Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1
Transitions:
t₁: l0(X₀) → l1(X₀)
t₀: l1(X₀) → l1(X₀) :|: (X₀)²+1 ≤ 0
Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1
Transitions:
t₁: l0(X₀) → l1(X₀)
t₀: l1(X₀) → l1(X₀) :|: (X₀)²+1 ≤ 0
Eliminate variables {X₀} that do not contribute to the problem
Overall timebound:inf {Infinity}
t₁: 1 {O(1)}
t₀: inf {Infinity}
Overall costbound: inf {Infinity}
t₁: 1 {O(1)}
t₀: inf {Infinity}
t₁, X₀: X₀ {O(n)}
t₀, X₀: X₀ {O(n)}