[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 42 from proof prepost-write-orphans (previous step)

avol = avol1[n, mapped(mkbuf(0))], err = err0, n < # avol1, ebm-vol-inv(avol1[n, mapped(mkbuf(0))]), ebm-vol-inv(avol1), is-aligned(# buf0, EB_PAGE_SIZE), is-encoded-pad(orphans0, # orphans0, buf0), # buf0 ≤ LEB_SIZE, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ [if err = ESUCCESS then if # buf0 ≠ 0 then avol[n] := mapped(avol[n].data + mkempbuf(0 - # avol[n].data) + subarray(buf0, 0, # buf0)) else {n1 := 0; n0 := # buf0; m0 := n; m := 0; buf := buf0; choose n2 with n2 < n0 ∧ is-aligned(n2, EB_PAGE_SIZE) in if n2 ≠ 0 then avol[m0] := mapped(avol[m0].data + mkempbuf(m - # avol[m0].data) + subarray(buf, n1, n2)) ifnone skip}] ( ebm-vol-inv(avol) → (err = ESUCCESS ∨ ⌊err⌋ ) ∧ id○(avol, avol1, n) ∧ (err = ESUCCESS → avol[n].mapped? ∧ is-encoded-pad(orphans0, # orphans0, avol[n].data)))

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information