Start: start
Program_Vars: X₀, X₁
Temp_Vars:
Locations: end, start, sumto
Transitions:
t₂: start(X₀, X₁) → sumto(X₀, X₁)
t₀: sumto(X₀, X₁) → end(X₀, X₁) :|: 1+X₁ ≤ X₀
t₁: sumto(X₀, X₁) → sumto(1+X₀, X₁) :|: X₀ ≤ X₁
Found invariant 1+X₁ ≤ X₀ for location end
Start: start
Program_Vars: X₀, X₁
Temp_Vars:
Locations: end, start, sumto
Transitions:
t₂: start(X₀, X₁) → sumto(X₀, X₁)
t₀: sumto(X₀, X₁) → end(X₀, X₁) :|: 1+X₁ ≤ X₀
t₁: sumto(X₀, X₁) → sumto(1+X₀, X₁) :|: X₀ ≤ X₁
new bound:
X₀+X₁+1 {O(n)}
MPRF:
• sumto: [1+X₁-X₀]
Overall timebound:X₀+X₁+3 {O(n)}
t₀: 1 {O(1)}
t₁: X₀+X₁+1 {O(n)}
t₂: 1 {O(1)}
Overall costbound: X₀+X₁+3 {O(n)}
t₀: 1 {O(1)}
t₁: X₀+X₁+1 {O(n)}
t₂: 1 {O(1)}
t₀, X₀: 3⋅X₀+X₁+1 {O(n)}
t₀, X₁: 2⋅X₁ {O(n)}
t₁, X₀: 2⋅X₀+X₁+1 {O(n)}
t₁, X₁: X₁ {O(n)}
t₂, X₀: X₀ {O(n)}
t₂, X₁: X₁ {O(n)}