Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉
Temp_Vars: K, L, M, N
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → l1(K, L, M, N, X₄, X₅, X₆, X₇, X₈, X₉)
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → l1(X₀, X₁, X₂, X₃, X₄, X₅, K, L, M, X₉) :|: 1+X₄ ≤ X₅
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → l2(X₀, X₁, X₂, X₃, X₄, X₅, K, L, X₈, M) :|: X₅ ≤ X₄
Eliminate variables {K,L,M,N,X₀,X₁,X₂,X₃,X₆,X₇,X₈,X₉} that do not contribute to the problem
Found invariant X₅ ≤ X₄ for location l2
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₄
Found invariant X₅ ≤ X₄ for location l2
Found invariant 1+X₄ ≤ X₅ for location n_l1___1
Overall timebound:inf {Infinity}
t₈: 1 {O(1)}
t₉: inf {Infinity}
t₁₀: 1 {O(1)}
Overall costbound: inf {Infinity}
t₈: 1 {O(1)}
t₉: inf {Infinity}
t₁₀: 1 {O(1)}
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)}