[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 235 from proof inv-io-save (previous step)

zh[r] = mkznode(r0, zbrar, boolvar, true, m0), istore4[m2] = indexblock(indx, lax0, m1), remove-refsize0(gstore1) = gstore1, remove-refsize0(istore2) = istore2, elems nx ∩ ginval2 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval2, ((btree(rp, r, adr1, height, dirty, ri, nodes(istore4), as, alladrs, ok) * P))(zh), btree-sub-clean(r, m0, zh), inv(gstore2 \ ginval2), inv(gstore1), inv(istore4), inv(istore2), inv (istore4 [m2, indexblock(indx + save(mkznode(r0, zbrar, boolvar, true, m0)) ', lax0 + @(m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize) ', m1) ]), inv(indexblock(indx, lax0, m1)), refsize-cons(istore4, as0 ∪ as), r ∈ zh, m2 ∈ istore4, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize ≤ LEB_SIZE, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize ≤ n, n ≤ LEB_SIZE, as0 ⊆ dom nodes(istore4), alladrs ⊆ dom nodes(istore4), as ⊆ alladrs, as ⊆ dom nodes(istore4), istore2 ⊑ istore4 [m2, indexblock(indx + save(mkznode(r0, zbrar, boolvar, true, m0)) ', lax0 + @(m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize) ', m1) ], istore2 ⊑ istore4, ¬ dups(nx), ¬ adr1 ∈ as, ¬ @(m2, m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize) ∈ istore4, ¬ @(m2, m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize) ∈ istore2, height = 0 → as = ∅ ⊦ ⟪apersistence_get_iblock_refsize# (index(m2).lnum, adr0, istore4 [index(m2).lnum, istore4[index(m2).lnum, istore4[index(m2).lnum].indlist:= (indx + save(mkznode(r0, zbrar, boolvar, true, m0)) ')][index(m2).lnum] .ladrlist:= (lax0 + @(m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize) ') ], istore2, ginval2, gstore2, gstore1, nx, maxino0, ginval, index(m2), syn ; ; maxino); istore3 := istore4 [index(m2).lnum, istore4[index(m2).lnum, istore4[index(m2).lnum].indlist:= (indx + save(mkznode(r0, zbrar, boolvar, true, m0)) ')][index(m2).lnum] .ladrlist:= (lax0 + @(m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize) ') ]; apersistence_set_iblock_refsize# (index(m2).lnum, maxino + save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize, adr0, istore2, ginval2, gstore2, gstore1, nx, maxino0, ginval, index(m2), syn ; istore3); err := ESUCCESS; if err = ESUCCESS then zh[r].dirty := false⟫ ( refsize-cons(istore3, as0 ∪ (err = ESUCCESS ⊃ as ++ @(m2, m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize);as)) ∧ inv(istore3) ∧ istore2 ⊑ istore3 ∧ m2 ∈ istore3 ∧ istore4 ⊑ istore3 ∧ r ∈ zh ∧ (err = ESUCCESS → ¬ @(m2, m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize) ∈ as) ∧ dom nodes(istore3) = dom nodes(istore4) ∪ (err = ESUCCESS ⊃ ∅ ++ @(m2, m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize);∅) ∧ (( btree (rp, r, (err = ESUCCESS ⊃ @(m2, m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize);adr1), height, err ≠ ESUCCESS, ri, nodes(istore3), (err = ESUCCESS ⊃ as ++ @(m2, m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize);as), (err = ESUCCESS ⊃ (alladrs -- adr1) ++ @(m2, m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize);alladrs), ok) * P) )(zh) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → ¬ zh[r].dirty))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 236:
istore4[m2] = indexblock(indx, lax0, m1), zh[r] = mkznode(r0, zbrar, boolvar, true, m0), adr = adr0, ginval0 = ginval2, gstore = gstore1, gstore0 = gstore2, istore = istore2, istore0 = istore4 [index(m2).lnum, istore4[index(m2).lnum, istore4[index(m2).lnum].indlist:= (indx + save(mkznode(r0, zbrar, boolvar, true, m0)) ')][index(m2).lnum] .ladrlist:= (lax0 + @(m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize) ') ], maxino = maxino1, maxino0 = index(m2).lnum, pstate = index(m2), remove-refsize0(istore2) = istore2, remove-refsize0(gstore1) = gstore1, elems nx ∩ ginval2 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval2, ((btree(rp, r, adr1, height, dirty, ri, nodes(istore4), as, alladrs, ok) * P))(zh), btree-sub-clean(r, m0, zh), inv(indexblock(indx, lax0, m1)), inv (istore4 [m2, indexblock(indx + save(mkznode(r0, zbrar, boolvar, true, m0)) ', lax0 + @(m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize) ', m1) ]), inv(istore2), inv(istore4), inv(gstore1), inv(gstore2 \ ginval2), refsize-cons(istore4, as0 ∪ as), index(m2).lnum ∈ istore4[index(m2).lnum, istore4[index(m2).lnum].indlist:= (indx + save(mkznode(r0, zbrar, boolvar, true, m0)) ')], index(m2).lnum ∈ istore4, m2 ∈ istore4, r ∈ zh, n ≤ LEB_SIZE, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize ≤ n, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize ≤ LEB_SIZE, as ⊆ dom nodes(istore4), as ⊆ alladrs, alladrs ⊆ dom nodes(istore4), as0 ⊆ dom nodes(istore4), istore2 ⊑ istore4, istore2 ⊑ istore4 [m2, indexblock(indx + save(mkznode(r0, zbrar, boolvar, true, m0)) ', lax0 + @(m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize) ', m1) ], height = 0 → as = ∅, index(m2).index? ∨ index(m2).journal? ⊦ ⟪if maxino0 ∈ istore0 then n := istore0[maxino0].ref-size else abort; istore3 := istore4 [index(m2).lnum, istore4[index(m2).lnum, istore4[index(m2).lnum].indlist:= (indx + save(mkznode(r0, zbrar, boolvar, true, m0)) ')][index(m2).lnum] .ladrlist:= (lax0 + @(m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize) ') ]; apersistence_set_iblock_refsize# (index(m2).lnum, n + save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize, adr0, istore2, ginval2, gstore2, gstore1, nx, maxino1, ginval, index(m2), syn ; istore3); err := ESUCCESS; if err = ESUCCESS then zh[r].dirty := false⟫ ( refsize-cons(istore3, as0 ∪ (err = ESUCCESS ⊃ as ++ @(m2, m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize);as)) ∧ inv(istore3) ∧ istore2 ⊑ istore3 ∧ m2 ∈ istore3 ∧ istore4 ⊑ istore3 ∧ r ∈ zh ∧ (err = ESUCCESS → ¬ @(m2, m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize) ∈ as) ∧ dom nodes(istore3) = dom nodes(istore4) ∪ (err = ESUCCESS ⊃ ∅ ++ @(m2, m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize);∅) ∧ (( btree (rp, r, (err = ESUCCESS ⊃ @(m2, m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize);adr1), height, err ≠ ESUCCESS, ri, nodes(istore3), (err = ESUCCESS ⊃ as ++ @(m2, m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize);as), (err = ESUCCESS ⊃ (alladrs -- adr1) ++ @(m2, m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize);alladrs), ok) * P) )(zh) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → ¬ zh[r].dirty)), dups(nx), adr1 ∈ as, @(m2, m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize) ∈ istore4, @(m2, m3, save(mkznode(r0, zbrar, boolvar, true, m0)).flashsize) ∈ istore2

Rule argument

pos: right 1

Additional information

Used simplifier rules: apersistence_get_iblock_refsize# (LNUM, ROOTADR, ISTORE, ISTORE0, GINVAL, GSTORE, GSTORE0, NL, MAXINO, OS, PSTATE, PSYNCED ; ; N ) {if LNUM ∈ ISTORE then N := ISTORE[LNUM].ref-size else abort};% ⊦ index(m).lnum = m; (s)% ⊦ n ∈ istore[n, iblock]; (s)% ⊦ index(m).index?; (s)