[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 26 from proof inv-format (previous step)

# pebs = n0 + m1, # pebs0 = n0 + m1, n0 ≠ 0, mtd-cons(pebs), mtd-cons(pebs0), ubi-io-initial(subarray(pebs, 0, m1)) ⊦ ⟪mtd_asm_isbad#(m1, pebs; ; isbad, err); m := m1; if err = ESUCCESS ∧ ¬ isbad then let aehdr = ?, bitflips = ? in {ubi_io_read_echdr#(m, EB_PAGE_SIZE, pebs; aehdr; bitflips, err); let n = (err = ESUCCESS ∧ aehdr.valid? ⊃ aehdr.ec + 1;0) in {mtd_asm_erase#(m; pebs; err); if err = ESUCCESS then ubi_io_write_echdr#(m, aechdr(n), EB_PAGE_SIZE; pebs; err)}}; m := m + 1⟫ ( m ≤ # pebs0 ∧ # pebs0 = # pebs ∧ mtd-cons(pebs) ∧ (err = ESUCCESS → ubi-io-initial(subarray(pebs, 0, m))) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ # pebs0 < n0 + m)

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 27:
# pebs0 = n0 + m1, # pebs = n0 + m1, m = m1, mtd-cons(pebs0), mtd-cons(pebs), ubi-io-initial(subarray(pebs, 0, m1)) ⊦ ⟪if m < # pebs then {fail_or_success#(; ; err); if err = ESUCCESS then isbad := pebs[m].bad else isbad := ?} else abort; m := m1; if err = ESUCCESS ∧ ¬ isbad then let aehdr = ?, bitflips = ? in {ubi_io_read_echdr#(m, EB_PAGE_SIZE, pebs; aehdr; bitflips, err); let n = (err = ESUCCESS ∧ aehdr.valid? ⊃ aehdr.ec + 1;0) in {mtd_asm_erase#(m; pebs; err); if err = ESUCCESS then ubi_io_write_echdr#(m, aechdr(n), EB_PAGE_SIZE; pebs; err)}}; m := m + 1⟫ ( m ≤ # pebs0 ∧ # pebs0 = # pebs ∧ mtd-cons(pebs) ∧ (err = ESUCCESS → ubi-io-initial(subarray(pebs, 0, m))) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ # pebs0 < n0 + m), n0 = 0

Rule argument

pos: right 1

Additional information

Used simplifier rules: mtd_asm_isbad#(PNUM, PEBS; ; ISBAD, ERR) {if PNUM < # PEBS then {fail_or_success#(; ; ERR); if ERR = ESUCCESS then ISBAD := PEBS[PNUM].bad else ISBAD := ?} else abort };