Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars: nondef.0, nondef.1
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8, l9
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₄: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₀, X₁, X₂, -X₂, X₄, X₅, X₆)
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₃: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀, X₁, nondef.0, X₃, X₄, X₅, X₆)
t₆: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l5(X₀, X₁, X₂, X₃, nondef.1, X₅, X₆)
t₇: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l6(X₃, -X₄, X₂, X₃, X₄, X₅, X₆)
t₈: l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l7(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₁ < X₀
t₉: l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l8(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀ ≤ X₁
t₁₀: l7(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l6(X₀+1, X₁+X₀, X₂, X₃, X₄, X₅, X₆)
t₁₁: l8(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l9(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
Eliminate variables {X₅,X₆} that do not contribute to the problem
Found invariant X₂+X₃ ≤ 0 ∧ X₃ ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₀+X₂ for location l6
Found invariant X₂+X₃ ≤ 0 ∧ X₃ ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₀+X₂ ∧ 1+X₁ ≤ X₀ for location l7
Found invariant X₂+X₃ ≤ 0 ∧ 0 ≤ X₂+X₃ for location l5
Found invariant X₂+X₃ ≤ 0 ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₁ for location l8
Found invariant X₂+X₃ ≤ 0 ∧ 0 ≤ X₂+X₃ for location l4
Found invariant X₂+X₃ ≤ 0 ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₁ for location l9
Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars: nondef.0, nondef.1
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8, l9
Transitions:
t₂₂: l0(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃, X₄)
t₂₃: l1(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, -X₂, X₄)
t₂₄: l2(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂, X₃, X₄)
t₂₅: l3(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, nondef.0, X₃, X₄)
t₂₆: l4(X₀, X₁, X₂, X₃, X₄) → l5(X₀, X₁, X₂, X₃, nondef.1) :|: X₂+X₃ ≤ 0 ∧ 0 ≤ X₂+X₃
t₂₇: l5(X₀, X₁, X₂, X₃, X₄) → l6(X₃, -X₄, X₂, X₃, X₄) :|: X₂+X₃ ≤ 0 ∧ 0 ≤ X₂+X₃
t₂₈: l6(X₀, X₁, X₂, X₃, X₄) → l7(X₀, X₁, X₂, X₃, X₄) :|: X₁ < X₀ ∧ X₂+X₃ ≤ 0 ∧ X₃ ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₀+X₂
t₂₉: l6(X₀, X₁, X₂, X₃, X₄) → l8(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ X₁ ∧ X₂+X₃ ≤ 0 ∧ X₃ ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₀+X₂
t₃₀: l7(X₀, X₁, X₂, X₃, X₄) → l6(X₀+1, X₁+X₀, X₂, X₃, X₄) :|: X₂+X₃ ≤ 0 ∧ X₃ ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₀+X₂ ∧ 1+X₁ ≤ X₀
t₃₁: l8(X₀, X₁, X₂, X₃, X₄) → l9(X₀, X₁, X₂, X₃, X₄) :|: X₂+X₃ ≤ 0 ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₁
Found invariant 1 ≤ X₃+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ X₂+X₃ ≤ 0 ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ 1 ≤ X₀+X₂ for location n_l6___2
Found invariant X₁+X₄ ≤ 0 ∧ 0 ≤ X₁+X₄ ∧ X₂+X₃ ≤ 0 ∧ X₃ ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ X₀ ≤ X₃ ∧ X₀+X₂ ≤ 0 ∧ 0 ≤ X₀+X₂ for location l6
Found invariant X₁+X₄ ≤ 0 ∧ 1 ≤ X₃+X₄ ∧ 1+X₂ ≤ X₄ ∧ 0 ≤ X₁+X₄ ∧ 1 ≤ X₀+X₄ ∧ X₂+X₃ ≤ 0 ∧ X₃ ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ 1+X₁ ≤ X₃ ∧ X₀ ≤ X₃ ∧ 1+X₁+X₂ ≤ 0 ∧ X₀+X₂ ≤ 0 ∧ 0 ≤ X₀+X₂ ∧ 1+X₁ ≤ X₀ for location n_l7___3
Found invariant X₂+X₃ ≤ 0 ∧ 0 ≤ X₂+X₃ for location l5
Found invariant 0 ≤ X₁+X₄ ∧ X₂+X₃ ≤ 0 ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₁ for location l8
Found invariant X₂+X₃ ≤ 0 ∧ 0 ≤ X₂+X₃ for location l4
Found invariant 0 ≤ X₁+X₄ ∧ X₂+X₃ ≤ 0 ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₁ for location l9
Found invariant 1 ≤ X₃+X₄ ∧ 1+X₂ ≤ X₄ ∧ 2 ≤ X₀+X₄ ∧ X₂+X₃ ≤ 0 ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₂+X₃ ∧ 1 ≤ X₀+X₂ ∧ 1+X₁ ≤ X₀ for location n_l7___1
Overall timebound:inf {Infinity}
t₂₂: 1 {O(1)}
t₂₃: 1 {O(1)}
t₂₄: 1 {O(1)}
t₂₅: 1 {O(1)}
t₂₆: 1 {O(1)}
t₂₇: 1 {O(1)}
t₂₈: inf {Infinity}
t₂₉: 1 {O(1)}
t₃₀: inf {Infinity}
t₃₁: 1 {O(1)}
Overall costbound: inf {Infinity}
t₂₂: 1 {O(1)}
t₂₃: 1 {O(1)}
t₂₄: 1 {O(1)}
t₂₅: 1 {O(1)}
t₂₆: 1 {O(1)}
t₂₇: 1 {O(1)}
t₂₈: 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)}
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)}
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)}