Start: start
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: eval, start
Transitions:
t₀: eval(X₀, X₁, X₂) → eval(X₀, X₁+X₂, X₂) :|: 1 ≤ X₂ ∧ X₁ ≤ X₀
t₁: start(X₀, X₁, X₂) → eval(X₀, X₁, X₂)
Start: start
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: eval, start
Transitions:
t₀: eval(X₀, X₁, X₂) → eval(X₀, X₁+X₂, X₂) :|: 1 ≤ X₂ ∧ X₁ ≤ X₀
t₁: start(X₀, X₁, X₂) → eval(X₀, X₁, X₂)
new bound:
X₀+X₁+1 {O(n)}
MPRF:
• eval: [1+X₀-X₁]
Overall timebound:X₀+X₁+2 {O(n)}
t₀: X₀+X₁+1 {O(n)}
t₁: 1 {O(1)}
Overall costbound: X₀+X₁+2 {O(n)}
t₀: X₀+X₁+1 {O(n)}
t₁: 1 {O(1)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: 2⋅X₀⋅X₂+2⋅X₁⋅X₂+4⋅X₂+X₁ {O(n^2)}
t₀, X₂: X₂ {O(n)}
t₁, X₀: X₀ {O(n)}
t₁, X₁: X₁ {O(n)}
t₁, X₂: X₂ {O(n)}