Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇
Temp_Vars: I, J, K
Locations: l0, l1, l2
Transitions:
t₂: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l1(X₀, X₁, X₂, X₃, X₄, X₅, I, J)
t₀: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l1(X₀, X₁, I, J, K, X₅, X₆, X₇) :|: 1+X₀ ≤ X₁
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l2(X₀, X₁, I, J, X₄, K, X₆, X₇) :|: X₁ ≤ X₀
Eliminate variables {I,J,K,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 X₁ ≤ X₀ for location l2
Found invariant 1+X₀ ≤ X₁ for location n_l1___1
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)}