[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 36 from proof decode-node (previous step)

err = EIO, m = m1, m0 = n, is-encoded(nodeheader(m2, true), subarray(buf, n, NODE_HEADER_SIZE)), n + NODE_HEADER_SIZE ≤ # buf, n + m1 ≤ # buf, 2 * NODE_HEADER_SIZE ≤ m1 ⊦ ⟪if err = ESUCCESS ∧ ¬ range=(buf, m0 + NODE_HEADER_SIZE + align↑(m2, 2 * NODE_HEADER_SIZE), validtrailer, 0, NODE_HEADER_SIZE) then {debug#("persistence: decode_node no validtrailer"); err := EIO}⟫ ( (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → (∃ buf0, buf1. subarray(buf, n, 2 * NODE_HEADER_SIZE + nd.alignedsize) = buf0 + buf1 + validtrailer ∧ is-encoded(nodeheader(node-size-headerless(nd), false), buf0) ∧ is-encoded(nd, subarray(buf1, 0, node-size-headerless(nd))) ∧ # buf1 = nd.alignedsize) ∧ m1 = 2 * NODE_HEADER_SIZE + nd.alignedsize))

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 37:
err = EIO, m = m1, m0 = n, is-encoded(nodeheader(m2, true), subarray(buf, n, NODE_HEADER_SIZE)), 2 * NODE_HEADER_SIZE ≤ m1, n + m1 ≤ # buf, n + NODE_HEADER_SIZE ≤ # buf ⊦ ⟪skip⟫ ( (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → (∃ buf0, buf1. subarray(buf, n, 2 * NODE_HEADER_SIZE + nd.alignedsize) = buf0 + buf1 + validtrailer ∧ is-encoded(nodeheader(node-size-headerless(nd), false), buf0) ∧ is-encoded(nd, subarray(buf1, 0, node-size-headerless(nd))) ∧ # buf1 = nd.alignedsize) ∧ m1 = 2 * NODE_HEADER_SIZE + nd.alignedsize))

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ESUCCESS ≠ EIO; (s)