Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂) → l3(X₀, X₁, X₂)
t₄: l1(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₀ < 0
t₃: l1(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: 0 ≤ X₀
t₆: l2(X₀, X₁, X₂) → l5(X₀, X₁, X₂)
t₁: l3(X₀, X₁, X₂) → l1(X₁, X₁, X₂) :|: X₂ ≤ X₁
t₂: l3(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₁ < X₂
t₅: l4(X₀, X₁, X₂) → l1(X₀-X₂, X₁, X₂)
Found invariant X₂ ≤ X₁ for location l1
Found invariant X₂ ≤ X₁ ∧ 0 ≤ X₀ for location l4
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂) → l3(X₀, X₁, X₂)
t₄: l1(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₀ < 0 ∧ X₂ ≤ X₁
t₃: l1(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: 0 ≤ X₀ ∧ X₂ ≤ X₁
t₆: l2(X₀, X₁, X₂) → l5(X₀, X₁, X₂)
t₁: l3(X₀, X₁, X₂) → l1(X₁, X₁, X₂) :|: X₂ ≤ X₁
t₂: l3(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₁ < X₂
t₅: l4(X₀, X₁, X₂) → l1(X₀-X₂, X₁, X₂) :|: X₂ ≤ X₁ ∧ 0 ≤ X₀
Chain transitions t₅: l4→l1 and t₃: l1→l4 to t₄₂: l4→l4
Chain transitions t₁: l3→l1 and t₃: l1→l4 to t₄₃: l3→l4
Chain transitions t₁: l3→l1 and t₄: l1→l2 to t₄₄: l3→l2
Chain transitions t₅: l4→l1 and t₄: l1→l2 to t₄₅: l4→l2
Found invariant X₂ ≤ X₁ for location l1
Found invariant X₂ ≤ X₁ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ for location l4
Cut unsatisfiable transition t₁₀₀: n_l1___3→l2
Found invariant X₂ ≤ X₁ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location n_l4___2
Found invariant X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l4___4
Found invariant X₂ ≤ X₁ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ for location n_l1___3
Found invariant X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l1
Found invariant X₂ ≤ X₁ ∧ 0 ≤ X₀+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ for location n_l1___1
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₃: inf {Infinity}
t₄: 1 {O(1)}
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₄: 1 {O(1)}
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₁: X₁ {O(n)}
t₂, X₂: X₂ {O(n)}
t₃, X₁: X₁ {O(n)}
t₃, X₂: X₂ {O(n)}
t₄, X₁: 2⋅X₁ {O(n)}
t₄, X₂: 2⋅X₂ {O(n)}
t₅, X₁: X₁ {O(n)}
t₅, X₂: X₂ {O(n)}
t₆, X₁: 3⋅X₁ {O(n)}
t₆, X₂: 3⋅X₂ {O(n)}