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₀-X₁, X₁) :|: X₁+1 ≤ X₀ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁
t₁: l1(X₀, X₁) → l1(X₀-X₁, X₁) :|: X₀+1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ X₁+1 ≤ X₀
t₂: l1(X₀, X₁) → l1(X₀, X₁-X₀) :|: X₁+1 ≤ X₀ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ X₀ ≤ X₁
t₃: l1(X₀, X₁) → l1(X₀, X₁-X₀) :|: X₀+1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ X₀ ≤ X₁
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₀-X₁, X₁) :|: X₁+1 ≤ X₀ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁
t₃: l1(X₀, X₁) → l1(X₀, X₁-X₀) :|: X₀+1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ X₀ ≤ X₁
new bound:
X₀ {O(n)}
new bound:
X₁ {O(n)}
Overall timebound:X₀+X₁+1 {O(n)}
t₀: X₀ {O(n)}
t₃: X₁ {O(n)}
t₄: 1 {O(1)}
Overall costbound: X₀+X₁+1 {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₀: X₀ {O(n)}
t₄, X₁: X₁ {O(n)}