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

# buf < n + m1, 2 * NODE_HEADER_SIZE ≤ m1 ⊦ ⟪debug#("persistence: decode_node buffer insufficient"); err := EINVAL⟫ ⌊err⌋

User applied rule insert program lemma

And obtained the following new goals

Proof step 12:
⊦ ⟪debug#(str)⟫ true
Proof step 13:
str0 = "persistence: decode_node buffer insufficient", # buf < n + m1, 2 * NODE_HEADER_SIZE ≤ m1 ⊦ ∀ . true → ⟪err := EINVAL⟫ ⌊err⌋

Rule argument

spec: debug name: debug seq: ⊦ ⟪debug#(str)⟫ true subst: [str] → ["persistence: decode_node buffer insufficient"] flags: <all paths>

Additional information