[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 110 from proof prepost-write-once (previous step)

# apebs2 = # wlar0, # apebs0 = # wlar1, n2 + m1 = n + n0, q0.head = eq-entry(m4, lref0), LEB_SIZE = (n0 + n) + m0, LEB_SIZE = (n2 + m0) + m1, apebs2[vtblpnum1] = mkpeb(aehdr, empty, mkempbuf(LEB_SIZE), 0, false), wlar0[vtblpnum1] = wl-entry(m5, free), vols0[v][m] = unmapped, aehdr.valid?, m < # vols0[v], vtblpnum1 < # wlar0, n < m1, n < LEB_SIZE, bflipset-cons(bflipset, wlar0), bflipset-cons(bflipset, wlar1), id(apebs2, apebs0, mapped-pebs(vols0)), is-aligned(m0, EB_PAGE_SIZE), is-aligned(m1, EB_PAGE_SIZE), is-aligned(n, EB_PAGE_SIZE), ubi-io-inv(apebs2), ubi-io-inv(apebs0), ubi-io-inv(apebs2[vtblpnum1, mkpeb(aehdr, avidhdr(v, m, sqnum, 0, 0), mkempbuf(LEB_SIZE), 0, false)]), ubi-io-inv(apebs2[vtblpnum1, mkpeb(aehdr, avidhdr(v, m, sqnum, 0, 0), mkempbuf(m0) + subarray(buf, m2, n) + mkempbuf(n0), m0 + n, false)]), unique-sqns(apebs2), unique-sqns(apebs0), valid-ebatbl(apebs2, wlar0, vols0, vtblpnum2), valid-ebatbl(apebs0, wlar1, vols0, vtblpnum2), valid-eraseq(q1 + eq-entry(vtblpnum1, v × m) '), valid-eraseq(apebs2, q1), valid-eraseq(wlar0, q1), valid-eraseq(q1), valid-eraseq(q0), valid-eraseq(wlar1, q0), valid-eraseq(apebs0, q0), valid-global-sqn(apebs2, sqnum), valid-global-sqn(apebs0, sqnum), valid-peb(mkpeb(aehdr, avidhdr(v, m, sqnum, 0, 0), subarray(mkempbuf(LEB_SIZE), 0, m0) + subarray(buf, m2, n) + mkempbuf(n0), m0 + n, false)), valid-vtbl(apebs2, vols0, wlar0, vtblpnum2), valid-vtbl(apebs0, vols0, wlar1, vtblpnum2), valid-wl(apebs2, wlar0), valid-wl(apebs0, wlar1), v ∈ vols0, m0 + m1 ≤ LEB_SIZE, m1 + m2 ≤ # buf, m1 ≤ LEB_SIZE, m2 + n ≤ # buf, m0 ≤ LEB_SIZE, n + m0 ≤ LEB_SIZE, q1.lebrefs ⊆ q0.lebrefs, ⌊err0⌋ , apebs0 = apebs2 ∧ wlar1 = wlar0 ∧ q0 = q1 ∨ id○(apebs0, apebs2, vtblpnum1) ∧ id○(wlar1, wlar0, vtblpnum1) ∧ q0 = eq-entry(vtblpnum1, lref0) ' + q1 ⊦ n0 + m0 = 0, n = 0, vtblpnum2 = vtblpnum1, vtblpnum2 ∈ q0, VTBL_VOLID ∈ vols0, vtblpnum2 ∈ q1, valid-ebatbl (apebs2[vtblpnum1, mkpeb(aehdr, avidhdr(v, m, sqnum, 0, 0), mkempbuf(m0) + subarray(buf, m2, n) + mkempbuf(n0), m0 + n, false)], wlar0[vtblpnum1, wl-entry(m5, erasing)], vols0, vtblpnum2) ∧ valid-eraseq (apebs2[vtblpnum1, mkpeb(aehdr, avidhdr(v, m, sqnum, 0, 0), mkempbuf(m0) + subarray(buf, m2, n) + mkempbuf(n0), m0 + n, false)], q1 + eq-entry(vtblpnum1, v × m) ') ∧ valid-wl (apebs2[vtblpnum1, mkpeb(aehdr, avidhdr(v, m, sqnum, 0, 0), mkempbuf(m0) + subarray(buf, m2, n) + mkempbuf(n0), m0 + n, false)], wlar0[vtblpnum1, wl-entry(m5, erasing)]) ∧ valid-global-sqn (apebs2[vtblpnum1, mkpeb(aehdr, avidhdr(v, m, sqnum, 0, 0), mkempbuf(m0) + subarray(buf, m2, n) + mkempbuf(n0), m0 + n, false)], sqnum + 1) ∧ unique-sqns(apebs2[vtblpnum1, mkpeb(aehdr, avidhdr(v, m, sqnum, 0, 0), mkempbuf(m0) + subarray(buf, m2, n) + mkempbuf(n0), m0 + n, false)])

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 7

Additional information

Used simplifier rules: ⊦ n1 ≤ n0 → subarray(mkempbuf(n0), 0, n1) = mkempbuf(n1); (s)%append-a: ⊦ (buf + buf0) + buf1 = buf + buf0 + buf1; from specification array-splice[buffer]% ⊦ m < n ↔ ¬ n ≤ m; (ss)% ⊦ m < n → (n ≤ m ↔ false); (s)%m < # apebs ⊦ unique-sqns(apebs) → ( unique-sqns(apebs[m, apeb]) ↔ ¬ valid-peb(apeb) ∨ ¬ apeb.vidhdr.sqn ∈ valid-sqns(apeb.vidhdr.vol, apeb.vidhdr.leb, apebs) \ (valid-peb(apeb.vidhdr.vol, apeb.vidhdr.leb, apebs[m]) ⊃ {apebs[m].vidhdr.sqn} ;∅ )); (ss)% ⊦ mkpeb(aehdr, avhdr, buf, m, boolvar).vidhdr = avhdr; (s)% ⊦ avidhdr(v, m, m0, m1, m2).sqn = m0; (s)% ⊦ avidhdr(v, m, m0, m1, m2).vol = v; (s)% ⊦ avidhdr(v, m, m0, m1, m2).leb = m; (s)% ⊦ ¬ valid-peb(v, m, mkpeb(aehdr, empty, buf, m0, boolvar)); (s)% ⊦ bag \ ∅ = bag; (s)% ⊦ valid-global-sqn(apebs, n) → ¬ n ∈ valid-sqns(v, m, apebs); (s)% ⊦ used ≠ free; (s)% ⊦ used ≠ erasing; (s)%stat ≠ used, stat0 ≠ used ⊦ wlar[m] = wl-entry(m0, stat) → ( valid-ebatbl(apebs, wlar[m, wl-entry(m1, stat0)], vols, n) ↔ valid-ebatbl(apebs, wlar, vols, n)); (ss)%stat ≠ used ⊦ wlar[m] = wl-entry(m0, stat) → ( valid-ebatbl(apebs[m, apeb], wlar, vols, n) ↔ valid-ebatbl(apebs, wlar, vols, n)); (ss)