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₁-1) :|: 1 ≤ X₀
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₁-1) :|: 1 ≤ X₀
Found invariant 1+X₁ ≤ X₀ ∧ X₀ ≤ 1+X₁ for location n_l1___1
new bound:
X₁ {O(n)}
MPRF:
n_l1___1 [X₀ ]
new bound:
X₁ {O(n)}
cfr-program:
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, n_l1___1
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₁)
t₁₆: l1(X₀, X₁) → n_l1___1(X₁, X₁-1) :|: 1 ≤ X₀
t₁₅: n_l1___1(X₀, X₁) → n_l1___1(X₁, X₁-1) :|: X₀ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ X₀ ≤ 1+X₁
Overall timebound:X₁+2 {O(n)}
t₀: 1 {O(1)}
t₁₆: 1 {O(1)}
t₁₅: X₁ {O(n)}
Overall costbound: X₁+2 {O(n)}
t₀: 1 {O(1)}
t₁₆: 1 {O(1)}
t₁₅: X₁ {O(n)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₁₆, X₀: X₁ {O(n)}
t₁₆, X₁: X₁+1 {O(n)}
t₁₅, X₀: X₁ {O(n)}
t₁₅, X₁: X₁+2 {O(n)}