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

wlar[n] = wl-entry(m0, stat0), apebs0[n] = mkpeb(aehdr0, avhdr, buf, m1, false), err1 ≠ ESUCCESS, n < # wlar, n < # apebs0, ⌊err0⌋ , ¬ aehdr.valid? ⊦ [aubi_io_markbad#(n; apebs; err1); wlar1 := wlar[n, wl-entry(wlar[n].ec + UBI_ERASE_RETRIES + 1, stat)]; if err1 = ESUCCESS then wlar1[n] := wl-entry(wlar1[n].ec, erroneous) else debug#("ubi: marking PEB " + n.toString + " as bad failed")] ∃ m, stat. m ≠ 0 ∧ m ≤ UBI_ERASE_RETRIES + 1 ∧ wlar1 = wlar[n, wl-entry(m0 + m, stat)]

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 119:
apebs0[n] = mkpeb(aehdr0, avhdr, buf, m1, false), wlar[n] = wl-entry(m0, stat0), vtblpnum = n, n < # apebs0, n < # wlar, ⌊err0⌋ ⊦ [if ubi-io-markbad-pre(vtblpnum, apebs) then {fail_or_success#(; ; err); if err = ESUCCESS then apebs[vtblpnum].bad := true} else abort; wlar1 := wlar[n, wl-entry(wlar[n].ec + UBI_ERASE_RETRIES + 1, stat)]; if err = ESUCCESS then wlar1[n] := wl-entry(wlar1[n].ec, erroneous) else debug#("ubi: marking PEB " + n.toString + " as bad failed")] ∃ m, stat. m ≠ 0 ∧ m ≤ UBI_ERASE_RETRIES + 1 ∧ wlar1 = wlar[n, wl-entry(m0 + m, stat)], err1 = ESUCCESS, aehdr.valid?

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubi_io_markbad#(PNUM; APEBS; ERR) {if ubi-io-markbad-pre(PNUM, APEBS) then {fail_or_success#(; ; ERR); if ERR = ESUCCESS then APEBS[PNUM].bad := true} else abort };