Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉
Temp_Vars: K, L, M
Locations: l0, l1, l2
Transitions:
t₂: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → l1(X₀, X₁, X₂, X₃, X₄, X₅, K, L, L, K)
t₀: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → l1(X₀, X₁, K, L, M, X₅, X₆, X₇, X₈, X₉) :|: 1+X₀ ≤ X₁
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → l2(X₀, X₁, K, L, X₄, M, X₆, X₇, X₈, X₉) :|: X₁ ≤ X₀

Preprocessing

Eliminate variables {K,L,M,X₂,X₃,X₄,X₅,X₆,X₇,X₈,X₉} that do not contribute to the problem

Found invariant X₁ ≤ X₀ for location l2

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₈: l0(X₀, X₁) → l1(X₀, X₁)
t₉: l1(X₀, X₁) → l1(X₀, X₁) :|: 1+X₀ ≤ X₁
t₁₀: l1(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ X₀

Analysing control-flow refined program

Found invariant X₁ ≤ X₀ for location l2

Found invariant 1+X₀ ≤ X₁ for location n_l1___1

CFR did not improve the program. Rolling back

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₈: 1 {O(1)}
t₉: inf {Infinity}
t₁₀: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
t₈: 1 {O(1)}
t₉: inf {Infinity}
t₁₀: 1 {O(1)}

Sizebounds

t₈, X₀: X₀ {O(n)}
t₈, X₁: X₁ {O(n)}
t₉, X₀: X₀ {O(n)}
t₉, X₁: X₁ {O(n)}
t₁₀, X₀: X₀ {O(n)}
t₁₀, X₁: X₁ {O(n)}