[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 109 from proof inv-wl-worker (previous step)

# apebs1 = # wlar, # apebs = # wlar, # wlar0 = # wlar, vols[v][m] = ⌜vtblpnum2⌝ , apebs[vtblpnum2] = mkpeb(aechdr(m1), avidhdr(v1, m4, valid-sqns(v, m, apebs).max, m6, m7), buf, m3, false), apebs[vtblpnum1] = mkpeb(aehdr, empty, mkempbuf(LEB_SIZE), 0, false), wlar[vtblpnum2] = wl-entry(m1, used), wlar[vtblpnum1] = wl-entry(m0, free), apebs1[vtblpnum1] = mkpeb(aehdr0, avhdr0, buf, align↑(datasize(buf, LEB_SIZE), EB_PAGE_SIZE), boolvar), apebs1 = apebs1, apebs2 = apebs1, bflipset2 = bflipset1, lref0 = v × m, m2 = vtblpnum2, q2 = q, q3 = [], sqnum1 = sqnum0, vols0 = vols[v, vols[v][m, ⌜vtblpnum1⌝ ]], vtblpnum0 = vtblpnum, wlar0 = wlar0, wlar1 = wlar0, aehdr.valid?, vtblpnum1 < # wlar, m < # vols[v], vtblpnum2 < # wlar, vtblpnum2 < # wlar0, bflipset-cons(bflipset1, wlar0), bflipset-cons(bflipset, wlar), bflipset-cons(bflipset0, wlar), id(apebs1, apebs, mapped-pebs(vols)), id○(apebs1, apebs, vtblpnum1), is-aligned(LEB_SIZE, EB_PAGE_SIZE), ubi-cons(apebs1, vols[v, vols[v][m, ⌜vtblpnum1⌝ ]], wlar0, q + eq-entry(vtblpnum2, v × m) ' + [], bflipset1, vtblpnum, sqnum0), ubi-io-inv(apebs), ubi-io-inv(apebs1), ubi-io-peb-inv(mkpeb(aechdr(m1), avidhdr(v1, m4, valid-sqns(v, m, apebs).max, m6, m7), buf, m3, false)), ubi-io-peb-inv(mkpeb(aehdr0, avhdr0, buf, align↑(datasize(buf, LEB_SIZE), EB_PAGE_SIZE), boolvar)), unique-sqns(apebs1), unique-sqns(apebs), valid-ebatbl(apebs1, wlar0, vols[v, vols[v][m, ⌜vtblpnum1⌝ ]], vtblpnum), valid-ebatbl(apebs, wlar, vols, vtblpnum4), valid-eraseq(q + eq-entry(vtblpnum2, v × m) '), valid-eraseq(wlar0, q + eq-entry(vtblpnum2, v × m) '), valid-eraseq(apebs1, q + eq-entry(vtblpnum2, v × m) '), valid-eraseq(q), valid-eraseq(wlar, q), valid-eraseq(apebs, q), valid-global-sqn(apebs1, sqnum0), valid-global-sqn(apebs, sqnum), valid-peb(mkpeb(aechdr(m1), avidhdr(v1, m4, valid-sqns(v, m, apebs).max, m6, m7), buf, m3, false)), valid-peb(v, m, mkpeb(aechdr(m1), avidhdr(v1, m4, valid-sqns(v, m, apebs).max, m6, m7), buf, m3, false)), valid-vtbl(apebs, vols, wlar, vtblpnum4), valid-vtbl(apebs1, vols, wlar0, vtblpnum), valid-wl(apebs1, wlar0), valid-wl(apebs, wlar), v ∈ vols, bflipset = ∅ → m1 + WL_THRESHOLD ≤ m0 ⊦ [ubi_erase_worker_helper#(vtblpnum2; wlar0, apebs1; err)] ( (err = ESUCCESS → ubi-cons(apebs1, vols0, wlar0, q2 + q3, bflipset2, vtblpnum0, sqnum1)) ∧ (err ≠ ESUCCESS → ubi-cons(apebs1, vols0, wlar0, q2 + eq-entry(m2, lref0) ' + q3, bflipset2, vtblpnum0, sqnum1)) ∧ ubi-io-inv(apebs1) ∧ wlar0[m2].status ≠ used ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ id○(wlar0, wlar1, m2) ∧ id○(apebs1, apebs2, m2) ∧ id(apebs1, apebs2, mapped-pebs(vols0)) → ⟪q1 := q + eq-entry(vtblpnum2, v × m) '; if err = ESUCCESS then q1 := q1.butlast⟫ ( # apebs1 = # wlar0 ∧ unique-sqns(apebs1) ∧ valid-global-sqn(apebs1, sqnum0) ∧ valid-wl(apebs1, wlar0) ∧ valid-eraseq(q1) ∧ valid-eraseq(wlar0, q1) ∧ valid-eraseq(apebs1, q1) ∧ bflipset-cons(bflipset1, wlar0) ∧ valid-ebatbl(apebs1, wlar0, vols[v, vols[v][m, ⌜vtblpnum1⌝ ]], vtblpnum) ∧ valid-vtbl(apebs1, vols, wlar0, vtblpnum) ∧ ubi-io-inv(apebs1) ∧ ( vols = vols[v, vols[v][m, ⌜vtblpnum1⌝ ]] ∧ id(apebs1, apebs, (mapped-pebs(vols) -- vtblpnum2) ++ vtblpnum1) ∧ q1.lebrefs ⊆ q.lebrefs ++ (VTBL_VOLID × VTBL_LNUM) ∨ (∃ v0, m2, n. v0 ∈ vols ∧ m2 < # vols[v0] ∧ vols[v0][m2] ≠ unmapped ∧ vols[v, vols[v][m, ⌜vtblpnum1⌝ ]] = vols[v0, vols[v0][m2, ⌜n⌝ ]] ∧ id(apebs1, apebs, mapped-pebs(vols) -- vols[v0][m2].pnum) ∧ apebs1[n].data = apebs[vols[v0][m2].pnum].data ∧ apebs1[n].fill ≤ apebs[vols[v0][m2].pnum].fill ∧ q1.lebrefs ⊆ q.lebrefs ++ (v0 × m2))))), vtblpnum = vtblpnum2, vtblpnum2 = vtblpnum4, vtblpnum4 = vtblpnum1, vtblpnum ∈ q, vtblpnum2 ∈ q, vtblpnum4 ∈ q, VTBL_VOLID ∈ vols

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic%⊦ v ∈ vols ∧ m < # vols[v] ∧ vols[v][m] = ⌜n0⌝ ∧ valid-ebatbl(apebs, wlar, vols, m0) → mapped-pebs(vols[v, vols[v][m, ⌜n1⌝ ]]) = (mapped-pebs(vols) -- n0) ++ n1; (s)% ⊦ v ∈ vols[v0, ebatbl] ↔ v = v0 ∨ v ∈ vols; (ws)%⊦ v ∈ vols → ( valid-vtbl(apebs, vols[v, vols[v][m, ebae]], wlar, n0) ↔ valid-vtbl(apebs, vols, wlar, n0)); (s)%⊦ ubi-cons(apebs, vols, wlar, q, bflipset, n0, n1) ↔ # apebs = # wlar ∧ unique-sqns(apebs) ∧ valid-global-sqn(apebs, n1) ∧ valid-wl(apebs, wlar) ∧ valid-eraseq(q) ∧ valid-eraseq(wlar, q) ∧ valid-eraseq(apebs, q) ∧ ¬ VTBL_VOLID ∈ vols ∧ bflipset-cons(bflipset, wlar) ∧ valid-ebatbl(apebs, wlar, vols, n0) ∧ valid-vtbl(apebs, vols, wlar, n0); (s)%a: ⊦ (q + q0) + q1 = q + q0 + q1; from specification list[erasequeue-base]% ⊦ q + [] = q; (s)