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

# avol0 = # lpt1 + m11, avol0[0] = mapped(buf2), avol0[m3] = mapped(buf3), avol0[m2] = mapped(buf4), adr = adr0, avol1 = subarray(avol, m11, # lpt1), log0 = log1, lpt = lpt1, m = m0, ns0 = orphans0, disk-layout(mksb(adr0, m0, m2, m3, m9, m10, m11), # lpt1), ebm-vol-inv(avol0), ebm-vol-inv(subarray(avol0, m11, # lpt1)), is-encoded(log1, buf4), is-encoded(lpt1, lebs(avol0, m10, lptlebs(# lpt1, LEB_SIZE))), is-encoded(mksb(adr0, m0, m2, m3, m9, m10, m11), buf2), is-encoded-pad(orphans0, m9, buf3), mapped-full?(avol0, m10, lptlebs(# lpt1, LEB_SIZE)), m11 ≤ # avol0, avol0 ⊆ avol, logoff ≠ LEB_SIZE → # buf4 = logoff, m1 ≠ LEB_SIZE → # buf4 = m1 ⊦ ⟨apersistence_io_recover#(; adr2, m5, ns1, log2, lpt2, adr, m, log0, lpt1, ns0, avol1; err0)⟩ ( m = m5 ∧ adr = adr2 ∧ avol1 = subarray(avol, m11, # lpt2) ∧ log2 = log0 ∧ is-encoded(lpt1, lebs(avol0, m10, lptlebs(# lpt2, LEB_SIZE))) ∧ ns1 = ns0 ∧ adr0 = adr2 ∧ m0 = m5 ∧ orphans0 = ns0 ∧ log1 = log0 ∧ lpt = lpt2 ∧ ESUCCESS = err0)

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 40:
# avol0 = # lpt1 + m11, avol0[m2] = mapped(buf4), avol0[m3] = mapped(buf3), avol0[0] = mapped(buf2), adr = adr1, adr0 = adr2, avol = avol1, avol1 = subarray(avol2, m11, # lpt1), log = log2, log0 = log1, lpt = lpt1, lpt0 = lpt2, lpt3 = lpt1, m = m4, m0 = m5, ns = ns0, ns0 = orphans0, orphans = ns1, plog = log0, disk-layout(mksb(adr1, m4, m2, m3, m9, m10, m11), # lpt1), ebm-vol-inv(subarray(avol0, m11, # lpt1)), ebm-vol-inv(avol0), is-encoded(mksb(adr1, m4, m2, m3, m9, m10, m11), buf2), is-encoded(lpt1, lebs(avol0, m10, lptlebs(# lpt1, LEB_SIZE))), is-encoded(log1, buf4), is-encoded-pad(orphans0, m9, buf3), mapped-full?(avol0, m10, lptlebs(# lpt1, LEB_SIZE)), m11 ≤ # avol0, avol0 ⊆ avol2, m1 ≠ LEB_SIZE → # buf4 = m1, logoff ≠ LEB_SIZE → # buf4 = logoff ⊦ ⟨fail_or_success#(; ; err); if err = ESUCCESS then adr0 := adr, m0 := m, log := plog, lpt0 := lpt, orphans := ns else avol := ?, adr := ?, m := ?, plog := ?, lpt := ?, adr0 := ?, m0 := ?, log := ?, lpt0 := ?, orphans := ?, ns := ?⟩ ( m = m0 ∧ adr = adr0 ∧ avol = subarray(avol2, m11, # lpt0) ∧ log = plog ∧ is-encoded(lpt, lebs(avol0, m10, lptlebs(# lpt0, LEB_SIZE))) ∧ orphans = ns ∧ adr1 = adr0 ∧ m4 = m0 ∧ orphans0 = ns ∧ log1 = plog ∧ lpt3 = lpt0 ∧ ESUCCESS = err)

Rule argument

pos: right 1

Additional information

Used simplifier rules: apersistence_io_recover# (; PROOTADR0, PMAXINO0, ORPHANS, LOG, LPT, PROOTADR, PMAXINO, PLOG, PLPT, PORPHANS, PVOL ; ERR ) {fail_or_success#(; ; ERR); if ERR = ESUCCESS then PROOTADR0 := PROOTADR, PMAXINO0 := PMAXINO, LOG := PLOG, LPT := PLPT, ORPHANS := PORPHANS else PVOL := ?, PROOTADR := ?, PMAXINO := ?, PLOG := ?, PLPT := ?, PROOTADR0 := ?, PMAXINO0 := ?, LOG := ?, LPT := ?, ORPHANS := ?, PORPHANS := ? };