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