[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 13 from proof inv-add-gnds (previous step)

# lpt0 = # avol, # lpt1 = # avol, isbuf0 ↔ isbuf1, lpt1[bleb.leb] = mklp(m4, m1, lpf, m2), ¬ isbuf0, keyset(gch) = gc-heap(lpt1, log0), log = log0, lpt = lpt0, awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(isbuf1, bleb, lpt1, avol), bufs-log-only(bleb, log0, lpt1), freelist-cons(lpt1, freelist), log-group-block(log0, lpt1), lpt-free-unref(lpt0), lpt-free-unref(lpt1), lpt-leb-size(lpt0), lpt-leb-size(lpt1), lpt-ram-flash(lpt1, lpt0, log0), ¬ isbuf1 → bleb.isbuf? ∧ bleb.leb < # avol ∧ lpf = LP_GROUP_NODES ∧ bleb.leb ∈ log0 ∧ avol[bleb.leb].mapped? ∧ (gndx ≠ [] ∧ m1 + gndx.flashsize ≤ LEB_SIZE → m1 = # avol[bleb.leb].data) ⊦ ⟪if gndx = [] then {ax := []; err := ESUCCESS} else let buf = ?, bleb1 = ? in {awbuf_get_buf#(adr, m, log0, avol, lpt0, ns, bleb, isbuf1; ; bleb1); persistence_encode_group_nodes#(gndx, bleb1.leb, lpt1[bleb1.leb].size; ; buf, ax, err); if err = ESUCCESS then if ¬ lpt1[bleb1.leb].size + # buf ≤ LEB_SIZE then {debug#("persistence: trying to write beyond LEB size"); awbuf_enter_readonly#(adr, m, log0, avol, lpt0, ns, bleb; ; isbuf1); err := ENOSPC} else {awbuf_write_buf#(# buf, buf, adr, m, log0, lpt0, ns, bleb; avol, isbuf1; err); if err = ESUCCESS then lpt1[bleb1.leb] := mklp(lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + # buf, lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) else {debug#("persistence: adding group node to LEB " + bleb1.leb.toString + " failed"); lpt1[bleb1.leb] := mklp(lpt1[bleb1.leb].ref-size, LEB_SIZE, lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx)}} else {debug#("persistence: could not encode group node"); awbuf_enter_readonly#(adr, m, log0, avol, lpt0, ns, bleb; ; isbuf1)}}⟫ ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log0) ∧ bufs-log-only(bleb, log0, lpt1) ∧ # lpt1 = # avol ∧ log-group-block(log0, lpt1) ∧ buf-ro-rw-mode(isbuf1, bleb, lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log0) ∧ awbuf-inv(avol, bleb) ∧ # lpt0 = # avol), dups(log0)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information