Proof step 75 from proof refine-sync (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 76:

  # lpt0 = # avol, # lpt1 = # avol, lpt1[pstate.lnum] = mklp(m1, # buf0, lpf, m4), avol[pstate.lnum] = mapped(buf0), buf = mkbuf(EB_PAGE_SIZE - # buf0 % EB_PAGE_SIZE), keyset(gch) = gc-heap(lpt1, log1), remove-refsize0(gstore0) = gstore0, remove-refsize0(istore0) = istore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, lpf ≠ LP_FREE, pstate ≠ readonly, pstate ≠ unbuffered, ginval < # avol, pstate.lnum < # avol, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore), awbuf-inv(avol, buffered(pstate.lnum)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(pstate.lnum), lpt1, avol), bufs-log-only(buffered(pstate.lnum), log1, lpt1), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt1, freelist), inv(gstore \ ginval), inv(gstore0), inv(istore), inv(istore0), is-aligned(# buf0, 2 * NODE_HEADER_SIZE), 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), # buf0 ≤ LEB_SIZE, istore0 ⊑ istore, ¬ dups(log1), ¬ is-aligned(# buf0, EB_PAGE_SIZE), pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore, pstate.index? → pstate.lnum ∈ istore ⊦ [persistence_encode_padding_node#(; buf; err); isbuf2 := pstate = readonly; bleb1 := buffered(pstate.lnum); if err = ESUCCESS then {awbuf_write_buf#(# buf, buf, adr0, m, log1, lpt0, ns0, bleb1; avol, isbuf2; err); m0 := lpt1[bleb1.leb].size; if err = ESUCCESS then lpt1[bleb1.leb] := mklp (lpt1[bleb1.leb].ref-size, lpt1[bleb1.leb].size + (EB_PAGE_SIZE - m0 % EB_PAGE_SIZE), lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx) else {debug#("persistence: flushing of LEB " + bleb1.leb.toString + " failed"); lpt1[bleb1.leb] := mklp(lpt1[bleb1.leb].ref-size, LEB_SIZE, lpt1[bleb1.leb].flags, lpt1[bleb1.leb].gcheapidx); awbuf_enter_readonly#(adr0, m, log1, avol, lpt0, ns0, bleb1; ; isbuf2)}} else {debug#("persistence: could not encode padding node"); awbuf_enter_readonly#(adr0, m, log1, avol, lpt0, ns0, bleb1; ; isbuf2)}] ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log1) ∧ bufs-log-only(bleb1, log1, lpt1) ∧ # lpt1 = # avol ∧ log-group-block(log1, lpt1) ∧ buf-ro-rw-mode(isbuf2, bleb1, lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log1) ∧ awbuf-inv(avol, bleb1) ∧ # lpt0 = # avol → ⟨isbuf1 := false; apersistence_sync#(adr0, istore, istore0, ginval, gstore, gstore0, log1, m, ns0; pstate, isbuf1; err0)⟩ ( abs-istore(avol, lpt1, istore) ∧ abs-gstore(avol, lpt1, gstore, ginval) ∧ ginval < # lpt1 ∧ (isbuf1 → synced(avol)) ∧ (pstate = unbuffered → bleb1 = nobuffer) ∧ (pstate = readonly ↔ isbuf2) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb1 = buffered(pstate.lnum)) ∧ err = err0))

Rule argument

Additional information

Used simplifier rules: n < # avol ⊦ awbuf-inv(avol, buffered(n)) ∧ avol[n] = mapped(buf) → (synced(avol) ↔ is-aligned(# buf, EB_PAGE_SIZE)); (ss)% ⊦ m < n → (n ≤ m ↔ false); (s)% ⊦ m < n ↔ ¬ n ≤ m; (ss)%⊦ n < # avol ∧ synced(avol) ∧ avol[n] = mapped(buf) → is-aligned(# buf, EB_PAGE_SIZE); (s)% ⊦ mapped(buf).data = buf; (s)%inv-buf-in-vol: ⊦ awbuf-inv(avol, buffered(n)) → n < # avol; (forward) from specification awbuf-inv%lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic% ⊦ nobuffer ≠ buffered(m); (s)% ⊦ avol[n].mapped? ↔ (∃ buf. avol[n] = mapped(buf)); (as)% ⊦ buffered(m).isbuf?; (s)% ⊦ buffered(m) = buffered(m0) ↔ m = m0; (s)% ⊦ m < n → n ≠ 0; (s)% ⊦ mklp(n2, n3, lpf, m).size = n3; (s)% ⊦ buffered(m).leb = m; (s)%lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic%f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic% ⊦ bleb.isbuf? ↔ (∃ n. bleb = buffered(n)); (as)%n ≠ 0 ⊦ m % n ≤ n; (s)% ⊦ n ≥ m ↔ m ≤ n; (s)% ⊦ EB_PAGE_SIZE ≠ 0; (s)