Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, 2, X₃) :|: 0 ≤ X₀ ∧ X₀ ≤ 3 ∧ X₁ ≤ 3 ∧ 0 ≤ X₁
t₁: l1(X₀, X₁, X₂, X₃) → l1(X₀, X₁+1, X₂, X₁+1) :|: 2⋅X₁+1 ≤ X₂+X₀ ∧ 2 ≤ 0
t₂: l1(X₀, X₁, X₂, X₃) → l1(X₀, X₁+1, X₂, X₁+1) :|: 2⋅X₁+1 ≤ X₂+X₀
t₃: l1(X₀, X₁, X₂, X₃) → l1(X₀, X₁-1, X₂, X₁-1) :|: 2+X₂+X₀ ≤ 2⋅X₁
t₄: l1(X₀, X₁, X₂, X₃) → l1(X₀, X₁-1, X₂, X₁-1) :|: 2+X₂+X₀ ≤ 2⋅X₁ ∧ 2 ≤ 0
t₅: l1(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₁) :|: 1 ≤ 0 ∧ X₂+X₀ ≤ 2⋅X₁ ∧ 2⋅X₁ ≤ X₂+X₀+1
t₆: l1(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₁) :|: 1 ≤ 0 ∧ X₂+X₀ ≤ 2⋅X₁ ∧ 2⋅X₁ ≤ X₂+X₀+1
Cut unsatisfiable transition t₁: l1→l1
Cut unsatisfiable transition t₄: l1→l1
Cut unsatisfiable transition t₅: l1→l1
Cut unsatisfiable transition t₆: l1→l1
Eliminate variables {X₃} that do not contribute to the problem
Found invariant X₂ ≤ 2 ∧ X₂ ≤ 2+X₁ ∧ X₁+X₂ ≤ 5 ∧ X₂ ≤ 2+X₀ ∧ X₀+X₂ ≤ 5 ∧ 2 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ X₁ ≤ 3 ∧ X₁ ≤ 3+X₀ ∧ X₀+X₁ ≤ 6 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ 3+X₁ ∧ X₀ ≤ 3 ∧ 0 ≤ X₀ for location l1
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₅₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, 2) :|: 0 ≤ X₀ ∧ X₀ ≤ 3 ∧ X₁ ≤ 3 ∧ 0 ≤ X₁
t₅₁: l1(X₀, X₁, X₂) → l1(X₀, X₁+1, X₂) :|: 2⋅X₁+1 ≤ X₂+X₀ ∧ X₂ ≤ 2 ∧ X₂ ≤ 2+X₁ ∧ X₁+X₂ ≤ 5 ∧ X₂ ≤ 2+X₀ ∧ X₀+X₂ ≤ 5 ∧ 2 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ X₁ ≤ 3 ∧ X₁ ≤ 3+X₀ ∧ X₀+X₁ ≤ 6 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ 3+X₁ ∧ X₀ ≤ 3 ∧ 0 ≤ X₀
t₅₂: l1(X₀, X₁, X₂) → l1(X₀, X₁-1, X₂) :|: 2+X₂+X₀ ≤ 2⋅X₁ ∧ X₂ ≤ 2 ∧ X₂ ≤ 2+X₁ ∧ X₁+X₂ ≤ 5 ∧ X₂ ≤ 2+X₀ ∧ X₀+X₂ ≤ 5 ∧ 2 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ X₁ ≤ 3 ∧ X₁ ≤ 3+X₀ ∧ X₀+X₁ ≤ 6 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ 3+X₁ ∧ X₀ ≤ 3 ∧ 0 ≤ X₀
Found invariant X₂ ≤ 2 ∧ X₂ ≤ 2+X₁ ∧ X₁+X₂ ≤ 5 ∧ X₂ ≤ 2+X₀ ∧ X₀+X₂ ≤ 5 ∧ 2 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ X₁ ≤ 3 ∧ X₁ ≤ 3+X₀ ∧ X₀+X₁ ≤ 6 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ 3+X₁ ∧ X₀ ≤ 3 ∧ 0 ≤ X₀ for location l1
Termination: true
Formula:
relevant size-bounds w.r.t. t₅₀:
X₀: 3 {O(1)}
X₁: 3 {O(1)}
X₂: 2 {O(1)}
Runtime-bound of t₅₀: 1 {O(1)}
Results in: 28 {O(1)}
Found invariant X₂ ≤ 2 ∧ X₂ ≤ 2+X₁ ∧ X₁+X₂ ≤ 5 ∧ X₂ ≤ 2+X₀ ∧ X₀+X₂ ≤ 5 ∧ 2 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ 1+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ X₁ ≤ 3 ∧ X₁ ≤ 3+X₀ ∧ X₀+X₁ ≤ 6 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ 3+X₁ ∧ X₀ ≤ 3 ∧ 0 ≤ X₀ for location l1
Termination: true
Formula:
relevant size-bounds w.r.t. t₅₀:
X₀: 3 {O(1)}
X₁: 3 {O(1)}
X₂: 2 {O(1)}
Runtime-bound of t₅₀: 1 {O(1)}
Results in: 30 {O(1)}
Overall timebound:59 {O(1)}
t₅₀: 1 {O(1)}
t₅₁: 28 {O(1)}
t₅₂: 30 {O(1)}
Overall costbound: 59 {O(1)}
t₅₀: 1 {O(1)}
t₅₁: 28 {O(1)}
t₅₂: 30 {O(1)}
t₅₀, X₀: 3 {O(1)}
t₅₀, X₁: 3 {O(1)}
t₅₀, X₂: 2 {O(1)}
t₅₁, X₀: 3 {O(1)}
t₅₁, X₁: 3 {O(1)}
t₅₁, X₂: 2 {O(1)}
t₅₂, X₀: 2 {O(1)}
t₅₂, X₁: 2 {O(1)}
t₅₂, X₂: 2 {O(1)}