[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 407 from proof prepost-atomic-leb-change (previous step)

# apebs0 = # wlar, LEB_SIZE = n2 + n0, wlar[m] = wl-entry(m2, used), vols[v][m0] = ⌜m⌝ , wlar[n1] = wl-entry(m1, free), apebs0[n1] = mkpeb(aehdr, empty, mkempbuf(LEB_SIZE), 0, false), aehdr.valid?, m0 < # vols[v], n1 < # wlar, m < # wlar, bflipset-cons(bflipset, wlar), bflipset-cons(bflipset -- m, wlar), is-aligned(n0, EB_PAGE_SIZE), ubi-io-inv(apebs0[n1, mkpeb(aehdr, avidhdr(v, m0, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)]), ubi-io-inv(apebs0), unique-sqns(apebs0), valid-ebatbl(apebs0, wlar, vols, vtblpnum1), valid-eraseq(q), valid-eraseq(wlar, q), valid-eraseq(apebs0, q), valid-eraseq(q + eq-entry(m, v × m0) '), valid-global-sqn(apebs0, sqnum + 1), valid-global-sqn(apebs0, sqnum), valid-peb(mkpeb(aehdr, avidhdr(v, m0, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)), valid-peb(v, m0, apebs0[m]), valid-vtbl(apebs0, vols, wlar, vtblpnum1), valid-wl(apebs0, wlar), v ∈ vols, n0 ≤ LEB_SIZE ⊦ m = vtblpnum1, vtblpnum1 = n1, valid-eraseq(apebs0[n1, mkpeb(aehdr, avidhdr(v, m0, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)], q + eq-entry(m, v × m0) '), m ∈ q, vtblpnum1 ∈ q, VTBL_VOLID ∈ vols

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 408:
⊦ valid-eraseq(apebs, q) → (valid-eraseq(apebs, q + eq-entry(n, lref) ') ↔ n < # apebs ∧ (valid-peb(apebs[n]) → lref = apebs[n].vidhdr.vol × apebs[n].vidhdr.leb))
Proof step 409:
# apebs0 = # wlar, LEB_SIZE = n2 + n0, apebs0[n1] = mkpeb(aehdr, empty, mkempbuf(LEB_SIZE), 0, false), wlar[n1] = wl-entry(m1, free), vols[v][m0] = ⌜m⌝ , wlar[m] = wl-entry(m2, used), aehdr.valid?, m < # wlar, n1 < # wlar, m0 < # vols[v], bflipset-cons(bflipset -- m, wlar), bflipset-cons(bflipset, wlar), is-aligned(n0, EB_PAGE_SIZE), ubi-io-inv(apebs0), ubi-io-inv(apebs0[n1, mkpeb(aehdr, avidhdr(v, m0, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)]), unique-sqns(apebs0), valid-ebatbl(apebs0, wlar, vols, vtblpnum1), valid-eraseq(q + eq-entry(m, v × m0) '), valid-eraseq(apebs0, q), valid-eraseq(wlar, q), valid-eraseq(q), valid-global-sqn(apebs0, sqnum), valid-global-sqn(apebs0, sqnum + 1), valid-peb(v, m0, apebs0[m]), valid-peb(mkpeb(aehdr, avidhdr(v, m0, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)), valid-vtbl(apebs0, vols, wlar, vtblpnum1), valid-wl(apebs0, wlar), v ∈ vols, n0 ≤ LEB_SIZE ⊦ m = vtblpnum1, vtblpnum1 = n1, valid-eraseq(apebs0[n1, mkpeb(aehdr, avidhdr(v, m0, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)], q + eq-entry(m, v × m0) '), valid-eraseq(apebs0[n1, mkpeb(aehdr, avidhdr(v, m0, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)], q), VTBL_VOLID ∈ vols, vtblpnum1 ∈ q, m ∈ q
Proof step 412:
# apebs0 = # wlar, LEB_SIZE = n2 + n0, apebs0[n1] = mkpeb(aehdr, empty, mkempbuf(LEB_SIZE), 0, false), wlar[n1] = wl-entry(m1, free), vols[v][m0] = ⌜m⌝ , wlar[m] = wl-entry(m2, used), aehdr.valid?, m < # wlar, n1 < # wlar, m0 < # vols[v], bflipset-cons(bflipset -- m, wlar), bflipset-cons(bflipset, wlar), is-aligned(n0, EB_PAGE_SIZE), ubi-io-inv(apebs0), ubi-io-inv(apebs0[n1, mkpeb(aehdr, avidhdr(v, m0, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)]), unique-sqns(apebs0), valid-ebatbl(apebs0, wlar, vols, vtblpnum1), valid-eraseq(q + eq-entry(m, v × m0) '), valid-eraseq(apebs0, q), valid-eraseq(wlar, q), valid-eraseq(q), valid-eraseq(apebs0[n1, mkpeb(aehdr, avidhdr(v, m0, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)], q), valid-global-sqn(apebs0, sqnum), valid-global-sqn(apebs0, sqnum + 1), valid-peb(v, m0, apebs0[m]), valid-peb(mkpeb(aehdr, avidhdr(v, m0, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)), valid-vtbl(apebs0, vols, wlar, vtblpnum1), valid-wl(apebs0, wlar), v ∈ vols, n0 ≤ LEB_SIZE ⊦ m = vtblpnum1, vtblpnum1 = n1, VTBL_VOLID ∈ vols, vtblpnum1 ∈ q, m ∈ q, m < # apebs0[n1, mkpeb(aehdr, avidhdr(v, m0, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)] ∧ ( valid-peb(apebs0[n1, mkpeb(aehdr, avidhdr(v, m0, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)][m]) → v × m0 = apebs0[n1, mkpeb(aehdr, avidhdr(v, m0, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)][m].vidhdr.vol × apebs0[n1, mkpeb(aehdr, avidhdr(v, m0, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)][m].vidhdr.leb)

Rule argument

spec: ubi-base name: valid-eraseqp-append seq: ⊦ valid-eraseq(apebs, q) → ( valid-eraseq(apebs, q + eq-entry(n, lref) ') ↔ n < # apebs ∧ ( valid-peb(apebs[n]) → lref = apebs[n].vidhdr.vol × apebs[n].vidhdr.leb)) subst: [lref, n, q, apebs] → [v × m0, m, q, apebs0 [n1, mkpeb (aehdr, avidhdr(v, m0, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false) ]] flags: <all paths>

Additional information

Used terms: v × m0, m, q, apebs0 [n1, mkpeb (aehdr, avidhdr(v, m0, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false) ]