Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars: H, I
Locations: l0, l1, l2, l3, l4
Transitions:
t₅: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(H, X₁, I, X₃, X₄, X₅, X₆)
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀-1, X₂, X₂-1, X₀, X₄, X₅, X₆) :|: 1 ≤ X₀
t₀: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀ ≤ 0
t₄: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(H, X₁, X₂, X₃, X₄, X₅, X₆) :|: 1 ≤ H ∧ 1 ≤ X₂
t₃: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀, X₁, X₂, X₃, X₄, X₅, H) :|: X₂ ≤ 0
t₂: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀-1, X₁, X₂-1, X₃, X₂, X₀, X₆) :|: 1 ≤ X₀ ∧ 1 ≤ X₂
Cut unreachable locations [l3] from the program graph
Eliminate variables {X₁,X₃,X₄,X₅,X₆} that do not contribute to the problem
Found invariant 0 ≤ X₀ for location l1
Found invariant X₁ ≤ 0 for location l4
Start: l0
Program_Vars: X₀, X₁
Temp_Vars: H, I
Locations: l0, l1, l2, l4
Transitions:
t₁₁: l0(X₀, X₁) → l2(H, I)
t₁₂: l1(X₀, X₁) → l1(X₀-1, X₁-1) :|: 1 ≤ X₀ ∧ 0 ≤ X₀
t₁₃: l1(X₀, X₁) → l2(X₀, X₁) :|: X₀ ≤ 0 ∧ 0 ≤ X₀
t₁₄: l2(X₀, X₁) → l1(H, X₁) :|: 1 ≤ H ∧ 1 ≤ X₁
t₁₅: l2(X₀, X₁) → l4(X₀, X₁) :|: X₁ ≤ 0
Chain transitions t₁₃: l1→l2 and t₁₅: l2→l4 to t₃₉: l1→l4
Chain transitions t₁₁: l0→l2 and t₁₅: l2→l4 to t₄₀: l0→l4
Chain transitions t₁₁: l0→l2 and t₁₄: l2→l1 to t₄₁: l0→l1
Chain transitions t₁₃: l1→l2 and t₁₄: l2→l1 to t₄₂: l1→l1
Found invariant 0 ≤ X₀ for location l1
Found invariant X₁ ≤ 0 for location l4
Found invariant 0 ≤ X₀ for location n_l1___2
Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l1___3
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l2___1
Found invariant X₁ ≤ 0 for location l4
Overall timebound:inf {Infinity}
t₁₁: 1 {O(1)}
t₁₂: inf {Infinity}
t₁₃: inf {Infinity}
t₁₄: inf {Infinity}
t₁₅: 1 {O(1)}
Overall costbound: inf {Infinity}
t₁₁: 1 {O(1)}
t₁₂: inf {Infinity}
t₁₃: inf {Infinity}
t₁₄: inf {Infinity}
t₁₅: 1 {O(1)}
t₁₃, X₀: 0 {O(1)}