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₇) :|: X₁+1 ≤ X₀
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l1(X₀, X₁, I, J, K, X₅, X₆, X₇) :|: X₀+1 ≤ X₁
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → l2(X₀, X₀, I, J, X₄, K, X₆, X₇) :|: 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₀ ∧ 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₁) :|: X₁+1 ≤ X₀
t₁₅: l1(X₀, X₁) → l1(X₀, X₁) :|: X₀+1 ≤ X₁
t₁₆: l1(X₀, X₁) → l2(X₀, X₀) :|: X₀ ≤ X₁ ∧ X₁ ≤ X₀
Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l2
Found invariant 1+X₁ ≤ X₀ for location n_l1___2
Found invariant 1+X₀ ≤ X₁ for location n_l1___1
Overall timebound:inf {Infinity}
t₁₃: 1 {O(1)}
t₁₄: inf {Infinity}
t₁₅: inf {Infinity}
t₁₆: 1 {O(1)}
Overall costbound: inf {Infinity}
t₁₃: 1 {O(1)}
t₁₄: inf {Infinity}
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)}
t₁₆, X₀: X₀ {O(n)}
t₁₆, X₁: X₀ {O(n)}