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

# buf = EB_PAGE_SIZE, # lpt = # avol, buffered(m4) ≠ bleb, m4 < # avol, ebm-vol-inv(avol), bleb ≠ nobuffer → bleb.leb < # avol ∧ wbuf-cons(mkwbuf(buf, m1, m2), avol[bleb.leb], rofs) ⊦ [fail_or_success#(; ; err); if err = ESUCCESS then avol[m4] := mapped(mkbuf(0)) else {skip or avol[m4] := unmapped}] (ebm-vol-inv(avol) ∧ # lpt = # avol → bleb ≠ nobuffer → bleb.leb < # avol ∧ wbuf-cons(mkwbuf(buf, m1, m2), avol[bleb.leb], rofs))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 15:
# lpt = # avol, # buf = EB_PAGE_SIZE, m4 < # avol, ebm-vol-inv(avol), bleb ≠ nobuffer → bleb.leb < # avol ∧ wbuf-cons(mkwbuf(buf, m1, m2), avol[bleb.leb], rofs) ⊦ [choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; if err = ESUCCESS then avol[m4] := mapped(mkbuf(0)) else {skip or avol[m4] := unmapped}] (ebm-vol-inv(avol) ∧ # lpt = # avol → bleb ≠ nobuffer → bleb.leb < # avol ∧ wbuf-cons(mkwbuf(buf, m1, m2), avol[bleb.leb], rofs)), buffered(m4) = bleb

Rule argument

pos: right 1

Additional information

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