[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 72 from proof initialization (previous step)

m = m6, m0 = LEB_SIZE, m1 = m3, ⌊err0⌋ ⊦ ⟨if m0 = LEB_SIZE then {fail_or_success#(; ; err); if err = ESUCCESS then pstate := unbuffered, isbuf := true, maxino := m, ns := ∅, log := [], gstore0 := ∅, gstore := ∅, istore0 := ∅, istore := ∅, ginval := ∅, adr := ? else pstate := ?, isbuf := ?, maxino := ?, ns := ?, log := ?, gstore0 := ?, gstore := ?, istore0 := ?, istore := ?, ginval := ?, adr := ?} else abort⟩ ( adr0 = adr ∧ istore3 = istore0 ∧ istore4 = istore ∧ ns0 = ginval ∧ gstore3 = gstore0 ∧ gstore4 = gstore ∧ log0 = log ∧ m = maxino ∧ ns1 = ns ∧ pstate1 = pstate ∧ (isbuf0 ↔ isbuf) ∧ err0 = err)

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 73:
m = m6, m0 = LEB_SIZE, m1 = m3, ⌊err0⌋ ⊦ ⟨fail_or_success#(; ; err); if err = ESUCCESS then pstate := unbuffered, isbuf := true, maxino := m, ns := ∅, log := [], gstore0 := ∅, gstore := ∅, istore0 := ∅, istore := ∅, ginval := ∅, adr := ? else pstate := ?, isbuf := ?, maxino := ?, ns := ?, log := ?, gstore0 := ?, gstore := ?, istore0 := ?, istore := ?, ginval := ?, adr := ?⟩ ( adr0 = adr ∧ istore3 = istore0 ∧ istore4 = istore ∧ ns0 = ginval ∧ gstore3 = gstore0 ∧ gstore4 = gstore ∧ log0 = log ∧ m = maxino ∧ ns1 = ns ∧ pstate1 = pstate ∧ (isbuf0 ↔ isbuf) ∧ err0 = err)

Proof step 72 from proof initialization (previous step)

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

Additional information