[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 69 from proof inv-read-gblock-nodes (previous step)

# gndx = # lax, # lpt = # avol, # lpt0 = # avol, LEB_SIZE = n0 + # buf1, avol[m5] = mapped(buf1), # buf1 < m1 + 2 * NODE_HEADER_SIZE + align↑(m, 2 * NODE_HEADER_SIZE), m5 < # avol, m1 < LEB_SIZE, LEB_SIZE < m1 + 2 * NODE_HEADER_SIZE + align↑(m, 2 * NODE_HEADER_SIZE), abs-nodes(buf1, gndx, lax, true), awbuf-inv(avol, bleb), buf-ro-rw-mode(isbuf, bleb, lpt0, avol), bufs-log-only(bleb, log0, lpt0), is-encoded(nodeheader(m, boolvar), subarray(buf1 + mkempbuf(n0), m1, NODE_HEADER_SIZE)), lpt-free-unref(lpt), lpt-leb-size(lpt), lpt-ram-flash(lpt0, lpt, log0), read-gblock-inv(m5, m1, ax, gndx0, ax1, gndx2, buf1, false), m1 + NODE_HEADER_SIZE ≤ LEB_SIZE, # buf1 ≤ LEB_SIZE, ¬ isempty(buf1 + mkempbuf(n0), m1, NODE_HEADER_SIZE) ⊦ ⟪debug# ( "persistence: read_gblock_nodes ignoring node of size " + (2 * NODE_HEADER_SIZE + align↑(m, 2 * NODE_HEADER_SIZE)).toString + " at offset " + m1.toString + " in LEB " + m5.toString); err := ENOENT; m0 := m1; if err = ESUCCESS then m0 := m0 + 2 * NODE_HEADER_SIZE + align↑(m, 2 * NODE_HEADER_SIZE)⟫ ( (err = ESUCCESS ∨ err = ENOENT ∨ ⌊err⌋ ) ∧ (err = ESUCCESS ∨ err = ENOENT → read-gblock-inv(m5, m0, ax, gndx0, ax1, gndx2, avol[m5].data, err = ENOENT)) ∧ (err ≠ ESUCCESS ⊃ 0;LEB_SIZE - m0) + m1 < LEB_SIZE)

User applied rule insert program lemma

And obtained the following new goals

Rule argument

spec: debug name: debug seq: ⊦ ⟪debug#(str)⟫ true subst: [str] → [ "persistence: read_gblock_nodes ignoring node of size " + (2 * NODE_HEADER_SIZE + align↑(m, 2 * NODE_HEADER_SIZE) ).toString + " at offset " + m1.toString + " in LEB " + m5.toString] flags: List([[1,0,0]])

Additional information