[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 19 from proof inv-io-read (previous step)

# buf = # buf2, # buf2 = n2 + n0 + n, UBI_READ_RETRIES = n1 + m4, pebs[m3] = mkpeb(buf1, m2, false), m3 < # pebs, mtd-cons(pebs), range=(buf, n0 + n, buf2, n0 + n, n2), range=(buf, 0, buf2, 0, n0), m4 ≤ UBI_READ_RETRIES, m4 ≤ UBI_READ_RETRIES + 1, n0 + n ≤ # buf2, m0 + n ≤ PEB_SIZE, ⌊err⌋ ⊦ ⟪mtd_asm_read#(m3, m0, n0, n, pebs; buf; bitflips, err); if err ≠ ESUCCESS then debug#("ubi-io: failed to read from PEB " + m3.toString); m := m4 + 1⟫ ( n0 + n ≤ # buf ∧ m ≤ UBI_READ_RETRIES + 1 ∧ # buf = # buf2 ∧ range=(buf, 0, buf2, 0, n0) ∧ range=(buf, n0 + n, buf2, n0 + n, n2) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → subarray(buf, n0, n) = subarray(pebs[m3].data, m0, n)) ∧ UBI_READ_RETRIES < n1 + m)

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 20:
# buf2 = n2 + n0 + n, # buf = # buf2, UBI_READ_RETRIES = n1 + m4, pebs[m3] = mkpeb(buf1, m2, false), buf0 = buf, m = m1, m0 = m3, m3 < # pebs, mtd-cons(pebs), range=(buf, 0, buf2, 0, n0), range=(buf, n0 + n, buf2, n0 + n, n2), m1 + n ≤ PEB_SIZE, n0 + n ≤ # buf2, m4 ≤ UBI_READ_RETRIES + 1, m4 ≤ UBI_READ_RETRIES, ⌊err⌋ ⊦ ⟪if m0 < # pebs ∧ ¬ pebs[m0].bad ∧ m + n ≤ PEB_SIZE ∧ n0 + n ≤ # buf0 then {fail_or_success#(; ; err); bitflips := ?; if err = ESUCCESS then buf0 := copy(pebs[m0].data, m, buf0, n0, n) else choose buf with # buf = # buf0 ∧ range=(buf, 0, buf0, 0, n0) ∧ range=(buf, n0 + n, buf0, n0 + n, # buf0 - n0 + n) in buf0 := buf} else abort; if err ≠ ESUCCESS then debug#("ubi-io: failed to read from PEB " + m3.toString); m := m4 + 1⟫ ( n0 + n ≤ # buf0 ∧ m ≤ UBI_READ_RETRIES + 1 ∧ # buf0 = # buf2 ∧ range=(buf0, 0, buf2, 0, n0) ∧ range=(buf0, n0 + n, buf2, n0 + n, n2) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → subarray(buf0, n0, n) = subarray(pebs[m3].data, m1, n)) ∧ UBI_READ_RETRIES < n1 + m)

Rule argument

pos: right 1

Additional information

Used simplifier rules: mtd_asm_read#(PNUM, OFFSET, N0, N, PEBS; BUF; BITFLIPS, ERR) {if PNUM < # PEBS ∧ ¬ PEBS[PNUM].bad ∧ OFFSET + N ≤ PEB_SIZE ∧ N0 + N ≤ # BUF then {fail_or_success#(; ; ERR); BITFLIPS := ?; if ERR = ESUCCESS then BUF := copy(PEBS[PNUM].data, OFFSET, BUF, N0, N) else choose BUF0 with # BUF0 = # BUF ∧ range=(BUF0, 0, BUF, 0, N0) ∧ range=(BUF0, N0 + N, BUF, N0 + N, # BUF - N0 + N) in BUF := BUF0} else abort };