Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars:
Locations: l0, l1
Transitions:
t₄: l0(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₂, X₃, X₄)
t₀: l1(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁+1, X₂, X₃, X₄+1) :|: X₁+1 ≤ X₀ ∧ X₃+1 ≤ X₂
t₁: l1(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₂, X₃+1, X₄+1) :|: X₁+1 ≤ X₀ ∧ X₃+1 ≤ X₂
t₂: l1(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₂, X₃+1, X₄+1) :|: X₀ ≤ X₁ ∧ X₃+1 ≤ X₂
t₃: l1(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁+1, X₂, X₃, X₄+1) :|: X₁+1 ≤ X₀ ∧ X₂ ≤ X₃
Eliminate variables {X₄} that do not contribute to the problem
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1
Transitions:
t₂₀: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₂₁: l1(X₀, X₁, X₂, X₃) → l1(X₀, X₁+1, X₂, X₃) :|: X₁+1 ≤ X₀ ∧ X₃+1 ≤ X₂
t₂₂: l1(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃+1) :|: X₁+1 ≤ X₀ ∧ X₃+1 ≤ X₂
t₂₃: l1(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃+1) :|: X₀ ≤ X₁ ∧ X₃+1 ≤ X₂
t₂₄: l1(X₀, X₁, X₂, X₃) → l1(X₀, X₁+1, X₂, X₃) :|: X₁+1 ≤ X₀ ∧ X₂ ≤ X₃
Found invariant 1+X₃ ≤ X₂ ∧ X₁ ≤ X₀ for location n_l1___4
Found invariant X₃ ≤ X₂ ∧ X₀ ≤ X₁ for location n_l1___2
Found invariant X₃ ≤ X₂ ∧ 1+X₁ ≤ X₀ for location n_l1___3
Found invariant X₂ ≤ X₃ ∧ X₁ ≤ X₀ for location n_l1___1
Found invariant 1+X₃ ≤ X₂ ∧ X₁ ≤ X₀ for location n_l1___4
Found invariant X₃ ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location n_l1___2
Found invariant X₃ ≤ X₂ ∧ 1+X₁ ≤ X₀ for location n_l1___3
Found invariant X₂ ≤ X₃ ∧ X₁ ≤ X₀ for location n_l1___1
Found invariant 1+X₃ ≤ X₂ ∧ X₁ ≤ X₀ for location n_l1___4
Found invariant X₃ ≤ X₂ ∧ X₀ ≤ X₁ for location n_l1___2
Found invariant X₃ ≤ X₂ ∧ 1+X₁ ≤ X₀ for location n_l1___3
Found invariant X₂ ≤ X₃ ∧ X₁ ≤ X₀ for location n_l1___1
Found invariant 1+X₃ ≤ X₂ ∧ X₁ ≤ X₀ for location n_l1___4
Found invariant X₃ ≤ X₂ ∧ X₀ ≤ X₁ for location n_l1___2
Found invariant X₃ ≤ X₂ ∧ 1+X₁ ≤ X₀ for location n_l1___3
Found invariant X₃ ≤ X₂ ∧ X₂ ≤ X₃ ∧ X₁ ≤ X₀ for location n_l1___1
Found invariant 1+X₃ ≤ X₂ ∧ X₁ ≤ X₀ for location n_l1___4
Found invariant X₃ ≤ X₂ ∧ X₀ ≤ X₁ for location n_l1___2
Found invariant X₃ ≤ X₂ ∧ 1+X₁ ≤ X₀ for location n_l1___3
Found invariant X₂ ≤ X₃ ∧ X₁ ≤ X₀ for location n_l1___1
Overall timebound: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₂₂: inf {Infinity}
t₂₃: inf {Infinity}
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₀: 2⋅X₀ {O(n)}
t₂₁, X₂: 2⋅X₂ {O(n)}
t₂₂, X₀: 2⋅X₀ {O(n)}
t₂₂, X₂: 2⋅X₂ {O(n)}
t₂₃, X₀: 3⋅X₀ {O(n)}
t₂₃, X₂: 3⋅X₂ {O(n)}
t₂₄, X₀: 3⋅X₀ {O(n)}
t₂₄, X₂: 3⋅X₂ {O(n)}