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

istore2[m1] = indexblock(indx, lax, m4), zh[r0] = mkznode(r, zbrar, boolvar, true, m0), istore[adr1] = istore2[adr1], zh0[r0] = mkznode(r1, zbrar0, boolvar0, boolvar1, m5), remove-refsize0(gstore0) = gstore0, remove-refsize0(istore0) = istore0, elems nx ∩ ginval = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval, ((btree(null, r0, adr1, height, dirty, ri, nodes(istore), as, alladrs, ok) * true))(zh), ((btree(null, r0, (err = ESUCCESS ⊃ @(m1, m2, m3);adr1), height, err ≠ ESUCCESS, ri, nodes(istore2) | as0, as0, alladrs1, ok) * true))(zh0), ((btree(null, null, adr1, height0, false, fi, nodes(istore0), alladrs0, alladrs0, ok) * true))(zh), inv(istore2), inv(gstore \ ginval), inv(gstore0), inv(istore), inv(istore0), refsize-cons(istore2, as0), refsize-cons(istore, as), refsize-cons(istore0, alladrs0), adr1 ∈ istore2, r0 ∈ zh0, m ∈ istore, adr1 ∈ istore, r0 ∈ zh, m ∈ istore2, as0 ⊆ dom nodes(istore2), as0 ⊆ alladrs1, as0 ∩ dom nodes(istore) ⊆ as, alladrs1 ⊆ alladrs ∪ as0, as ⊆ alladrs, as ⊆ dom nodes(istore), alladrs0 ⊆ dom nodes(istore), alladrs0 ⊆ dom nodes(istore0), alladrs ⊆ dom nodes(istore), as0 ∩ dom nodes(istore) ⊆ alladrs, istore ⊑ istore2, istore0 ⊑ istore2, istore0 ⊑ istore, pstate0.journal? → nx ≠ [] ∧ pstate0.lnum = nx.last ∧ pstate0.lnum ∈ gstore, pstate0.index? → pstate0.lnum ∈ istore2, pstate0 = unbuffered → bv, err = ESUCCESS → ¬ boolvar1 ∧ pstate0.index?, height = 0 → as = ∅ ⊦ dups(nx), adr1 ∈ as, (err ≠ ESUCCESS → btree-inv(r0, adr1, istore2, istore0, zh0, ri, fi)) ∧ ( err = ESUCCESS → btree-inv(r0, @(m1, m2, m3), istore2, istore2, zh0, ri, ri) ∧ btree-inv(r0, adr1, istore2[m1, indexblock(indx, lax, m4 - m3)], istore0, zh0[r0, mkznode(r1, zbrar0, boolvar0, true, m5)], ri, fi) ∧ ¬ boolvar1)

User applied rule cut formula

And obtained the following new goals

