[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 40 from proof inv-commit (previous step)

syn ↔ false, zh[rp] = mkznode(r, zbrar, boolvar, true, m), remove-refsize0(istore1) = istore1, remove-refsize0(gstore1) = gstore1, elems nx ∩ ginval4 = ∅, dom remove-refsize0(gstore2) ∩ ginval4 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval4, btree-inv(rp, adr, istore3[n, indexblock([], [], 0)], istore1, zh, ri, fi), btree-inv(rp, adr, istore3, istore1, zh, ri, fi), inv(istore3[n, indexblock([], [], 0)]), inv(istore1), inv(istore3), inv(gstore1), inv(gstore2 \ ginval4), inv(istore0), rp ∈ zh, istore1 ⊑ istore0, istore1 ⊑ istore3[n, indexblock([], [], 0)], istore1 ⊑ istore3, istore3[n, indexblock([], [], 0)] ⊑ istore0, err = ESUCCESS → btree-inv(rp, adr1, istore0, istore0, zh0, ri, ri) ∧ btree-inv (rp, adr, istore0[adr1.lnum, istore0[adr1.lnum].ref-size:= (istore0[adr1.lnum].ref-size - adr1.size)], istore1, zh0[rp, zh0[rp].dirty:= true], ri, fi) ∧ ¬ zh0[rp].dirty, err ≠ ESUCCESS → btree-inv(rp, adr, istore0, istore1, zh0, ri, fi), pstate0 = unbuffered → syn1, pstate0.index? → pstate0.lnum ∈ istore0, pstate0.journal? → nx ≠ [] ∧ pstate0.lnum = nx.last ∧ pstate0.lnum ∈ gstore2 ⊦ ⟪adr0 := adr; if err = ESUCCESS then {syn := true; apersistence_sync#(adr0, istore0, istore1, ginval4, gstore2, gstore1, nx, maxino0, ginval; pstate0, syn1; err)}; if err = ESUCCESS then apersistence_commit#(adr1, maxino1, syn1; ginval1, adr0, istore0, istore1, ginval4, gstore2, gstore1, nx, maxino0, ginval, pstate0; err); if err = ESUCCESS then adr := adr1 else if syn then {zh0[rp].dirty := true; let maxino = 0 in {apersistence_get_iblock_refsize# (adr1.lnum, adr0, istore0, istore1, ginval4, gstore2, gstore1, nx, maxino0, ginval, pstate0, syn1; ; maxino); apersistence_set_iblock_refsize# (adr1.lnum, maxino - adr1.size, adr0, istore1, ginval4, gstore2, gstore1, nx, maxino0, ginval, pstate0, syn1; istore0)}}⟫ ( (∃ ri, fi. btree-inv(rp, adr0, istore0, istore1, zh0, ri, fi)) ∧ inv(gstore2 \ ginval4) ∧ inv(gstore1) ∧ elems nx ∩ ginval4 = ∅ ∧ ¬ dups(nx) ∧ dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval4 ∧ remove-refsize0(gstore1) = gstore1 ∧ inv(istore0) ∧ inv(istore1) ∧ istore1 ⊑ istore0 ∧ remove-refsize0(istore1) = istore1 ∧ (pstate0.journal? → nx ≠ [] ∧ pstate0.lnum = nx.last ∧ pstate0.lnum ∈ gstore2) ∧ (pstate0.index? → pstate0.lnum ∈ istore0) ∧ (pstate0 = unbuffered → syn1)), dups(nx), n ∈ istore3

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information