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

zh0[rp] = mkznode(r0, zbrar0, boolvar0, false, m4), zh[rp] = mkznode(r, zbrar, boolvar, true, m), istore2[m0] = indexblock(indx, lax, m3), adr0 = @(m0, m1, m2), err1 = err, err1 = ESUCCESS, ginval = ginval0, ginval4 = ∅, gstore = gstore3, gstore0 = gstore4, gstore1 = remove-refsize0(gstore0), gstore2 = remove-refsize0(gstore0), istore = istore4, istore0 = remove-refsize0(istore2), istore1 = istore0, maxino2 = maxino0, nx = [], pstate = unbuffered, remove-refsize0(remove-refsize0(gstore0)) = remove-refsize0(gstore0), remove-refsize0(istore0) = istore0, remove-refsize0(gstore3) = gstore3, remove-refsize0(istore4) = istore4, elems nx ∩ ∅ = ∅, elems nx0 ∩ ginval0 = ∅, dom remove-refsize0(gstore4) ∩ ginval0 = ∅, dom remove-refsize0(gstore0) ∪ elems nx = dom remove-refsize0(gstore0) ∪ ∅, dom gstore3 ∪ elems nx0 = dom gstore4 ∪ ginval0, btree-inv(rp, adr, istore2[m0, indexblock(indx, lax, m3 - m2)], istore4, zh0[rp, mkznode(r0, zbrar0, boolvar0, true, m4)], ri, fi), btree-inv(rp, @(m0, m1, m2), istore2, istore2, zh0, ri, ri), btree-inv(rp, adr, istore3, istore4, zh, ri, fi), btree-inv(rp, adr, istore3[n, indexblock([], [], 0)], istore4, zh, ri, fi), inv(remove-refsize0(gstore0) \ ∅), inv(remove-refsize0(gstore0)), inv(istore0), inv(istore2), inv(gstore4 \ ginval0), inv(gstore3), inv(istore3), inv(istore4), inv(istore3[n, indexblock([], [], 0)]), rp ∈ zh, istore0 ⊑ istore0, istore3[n, indexblock([], [], 0)] ⊑ istore2, istore4 ⊑ istore3, istore4 ⊑ istore3[n, indexblock([], [], 0)], istore4 ⊑ istore2, pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ remove-refsize0(gstore0), pstate.index? → pstate.lnum ∈ istore0, ⌊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, ginval1, pstate, true; ; maxino); apersistence_set_iblock_refsize# (m0, maxino - m2, adr0, istore1, ginval4, gstore2, gstore1, nx, maxino2, ginval1, pstate, true; istore0)}}⟫ ( (∃ ri, fi. btree-inv(rp, adr0, istore0, istore1, zh0, ri, fi)) ∧ inv(istore0) ∧ istore1 ⊑ istore0 ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore2) ∧ (pstate.index? → pstate.lnum ∈ istore0)), dups(nx0), dups(nx), n ∈ istore3

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

pos: right 1

Additional information