Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2, l3
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₀) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀
t₁: l1(X₀, X₁) → l1(X₀+1, X₁+1)
t₃: l1(X₀, X₁) → l2(X₀, X₁) :|: X₁+1 ≤ X₀
t₂: l1(X₀, X₁) → l3(X₀, X₁)
Found invariant 1 ≤ 0 for location l2
Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l1
Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l3
Cut unsatisfiable transition t₃: l1→l2
Cut unreachable locations [l2] from the program graph
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l3
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₀) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀
t₁: l1(X₀, X₁) → l1(X₀+1, X₁+1) :|: X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₂: l1(X₀, X₁) → l3(X₀, X₁) :|: X₁ ≤ X₀ ∧ X₀ ≤ X₁
Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l1
Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l3
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
t₂: 1 {O(1)}
Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
t₂: 1 {O(1)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₀ {O(n)}