Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₁: l1(X₀, X₁, X₂, X₃) → l1(X₀-1, 3⋅X₁+2⋅X₂, -5⋅X₁-3⋅X₂, (X₀)²+X₃) :|: 0 < X₀
t₂: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃)
t₃: l2(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃-1) :|: 0 < X₃
Eliminate variables {X₁,X₂} that do not contribute to the problem
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₉: l0(X₀, X₁) → l1(X₀, X₁)
t₁₀: l1(X₀, X₁) → l1(X₀-1, (X₀)²+X₁) :|: 0 < X₀
t₁₁: l1(X₀, X₁) → l2(X₀, X₁)
t₁₂: l2(X₀, X₁) → l2(X₀, X₁-1) :|: 0 < X₁
new bound:
X₀ {O(n)}
Overall timebound:inf {Infinity}
t₉: 1 {O(1)}
t₁₀: X₀ {O(n)}
t₁₁: 1 {O(1)}
t₁₂: inf {Infinity}
Overall costbound: inf {Infinity}
t₉: 1 {O(1)}
t₁₀: X₀ {O(n)}
t₁₁: 1 {O(1)}
t₁₂: inf {Infinity}
t₉, X₀: X₀ {O(n)}
t₉, X₁: X₁ {O(n)}
t₁₀, X₀: X₀ {O(n)}
t₁₁, X₀: 2⋅X₀ {O(n)}
t₁₂, X₀: 2⋅X₀ {O(n)}