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

wlar[n] = wl-entry(m0, stat0), apebs0[n] = mkpeb(aehdr, avhdr, buf, m1, false), vtblpnum = n, n < # wlar, n < # apebs0, ubi-io-markbad-pre(vtblpnum, apebs), ⌊err⌋ ⊦ [fail_or_success#(; ; err); if err = ESUCCESS then apebs[vtblpnum].bad := true; 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)], err0 = ESUCCESS

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 331:
apebs0[n] = mkpeb(aehdr, avhdr, buf, m1, false), wlar[n] = wl-entry(m0, stat0), err0 ≠ ESUCCESS, n < # apebs0, n < # wlar, n < # apebs, ⌊err⌋ , ¬ apebs[n].bad ⊦ [fail_or_success#(; ; err); if err = ESUCCESS then apebs[n].bad := true; 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)]

Rule argument

Additional information

Used simplifier rules: ⊦ ubi-io-markbad-pre(n, apebs) ↔ n < # apebs ∧ ¬ apebs[n].bad; (s)