| # wlar = # apebs, subarray(wlar[m5, wl-entry(m3, used)], 0, m5 + 1)[m5] = wl-entry(m10, stat), apebs[m5] = mkpeb(aehdr1, avidhdr(v, n, m0, m1, m4), buf1, m13, boolvar1), subarray(apebs, 0, m5 + 1)[m5] = mkpeb(aehdr0, avhdr, buf0, m9, boolvar0), (∅)[v × n] = recovery-entry(m11, m12), wlar[m5] = wl-entry(m14, stat0), m5 < # apebs ⊦ v × n ∈ recs, stat = used ∧ avhdr.vol = v ∧ avhdr.leb = n |
⊦ n + m ≤ # wlar ∧ n0 < n → subarray(wlar, m, n)[n0] = wlar[m + n0]
Used simplifier rules: ⊦ n + 0 = n; (s)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic% ⊦ m < n ↔ ¬ n ≤ m; (ss)% ⊦ m < n → (n ≤ m ↔ false); (s)%m < # wlar ⊦ wlar[m, wle][m] = wle; (s)% ⊦ wl-entry(m, stat) = wl-entry(m0, stat0) ↔ m = m0 ∧ stat = stat0; (ws)% ⊦ n0 < n → subarray(apebs, m, n)[n0] = apebs[m + n0]; (s)% ⊦ # wlar[n, wle] = # wlar; (s)% ⊦ m + 1 ≤ n ↔ m < n; (s)% ⊦ m < n + 1 ↔ ¬ n < m; (s)% ⊦ ¬ n < n; (s)%⊦ mkpeb(aehdr, avhdr, buf, m, boolvar) = mkpeb(aehdr0, avhdr0, buf0, m0, boolvar0) ↔ aehdr = aehdr0 ∧ avhdr = avhdr0 ∧ buf = buf0 ∧ m = m0 ∧ (boolvar ↔ boolvar0); (s)% ⊦ avidhdr(v, m, m0, m1, m2).vol = v; (s)% ⊦ avidhdr(v, m, m0, m1, m2).leb = m; (s)%fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat%fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat%# apebs = n ⊦ subarray(apebs, 0, n) = apebs; (s)%# wlar = n ⊦ subarray(wlar, 0, n) = wlar; (s)% ⊦ m < n → wlar[m, wle][n] = wlar[n]; (s) Used terms: m5, m5 + 1, 0, wlar[m5, wl-entry(m3, used)]