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

apebs[n] = mkpeb(aehdr0, avhdr0, buf0, m2, false), apebs0[n] = mkpeb(aehdr, avhdr, buf, m1, false), wlar[n] = wl-entry(m0, stat0), err0 ≠ ESUCCESS, n < # apebs0, n < # wlar, n < # apebs, ⌊err⌋ ⊦ [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)]

Heuristic weak unfold applied rule call right

And obtained the following new goals

Proof step 334:
wlar[n] = wl-entry(m0, stat0), apebs0[n] = mkpeb(aehdr, avhdr, buf, m1, false), apebs[n] = mkpeb(aehdr0, avhdr0, buf0, m2, false), n < # apebs, n < # wlar, n < # apebs0, ⌊err⌋ ⊦ [choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; 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)], err0 = ESUCCESS

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail_or_success#(; ; ERR) {choose ERR0 with ⌊ERR0⌋ ∨ ERR0 = ESUCCESS in ERR := ERR0};