Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₆: l0(X₀, X₁) → l1(X₀, X₁)
t₀: l1(X₀, X₁) → l1(X₀-1, X₁) :|: 1 ≤ X₀
t₁: l1(X₀, X₁) → l1(X₀-1, X₁) :|: 1 ≤ X₁ ∧ 1 ≤ X₀
t₂: l1(X₀, X₁) → l1(X₀, X₁-1) :|: 1 ≤ X₀ ∧ X₀ ≤ 0 ∧ 1 ≤ X₁
t₃: l1(X₀, X₁) → l1(X₀, X₁-1) :|: 1 ≤ X₁ ∧ X₀ ≤ 0
t₄: l1(X₀, X₁) → l1(X₀, X₁) :|: 1 ≤ X₀ ∧ X₀ ≤ 0 ∧ X₁ ≤ 0
t₅: l1(X₀, X₁) → l1(X₀, X₁) :|: 1 ≤ X₁ ∧ X₀ ≤ 0 ∧ X₁ ≤ 0
Cut unsatisfiable transition t₂: l1→l1
Cut unsatisfiable transition t₄: l1→l1
Cut unsatisfiable transition t₅: l1→l1
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₆: l0(X₀, X₁) → l1(X₀, X₁)
t₀: l1(X₀, X₁) → l1(X₀-1, X₁) :|: 1 ≤ X₀
t₁: l1(X₀, X₁) → l1(X₀-1, X₁) :|: 1 ≤ X₁ ∧ 1 ≤ X₀
t₃: l1(X₀, X₁) → l1(X₀, X₁-1) :|: 1 ≤ X₁ ∧ X₀ ≤ 0
new bound:
X₀ {O(n)}
new bound:
X₀ {O(n)}
new bound:
X₁ {O(n)}
Overall timebound:2⋅X₀+X₁+1 {O(n)}
t₀: X₀ {O(n)}
t₁: X₀ {O(n)}
t₃: X₁ {O(n)}
t₆: 1 {O(1)}
Overall costbound: 2⋅X₀+X₁+1 {O(n)}
t₀: X₀ {O(n)}
t₁: X₀ {O(n)}
t₃: X₁ {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₀: 3⋅X₀ {O(n)}
t₃, X₁: 3⋅X₁ {O(n)}
t₆, X₀: X₀ {O(n)}
t₆, X₁: X₁ {O(n)}