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

syn1 ↔ true, istore0[m0] = indexblock(indx, lax, m3), zh[rp] = mkznode(r, zbrar, boolvar, true, m), zh0[rp] = mkznode(r0, zbrar0, boolvar0, false, m4), adr0 = adr, err1 = err, ginval0 = ginval1, ginval4 = ginval0, gstore = gstore3, gstore0 = gstore4, gstore1 = gstore, gstore2 = gstore0, istore = istore2, istore1 = istore, maxino2 = maxino, pstate1 = readonly, remove-refsize0(istore2) = istore2, remove-refsize0(gstore3) = gstore3, remove-refsize0(istore) = istore, remove-refsize0(gstore) = gstore, elems nx ∩ ginval1 = ∅, dom remove-refsize0(gstore4) ∩ ginval1 = ∅, elems nx ∩ ginval0 = ∅, dom gstore3 ∪ elems nx = dom gstore4 ∪ ginval1, dom gstore ∪ elems nx = dom gstore0 ∪ ginval0, btree-inv(rp, adr, istore3[n, indexblock([], [], 0)], istore2, zh, ri, fi), btree-inv(rp, adr, istore3, istore2, zh, ri, fi), btree-inv(rp, @(m0, m1, m2), istore0, istore0, zh0, ri, ri), btree-inv(rp, adr, istore0[m0, indexblock(indx, lax, m3 - m2)], istore2, zh0[rp, mkznode(r0, zbrar0, boolvar0, true, m4)], ri, fi), inv(istore3[n, indexblock([], [], 0)]), inv(istore2), inv(istore3), inv(gstore3), inv(gstore4 \ ginval1), inv(istore0), inv(istore), inv(gstore), inv(gstore0 \ ginval0), rp ∈ zh, istore2 ⊑ istore0, istore2 ⊑ istore3[n, indexblock([], [], 0)], istore2 ⊑ istore3, istore3[n, indexblock([], [], 0)] ⊑ istore0, istore ⊑ istore0, pstate.index? → pstate.lnum ∈ istore0, pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore4, readonly.index? → readonly.lnum ∈ istore0, readonly.journal? → nx ≠ [] ∧ readonly.lnum = nx.last ∧ readonly.lnum ∈ gstore0, ⌊err⌋ ∨ err = ESUCCESS ⊦ ⟪if err1 = ESUCCESS then adr := @(m0, m1, m2) else if true then {zh0[rp].dirty := true; let maxino = 0 in {apersistence_get_iblock_refsize# (m0, adr0, istore0, istore1, ginval4, gstore2, gstore1, nx, maxino2, ginval, pstate1, syn1; ; maxino); apersistence_set_iblock_refsize# (m0, maxino - m2, adr0, istore1, ginval4, gstore2, gstore1, nx, maxino2, ginval, pstate1, syn1; istore0)}}⟫ ( (∃ ri, fi. btree-inv(rp, adr0, istore0, istore1, zh0, ri, fi)) ∧ inv(istore0) ∧ istore1 ⊑ istore0 ∧ (pstate1.journal? → nx ≠ [] ∧ pstate1.lnum = nx.last ∧ pstate1.lnum ∈ gstore2) ∧ (pstate1.index? → pstate1.lnum ∈ istore0) ∧ (pstate1 = unbuffered → syn1)), err1 = ESUCCESS, pstate = unbuffered, pstate = readonly, dups(nx), n ∈ istore3

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Rule argument

pos: right 1

Additional information