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