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

# avol0 = # lpt5 + m11, avol0[m2] = mapped(buf1), avol0[m3] = mapped(buf0), avol0[0] = mapped(buf), adr = adr3, adr0 = adr2, avol = avol3, log = log2, lpt = lpt3, lpt0 = lpt2, m = m8, m0 = m5, ns = ns2, orphans = ns1, plog = plog0, disk-layout(mksb(adr5, m6, m2, m3, m9, m10, m11), # lpt5), ebm-vol-inv(subarray(avol0, m11, # lpt5)), ebm-vol-inv(avol0), is-encoded(log0, buf1), is-encoded(lpt5, lebs(avol0, m10, lptlebs(# lpt5, LEB_SIZE))), is-encoded(mksb(adr5, m6, m2, m3, m9, m10, m11), buf), is-encoded-pad(ns0, m9, buf0), mapped-full?(avol0, m10, lptlebs(# lpt5, LEB_SIZE)), m11 ≤ # avol0, avol0 ⊆ avol1, ⌊err1⌋ , m1 ≠ LEB_SIZE → # buf1 = m1 ⊦ ⟨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 := ?⟩ ( adr1 = adr ∧ m4 = m ∧ log3 = plog ∧ avol2 = avol ∧ lpt4 = lpt ∧ ns3 = ns ∧ adr4 = adr0 ∧ m12 = m0 ∧ orphans0 = orphans ∧ log1 = log ∧ lpt1 = lpt0 ∧ err1 = err)

Heuristic unfold applied rule call right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail_or_success#(; ; ERR) {choose ERR0 with ⌊ERR0⌋ ∨ ERR0 = ESUCCESS in ERR := ERR0};