Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars: nondef.0
Locations: l0, l1, l2, l3, l4, l5, l6, l7
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₉: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₂-1, X₁+X₀, X₂, X₃, X₄, X₅, X₆) :|: X₃ < 0 ∧ X₃ < 0
t₁₀: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₂-1, X₁+X₀, X₂, X₃, X₄, X₅, X₆) :|: X₃ < 0 ∧ 0 < X₃
t₁₁: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₂-1, X₁+X₀, X₂, X₃, X₄, X₅, X₆) :|: 0 < X₃ ∧ X₃ < 0
t₁₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₂-1, X₁+X₀, X₂, X₃, X₄, X₅, X₆) :|: 0 < X₃ ∧ 0 < X₃
t₁₃: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₁+X₀, X₁+X₀, X₂, X₃, X₄, X₅, X₆) :|: X₃ < 0 ∧ X₃ ≤ 0 ∧ 0 ≤ X₃
t₁₄: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₁+X₀, X₁+X₀, X₂, X₃, X₄, X₅, X₆) :|: 0 < X₃ ∧ X₃ ≤ 0 ∧ 0 ≤ X₃
t₁₅: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₂-1, X₂-1, X₂, X₃, X₄, X₅, X₆) :|: X₃ ≤ 0 ∧ 0 ≤ X₃ ∧ X₃ < 0
t₁₆: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₂-1, X₂-1, X₂, X₃, X₄, X₅, X₆) :|: X₃ ≤ 0 ∧ 0 ≤ X₃ ∧ 0 < X₃
t₁₇: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₁+X₀, X₂-1, X₂, X₃, X₄, X₅, X₆) :|: X₃ ≤ 0 ∧ 0 ≤ X₃ ∧ X₃ ≤ 0 ∧ 0 ≤ X₃
t₅: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₁, X₃, X₄, X₅, X₆) :|: X₁ < X₀
t₆: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₀, X₃, X₄, X₅, X₆) :|: X₀ ≤ X₁
t₈: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀, X₁, X₂, nondef.0, X₄, X₅, X₆)
t₂: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 0 < X₁ ∧ 0 < X₀
t₃: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₁ ≤ 0
t₄: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀ ≤ 0
t₁: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l4(X₄, X₅, X₂, X₃, X₄, X₅, X₆)
t₁₈: l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l7(X₀, X₁, X₂, X₃, X₄, X₅, X₆)

Preprocessing

Cut unsatisfiable transition t₁₀: l1→l4

Cut unsatisfiable transition t₁₁: l1→l4

Cut unsatisfiable transition t₁₃: l1→l4

Cut unsatisfiable transition t₁₄: l1→l4

Cut unsatisfiable transition t₁₅: l1→l4

Cut unsatisfiable transition t₁₆: l1→l4

Eliminate variables {X₆} that do not contribute to the problem

Found invariant 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l2

Found invariant X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₁ for location l1

