Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₁: l1(X₀, X₁, X₂) → l1(X₀+(X₁)²*X₂, X₁-2⋅(X₂)², X₂) :|: 0 < X₀+(X₁)²
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₁: l1(X₀, X₁, X₂) → l1(X₀+(X₁)²*X₂, X₁-2⋅(X₂)², X₂) :|: 0 < X₀+(X₁)²
Eliminate variables {NoDet0,NoDet1,X₀,X₁,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)}
t₀, X₂: X₂ {O(n)}
t₁, X₂: X₂ {O(n)}