| # buf1 = 2 * NODE_HEADER_SIZE + ind.alignedsize, # lpt1 = # avol, # lpt0 = # avol, # lpt0 = # avol[m, mapped(avol[m].data + subarray(buf0, 0, n))], isbuf ↔ false, avol[n1] = mapped(buf), lpt1[n1] = mklp(m1, # buf, LP_INDEX_NODES, m2), buf0 = buf1, err = err0, keyset(gch) = gc-heap(lpt1, log0), m = buffered(n1).leb, n0 = # buf1, buffered(n1).isbuf?, avol[m].mapped?, m < # avol, n1 < # avol, n < n0, abs-node(buf1, ind), awbuf-inv(avol, buffered(n1)), awbuf-inv(avol[m, mapped(avol[m].data + subarray(buf0, 0, n))], buffered(n1)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(n1), lpt1, avol), bufs-log-only(buffered(n1), log0, lpt1), freelist-cons(lpt1, freelist), is-aligned(# avol[m].data + n, EB_PAGE_SIZE), log-group-block(log0, lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1, lpt0, log0), 0 + n ≤ # buf0, # buf + # buf1 ≤ LEB_SIZE, n ≠ 0 → n < n0 → avol[m].mapped? ∧ m < # avol, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪lpt1[buffered(n1).leb] := mklp(lpt1[buffered(n1).leb].ref-size, LEB_SIZE, lpt1[buffered(n1).leb].flags, lpt1[buffered(n1).leb].gcheapidx)⟫ ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log0) ∧ bufs-log-only(buffered(n1), log0, lpt1) ∧ # lpt1 = # avol[m, mapped(avol[m].data + subarray(buf0, 0, n))] ∧ log-group-block(log0, lpt1) ∧ buf-ro-rw-mode(true, buffered(n1), lpt1, avol[m, mapped(avol[m].data + subarray(buf0, 0, n))]) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log0)), err = ESUCCESS, n = 0 |
Used simplifier rules: elim-mapped: ⊦ avol[n].mapped? ↔ (∃ buf. avol[n] = mapped(buf));%elim-mapped: ⊦ avol[n].mapped? ↔ (∃ buf. avol[n] = mapped(buf));% ⊦ buffered(m).leb = m; (s)% ⊦ # avol[n, aleb] = # avol; (s)% ⊦ n + 0 = n; (s)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic% ⊦ m < n → m ≤ n; (s)% ⊦ buffered(m).isbuf?; (s)% ⊦ ⌊err⌋ → err ≠ ESUCCESS; (s)% ⊦ EB_PAGE_SIZE ≠ 0; (s)% ⊦ m < n ↔ ¬ n ≤ m; (ss)%fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat%f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic%lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic%inv-buf-in-vol: ⊦ awbuf-inv(avol, buffered(n)) → n < # avol; (forward) from specification awbuf-inv% ⊦ # buf = 0 ↔ buf = mkbuf(0); (s)% ⊦ m ≤ n → (n < m ↔ false); (s)%m ≠ 0, is-aligned(n1, m) ⊦ is-aligned(n0 + n1, m) ↔ is-aligned(n0, m); (s)%# buf = n ⊦ subarray(buf, 0, n) = buf; (s)%fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat% ⊦ mapped(buf) = mapped(buf0) ↔ buf = buf0; (s)% ⊦ ¬ n < n; (s)%⊦ lpt-free-unref(lpt) → ( lpt-free-unref(lpt[n, lp]) ↔ n < # lpt ∧ lp.flags = LP_FREE → lp.ref-size = 0); (s)% ⊦ mklp(n2, n3, lpf, m).flags = lpf; (s)% ⊦ mklp(n2, n3, lpf, m).ref-size = n2; (s)% ⊦ LP_GROUP_NODES ≠ LP_INDEX_NODES; (s)%lpf0 ≠ LP_GROUP_NODES, n < # lpt ⊦ lpt[n] = mklp(m0, m1, lpf0, m2) ∧ keyset(gch) = gc-heap(lpt, nx) → ( bin-heap-inv(gch, lpt[n, mklp(n0, n1, lpf1, n2)]) ↔ bin-heap-inv(gch, lpt)); (s)%lpf0 ≠ LP_GROUP_NODES, lpf1 ≠ LP_GROUP_NODES, n < # lpt ⊦ lpt[n] = mklp(m0, m1, lpf0, m2) → gc-heap(lpt[n, mklp(n0, n1, lpf1, n2)], nx) = gc-heap(lpt, nx); (s)% ⊦ mklp(n2, n3, lpf, m).gcheapidx = m; (s)%lpt[n].flags = lp.flags ⊦ bufs-log-only(bleb, nx, lpt) → bufs-log-only(bleb, nx, lpt[n, lp]); (s)% ⊦ # lpt[n, lp] = # lpt; (s)%n < # lpt, lpf ≠ LP_GROUP_NODES ⊦ lpt[n] = mklp(n0, n1, lpf, n2) ∧ log-group-block(nx, lpt) → log-group-block(nx, lpt[n, lp]); (s)%⊦ buf-ro-rw-mode (true, buffered(n), lpt[n, mklp(m0, LEB_SIZE, lpf, m1)], avol) ↔ n < # lpt; (s)%⊦ lpt-leb-size(lpt) → (lpt-leb-size(lpt[n, lp]) ↔ # lpt ≤ n ∨ lp.size ≤ LEB_SIZE); (s)% ⊦ m < n → (n ≤ m ↔ false); (s)% ⊦ mklp(n2, n3, lpf, m).size = n3; (s)% ⊦ m ≤ m; (s)%n < # lpt, lpf ≠ LP_GROUP_NODES ⊦ lpt-ram-flash(lpt, lpt0, nx) → lpt-ram-flash(lpt[n, mklp(n0, n1, lpf, n2)], lpt0, nx); (ss)% ⊦ mapped(buf).data = buf; (s)% ⊦ LP_FREE ≠ LP_INDEX_NODES; (s)%⊦ freelist-cons(lpt, freelist) ∧ lpt[n] = mklp(m0, m1, lpf, m2) → freelist-cons(lpt[n, mklp(n0, n1, lpf, n2)], freelist); (s)