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₀-1, X₁) :|: X₀ ≤ 1
t₂: l1(X₀, X₁) → l2(X₀-1, C) :|: 2 ≤ X₀
Eliminate variables {C,X₁} that do not contribute to the problem
Found invariant 1 ≤ X₀ 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₀-1) :|: X₀ ≤ 1
t₉: l1(X₀) → l2(X₀-1) :|: 2 ≤ X₀
Found invariant 1 ≤ X₀ for location l2
Found invariant X₀ ≤ 0 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)}