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

m4 + # lpt = # avol, avol[m5] = mapped(buf1), avol[m1] = mapped(buf3), avol[0] = mapped(buf2), buf = mkbuf(m2 * ENCODED_NAT_SIZE), buf0 = buf, m = 0, m0 = m1, n = m2 * ENCODED_NAT_SIZE, n0 = 0, disk-layout(mksb(adr, m6, m5, m1, m2, m3, m4), # lpt), ebm-vol-inv(avol), is-encoded(mksb(adr, m6, m5, m1, m2, m3, m4), buf2), is-encoded(lpt, lebs(avol, m3, lptlebs(# lpt, LEB_SIZE))), is-encoded(log, buf1), is-encoded-pad(orphans0, m2, buf3), mapped-full?(avol, m3, lptlebs(# lpt, LEB_SIZE)), logoff ≠ LEB_SIZE → # buf1 = logoff ⊦ ⟪if m0 < # avol ∧ avol[m0].mapped? ∧ n0 + n ≤ # buf0 ∧ m + n ≤ LEB_SIZE then {fail_or_success#(; ; err); if err = ESUCCESS then buf0 := copy(avol[m0].data + mkempbuf(LEB_SIZE - # avol[m0].data), m, buf0, n0, n) else choose buf with # buf = # buf0 ∧ range=(buf0, 0, buf, 0, n0) ∧ range=(buf0, n0 + n, buf, n0 + n, # buf0 - n0 + n) in buf0 := buf} else abort; if err = ESUCCESS then persistence_io_decode_orphans#(m2, buf0; ; orphans, err)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → orphans = orphans0))

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information