Initial Problem

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

Preprocessing

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

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

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

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

Problem after Preprocessing

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₂+X₃+1, 10, X₂+X₃+1, X₃, X₄, X₅, X₆) :|: 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁
t₂₂: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁
t₂₃: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀, X₁, X₂, nondef.0, X₄, X₅, X₆) :|: 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁
t₂₄: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 1+X₂ ≤ X₁ ∧ X₀ ≤ X₂ ∧ X₂ ≤ X₀
t₂₅: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₁ < X₂+1
t₂₆: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₀ < X₂
t₂₇: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l6(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₂ < X₀
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₆)

Chain transitions t₂₃: l3→l1 and t₂₁: l1→l4 to t₆₅: l3→l4

Chain transitions t₂₄: l4→l2 and t₂₂: l2→l3 to t₆₆: l4→l3

Chain transitions t₆₆: l4→l3 and t₆₅: l3→l4 to t₆₇: l4→l4

Chain transitions t₆₆: l4→l3 and t₂₃: l3→l1 to t₆₈: l4→l1

Analysing control-flow refined program

Eliminate variables {Temp_Int₃₉₄,X₃} that do not contribute to the problem

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

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

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

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

Analysing control-flow refined program

Found invariant 1+X₆ ≤ X₅ ∧ X₆ ≤ X₄ ∧ X₆ ≤ X₂ ∧ 1+X₆ ≤ X₁ ∧ X₆ ≤ X₀ ∧ X₄ ≤ X₆ ∧ X₂ ≤ X₆ ∧ X₀ ≤ X₆ ∧ X₅ ≤ X₁ ∧ 1+X₄ ≤ X₅ ∧ 1+X₂ ≤ X₅ ∧ X₁ ≤ X₅ ∧ 1+X₀ ≤ X₅ ∧ X₄ ≤ X₂ ∧ 1+X₄ ≤ X₁ ∧ X₄ ≤ X₀ ∧ X₂ ≤ X₄ ∧ X₀ ≤ X₄ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁ for location n_l2___7

Found invariant 1+X₆ ≤ X₅ ∧ X₆ ≤ X₄ ∧ X₄ ≤ X₆ ∧ 1+X₄ ≤ X₅ ∧ X₁ ≤ 10 ∧ 10 ≤ X₁ for location n_l4___4

Found invariant 1+X₆ ≤ X₅ ∧ X₆ ≤ X₄ ∧ X₆ ≤ X₂ ∧ 1+X₆ ≤ X₁ ∧ X₆ ≤ X₀ ∧ X₄ ≤ X₆ ∧ X₂ ≤ X₆ ∧ X₀ ≤ X₆ ∧ X₅ ≤ X₁ ∧ 1+X₄ ≤ X₅ ∧ 1+X₂ ≤ X₅ ∧ X₁ ≤ X₅ ∧ 1+X₀ ≤ X₅ ∧ X₄ ≤ X₂ ∧ 1+X₄ ≤ X₁ ∧ X₄ ≤ X₀ ∧ X₂ ≤ X₄ ∧ X₀ ≤ X₄ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁ for location n_l3___6

Found invariant 1+X₆ ≤ X₅ ∧ X₆ ≤ X₄ ∧ X₄ ≤ X₆ ∧ 1+X₄ ≤ X₅ ∧ X₂ ≤ 9 ∧ 1+X₂ ≤ X₁ ∧ X₁+X₂ ≤ 19 ∧ X₂ ≤ X₀ ∧ X₀+X₂ ≤ 18 ∧ X₀ ≤ X₂ ∧ X₁ ≤ 10 ∧ X₀+X₁ ≤ 19 ∧ 10 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 9 for location n_l2___3

Found invariant 1+X₆ ≤ X₅ ∧ X₆ ≤ X₄ ∧ X₆ ≤ X₂ ∧ 1+X₆ ≤ X₁ ∧ X₆ ≤ X₀ ∧ X₄ ≤ X₆ ∧ X₂ ≤ X₆ ∧ X₀ ≤ X₆ ∧ X₅ ≤ X₁ ∧ 1+X₄ ≤ X₅ ∧ 1+X₂ ≤ X₅ ∧ X₁ ≤ X₅ ∧ 1+X₀ ≤ X₅ ∧ X₄ ≤ X₂ ∧ 1+X₄ ≤ X₁ ∧ X₄ ≤ X₀ ∧ X₂ ≤ X₄ ∧ X₀ ≤ X₄ ∧ 1+X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁ for location n_l1___5

Found invariant 1+X₆ ≤ X₅ ∧ X₆ ≤ X₄ ∧ X₄ ≤ X₆ ∧ 1+X₄ ≤ X₅ ∧ X₂ ≤ 9 ∧ 1+X₂ ≤ X₁ ∧ X₁+X₂ ≤ 19 ∧ X₂ ≤ X₀ ∧ X₀+X₂ ≤ 18 ∧ X₀ ≤ X₂ ∧ X₁ ≤ 10 ∧ X₀+X₁ ≤ 19 ∧ 10 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 9 for location n_l3___2

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

Found invariant 1+X₆ ≤ X₅ ∧ X₆ ≤ X₄ ∧ X₄ ≤ X₆ ∧ 1+X₄ ≤ X₅ ∧ X₂ ≤ 9 ∧ 1+X₂ ≤ X₁ ∧ X₁+X₂ ≤ 19 ∧ X₂ ≤ X₀ ∧ X₀+X₂ ≤ 18 ∧ X₀ ≤ X₂ ∧ X₁ ≤ 10 ∧ X₀+X₁ ≤ 19 ∧ 10 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 9 for location n_l1___1

CFR did not improve the program. Rolling back

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₂₅: 1 {O(1)}
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₂₅: 1 {O(1)}
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₁: 10 {O(1)}
t₂₁, X₄: X₄ {O(n)}
t₂₁, X₅: X₅ {O(n)}
t₂₁, X₆: X₆ {O(n)}
t₂₂, X₁: X₅+10 {O(n)}
t₂₂, X₄: X₄ {O(n)}
t₂₂, X₅: X₅ {O(n)}
t₂₂, X₆: X₆ {O(n)}
t₂₃, X₁: X₅+10 {O(n)}
t₂₃, X₄: X₄ {O(n)}
t₂₃, X₅: X₅ {O(n)}
t₂₃, X₆: X₆ {O(n)}
t₂₄, X₁: X₅+10 {O(n)}
t₂₄, X₄: X₄ {O(n)}
t₂₄, X₅: X₅ {O(n)}
t₂₄, X₆: X₆ {O(n)}
t₂₅, X₁: X₅+10 {O(n)}
t₂₅, X₄: 2⋅X₄ {O(n)}
t₂₅, X₅: 2⋅X₅ {O(n)}
t₂₅, X₆: 2⋅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)}
t₂₈, X₄: X₄ {O(n)}
t₂₈, X₅: X₅ {O(n)}
t₂₈, X₆: X₆ {O(n)}
t₂₉, X₁: 3⋅X₅+10 {O(n)}
t₂₉, X₄: 4⋅X₄ {O(n)}
t₂₉, X₅: 4⋅X₅ {O(n)}
t₂₉, X₆: 4⋅X₆ {O(n)}