Start: start
Program_Vars: X₀, X₁
Temp_Vars:
Locations: eval, start
Transitions:
t₀: eval(X₀, X₁) → eval(X₀-X₁, X₁) :|: 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁
t₁: eval(X₀, X₁) → eval(X₀-X₁, X₁) :|: 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₁
t₂: eval(X₀, X₁) → eval(X₀, X₁-X₀) :|: 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ X₀ ≤ X₁
t₃: eval(X₀, X₁) → eval(X₀, X₁-X₀) :|: 1 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₁ ∧ X₀ ≤ X₁
t₄: start(X₀, X₁) → eval(X₀, X₁)
Cut unsatisfiable transition [t₁: eval→eval; t₂: eval→eval]
Start: start
Program_Vars: X₀, X₁
Temp_Vars:
Locations: eval, start
Transitions:
t₀: eval(X₀, X₁) → eval(X₀-X₁, X₁) :|: 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁
t₃: eval(X₀, X₁) → eval(X₀, X₁-X₀) :|: 1 ≤ X₀ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₁ ∧ X₀ ≤ X₁
t₄: start(X₀, X₁) → eval(X₀, X₁)
new bound:
X₀ {O(n)}
MPRF:
• eval: [X₀]
new bound:
X₁ {O(n)}
MPRF:
• eval: [X₁]
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)}