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₃
new bound:
X₀+X₁ {O(n)}
new bound:
X₂+X₃ {O(n)}
new bound:
X₂+X₃ {O(n)}
new bound:
X₀+X₁ {O(n)}
Overall timebound:2⋅X₀+2⋅X₁+2⋅X₂+2⋅X₃+1 {O(n)}
t₁₉: 1 {O(1)}
t₂₀: X₀+X₁ {O(n)}
t₂₁: X₂+X₃ {O(n)}
t₂₂: X₂+X₃ {O(n)}
t₂₃: X₀+X₁ {O(n)}
Overall costbound: 2⋅X₀+2⋅X₁+2⋅X₂+2⋅X₃+1 {O(n)}
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₂: X₂ {O(n)}
t₁₉, X₃: X₃ {O(n)}
t₂₀, X₀: X₀ {O(n)}
t₂₀, X₁: 2⋅X₁+X₀ {O(n)}
t₂₀, X₂: X₂ {O(n)}
t₂₀, X₃: 2⋅X₃+X₂ {O(n)}
t₂₁, X₀: X₀ {O(n)}
t₂₁, X₁: 2⋅X₁+X₀ {O(n)}
t₂₁, X₂: X₂ {O(n)}
t₂₁, X₃: 2⋅X₃+X₂ {O(n)}
t₂₂, X₀: 2⋅X₀ {O(n)}
t₂₂, X₁: 3⋅X₁+X₀ {O(n)}
t₂₂, X₂: 2⋅X₂ {O(n)}
t₂₂, X₃: 2⋅X₂+4⋅X₃ {O(n)}
t₂₃, X₀: 2⋅X₀ {O(n)}
t₂₃, X₁: 2⋅X₀+4⋅X₁ {O(n)}
t₂₃, X₂: 2⋅X₂ {O(n)}
t₂₃, X₃: 3⋅X₃+X₂ {O(n)}