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

# lpt = # avol, # lpt0 = # avol, keyset(gch) = gc-heap(lpt, log1), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt), buf-ro-rw-mode(isbuf1, 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), ¬ dups(log1) ⊦ ⟪awbuf_is_readonly#(adr, m, log1, avol, lpt0, ns, bleb, isbuf1; ; isbuf); if isbuf then err := EROFS else if freelist = [] then err := ENOSPC else {n := freelist.head; awbuf_remap#(n, adr, m, log1, lpt0, ns, bleb, isbuf1; avol; err); if err = ESUCCESS then {freelist := freelist.tail; lpt[n] := mklp(lpt[n].ref-size, 0, lpt[n].flags, lpt[n].gcheapidx); lpt[n].ref-size := 0}}; log := log1; if err = ESUCCESS then {awbuf_add_log_leb#(n, 0, adr, m, avol, lpt0, ns, isbuf1; 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(isbuf1, bleb, lpt, avol) ∧ lpt-leb-size(lpt) ∧ lpt-ram-flash(lpt, lpt0, log) ∧ awbuf-inv(avol, bleb) ∧ # lpt0 = # avol)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 12:
# lpt0 = # avol, # lpt1 = # avol, isbuf0 ↔ isbuf1, keyset(gch) = gc-heap(lpt1, log1), log = log1, lpt = lpt0, awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(isbuf1, bleb, lpt1, avol), bufs-log-only(bleb, log1, lpt1), freelist-cons(lpt1, freelist), log-group-block(log1, lpt1), lpt-free-unref(lpt0), lpt-free-unref(lpt1), lpt-leb-size(lpt0), lpt-leb-size(lpt1), lpt-ram-flash(lpt1, lpt0, log1), synced(avol) ⊦ ⟪isbuf := isbuf0; if isbuf then err := EROFS else if freelist = [] then err := ENOSPC else {n := freelist.head; awbuf_remap#(n, adr, m, log1, lpt0, ns, bleb, isbuf1; avol; err); if err = ESUCCESS then {freelist := freelist.tail; lpt1[n] := mklp(lpt1[n].ref-size, 0, lpt1[n].flags, lpt1[n].gcheapidx); lpt1[n].ref-size := 0}}; log := log1; if err = ESUCCESS then {awbuf_add_log_leb#(n, 0, adr, m, avol, lpt0, ns, isbuf1; log, bleb; err); if err ≠ ESUCCESS then freelist := n ' + freelist}; if err = ESUCCESS then {lpt1[n].flags := LP_GROUP_NODES; log1 := log1 + n '}⟫ ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ log1 = log ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log) ∧ bufs-log-only(bleb, log, lpt1) ∧ # lpt1 = # avol ∧ ¬ dups(log) ∧ log-group-block(log, lpt1) ∧ buf-ro-rw-mode(isbuf1, bleb, lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log) ∧ awbuf-inv(avol, bleb) ∧ # lpt0 = # avol), dups(log1)

Rule argument

pos: right 1

Additional information

Used simplifier rules: awbuf_is_readonly# (WROOTADR, WMAXINO, WLOG, WVOL, WLPT, WORPHANS, WBUFLEB, AROFS ; ; AROFS0 ) {AROFS0 := AROFS};