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

zh0[rp] = mkznode(r0, zbrar0, boolvar0, false, m4), zh[rp] = mkznode(r, zbrar, boolvar, true, m), istore0[m0] = indexblock(indx, lax, m3), remove-refsize0(gstore1) = gstore1, remove-refsize0(istore1) = istore1, dom remove-refsize0(gstore2) ∩ ginval4 = ∅, elems nx ∩ ginval4 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval4, pstate1 ≠ readonly, pstate1 ≠ unbuffered, btree-inv(rp, adr, istore0[m0, indexblock(indx, lax, m3 - m2)], istore1, 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, istore1, zh, ri, fi), btree-inv(rp, adr, istore3[n, indexblock([], [], 0)], istore1, zh, ri, fi), inv(istore0), inv(gstore2 \ ginval4), inv(gstore1), inv(istore3), inv(istore1), inv(istore3[n, indexblock([], [], 0)]), inv(indexblock(indx, lax, m3)), rp ∈ zh, m0 ∈ istore0, istore3[n, indexblock([], [], 0)] ⊑ istore0, istore1 ⊑ istore3, istore1 ⊑ istore3[n, indexblock([], [], 0)], istore1 ⊑ istore0, ⌊err⌋ , ¬ dups(nx), ¬ n ∈ istore3, pstate1.journal? → nx ≠ [] ∧ pstate1.lnum = nx.last ∧ pstate1.lnum ∈ gstore2, pstate1.index? → pstate1.lnum ∈ istore0 ⊦ ⟪apersistence_set_iblock_refsize# (m0, istore0[m0].ref-size - m2, adr, istore1, ginval4, gstore2, gstore1, nx, maxino1, ginval, readonly, false; istore0)⟫ ( (∃ ri0, fi0. btree-inv(rp, adr, istore0, istore1, zh0[rp, mkznode(r0, zbrar0, boolvar0, true, m4)], ri0, fi0)) ∧ inv(istore0) ∧ istore1 ⊑ istore0)

User applied rule insert program lemma

And obtained the following new goals

Proof step 304:
inv-journal(nx, gstore, gstore0, ginval), inv-index(istore, istore0), inv-state(pstate, nx, gstore, istore, syn), maxino ∈ istore ⊦ ⟪apersistence_set_iblock_refsize#(maxino, n, adr, istore0, ginval, gstore, gstore0, nx, maxino0, ginval0, pstate, syn; istore)⟫ (inv-index(istore, istore0) ∧ inv-state(pstate, nx, gstore, istore, syn))
Proof step 305:
syn0 ↔ false, istore0[m0] = indexblock(indx, lax, m3), zh[rp] = mkznode(r, zbrar, boolvar, true, m), zh0[rp] = mkznode(r0, zbrar0, boolvar0, false, m4), adr0 = adr, ginval1 = ginval4, ginval2 = ginval, gstore3 = gstore2, gstore4 = gstore1, istore2 = istore1, maxino2 = m0, maxino3 = maxino1, n0 = istore0[m0].ref-size - m2, nx0 = nx, pstate0 = readonly, 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), btree-inv(rp, @(m0, m1, m2), istore0, istore0, zh0, ri, ri), btree-inv(rp, adr, istore0[m0, indexblock(indx, lax, m3 - m2)], istore1, zh0[rp, mkznode(r0, zbrar0, boolvar0, true, m4)], ri, fi), inv(indexblock(indx, lax, m3)), inv(istore3[n, indexblock([], [], 0)]), inv(istore1), inv(istore3), inv(gstore1), inv(gstore2 \ ginval4), inv(istore0), inv-index(istore0, istore1), inv-journal(nx, gstore2, gstore1, ginval4), inv-state(readonly, nx, gstore2, istore0, false), rp ∈ zh, m0 ∈ istore0, istore1 ⊑ istore0, istore1 ⊑ istore3[n, indexblock([], [], 0)], istore1 ⊑ istore3, istore3[n, indexblock([], [], 0)] ⊑ istore0, ⌊err⌋ , pstate1.index? → pstate1.lnum ∈ istore0, pstate1.journal? → nx ≠ [] ∧ pstate1.lnum = nx.last ∧ pstate1.lnum ∈ gstore2 ⊦ [apersistence_set_iblock_refsize# (m0, istore0[m0].ref-size - m2, adr, istore1, ginval4, gstore2, gstore1, nx, maxino1, ginval, readonly, false; istore0)] ( inv-index(istore0, istore2) ∧ inv-state(pstate0, nx0, gstore3, istore0, syn0) → (∃ ri0, fi0. btree-inv(rp, adr, istore0, istore1, zh0[rp, mkznode(r0, zbrar0, boolvar0, true, m4)], ri0, fi0)) ∧ inv(istore0) ∧ istore1 ⊑ istore0), pstate1 = readonly, pstate1 = unbuffered, dups(nx), n ∈ istore3

Rule argument

spec: apersistence-asm name: inv-set-iblock-refsize seq: inv-journal(nx, gstore, gstore0, ginval), inv-index(istore, istore0), inv-state(pstate, nx, gstore, istore, syn), maxino ∈ istore ⊦ ⟪apersistence_set_iblock_refsize# (maxino, n, adr, istore0, ginval, gstore, gstore0, nx, maxino0, ginval0, pstate, syn ; istore)⟫ ( inv-index(istore, istore0) ∧ inv-state(pstate, nx, gstore, istore, syn)) subst: [syn, pstate, ginval0, maxino0, nx, gstore0, gstore, ginval, istore0, adr, n, maxino, istore] → [false, readonly, ginval, maxino1, nx, gstore1, gstore2, ginval4, istore1, adr, istore0[m0].ref-size - m2, m0, istore0] flags: <all paths>

Additional information

Used simplifier rules: ⊦ inv-journal(nx, gstore, gstore0, ginval) ↔ inv(gstore \ ginval) ∧ inv(gstore0) ∧ elems nx ∩ ginval = ∅ ∧ ¬ dups(nx) ∧ dom gstore0 ∪ elems nx = dom gstore ∪ ginval ∧ remove-refsize0(gstore0) = gstore0; (s)%⊦ inv-index(istore, istore0) ↔ inv(istore) ∧ inv(istore0) ∧ istore0 ⊑ istore ∧ remove-refsize0(istore0) = istore0; (s)%⊦ inv-state(pstate, nx, gstore, istore, syn) ↔ ( pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore) ∧ (pstate.index? → pstate.lnum ∈ istore) ∧ (pstate = unbuffered → syn); (s)% ⊦ ¬ readonly.journal?; (s)% ⊦ ¬ readonly.index?; (s)% ⊦ unbuffered ≠ readonly; (s)%⊦ btree-inv(rp, @(m0, m1, m2), istore, istore0, zh, fi, fi0) → m0 ∈ istore; (ss)