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

# lpt = # avol, # lpt0 = # avol, keyset(gch) = gc-heap(lpt, log0), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt), buf-ro-rw-mode(isbuf, bleb, lpt, avol), bufs-log-only(bleb, log0, lpt), freelist-cons(lpt, freelist), log-group-block(log0, lpt), lpt-free-unref(lpt), lpt-free-unref(lpt0), lpt-leb-size(lpt), lpt-leb-size(lpt0), lpt-ram-flash(lpt, lpt0, log0), synced(avol) ⊦ ⟪persistence_allocate_leb#(adr, m, log0, lpt0, ns, bleb, isbuf; n, lpt, freelist, avol; err); if err = ESUCCESS then {awbuf_move_buf#(n, 0, adr, m, log0, avol, lpt0, ns, isbuf; bleb; err); if err ≠ ESUCCESS then freelist := n ' + freelist else lpt[n].flags := LP_INDEX_NODES}⟫ ( lpt-free-unref(lpt) ∧ freelist-cons(lpt, freelist) ∧ bin-heap-inv(gch, lpt) ∧ keyset(gch) = gc-heap(lpt, log0) ∧ bufs-log-only(bleb, log0, lpt) ∧ # lpt = # avol ∧ log-group-block(log0, lpt) ∧ buf-ro-rw-mode(isbuf, bleb, lpt, avol) ∧ lpt-leb-size(lpt) ∧ lpt-ram-flash(lpt, lpt0, log0) ∧ awbuf-inv(avol, bleb) ∧ # lpt0 = # avol)

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 8:
# lpt0 = # avol, # lpt = # avol, isbuf0 ↔ isbuf, keyset(gch) = gc-heap(lpt, log0), log = log0, awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt), buf-ro-rw-mode(isbuf, bleb, lpt, avol), bufs-log-only(bleb, log0, lpt), freelist-cons(lpt, freelist), log-group-block(log0, lpt), lpt-free-unref(lpt0), lpt-free-unref(lpt), lpt-leb-size(lpt0), lpt-leb-size(lpt), lpt-ram-flash(lpt, lpt0, log0), synced(avol) ⊦ ⟪let isbuf = ? in {awbuf_is_readonly#(adr, m, log, avol, lpt0, ns, bleb, isbuf0; ; isbuf); if isbuf then err := EROFS else if freelist = [] then err := ENOSPC else {n := freelist.head; awbuf_remap#(n, adr, m, log, lpt0, ns, bleb, isbuf0; avol; err); if err = ESUCCESS then {freelist := freelist.tail; lpt[n].size := 0; lpt[n].ref-size := 0}}}; if err = ESUCCESS then {awbuf_move_buf#(n, 0, adr, m, log0, avol, lpt0, ns, isbuf; bleb; err); if err ≠ ESUCCESS then freelist := n ' + freelist else lpt[n].flags := LP_INDEX_NODES}⟫ ( lpt-free-unref(lpt) ∧ freelist-cons(lpt, freelist) ∧ bin-heap-inv(gch, lpt) ∧ keyset(gch) = gc-heap(lpt, log0) ∧ bufs-log-only(bleb, log0, lpt) ∧ # lpt = # avol ∧ log-group-block(log0, lpt) ∧ buf-ro-rw-mode(isbuf, bleb, lpt, avol) ∧ lpt-leb-size(lpt) ∧ lpt-ram-flash(lpt, lpt0, log0) ∧ awbuf-inv(avol, bleb) ∧ # lpt0 = # avol)

Rule argument

pos: right 1

Additional information

Used simplifier rules: allocate-leb: ⊦ ;