Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: D
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8
Transitions:
t₀: l0(X₀, X₁, X₂) → l7(X₀, X₁, X₂)
t₉: l1(X₀, X₁, X₂) → l3(X₀, X₁, X₂-1)
t₁₀: l2(X₀, X₁, X₂) → l3(X₀, X₁-1, X₁-1)
t₄: l3(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₀ ≤ X₂
t₅: l3(X₀, X₁, X₂) → l5(X₀, X₁, X₂) :|: X₂+1 ≤ X₀
t₆: l4(X₀, X₁, X₂) → l1(X₀, X₁, X₂) :|: D+1 ≤ 0
t₇: l4(X₀, X₁, X₂) → l1(X₀, X₁, X₂) :|: 1 ≤ D
t₈: l4(X₀, X₁, X₂) → l2(X₀, X₁, X₂)
t₁₁: l5(X₀, X₁, X₂) → l8(X₀, X₁, X₂)
t₃: l6(X₀, X₁, X₂) → l3(X₀, 2⋅X₀, 2⋅X₀)
t₂: l7(X₀, X₁, X₂) → l5(X₀, X₁, X₂) :|: X₀+1 ≤ 0
t₁: l7(X₀, X₁, X₂) → l6(X₀, X₁, X₂) :|: 0 ≤ X₀
Found invariant 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀ for location l2
Found invariant 0 ≤ X₀ for location l6
Found invariant 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀ for location l1
Found invariant 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀ for location l4
Found invariant 0 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: D
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8
Transitions:
t₀: l0(X₀, X₁, X₂) → l7(X₀, X₁, X₂)
t₉: l1(X₀, X₁, X₂) → l3(X₀, X₁, X₂-1) :|: 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀
t₁₀: l2(X₀, X₁, X₂) → l3(X₀, X₁-1, X₁-1) :|: 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀
t₄: l3(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₀ ≤ X₂ ∧ 0 ≤ X₀
t₅: l3(X₀, X₁, X₂) → l5(X₀, X₁, X₂) :|: X₂+1 ≤ X₀ ∧ 0 ≤ X₀
t₆: l4(X₀, X₁, X₂) → l1(X₀, X₁, X₂) :|: D+1 ≤ 0 ∧ 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀
t₇: l4(X₀, X₁, X₂) → l1(X₀, X₁, X₂) :|: 1 ≤ D ∧ 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀
t₈: l4(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀
t₁₁: l5(X₀, X₁, X₂) → l8(X₀, X₁, X₂)
t₃: l6(X₀, X₁, X₂) → l3(X₀, 2⋅X₀, 2⋅X₀) :|: 0 ≤ X₀
t₂: l7(X₀, X₁, X₂) → l5(X₀, X₁, X₂) :|: X₀+1 ≤ 0
t₁: l7(X₀, X₁, X₂) → l6(X₀, X₁, X₂) :|: 0 ≤ X₀
Cut unsatisfiable transition t₅: l3→l5
Found invariant 1+X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l2___6
Found invariant 0 ≤ X₀ for location l6
Found invariant X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l1___11
Found invariant X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l4___4
Found invariant 1+X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l1___7
Found invariant X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l3___5
Found invariant X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l4___12
Found invariant X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l1___3
Found invariant X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l2___2
Found invariant 1+X₂ ≤ X₁ ∧ 0 ≤ 1+X₂ ∧ 0 ≤ 1+X₁+X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l3___9
Found invariant X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l2___10
Found invariant X₂ ≤ X₁ ∧ 0 ≤ 1+X₂ ∧ 0 ≤ 2+X₁+X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ 1+X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ 1+X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ 0 ≤ X₀ for location n_l3___1
Found invariant 1+X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l4___8
Found invariant 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₀ for location l3
Cut unsatisfiable transition t₃₃₃: n_l3___5→l5
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₉: inf {Infinity}
t₁₀: inf {Infinity}
t₄: inf {Infinity}
t₅: 1 {O(1)}
t₆: inf {Infinity}
t₇: inf {Infinity}
t₈: inf {Infinity}
t₁₁: 1 {O(1)}
t₃: 1 {O(1)}
t₁: 1 {O(1)}
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₆: inf {Infinity}
t₇: inf {Infinity}
t₈: inf {Infinity}
t₁₁: 1 {O(1)}
t₃: 1 {O(1)}
t₁: 1 {O(1)}
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₀: 2⋅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₁: 2⋅X₀ {O(n)}
t₃, X₂: 2⋅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)}