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

wlar[n] = wl-entry(m0, stat0), apebs0[n] = mkpeb(aehdr, avhdr, buf, m1, false), err0 = ESUCCESS, vtblpnum = 1, vtblpnum0 = n, wlar0 = wlar[n, wlar[n].ec:= (wlar[n].ec + 1)], n < # wlar, n < # apebs0, id○(wlar, wlar1, n), vtblpnum1 ≤ UBI_ERASE_RETRIES + 1, ⌊err⌋ , ∃ stat. wlar1 = wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)] ⊦ [wlar1[vtblpnum0] := wl-entry(wlar1[vtblpnum0].ec, free)] ∃ m, stat. m ≠ 0 ∧ m ≤ UBI_ERASE_RETRIES + 1 ∧ wlar1 = wlar[n, wl-entry(m0 + m, stat)], vtblpnum1 = 0, err0 ≠ ESUCCESS ∧ vtblpnum1 ≤ UBI_ERASE_RETRIES

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 325:
apebs0[n] = mkpeb(aehdr, avhdr, buf, m1, false), wlar[n] = wl-entry(m0, stat0), err0 = ESUCCESS, vtblpnum = 1, vtblpnum0 = n, wlar0 = wlar[n, wlar[n].ec:= (wlar[n].ec + 1)], vtblpnum0 < # wlar1, n < # apebs0, n < # wlar, id○(wlar, wlar1, n), vtblpnum1 ≤ UBI_ERASE_RETRIES + 1, ⌊err⌋ , ∃ stat. wlar1 = wlar[n, wl-entry(wlar[n].ec + vtblpnum1, stat)] ⊦ vtblpnum1 = 0, ∃ m, stat. m ≠ 0 ∧ m ≤ UBI_ERASE_RETRIES + 1 ∧ wlar1[vtblpnum0, wl-entry(wlar1[vtblpnum0].ec, free)] = wlar[n, wl-entry(m0 + m, stat)], err0 ≠ ESUCCESS ∧ vtblpnum1 ≤ UBI_ERASE_RETRIES

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

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information