[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 130 from proof refine-write (previous step)

# avol0 = # lpt + m6, avol0[m2] = mapped(buf3), avol0[m3] = mapped(buf2), avol0[0] = mapped(buf1), avol0[m6 + m8] = mapped(buf0), avol = avol1, avol1 = subarray(avol0, m6, # lpt), m = m9, m0 = m7, m1 = m8, n0 = n, n1 = n2, ns = orphans, plog = log, m8 < # lpt, disk-layout(mksb(adr, m9, m2, m3, m4, m5, m6), # lpt), ebm-vol-inv(avol0), ebm-vol-inv(subarray(avol0, m6, # lpt)), is-aligned(n, EB_PAGE_SIZE), is-aligned(m7, EB_PAGE_SIZE), is-encoded(log, buf3), is-encoded(lpt, lebs(avol0, m5, lptlebs(# lpt, LEB_SIZE))), is-encoded(mksb(adr, m9, m2, m3, m4, m5, m6), buf1), is-encoded-pad(orphans, m4, buf2), mapped-full?(avol0, m5, lptlebs(# lpt, LEB_SIZE)), n2 + n ≤ # buf, # buf0 ≤ m7, m7 + n ≤ LEB_SIZE, ⌊err0⌋ , logoff ≠ LEB_SIZE → # buf3 = logoff, ∀ n0. ¬ n0 < n ∨ ¬ is-aligned(n0, EB_PAGE_SIZE) ⊦ ⟨if m1 < # avol ∧ avol[m1].mapped? ∧ # avol[m1].data ≤ m0 ∧ is-aligned(m0, EB_PAGE_SIZE) ∧ is-aligned(n0, EB_PAGE_SIZE) ∧ m0 + n0 ≤ LEB_SIZE ∧ n1 + n0 ≤ # buf then {fail_or_success#(; ; err); if err = ESUCCESS then if n0 ≠ 0 then avol[m1] := mapped(avol[m1].data + mkempbuf(m0 - # avol[m1].data) + subarray(buf, n1, n0)) else choose n with n < n0 ∧ is-aligned(n, EB_PAGE_SIZE) in if n ≠ 0 then avol[m1] := mapped(avol[m1].data + mkempbuf(m0 - # avol[m1].data) + subarray(buf, n1, n)) ifnone skip} else abort⟩ (avol = subarray(avol0, m6, # lpt) ∧ is-encoded(log, avol0[m2].data) ∧ is-encoded-pad(orphans, m4, avol0[m3].data) ∧ err0 = err)

Heuristic symbolic execution applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information