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