Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: l0, l1, l2
Transitions:
t₁: l0(X₀, X₁) → l1(X₀, X₁)
t₀: l1(X₀, X₁) → l1(X₀, X₁) :|: 0 ≤ X₀
t₂: l1(X₀, X₁) → l2(X₀, C) :|: X₀+1 ≤ 0
Eliminate variables {C,X₁} that do not contribute to the problem
Found invariant 1+X₀ ≤ 0 for location l2
Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₈: l0(X₀) → l1(X₀)
t₉: l1(X₀) → l1(X₀) :|: 0 ≤ X₀
t₁₀: l1(X₀) → l2(X₀) :|: X₀+1 ≤ 0
Found invariant 1+X₀ ≤ 0 for location l2
Found invariant 0 ≤ X₀ for location n_l1___1
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)}
t₁₀, X₀: X₀ {O(n)}