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

# lpt0 = # lpt, (5 + 2 * lptlebs(# lpt, LEB_SIZE)) + # lpt = # avol, avol[2] = mapped(buf1), avol[4] = mapped(buf0), avol[0] = mapped(buf), avol1 = avol, err = err0, ebm-vol-inv(avol), is-encoded(mksb(adr0, m2, 2, 4, m6, 5 + lptlebs(# lpt, LEB_SIZE), 5 + 2 * lptlebs(# lpt, LEB_SIZE)), buf), is-encoded(lpt0, lebs(avol, 5 + lptlebs(# lpt, LEB_SIZE), lptlebs(# lpt, LEB_SIZE))), is-encoded(log, buf1), is-encoded-pad(orphans0, m6, buf0), mapped-full?(avol, 5 + lptlebs(# lpt, LEB_SIZE), lptlebs(# lpt, LEB_SIZE)), 5 + 2 * lptlebs(# lpt, LEB_SIZE) ≤ # avol, logoff ≠ LEB_SIZE → # buf1 = logoff, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ [skip or avol[1] := unmapped] ( ebm-vol-inv(avol) → ⟪ns := orphans; m1 := EB_PAGE_SIZE; sb1 := mksb(adr, m3, 1, 3, # orphans, 5, 5 + 2 * lptlebs(# lpt, LEB_SIZE)); m0 := LEB_SIZE; if err = ESUCCESS then persistence_io_write_orphans#(sb1.orph, m1, m0; orphans, avol; err); if err = ESUCCESS then let buf = ? in {persistence_io_encode_lpt#(lpt, m0; ; buf, err); if err = ESUCCESS then persistence_io_write_lebs#(sb1.lpt, lptlebs(# lpt, m0), buf, m0; avol; err)}; if err = ESUCCESS then ebm_avol_sync_device#(avol; ; err); if err = ESUCCESS then persistence_io_write_superblock#(sb1, m1, m0; avol; err); sb0 := mksb(adr0, m2, 2, 4, m6, 5 + lptlebs(# lpt, LEB_SIZE), 5 + 2 * lptlebs(# lpt, LEB_SIZE)); if err = ESUCCESS then {sb0 := sb1; logoff := 0}⟫ ( (∃ lpt1, log, orphans. disk-layout(sb0, # lpt1) ∧ sb0.main + # lpt1 = # avol ∧ avol[0].mapped? ∧ is-encoded(sb0, avol[0].data) ∧ avol[sb0.orph].mapped? ∧ is-encoded-pad(orphans, sb0.orphsize, avol[sb0.orph].data) ∧ avol[sb0.log].mapped? ∧ (logoff ≠ LEB_SIZE → # avol[sb0.log].data = logoff) ∧ is-encoded(log, avol[sb0.log].data) ∧ mapped-full?(avol, sb0.lpt, lptlebs(# lpt1, LEB_SIZE)) ∧ is-encoded(lpt1, lebs(avol, sb0.lpt, lptlebs(# lpt1, LEB_SIZE)))) ∧ ebm-vol-inv(avol) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → sb0.indexaddr = adr ∧ sb0.maxino = m3 ∧ avol[sb0.log].data = mkbuf(0) ∧ is-encoded(lpt, lebs(avol, sb0.lpt, lptlebs(# avol - sb0.main, LEB_SIZE))) ∧ is-encoded-pad(ns, sb0.orphsize, avol[sb0.orph].data)) ∧ ( err ≠ ESUCCESS → sb0 = mksb(adr0, m2, 2, 4, m6, 5 + lptlebs(# lpt, LEB_SIZE), sb0.main) ∧ avol[2] = avol1[2] ∧ avol[4] = avol1[4] ∧ lebs(avol, 5 + lptlebs(# lpt, LEB_SIZE), lptlebs(# avol - sb0.main, LEB_SIZE)) = lebs(avol1, 5 + lptlebs(# lpt, LEB_SIZE), lptlebs(# avol - sb0.main, LEB_SIZE))) ∧ sb0.main = 5 + 2 * lptlebs(# lpt, LEB_SIZE) ∧ # avol = # avol1 ∧ subarray(avol, sb0.main, # avol - sb0.main) = subarray(avol1, sb0.main, # avol - sb0.main))), err = ESUCCESS

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Rule argument

Additional information