Proof step 25:
zh0[r0] = mkznode(r1, zbrar0, boolvar0, boolvar1, m5), istore[adr1] = istore2[adr1], zh[r0] = mkznode(r, zbrar, boolvar, true, m0), istore2[m1] = indexblock(indx, lax, m4), err = ESUCCESS, remove-refsize0(istore0) = istore0, remove-refsize0(gstore0) = gstore0, elems nx ∩ ginval = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval, ((btree(null, null, adr1, height0, false, fi, nodes(istore0), alladrs0, alladrs0, ok) * true))(zh), ((btree(null, r0, (err = ESUCCESS ⊃ @(m1, m2, m3);adr1), height, err ≠ ESUCCESS, ri, nodes(istore2) | as0, as0, alladrs1, ok) * true))(zh0), ((btree(null, r0, adr1, height, dirty, ri, nodes(istore), as, alladrs, ok) * true))(zh), inv(istore0), inv(istore), inv(gstore0), inv(gstore \ ginval), inv(istore2), refsize-cons(istore0, alladrs0), refsize-cons(istore, as), refsize-cons(istore2, as0), m ∈ istore2, r0 ∈ zh, adr1 ∈ istore, m ∈ istore, r0 ∈ zh0, adr1 ∈ istore2, as0 ∩ dom nodes(istore) ⊆ alladrs, alladrs ⊆ dom nodes(istore), alladrs0 ⊆ dom nodes(istore0), alladrs0 ⊆ dom nodes(istore), as ⊆ dom nodes(istore), as ⊆ alladrs, alladrs1 ⊆ alladrs ∪ as0, as0 ∩ dom nodes(istore) ⊆ as, as0 ⊆ alladrs1, as0 ⊆ dom nodes(istore2), istore0 ⊑ istore, istore0 ⊑ istore2, istore ⊑ istore2, height = 0 → as = ∅, err = ESUCCESS → ¬ boolvar1 ∧ pstate0.index?, pstate0 = unbuffered → bv, pstate0.index? → pstate0.lnum ∈ istore2, pstate0.journal? → nx ≠ [] ∧ pstate0.lnum = nx.last ∧ pstate0.lnum ∈ gstore ⊦ dups(nx), adr1 ∈ as, (err ≠ ESUCCESS → btree-inv(r0, adr1, istore2, istore0, zh0, ri, fi)) ∧ ( err = ESUCCESS → btree-inv(r0, @(m1, m2, m3), istore2, istore2, zh0, ri, ri) ∧ btree-inv(r0, adr1, istore2[m1, indexblock(indx, lax, m4 - m3)], istore0, zh0[r0, mkznode(r1, zbrar0, boolvar0, true, m5)], ri, fi) ∧ ¬ boolvar1)
Proof step 58:
zh0[r0] = mkznode(r1, zbrar0, boolvar0, boolvar1, m5), istore[adr1] = istore2[adr1], zh[r0] = mkznode(r, zbrar, boolvar, true, m0), istore2[m1] = indexblock(indx, lax, m4), remove-refsize0(istore0) = istore0, remove-refsize0(gstore0) = gstore0, elems nx ∩ ginval = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval, ((btree(null, null, adr1, height0, false, fi, nodes(istore0), alladrs0, alladrs0, ok) * true))(zh), ((btree(null, r0, (err = ESUCCESS ⊃ @(m1, m2, m3);adr1), height, err ≠ ESUCCESS, ri, nodes(istore2) | as0, as0, alladrs1, ok) * true))(zh0), ((btree(null, r0, adr1, height, dirty, ri, nodes(istore), as, alladrs, ok) * true))(zh), inv(istore0), inv(istore), inv(gstore0), inv(gstore \ ginval), inv(istore2), refsize-cons(istore0, alladrs0), refsize-cons(istore, as), refsize-cons(istore2, as0), m ∈ istore2, r0 ∈ zh, adr1 ∈ istore, m ∈ istore, r0 ∈ zh0, adr1 ∈ istore2, as0 ∩ dom nodes(istore) ⊆ alladrs, alladrs ⊆ dom nodes(istore), alladrs0 ⊆ dom nodes(istore0), alladrs0 ⊆ dom nodes(istore), as ⊆ dom nodes(istore), as ⊆ alladrs, alladrs1 ⊆ alladrs ∪ as0, as0 ∩ dom nodes(istore) ⊆ as, as0 ⊆ alladrs1, as0 ⊆ dom nodes(istore2), istore0 ⊑ istore, istore0 ⊑ istore2, istore ⊑ istore2, height = 0 → as = ∅, err = ESUCCESS → ¬ boolvar1 ∧ pstate0.index?, pstate0 = unbuffered → bv, pstate0.index? → pstate0.lnum ∈ istore2, pstate0.journal? → nx ≠ [] ∧ pstate0.lnum = nx.last ∧ pstate0.lnum ∈ gstore ⊦ err = ESUCCESS, dups(nx), adr1 ∈ as, (err ≠ ESUCCESS → btree-inv(r0, adr1, istore2, istore0, zh0, ri, fi)) ∧ ( err = ESUCCESS → btree-inv(r0, @(m1, m2, m3), istore2, istore2, zh0, ri, ri) ∧ btree-inv(r0, adr1, istore2[m1, indexblock(indx, lax, m4 - m3)], istore0, zh0[r0, mkznode(r1, zbrar0, boolvar0, true, m5)], ri, fi) ∧ ¬ boolvar1)

Rule argument

fma: err = ESUCCESS

Additional information

Used formulas: err = ESUCCESS