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

# apebs1 = # wlar, # wlar0 = # wlar, # apebs = # wlar, avhdr.leb = VTBL_LNUM, avhdr.vol = VTBL_VOLID, apebs[vtblpnum4] = mkpeb(aehdr1, avhdr, buf, m3, false), apebs[vtblpnum1] = mkpeb(aehdr, empty, mkempbuf(LEB_SIZE), 0, false), wlar[vtblpnum4] = 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), apebs2 = apebs1, wlar1 = wlar0, vtblpnum ≠ vtblpnum4, vtblpnum4 ≠ vtblpnum1, aehdr.valid?, vtblpnum1 < # wlar, vtblpnum4 < # wlar, 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-io-inv(apebs), ubi-io-inv(apebs1), ubi-io-peb-inv(mkpeb(aehdr1, avhdr, 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(apebs, wlar, vols, vtblpnum4), valid-ebatbl(apebs1, wlar0, vols, vtblpnum), valid-eraseq(q + eq-entry(vtblpnum4, VTBL_VOLID × VTBL_LNUM) '), valid-eraseq(wlar0, q + eq-entry(vtblpnum4, VTBL_VOLID × VTBL_LNUM) '), valid-eraseq(apebs1, q + eq-entry(vtblpnum4, VTBL_VOLID × VTBL_LNUM) '), valid-eraseq(q), valid-eraseq(wlar, q), valid-eraseq(apebs, q), valid-global-sqn(apebs1, sqnum0), valid-global-sqn(apebs, sqnum), valid-peb(mkpeb(aehdr1, avhdr, buf, m3, false)), valid-vtbl(apebs, vols, wlar, vtblpnum4), valid-vtbl(apebs1, vols, wlar0, vtblpnum), valid-wl(apebs1, wlar0), valid-wl(apebs, wlar), ¬ vtblpnum4 ∈ q, ¬ VTBL_VOLID ∈ vols, ¬ vtblpnum ∈ q, bflipset = ∅ → m1 + WL_THRESHOLD ≤ m0, ∀ v, m. ¬ v ∈ vols ∧ is-encoded(to-vtbl(vols)[v, m], buf) → valid-ebatbl(apebs1, wlar0, vols[v, fill(mkebatbl(m), unmapped)], vtblpnum) ∧ valid-vtbl(apebs1, vols[v, fill(mkebatbl(m), unmapped)], wlar0, vtblpnum) ⊦ [ubi_erase_worker_helper#(vtblpnum4; wlar0, apebs1; err)] ( ( err = ESUCCESS → # apebs1 = # wlar0 ∧ unique-sqns(apebs1) ∧ valid-global-sqn(apebs1, sqnum0) ∧ valid-wl(apebs1, wlar0) ∧ valid-eraseq(wlar0, q) ∧ valid-eraseq(apebs1, q) ∧ bflipset-cons(bflipset1, wlar0) ∧ valid-ebatbl(apebs1, wlar0, vols, vtblpnum) ∧ valid-vtbl(apebs1, vols, wlar0, vtblpnum)) ∧ ( err ≠ ESUCCESS → # apebs1 = # wlar0 ∧ unique-sqns(apebs1) ∧ valid-global-sqn(apebs1, sqnum0) ∧ valid-wl(apebs1, wlar0) ∧ valid-eraseq(wlar0, q + eq-entry(vtblpnum4, VTBL_VOLID × VTBL_LNUM) ') ∧ valid-eraseq(apebs1, q + eq-entry(vtblpnum4, VTBL_VOLID × VTBL_LNUM) ') ∧ bflipset-cons(bflipset1, wlar0) ∧ valid-ebatbl(apebs1, wlar0, vols, vtblpnum) ∧ valid-vtbl(apebs1, vols, wlar0, vtblpnum)) ∧ ubi-io-inv(apebs1) ∧ wlar0[vtblpnum4].status ≠ used ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ id○(wlar0, wlar1, vtblpnum4) ∧ id○(apebs1, apebs2, vtblpnum4) ∧ id(apebs1, apebs2, mapped-pebs(vols)) → ⟪q1 := q + eq-entry(vtblpnum4, VTBL_VOLID × VTBL_LNUM) '; 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, vtblpnum) ∧ valid-vtbl(apebs1, vols, wlar0, vtblpnum) ∧ ( id(apebs1, apebs, mapped-pebs(vols)) ∧ q1.lebrefs ⊆ q.lebrefs ++ (VTBL_VOLID × VTBL_LNUM) ∨ (∃ v, m, n. v ∈ vols ∧ m < # vols[v] ∧ vols[v][m] ≠ unmapped ∧ vols = vols[v, vols[v][m, ⌜n⌝ ]] ∧ id(apebs1, apebs, mapped-pebs(vols) -- vols[v][m].pnum) ∧ apebs1[n].data = apebs[vols[v][m].pnum].data ∧ apebs1[n].fill ≤ apebs[vols[v][m].pnum].fill ∧ q1.lebrefs ⊆ q.lebrefs ++ (v × m)))))

User applied rule skip call

And obtained the following new goals

Rule argument

pos: right 1

Additional information