Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: l0, l1, l2, l3, l4
Transitions:
t₅: l0(X₀, X₁) → l1(C, 1)
t₀: l1(X₀, X₁) → l1(C, X₁) :|: X₀+1 ≤ 0
t₁: l1(X₀, X₁) → l1(C, X₁) :|: 1 ≤ X₀
t₄: l1(X₀, X₁) → l2(0, 1) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
t₂: l2(X₀, X₁) → l2(X₀, X₁)
t₃: l4(X₀, X₁) → l3(X₀, X₁)
Cut unreachable locations [l3; l4] from the program graph
Eliminate variables {X₁} that do not contribute to the problem
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l2
Start: l0
Program_Vars: X₀
Temp_Vars: C
Locations: l0, l1, l2
Transitions:
t₁₂: l0(X₀) → l1(C)
t₁₃: l1(X₀) → l1(C) :|: X₀+1 ≤ 0
t₁₄: l1(X₀) → l1(C) :|: 1 ≤ X₀
t₁₅: l1(X₀) → l2(0) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
t₁₆: l2(X₀) → l2(X₀) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l2
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l2
Overall timebound:inf {Infinity}
t₁₂: 1 {O(1)}
t₁₃: inf {Infinity}
t₁₄: inf {Infinity}
t₁₅: 1 {O(1)}
t₁₆: inf {Infinity}
Overall costbound: inf {Infinity}
t₁₂: 1 {O(1)}
t₁₃: inf {Infinity}
t₁₄: inf {Infinity}
t₁₅: 1 {O(1)}
t₁₆: inf {Infinity}
t₁₅, X₀: 0 {O(1)}
t₁₆, X₀: 0 {O(1)}