[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 255 from proof wlar-erase-worker-helper (previous step)

apebs[n] = mkpeb(aehdr, avhdr, buf, m1, false), wlar[n] = wl-entry(m0, stat0), n < # wlar, n < # apebs, ⌊err0⌋ ⊦ [debug#("ubi: erase of PEB " + n.toString + " failed"); vtblpnum1 := 1; wlar1 := wlar[n, wlar[n].ec:= (wlar[n].ec + 1)]; vtblpnum0 := n; while err0 ≠ ESUCCESS ∧ vtblpnum1 ≤ UBI_ERASE_RETRIES do {wlar1[vtblpnum0].ec := wlar1[vtblpnum0].ec + 1; aubi_io_sync_erase#(vtblpnum0; apebs; err0); if err0 = ESUCCESS then aubi_io_write_echdr#(vtblpnum0, aechdr(wlar1[vtblpnum0].ec); apebs; err0) else debug#("ubi: erase of PEB " + vtblpnum0.toString + " failed"); vtblpnum1 := vtblpnum1 + 1}; if err0 = ESUCCESS then wlar1[vtblpnum0] := wl-entry(wlar1[vtblpnum0].ec, free) else {aubi_io_markbad#(vtblpnum0; apebs; err0); if err0 = ESUCCESS then wlar1[vtblpnum0] := wl-entry(wlar1[vtblpnum0].ec, erroneous) else debug#("ubi: marking PEB " + vtblpnum0.toString + " as bad failed")}] ∃ m, stat. m ≠ 0 ∧ m ≤ UBI_ERASE_RETRIES + 1 ∧ wlar1 = wlar[n, wl-entry(m0 + m, stat)]

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: erase of PEB " + n.toString + " failed"] flags: <all paths>

Additional information