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

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

User applied rule invariant right

And obtained the following new goals

Proof step 52:
apebs0[n] = mkpeb(aehdr0, avhdr, buf, m1, false), wlar[n] = wl-entry(m0, stat0), apebs = apebs0[n, mkpeb(aehdr, empty, mkempbuf(LEB_SIZE), 0, false)], err1 = err0, vtblpnum = n, vtblpnum1 = 1, wlar1 = wlar[n, wl-entry(m0 + 1, stat0)], n < # apebs0, n < # wlar, ⌊err0⌋ ⊦ aehdr.valid?, n < # wlar ∧ id○(wlar, wlar1, n) ∧ vtblpnum1 ≠ 0 ∧ vtblpnum1 ≤ UBI_ERASE_RETRIES + 1 ∧ (∃ stat. wlar1 = wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)])
Proof step 54:
apebs0[n] = mkpeb(aehdr0, avhdr, buf, m1, false), wlar[n] = wl-entry(m0, stat0), apebs1 = apebs0[n, mkpeb(aehdr, empty, mkempbuf(LEB_SIZE), 0, false)], err = err0, vtblpnum = n, vtblpnum0 = 1, wlar0 = wlar[n, wl-entry(m0 + 1, stat0)], n < # apebs0, n < # wlar, id○(wlar, wlar1, n), vtblpnum1 ≤ UBI_ERASE_RETRIES + 1, vtblpnum1 ≤ UBI_ERASE_RETRIES, ⌊err0⌋ , ∃ stat. wlar1 = wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)] ⊦ [wlar1[vtblpnum].ec := wlar1[vtblpnum].ec + 1; aubi_io_sync_erase#(vtblpnum; apebs; err1); if err1 = ESUCCESS then aubi_io_write_echdr#(vtblpnum, aechdr(wlar1[vtblpnum].ec); apebs; err1) else debug#("ubi: erase of PEB " + vtblpnum.toString + " failed"); vtblpnum1 := vtblpnum1 + 1] ( n < # wlar ∧ id○(wlar, wlar1, n) ∧ vtblpnum1 ≠ 0 ∧ vtblpnum1 ≤ UBI_ERASE_RETRIES + 1 ∧ (∃ stat. wlar1 = wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)])), err1 = ESUCCESS, vtblpnum1 = 0, aehdr.valid?
Proof step 113:
apebs0[n] = mkpeb(aehdr0, avhdr, buf, m1, false), wlar[n] = wl-entry(m0, stat0), apebs1 = apebs0[n, mkpeb(aehdr, empty, mkempbuf(LEB_SIZE), 0, false)], err = err0, vtblpnum = n, vtblpnum0 = 1, wlar0 = wlar[n, wl-entry(m0 + 1, stat0)], n < # apebs0, n < # wlar, id○(wlar, wlar1, n), vtblpnum1 ≤ UBI_ERASE_RETRIES + 1, ⌊err0⌋ , ∃ stat. wlar1 = wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)] ⊦ [if err1 = ESUCCESS then wlar1[vtblpnum] := wl-entry(wlar1[vtblpnum].ec, free) else {aubi_io_markbad#(vtblpnum; apebs; err1); if err1 = ESUCCESS then wlar1[vtblpnum] := wl-entry(wlar1[vtblpnum].ec, erroneous) else debug#("ubi: marking PEB " + vtblpnum.toString + " as bad failed")}] ∃ m, stat. m ≠ 0 ∧ m ≤ UBI_ERASE_RETRIES + 1 ∧ wlar1 = wlar[n, wl-entry(m0 + m, stat)], vtblpnum1 = 0, aehdr.valid?, err1 ≠ ESUCCESS ∧ vtblpnum1 ≤ UBI_ERASE_RETRIES

Rule argument

fma: n < # wlar ∧ id○(wlar, wlar1, n) ∧ vtblpnum1 ≠ 0 ∧ vtblpnum1 ≤ UBI_ERASE_RETRIES + 1 ∧ (∃ stat. wlar1 = wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)]) pos: right 1

Additional information

Used formulas: n < # wlar ∧ id○(wlar, wlar1, n) ∧ vtblpnum1 ≠ 0 ∧ vtblpnum1 ≤ UBI_ERASE_RETRIES + 1 ∧ (∃ stat. wlar1 = wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)])