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

apebs0[n] = mkpeb(aehdr, avhdr, buf, m1, false), wlar[n] = wl-entry(m0, stat0), apebs[n] = mkpeb(aehdr1, avhdr1, buf1, m3, false), n < # apebs0, n < # wlar, n < # apebs, ubi-io-peb-inv(mkpeb(aehdr0, avhdr0, buf0, m2, false)), ⌊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, avhdr0.valid?

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Proof step 233:
apebs[n] = mkpeb(aehdr1, avhdr1, buf1, m3, false), wlar[n] = wl-entry(m0, stat0), apebs0[n] = mkpeb(aehdr, avhdr, buf, m1, false), n < # apebs, n < # wlar, n < # apebs0, ubi-io-peb-inv(mkpeb(aehdr0, avhdr0, buf0, m2, false)), ⌊err⌋ , ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ [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)], err1 = ESUCCESS, avhdr0.valid?

Proof step 232 from proof wlar-erase-worker-helper (previous step)

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Rule argument

Additional information