Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: l0, l1, l2, l3
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(0, X₁, X₂, X₃)
t₆: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₀
t₁: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₀+1, X₃) :|: X₀+1 ≤ X₁
t₅: l3(X₀, X₁, X₂, X₃) → l1(X₀+1, X₁, X₂, X₃) :|: X₁ ≤ X₂
t₂: l3(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂+1, 0) :|: X₂+1 ≤ X₁
t₃: l3(X₀, X₁, X₂, X₃) → l3(X₀, X₁-1, X₂, E) :|: X₂+1 ≤ X₁ ∧ E+1 ≤ 0
t₄: l3(X₀, X₁, X₂, X₃) → l3(X₀, X₁-1, X₂, E) :|: X₂+1 ≤ X₁ ∧ 1 ≤ E
Eliminate variables {X₃} that do not contribute to the problem
Found invariant X₁ ≤ X₀ ∧ 0 ≤ X₀ for location l2
Found invariant 0 ≤ X₀ for location l1
Found invariant X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: E
Locations: l0, l1, l2, l3
Transitions:
t₁₅: l0(X₀, X₁, X₂) → l1(0, X₁, X₂)
t₁₇: l1(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: X₁ ≤ X₀ ∧ 0 ≤ X₀
t₁₆: l1(X₀, X₁, X₂) → l3(X₀, X₁, X₀+1) :|: X₀+1 ≤ X₁ ∧ 0 ≤ X₀
t₂₁: l3(X₀, X₁, X₂) → l1(X₀+1, X₁, X₂) :|: X₁ ≤ X₂ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₁₈: l3(X₀, X₁, X₂) → l3(X₀, X₁, X₂+1) :|: X₂+1 ≤ X₁ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₁₉: l3(X₀, X₁, X₂) → l3(X₀, X₁-1, X₂) :|: X₂+1 ≤ X₁ ∧ E+1 ≤ 0 ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
t₂₀: l3(X₀, X₁, X₂) → l3(X₀, X₁-1, X₂) :|: X₂+1 ≤ X₁ ∧ 1 ≤ E ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀
Cut unsatisfiable transition t₂₄₀: n_l1___1→l2
Cut unsatisfiable transition t₂₁₂: n_l1___3→n_l3___4
Found invariant X₁ ≤ X₀ ∧ 0 ≤ X₀ for location l2
Found invariant X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l3___4
Found invariant X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l1___3
Found invariant X₂ ≤ X₁ ∧ 2 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 2+X₀ ≤ X₂ ∧ 2 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l3___2
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l1
Found invariant X₂ ≤ X₁ ∧ 2 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 3 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l1___1
Overall timebound:inf {Infinity}
t₁₅: 1 {O(1)}
t₁₆: inf {Infinity}
t₁₇: 1 {O(1)}
t₁₈: inf {Infinity}
t₁₉: inf {Infinity}
t₂₀: inf {Infinity}
t₂₁: inf {Infinity}
Overall costbound: inf {Infinity}
t₁₅: 1 {O(1)}
t₁₆: inf {Infinity}
t₁₇: 1 {O(1)}
t₁₈: inf {Infinity}
t₁₉: inf {Infinity}
t₂₀: inf {Infinity}
t₂₁: inf {Infinity}
t₁₅, X₀: 0 {O(1)}
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₁: X₁ {O(n)}