Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈
Temp_Vars: J, K, L, M
Locations: l0, l1, l2
Transitions:
t₄: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈) → l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, K, L)
t₀: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈) → l1(X₀, X₁, K, L, J, M, X₆, X₇, X₈) :|: 1 ≤ J ∧ 1+X₀ ≤ X₁
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈) → l1(X₀, X₁, K, L, J, M, X₆, X₇, X₈) :|: J+1 ≤ 0 ∧ 1+X₀ ≤ X₁
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈) → l1(X₀, X₁, K, L, 0, X₅, X₆, X₇, X₈) :|: 1+X₀ ≤ X₁
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈) → l2(X₀, X₁, K, L, X₄, X₅, J, X₇, X₈) :|: X₁ ≤ X₀
Eliminate variables {K,L,M,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: J
Locations: l0, l1, l2
Transitions:
t₁₄: l0(X₀, X₁) → l1(X₀, X₁)
t₁₅: l1(X₀, X₁) → l1(X₀, X₁) :|: 1 ≤ J ∧ 1+X₀ ≤ X₁
t₁₆: l1(X₀, X₁) → l1(X₀, X₁) :|: J+1 ≤ 0 ∧ 1+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
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₁₆: inf {Infinity}
t₁₇: inf {Infinity}
t₁₈: 1 {O(1)}
Overall costbound: inf {Infinity}
t₁₄: 1 {O(1)}
t₁₅: inf {Infinity}
t₁₆: inf {Infinity}
t₁₇: inf {Infinity}
t₁₈: 1 {O(1)}
t₁₄, X₀: X₀ {O(n)}
t₁₄, X₁: X₁ {O(n)}
t₁₅, X₀: 3⋅X₀ {O(n)}
t₁₅, X₁: 3⋅X₁ {O(n)}
t₁₆, X₀: 3⋅X₀ {O(n)}
t₁₆, X₁: 3⋅X₁ {O(n)}
t₁₇, X₀: 3⋅X₀ {O(n)}
t₁₇, X₁: 3⋅X₁ {O(n)}
t₁₈, X₀: X₀ {O(n)}
t₁₈, X₁: X₁ {O(n)}