Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀) → l1(X₀)
t₁: l1(X₀) → l1(X₀-1) :|: X₀ ≤ 0
t₂: l1(X₀) → l1(X₀-1) :|: 1 ≤ X₀
Start: l0
Program_Vars: X₀
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀) → l1(X₀)
t₁: l1(X₀) → l1(X₀-1) :|: X₀ ≤ 0
t₂: l1(X₀) → l1(X₀-1) :|: 1 ≤ X₀
new bound:
X₀ {O(n)}
MPRF:
l1 [X₀ ]
Found invariant 1+X₀ ≤ 0 for location n_l1___2
Found invariant 0 ≤ X₀ for location n_l1___1
new bound:
X₀+1 {O(n)}
MPRF:
n_l1___1 [X₀+1 ]
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
t₂: X₀ {O(n)}
Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
t₂: X₀ {O(n)}
t₀, X₀: X₀ {O(n)}
t₂, X₀: X₀ {O(n)}