[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 16 from proof recovery (previous step)

ginval = ginval2, ginval0 = ginval3, gstore = gstore1, gstore0 = crash(gstore4, gstore1, ginval3, nx1), maxino = maxino1, nx = nx1, remove-refsize0(istore1) = istore1, remove-refsize0(gstore1) = gstore1, elems nx1 ∩ ginval3 = ∅, dom gstore1 ∪ elems nx1 = dom gstore4 ∪ ginval3, btree-inv(rp1, adr2, istore2, istore1, zh, ri, fi3), btree-inv(rp1, adr2, istore2, istore1, zh, fi, fi0), inv(crash(gstore4, gstore1, ginval3, nx1) \ ginval3), inv(istore1), inv(istore2), inv(gstore1), inv(gstore4 \ ginval3), ri-inj(fi0), ri-inj(fi), istore1 ⊑ istore2, ¬ dups(nx1), pstate1.index? → pstate1.lnum ∈ istore2, pstate1.journal? → nx1 ≠ [] ∧ pstate1.lnum = nx1.last ∧ pstate1.lnum ∈ gstore4 ⊦ ∃ fi4, syn. ⟨gstore3 := crash(gstore4, gstore1, ginval3, nx1); index+persistence_recover#(; maxino3, nx3, ginval6, fi4, fi0, ginval3, gstore3, gstore1, nx1, maxino1, ginval2, syn; err0)⟩ ( ginval3 = ginval0 ∧ gstore3 = gstore0 ∧ gstore1 = gstore ∧ nx1 = nx3 ∧ maxino1 = maxino3 ∧ ginval2 = ginval6 ∧ btree-inv(null, adr2, remove-refsize0(crash(istore2, istore1)), istore1, zh0, fi4, fi0) ∧ syn ∧ maxino = maxino3 ∧ nx = nx3 ∧ ginval = ginval6 ∧ ESUCCESS = err0)

User applied rule exists right

And obtained the following new goals

Proof step 17:
ginval = ginval2, ginval0 = ginval3, gstore = gstore1, gstore0 = crash(gstore4, gstore1, ginval3, nx1), maxino = maxino1, nx = nx1, remove-refsize0(gstore1) = gstore1, remove-refsize0(istore1) = istore1, elems nx1 ∩ ginval3 = ∅, dom gstore1 ∪ elems nx1 = dom gstore4 ∪ ginval3, btree-inv(rp1, adr2, istore2, istore1, zh, fi, fi0), btree-inv(rp1, adr2, istore2, istore1, zh, ri, fi3), inv(gstore4 \ ginval3), inv(gstore1), inv(istore2), inv(istore1), inv(crash(gstore4, gstore1, ginval3, nx1) \ ginval3), ri-inj(fi), ri-inj(fi0), istore1 ⊑ istore2, pstate1.journal? → nx1 ≠ [] ∧ pstate1.lnum = nx1.last ∧ pstate1.lnum ∈ gstore4, pstate1.index? → pstate1.lnum ∈ istore2 ⊦ ⟨gstore3 := crash(gstore4, gstore1, ginval3, nx1); syn := true, fi := fi0; index+persistence_recover#(; maxino3, nx3, ginval6, fi0, fi, ginval3, gstore3, gstore1, nx1, maxino1, ginval2, syn; err0)⟩ ( ginval3 = ginval0 ∧ gstore3 = gstore0 ∧ gstore1 = gstore ∧ nx1 = nx3 ∧ maxino1 = maxino3 ∧ ginval2 = ginval6 ∧ btree-inv(null, adr2, remove-refsize0(crash(istore2, istore1)), istore1, zh0, fi0, fi) ∧ syn ∧ maxino = maxino3 ∧ nx = nx3 ∧ ginval = ginval6 ∧ ESUCCESS = err0), dups(nx1)

Rule argument

pos: right 1 terms: fi0, true abort: F discard: T computed: F

Additional information

Used terms: fi0, true