Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: D
Locations: l0, l1, l2
Transitions:
t₁: l0(X₀, X₁, X₂) → l1(D, D+1, X₁)
t₂: l1(X₀, X₁, X₂) → l1(D, D+1, X₁)
t₀: l1(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₁+1 ≤ X₀
Cut unsatisfiable transition t₀: l1→l2
Cut unreachable locations [l2] from the program graph
Eliminate variables {D,X₀,X₁,X₂} that do not contribute to the problem
Start: l0
Program_Vars:
Temp_Vars:
Locations: l0, l1
Transitions:
t₇: l0 → l1
t₈: l1 → l1
Overall timebound:inf {Infinity}
t₇: 1 {O(1)}
t₈: inf {Infinity}
Overall costbound: inf {Infinity}
t₇: 1 {O(1)}
t₈: inf {Infinity}