Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: nondef.0
Locations: l0, l1, l2, l3, l4, l5, l6, l7
Transitions:
t₀: l0(X₀, X₁, X₂) → l5(X₀, X₁, X₂)
t₇: l1(X₀, X₁, X₂) → l4(X₀-1, X₁, X₂) :|: X₁ < 0
t₈: l1(X₀, X₁, X₂) → l4(X₀-1, X₁, X₂) :|: 0 < X₁
t₉: l1(X₀, X₁, X₂) → l4(X₀+1, X₁, X₂) :|: X₁ ≤ 0 ∧ 0 ≤ X₁
t₄: l2(X₀, X₁, X₂) → l3(X₀, X₁, X₂)
t₆: l3(X₀, X₁, X₂) → l1(X₀, nondef.0, X₂)
t₂: l4(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: 0 ≤ X₀
t₃: l4(X₀, X₁, X₂) → l6(X₀, X₁, X₂) :|: X₀ < 0
t₁: l5(X₀, X₁, X₂) → l4(X₂, X₁, X₂)
t₁₀: l6(X₀, X₁, X₂) → l7(X₀, X₁, X₂)
Found invariant 0 ≤ X₀ for location l2
Found invariant 1+X₀ ≤ 0 for location l6
Found invariant 1+X₀ ≤ 0 for location l7
Found invariant 0 ≤ X₀ for location l1
Found invariant 0 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: nondef.0
Locations: l0, l1, l2, l3, l4, l5, l6, l7
Transitions:
t₀: l0(X₀, X₁, X₂) → l5(X₀, X₁, X₂)
t₇: l1(X₀, X₁, X₂) → l4(X₀-1, X₁, X₂) :|: X₁ < 0 ∧ 0 ≤ X₀
t₈: l1(X₀, X₁, X₂) → l4(X₀-1, X₁, X₂) :|: 0 < X₁ ∧ 0 ≤ X₀
t₉: l1(X₀, X₁, X₂) → l4(X₀+1, X₁, X₂) :|: X₁ ≤ 0 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀
t₄: l2(X₀, X₁, X₂) → l3(X₀, X₁, X₂) :|: 0 ≤ X₀
t₆: l3(X₀, X₁, X₂) → l1(X₀, nondef.0, X₂) :|: 0 ≤ X₀
t₂: l4(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: 0 ≤ X₀
t₃: l4(X₀, X₁, X₂) → l6(X₀, X₁, X₂) :|: X₀ < 0
t₁: l5(X₀, X₁, X₂) → l4(X₂, X₁, X₂)
t₁₀: l6(X₀, X₁, X₂) → l7(X₀, X₁, X₂) :|: 1+X₀ ≤ 0
Chain transitions t₆: l3→l1 and t₉: l1→l4 to t₁₂₂: l3→l4
Chain transitions t₆: l3→l1 and t₈: l1→l4 to t₁₂₃: l3→l4
Chain transitions t₆: l3→l1 and t₇: l1→l4 to t₁₂₄: l3→l4
Chain transitions t₂: l4→l2 and t₄: l2→l3 to t₁₂₅: l4→l3
Chain transitions t₁₂₅: l4→l3 and t₁₂₄: l3→l4 to t₁₂₆: l4→l4
Chain transitions t₁₂₅: l4→l3 and t₁₂₃: l3→l4 to t₁₂₇: l4→l4
Chain transitions t₁₂₅: l4→l3 and t₁₂₂: l3→l4 to t₁₂₈: l4→l4
Chain transitions t₁₂₅: l4→l3 and t₆: l3→l1 to t₁₂₉: l4→l1
Eliminate variables {Temp_Int₃₅₃,X₁} that do not contribute to the problem
Found invariant 0 ≤ X₀ for location l2
Found invariant 1+X₀ ≤ 0 for location l6
Found invariant 1+X₀ ≤ 0 for location l7
Found invariant 0 ≤ X₀ for location l1
Found invariant 0 ≤ X₀ for location l3
Cut unsatisfiable transition t₂₅₇: n_l4___1→l6
Cut unsatisfiable transition t₂₅₈: n_l4___8→l6
Found invariant 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₀ for location n_l2___7
Found invariant X₀ ≤ X₂ ∧ 1+X₀ ≤ 0 for location l6
Found invariant 0 ≤ X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ 0 ≤ 1+X₀ for location n_l4___9
Found invariant 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l3___3
Found invariant 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₀ for location n_l3___6
Found invariant X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀ for location n_l1___10
Found invariant 0 ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀ for location n_l1___2
Found invariant X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀ for location n_l2___12
Found invariant X₀ ≤ X₂ ∧ 1+X₀ ≤ 0 for location l7
Found invariant X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀ for location n_l3___11
Found invariant 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₀ for location n_l4___1
Found invariant 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₀ for location n_l1___5
Found invariant X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location l4
Found invariant 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l4___8
Found invariant 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l2___4
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: inf {Infinity}
t₃: 1 {O(1)}
t₄: inf {Infinity}
t₆: inf {Infinity}
t₇: inf {Infinity}
t₈: inf {Infinity}
t₉: inf {Infinity}
t₁₀: 1 {O(1)}
Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: inf {Infinity}
t₃: 1 {O(1)}
t₄: inf {Infinity}
t₆: inf {Infinity}
t₇: inf {Infinity}
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₀: X₂ {O(n)}
t₁, X₁: X₁ {O(n)}
t₁, X₂: X₂ {O(n)}
t₂, X₂: X₂ {O(n)}
t₃, X₂: 3⋅X₂ {O(n)}
t₄, X₂: X₂ {O(n)}
t₆, X₂: X₂ {O(n)}
t₇, X₂: X₂ {O(n)}
t₈, X₂: X₂ {O(n)}
t₉, X₁: 0 {O(1)}
t₉, X₂: X₂ {O(n)}
t₁₀, X₂: 3⋅X₂ {O(n)}