Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5, l6, l7
Transitions:
t₀: l0(X₀, X₁, X₂) → l2(X₀, X₁, X₂)
t₂: l1(X₀, X₁, X₂) → l7(X₀, X₁, X₂)
t₁: l2(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₄: l3(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₀ < 103
t₅: l3(X₀, X₁, X₂) → l6(X₀, X₁, X₂) :|: 103 ≤ X₀
t₆: l4(X₀, X₁, X₂) → l3(X₀, X₁, X₂)
t₇: l6(X₀, X₁, X₂) → l5(X₀, X₁, X₂)
t₃: l7(X₀, X₁, X₂) → l3(0, X₁, X₂)
Eliminate variables {X₁,X₂} that do not contribute to the problem
Found invariant 1 ≤ 0 for location l6
Found invariant 1 ≤ 0 for location l5
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l4
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l3
Cut unsatisfiable transition t₂₁: l3→l6
Cut unsatisfiable transition t₂₃: l6→l5
Cut unreachable locations [l5; l6] from the program graph
Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l7
Transitions:
t₁₇: l0(X₀) → l2(X₀)
t₁₈: l1(X₀) → l7(X₀)
t₁₉: l2(X₀) → l1(X₀)
t₂₀: l3(X₀) → l4(X₀) :|: X₀ < 103 ∧ X₀ ≤ 0 ∧ 0 ≤ X₀
t₂₂: l4(X₀) → l3(X₀) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
t₂₄: l7(X₀) → l3(0)
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l4___1
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l3
Overall timebound:inf {Infinity}
t₁₇: 1 {O(1)}
t₁₈: 1 {O(1)}
t₁₉: 1 {O(1)}
t₂₀: inf {Infinity}
t₂₂: inf {Infinity}
t₂₄: 1 {O(1)}
Overall costbound: inf {Infinity}
t₁₇: 1 {O(1)}
t₁₈: 1 {O(1)}
t₁₉: 1 {O(1)}
t₂₀: inf {Infinity}
t₂₂: inf {Infinity}
t₂₄: 1 {O(1)}
t₁₇, X₀: X₀ {O(n)}
t₁₈, X₀: X₀ {O(n)}
t₁₉, X₀: X₀ {O(n)}
t₂₀, X₀: 0 {O(1)}
t₂₂, X₀: 0 {O(1)}
t₂₄, X₀: 0 {O(1)}