Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₁)
t₁: l1(X₀, X₁) → l1(X₀+X₁, X₁) :|: 1 ≤ X₀ ∧ 1 ≤ X₁
t₂: l1(X₀, X₁) → l1(X₀+X₁, X₁) :|: 1 ≤ X₀ ∧ X₁+1 ≤ 0
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₁)
t₁: l1(X₀, X₁) → l1(X₀+X₁, X₁) :|: 1 ≤ X₀ ∧ 1 ≤ X₁
t₂: l1(X₀, X₁) → l1(X₀+X₁, X₁) :|: 1 ≤ X₀ ∧ X₁+1 ≤ 0
new bound:
X₀ {O(n)}
MPRF:
l1 [X₀ ]
Found invariant 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l1___2
Found invariant 1+X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ for location n_l1___1
new bound:
X₀+X₁ {O(n)}
MPRF:
n_l1___1 [X₀ ]
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)}
t₁, X₁: X₁ {O(n)}
t₂, X₀: 2⋅X₁+X₀ {O(n)}
t₂, X₁: X₁ {O(n)}