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