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

syn ↔ true, istore0[m0] = indexblock(indx, lax, m3), zh[rp] = mkznode(r, zbrar, boolvar, true, m), zh0[rp] = mkznode(r0, zbrar0, boolvar0, false, m4), ginval0 = ginval1, gstore = gstore3, gstore0 = gstore4, istore = istore2, maxino = maxino2, maxino0 = m0, pstate = readonly, remove-refsize0(istore2) = istore2, remove-refsize0(gstore3) = gstore3, elems nx ∩ ginval1 = ∅, dom remove-refsize0(gstore4) ∩ ginval1 = ∅, dom gstore3 ∪ elems nx = dom gstore4 ∪ ginval1, 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(istore3), inv(istore0), inv(istore2), inv(gstore3), inv(gstore4 \ ginval1), rp ∈ zh, istore2 ⊑ istore3[n, indexblock([], [], 0)], istore2 ⊑ istore3, istore3[n, indexblock([], [], 0)] ⊑ istore0, istore2 ⊑ istore0, ⌊err⌋ , pstate0.index? → pstate0.lnum ∈ istore0, pstate0.journal? → nx ≠ [] ∧ pstate0.lnum = nx.last ∧ pstate0.lnum ∈ gstore4 ⊦ ⟪n := istore0[maxino0].ref-size; apersistence_set_iblock_refsize#(m0, n - m2, adr, istore2, ginval1, gstore4, gstore3, nx, maxino2, ginval, readonly, true; istore0)⟫ ( (∃ ri0, fi0. btree-inv(rp, adr, istore0, istore2, zh0[rp, mkznode(r0, zbrar0, boolvar0, true, m4)], ri0, fi0)) ∧ inv(istore0) ∧ istore2 ⊑ istore0), pstate0 = readonly, pstate0 = unbuffered, dups(nx), n ∈ istore3

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 202:
syn ↔ true, zh0[rp] = mkznode(r0, zbrar0, boolvar0, false, m4), zh[rp] = mkznode(r, zbrar, boolvar, true, m), istore0[m0] = indexblock(indx, lax, m3), ginval0 = ginval1, gstore = gstore3, gstore0 = gstore4, istore = istore2, maxino = maxino2, maxino0 = m0, pstate = readonly, remove-refsize0(gstore3) = gstore3, remove-refsize0(istore2) = istore2, dom remove-refsize0(gstore4) ∩ ginval1 = ∅, elems nx ∩ ginval1 = ∅, dom gstore3 ∪ elems nx = dom gstore4 ∪ ginval1, btree-inv(rp, adr, istore0[m0, indexblock(indx, lax, m3 - m2)], istore2, zh0[rp, mkznode(r0, zbrar0, boolvar0, true, m4)], ri, fi), btree-inv(rp, @(m0, m1, m2), istore0, istore0, zh0, ri, ri), btree-inv(rp, adr, istore3, istore2, zh, ri, fi), btree-inv(rp, adr, istore3[n, indexblock([], [], 0)], istore2, zh, ri, fi), inv(gstore4 \ ginval1), inv(gstore3), inv(istore2), inv(istore0), inv(istore3), inv(istore3[n, indexblock([], [], 0)]), maxino0 ∈ istore0, rp ∈ zh, istore2 ⊑ istore0, istore3[n, indexblock([], [], 0)] ⊑ istore0, istore2 ⊑ istore3, istore2 ⊑ istore3[n, indexblock([], [], 0)], ⌊err⌋ , pstate0.journal? → nx ≠ [] ∧ pstate0.lnum = nx.last ∧ pstate0.lnum ∈ gstore4, pstate0.index? → pstate0.lnum ∈ istore0 ⊦ ⟪apersistence_set_iblock_refsize# (m0, istore0[maxino0].ref-size - m2, adr, istore2, ginval1, gstore4, gstore3, nx, maxino2, ginval, readonly, true; istore0)⟫ ( (∃ ri0, fi0. btree-inv(rp, adr, istore0, istore2, zh0[rp, mkznode(r0, zbrar0, boolvar0, true, m4)], ri0, fi0)) ∧ inv(istore0) ∧ istore2 ⊑ istore0), pstate0 = unbuffered, pstate0 = readonly, dups(nx), n ∈ istore3

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ n ∈ istore → istore[n] = (∅)[n]; (s)%⊦ btree-inv(rp, @(m0, m1, m2), istore, istore0, zh, fi, fi0) → m0 ∈ istore; (ss)