Found invariant X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l3

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars: nondef.0
Locations: l0, l1, l2, l3, l4, l5, l6, l7
Transitions:
t₃₇: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅)
t₃₈: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₂-1, X₁+X₀, X₂, X₃, X₄, X₅) :|: X₃ < 0 ∧ X₃ < 0 ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₁
t₃₉: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₂-1, X₁+X₀, X₂, X₃, X₄, X₅) :|: 0 < X₃ ∧ 0 < X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₁
t₄₀: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₁+X₀, X₂-1, X₂, X₃, X₄, X₅) :|: X₃ ≤ 0 ∧ 0 ≤ X₃ ∧ X₃ ≤ 0 ∧ 0 ≤ X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1 ≤ X₁
t₄₁: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₁, X₃, X₄, X₅) :|: X₁ < X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₄₂: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₀, X₃, X₄, X₅) :|: X₀ ≤ X₁ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₄₃: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, X₁, X₂, nondef.0, X₄, X₅) :|: X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₄₄: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 < X₁ ∧ 0 < X₀
t₄₅: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l6(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ ≤ 0
t₄₆: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l6(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ ≤ 0
t₄₇: l5(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₄, X₅, X₂, X₃, X₄, X₅)
t₄₈: l6(X₀, X₁, X₂, X₃, X₄, X₅) → l7(X₀, X₁, X₂, X₃, X₄, X₅)

Analysing control-flow refined program

Cut unsatisfiable transition t₉₄₁: n_l4___8→l6

Cut unsatisfiable transition t₉₄₅: n_l4___8→l6

Cut unsatisfiable transition t₉₄₉: n_l4___8→l6

Cut unsatisfiable transition t₉₄₀: n_l4___9→l6

Cut unsatisfiable transition t₉₄₄: n_l4___9→l6

Cut unsatisfiable transition t₉₄₈: n_l4___9→l6

Found invariant 1+X₅ ≤ X₁ ∧ 2 ≤ X₅ ∧ 4 ≤ X₄+X₅ ∧ 4 ≤ X₂+X₅ ∧ X₂ ≤ X₅ ∧ 5 ≤ X₁+X₅ ∧ 3 ≤ X₀+X₅ ∧ 1+X₀ ≤ X₅ ∧ 1+X₄ ≤ X₁ ∧ 2 ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 5 ≤ X₁+X₄ ∧ 3 ≤ X₀+X₄ ∧ 1+X₀ ≤ X₄ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 2 ≤ X₂ ∧ 5 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 3 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 2+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l2___7

Found invariant 1+X₅ ≤ X₁ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 2 ≤ X₂+X₅ ∧ X₂ ≤ X₅ ∧ 3 ≤ X₁+X₅ ∧ 1 ≤ X₀+X₅ ∧ 1+X₀ ≤ X₅ ∧ 1+X₄ ≤ X₁ ∧ 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 3 ≤ X₁+X₄ ∧ 1 ≤ X₀+X₄ ∧ 1+X₀ ≤ X₄ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 2 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2+X₀ ≤ X₁ ∧ 0 ≤ X₀ for location n_l4___9

Found invariant 1+X₅ ≤ X₀ ∧ 2 ≤ X₅ ∧ 4 ≤ X₄+X₅ ∧ 2 ≤ X₃+X₅ ∧ 2+X₃ ≤ X₅ ∧ 3 ≤ X₂+X₅ ∧ 1+X₂ ≤ X₅ ∧ 3 ≤ X₁+X₅ ∧ 1+X₁ ≤ X₅ ∧ 5 ≤ X₀+X₅ ∧ 1+X₄ ≤ X₀ ∧ 2 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2+X₃ ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 3 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 5 ≤ X₀+X₄ ∧ X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 3+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₃ ∧ X₂ ≤ X₁ ∧ 2+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 4 ≤ X₀+X₂ ∧ 2+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location n_l3___3

Found invariant 1+X₅ ≤ X₁ ∧ 2 ≤ X₅ ∧ 4 ≤ X₄+X₅ ∧ 3 ≤ X₂+X₅ ∧ 1+X₂ ≤ X₅ ∧ 5 ≤ X₁+X₅ ∧ 3 ≤ X₀+X₅ ∧ 1+X₀ ≤ X₅ ∧ 1+X₄ ≤ X₁ ∧ 2 ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 5 ≤ X₁+X₄ ∧ 3 ≤ X₀+X₄ ∧ 1+X₀ ≤ X₄ ∧ 2+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 3 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 2+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l3___6

Found invariant 1+X₅ ≤ X₄ ∧ X₅ ≤ X₂ ∧ X₅ ≤ X₁ ∧ 1+X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 3 ≤ X₄+X₅ ∧ 2 ≤ X₂+X₅ ∧ X₂ ≤ X₅ ∧ 2 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 3 ≤ X₀+X₅ ∧ X₄ ≤ X₀ ∧ 2 ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 3 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 4 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 3 ≤ X₀+X₂ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l1___10

Found invariant 1+X₅ ≤ X₀ ∧ 2 ≤ X₅ ∧ 4 ≤ X₄+X₅ ∧ 3 ≤ X₂+X₅ ∧ 1+X₂ ≤ X₅ ∧ 3 ≤ X₁+X₅ ∧ 1+X₁ ≤ X₅ ∧ 5 ≤ X₀+X₅ ∧ 1+X₄ ≤ X₀ ∧ 2 ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 3 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 5 ≤ X₀+X₄ ∧ X₂ ≤ X₁ ∧ 2+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 4 ≤ X₀+X₂ ∧ 2+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location n_l1___2

Found invariant 1+X₅ ≤ X₄ ∧ X₅ ≤ X₂ ∧ X₅ ≤ X₁ ∧ 1+X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 3 ≤ X₄+X₅ ∧ 2 ≤ X₂+X₅ ∧ X₂ ≤ X₅ ∧ 2 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 3 ≤ X₀+X₅ ∧ X₄ ≤ X₀ ∧ 2 ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 3 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 4 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 3 ≤ X₀+X₂ ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l3___12

Found invariant X₅ ≤ X₁ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ X₄ ≤ X₅ ∧ 2 ≤ X₂+X₅ ∧ X₂ ≤ X₅ ∧ 2 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ X₄ ≤ X₂ ∧ X₄ ≤ X₁ ∧ X₄ ≤ X₀ ∧ 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l3___11

Found invariant 1+X₅ ≤ X₁ ∧ 2 ≤ X₅ ∧ 4 ≤ X₄+X₅ ∧ 3 ≤ X₂+X₅ ∧ 1+X₂ ≤ X₅ ∧ 5 ≤ X₁+X₅ ∧ 3 ≤ X₀+X₅ ∧ 1+X₀ ≤ X₅ ∧ 1+X₄ ≤ X₁ ∧ 2 ≤ X₄ ∧ 3 ≤ X₂+X₄ ∧ 1+X₂ ≤ X₄ ∧ 5 ≤ X₁+X₄ ∧ 3 ≤ X₀+X₄ ∧ 1+X₀ ≤ X₄ ∧ 2+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 3 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 2+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l1___5

Found invariant X₅ ≤ X₁ ∧ X₁ ≤ X₅ ∧ X₄ ≤ X₀ ∧ X₀ ≤ X₄ for location l4

Found invariant 1+X₅ ≤ X₀ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 1 ≤ X₃+X₅ ∧ 1+X₃ ≤ X₅ ∧ 2 ≤ X₂+X₅ ∧ X₂ ≤ X₅ ∧ 1 ≤ X₁+X₅ ∧ 1+X₁ ≤ X₅ ∧ 3 ≤ X₀+X₅ ∧ 1+X₄ ≤ X₀ ∧ 1 ≤ X₄ ∧ 1 ≤ X₃+X₄ ∧ 1+X₃ ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 1 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 3 ≤ X₀+X₄ ∧ X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ 2+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 0 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ X₂ ≤ 1+X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 3 ≤ X₀+X₂ ∧ 2+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l4___8

Found invariant X₅ ≤ X₁ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ X₄ ≤ X₅ ∧ 2 ≤ X₂+X₅ ∧ X₂ ≤ X₅ ∧ 2 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₀ ≤ X₅ ∧ X₄ ≤ X₂ ∧ X₄ ≤ X₁ ∧ X₄ ≤ X₀ ∧ 1 ≤ X₄ ∧ 2 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l1___1

Found invariant X₅ ≤ X₁ ∧ 1 ≤ X₅ ∧ 2 ≤ X₄+X₅ ∧ 2 ≤ X₁+X₅ ∧ X₁ ≤ X₅ ∧ 2 ≤ X₀+X₅ ∧ X₄ ≤ X₀ ∧ 1 ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l2___13

Found invariant 1+X₅ ≤ X₀ ∧ 2 ≤ X₅ ∧ 4 ≤ X₄+X₅ ∧ 2 ≤ X₃+X₅ ∧ 2+X₃ ≤ X₅ ∧ 4 ≤ X₂+X₅ ∧ X₂ ≤ X₅ ∧ 3 ≤ X₁+X₅ ∧ 1+X₁ ≤ X₅ ∧ 5 ≤ X₀+X₅ ∧ 1+X₄ ≤ X₀ ∧ 2 ≤ X₄ ∧ 2 ≤ X₃+X₄ ∧ 2+X₃ ≤ X₄ ∧ 4 ≤ X₂+X₄ ∧ X₂ ≤ X₄ ∧ 3 ≤ X₁+X₄ ∧ 1+X₁ ≤ X₄ ∧ 5 ≤ X₀+X₄ ∧ X₃ ≤ 0 ∧ 2+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 3+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₃ ∧ X₂ ≤ 1+X₁ ∧ 1+X₂ ≤ X₀ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 5 ≤ X₀+X₂ ∧ 2+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location n_l2___4

CFR did not improve the program. Rolling back

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₃₇: 1 {O(1)}
t₃₈: inf {Infinity}
t₃₉: inf {Infinity}
t₄₀: inf {Infinity}
t₄₁: inf {Infinity}
t₄₂: inf {Infinity}
t₄₃: inf {Infinity}
t₄₄: inf {Infinity}
t₄₅: 1 {O(1)}
t₄₆: 1 {O(1)}
t₄₇: 1 {O(1)}
t₄₈: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
t₃₇: 1 {O(1)}
t₃₈: inf {Infinity}
t₃₉: inf {Infinity}
t₄₀: inf {Infinity}
t₄₁: inf {Infinity}
t₄₂: inf {Infinity}
t₄₃: inf {Infinity}
t₄₄: inf {Infinity}
t₄₅: 1 {O(1)}
t₄₆: 1 {O(1)}
t₄₇: 1 {O(1)}
t₄₈: 1 {O(1)}

Sizebounds

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₃: 0 {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₄: 4⋅X₄ {O(n)}
t₄₅, X₅: 4⋅X₅ {O(n)}
t₄₆, X₄: 4⋅X₄ {O(n)}
t₄₆, X₅: 4⋅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₄: 8⋅X₄ {O(n)}
t₄₈, X₅: 8⋅X₅ {O(n)}