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