Proof step 102 from proof refine-add-ind (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 103:

  # lpt1 = # avol, # buf1 = 2 * NODE_HEADER_SIZE + ind.alignedsize, # lpt0 = # avol, istore[m1] = indexblock(indx, lax, m4), lpt1[m1] = mklp(m4, # buf0, LP_INDEX_NODES, m2), avol[m1] = mapped(buf0), keyset(gch) = gc-heap(lpt1, log1), pstate = index(m1), remove-refsize0(istore0) = istore0, remove-refsize0(gstore0) = gstore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, ginval < # avol, m1 < # avol, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore), abs-node(buf1, ind), awbuf-inv(avol[m1, mapped(buf0 + buf1)], buffered(m1)), awbuf-inv(avol, buffered(m1)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(m1), lpt1, avol), bufs-log-only(buffered(m1), log1, lpt1), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt1, freelist), inv(istore0), inv(istore), inv(gstore0), inv(gstore \ ginval), inv(indexblock(indx, lax, m4)), log-group-block(log1, lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1[m1, mklp(m4, # buf0 + # buf1, LP_INDEX_NODES, m2)], lpt0, log1), lpt-ram-flash(lpt1, lpt0, log1), m1 ∈ istore, # buf0 + # buf1 ≤ LEB_SIZE, istore0 ⊑ istore, ¬ dups(log1), isbuf1 → synced(avol) ⊦ ⟨apersistence_add_ind#(ind, adr0, istore0, ginval, gstore, gstore0, log1, m0, ns0; adr2, istore, pstate, isbuf1; err1)⟩ ( abs-istore (avol[pstate.lnum, mapped(avol[pstate.lnum].data + buf1)], lpt1 [pstate.lnum, mklp(lpt1[pstate.lnum].ref-size, lpt1[pstate.lnum].size + # buf1, lpt1[pstate.lnum].flags, lpt1[pstate.lnum].gcheapidx) ], istore) ∧ (isbuf1 → is-aligned(# avol[pstate.lnum].data + # buf1, EB_PAGE_SIZE)) ∧ pstate ≠ unbuffered ∧ pstate ≠ readonly ∧ m1 = pstate.lnum ∧ @(pstate.lnum, lpt1[pstate.lnum].size, # buf1) = adr2 ∧ ESUCCESS = err1)

Rule argument

Additional information

Used simplifier rules: ⊦ 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)% ⊦ mapped(buf) = mapped(buf0) ↔ buf = buf0; (s)% ⊦ mapped(buf).data = buf; (s)%inv-buf-in-vol: ⊦ awbuf-inv(avol, buffered(n)) → n < # avol; (forward) from specification awbuf-inv%⊦ awbuf-inv(avol, buffered(n)) → (synced(avol[n, mapped(buf)]) ↔ is-aligned(# buf, EB_PAGE_SIZE)); (s)%lpf ≠ LP_GROUP_NODES ⊦ lpt[n] = mklp(n0, n1, lpf, n2) → ( abs-gstore(avol[n, aleb], lpt, gstore, ginval) ↔ abs-gstore(avol, lpt, gstore, ginval)); (s)%lpf ≠ LP_GROUP_NODES, lp.flags ≠ LP_GROUP_NODES ⊦ lpt[n] = mklp(n0, n1, lpf, n2) → ( abs-gstore(avol, lpt[n, lp], gstore, ginval) ↔ abs-gstore(avol, lpt, gstore, ginval)); (s)% ⊦ m < n → (n ≤ m ↔ false); (s)% ⊦ ¬ ⌊ESUCCESS⌋ ; (s)% ⊦ buffered(m).isbuf?; (s)% ⊦ avol[n].mapped? ↔ (∃ buf. avol[n] = mapped(buf)); (as)%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)% ⊦ m + n = m + n0 ↔ n = n0; (s)%append-a: ⊦ (buf + buf0) + buf1 = buf + buf0 + buf1; from specification array-splice[buffer]% ⊦ #(buf + buf0) = # buf + # buf0; (s)%n < # lpt, n < # avol ⊦ buf-ro-rw-mode (false, buffered(n), lpt[n, mklp(m0, m1, lpf, m2)], avol[n, mapped(buf)]) ↔ m1 = # buf; (s)%lpt[n].flags = lp.flags ⊦ bufs-log-only(bleb, nx, lpt) → bufs-log-only(bleb, nx, lpt[n, lp]); (s)% ⊦ mklp(n2, n3, lpf, m).gcheapidx = m; (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)% ⊦ mklp(n2, n3, lpf, m).ref-size = n2; (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).size = n3; (s)%⊦ lpt-leb-size(lpt) → (lpt-leb-size(lpt[n, lp]) ↔ # lpt ≤ n ∨ lp.size ≤ LEB_SIZE); (s)% ⊦ m ≤ m; (s)%c: ⊦ m + n = n + m; from specification nat-basic%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic% ⊦ n + 0 = n; (s)% ⊦ # avol[n, aleb] = # avol; (s)%# buf = n ⊦ subarray(buf, 0, n) = buf; (s)% ⊦ # lpt[n, lp] = # 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).flags = lpf; (s)% ⊦ LP_GROUP_NODES ≠ LP_INDEX_NODES; (s)% ⊦ buffered(m).leb = m; (s)