[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 inv-allocate-gnd (previous step)

# lpt = # avol, # lpt0 = # avol, isbuf0 ↔ isbuf, keyset(gch) = gc-heap(lpt, log1), log = log1, awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt), buf-ro-rw-mode(isbuf, bleb, lpt, avol), bufs-log-only(bleb, log1, lpt), freelist-cons(lpt, freelist), log-group-block(log1, lpt), lpt-free-unref(lpt), lpt-free-unref(lpt0), lpt-leb-size(lpt), lpt-leb-size(lpt0), lpt-ram-flash(lpt, lpt0, log1), 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}}}; log := log1; if err = ESUCCESS then {awbuf_add_log_leb#(n, 0, adr, m, avol, lpt0, ns, isbuf; log, bleb; err); if err ≠ ESUCCESS then freelist := n ' + freelist}; if err = ESUCCESS then {lpt[n].flags := LP_GROUP_NODES; log1 := log1 + n '}⟫ ( lpt-free-unref(lpt) ∧ freelist-cons(lpt, freelist) ∧ log1 = log ∧ bin-heap-inv(gch, lpt) ∧ keyset(gch) = gc-heap(lpt, log) ∧ bufs-log-only(bleb, log, lpt) ∧ # lpt = # avol ∧ ¬ dups(log) ∧ log-group-block(log, lpt) ∧ buf-ro-rw-mode(isbuf, bleb, lpt, avol) ∧ lpt-leb-size(lpt) ∧ lpt-ram-flash(lpt, lpt0, log) ∧ awbuf-inv(avol, bleb) ∧ # lpt0 = # avol), dups(log1)

Heuristic symbolic execution applied rule let right

And obtained the following new goals

Rule argument

Additional information