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

# wlar0 = # wlar, # apebs = # wlar, # apebs1 = # wlar, q1.lebrefs = q.lebrefs, wlar[vtblpnum1] = wl-entry(m0, free), wlar[vtblpnum2] = wl-entry(m1, used), apebs[vtblpnum1] = mkpeb(aehdr, empty, mkempbuf(LEB_SIZE), 0, false), apebs[vtblpnum2] = mkpeb(aehdr1, avhdr, buf, m3, false), vtblpnum4 ≠ vtblpnum1, aehdr.valid?, vtblpnum1 < # wlar, vtblpnum2 < # wlar, bflipset-cons(bflipset0, wlar), bflipset-cons(bflipset, wlar), bflipset-cons(bflipset1, wlar0), 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)), unique-sqns(apebs), unique-sqns(apebs1), valid-ebatbl(apebs1, wlar0, vols, vtblpnum), valid-ebatbl(apebs, wlar, vols, vtblpnum4), valid-eraseq(apebs, q), valid-eraseq(wlar, q), valid-eraseq(q), valid-eraseq(apebs1, q1), valid-eraseq(wlar0, q1), valid-eraseq(q1), valid-global-sqn(apebs, sqnum), valid-global-sqn(apebs1, sqnum0), valid-peb(mkpeb(aehdr1, avhdr, buf, m3, false)), valid-vtbl(apebs1, vols, wlar0, vtblpnum), valid-vtbl(apebs, vols, wlar, vtblpnum4), valid-wl(apebs, wlar), valid-wl(apebs1, wlar0), ⌊err⌋ , ¬ vtblpnum ∈ q1, ¬ vtblpnum2 ∈ q, ¬ vtblpnum4 ∈ q, ¬ VTBL_VOLID ∈ vols, bflipset = ∅ → m1 + WL_THRESHOLD ≤ m0, avhdr.vol ∈ vols ∧ avhdr.leb < # vols[avhdr.vol] ∨ avhdr.vol = VTBL_VOLID ∧ avhdr.leb = VTBL_LNUM ⊦ ⟪debug#("ubi: wear-leveling of PEB " + vtblpnum2.toString + " to PEB " + vtblpnum1.toString + " failed"); if err = ESUCCESS then {ubi_erase_worker_helper#(vtblpnum2; wlar0, apebs1; err); 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) ∧ ubi-io-inv(apebs1) ∧ ( 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 insert program lemma

And obtained the following new goals

Rule argument

spec: debug name: debug seq: ⊦ ⟪debug#(str)⟫ true subst: [str] → [ "ubi: wear-leveling of PEB " + vtblpnum2.toString + " to PEB " + vtblpnum1.toString + " failed"] flags: <all paths>

Additional information