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

wlar[n] = wl-entry(m0, stat0), err = EIO, vtblpnum = 0, vtblpnum0 = n, wlar0 = wlar, n < # wlar ⊦ [while err ≠ ESUCCESS ∧ vtblpnum ≤ UBI_ERASE_RETRIES do {wlar[vtblpnum0].ec := wlar[vtblpnum0].ec + 1; aubi_io_sync_erase#(vtblpnum0; apebs; err); if err = ESUCCESS then aubi_io_write_echdr#(vtblpnum0, aechdr(wlar[vtblpnum0].ec); apebs; err) else debug#("ubi: erase of PEB " + vtblpnum0.toString + " failed"); vtblpnum := vtblpnum + 1}; if err = ESUCCESS then wlar[vtblpnum0] := wl-entry(wlar[vtblpnum0].ec, free) else {aubi_io_markbad#(vtblpnum0; apebs; err); if err = ESUCCESS then wlar[vtblpnum0] := wl-entry(wlar[vtblpnum0].ec, erroneous) else debug#("ubi: marking PEB " + vtblpnum0.toString + " as bad failed")}] ∃ m, stat. m ≠ 0 ∧ m ≤ UBI_ERASE_RETRIES + 1 ∧ wlar = wlar0[n, wl-entry(m0 + m, stat)]

Heuristic unwind applied rule while unwind right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ESUCCESS ≠ EIO; (s)% ⊦ 0 ≤ m; (s)