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