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

apebs[n] = mkpeb(aehdr0, avhdr0, buf0, m, false), apebs0[n] = mkpeb(aehdr, avhdr, buf, m1, false), wlar[n] = wl-entry(m0, stat0), err = err0, n < # apebs0, n < # wlar, n < # apebs, vtblpnum1 ≤ UBI_ERASE_RETRIES + 1, vtblpnum1 ≤ UBI_ERASE_RETRIES, ⌊err2⌋ , ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ [{vtblpnum := n; choose apeb with ubi-io-peb-inv(apeb) ∧ ¬ apeb.bad ∧ ¬ apeb.vidhdr.valid? in apebs[vtblpnum] := apeb} or skip; wlar1 := wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)] [n, wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)][n].ec:= (wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)][n].ec + 1) ]; if err = ESUCCESS then aubi_io_write_echdr#(n, aechdr(wlar1[n].ec); apebs; err1) else debug#("ubi: erase of PEB " + n.toString + " failed"); vtblpnum1 := vtblpnum1 + 1] (id○(wlar, wlar1, n) ∧ vtblpnum1 ≠ 0 ∧ vtblpnum1 ≤ UBI_ERASE_RETRIES + 1 ∧ (∃ stat. wlar1 = wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)])), err = ESUCCESS, err1 = ESUCCESS, vtblpnum1 = 0

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Rule argument

Additional information