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

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

Found invariant X₀ ≤ 1 for location l6

Found invariant X₀ ≤ 1 for location l7

Found invariant X₂ ≤ 99 ∧ X₁+X₂ ≤ 198 ∧ X₀+X₂ ≤ 100 ∧ X₁ ≤ 99 ∧ X₀+X₁ ≤ 100 ∧ X₀ ≤ 1 for location l5

Found invariant X₀ ≤ 1 for location l4

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

Chain transitions t₃₁: l5→l4 and t₃₀: l4→l6 to t₇₄: l5→l6

Chain transitions t₂₅: l1→l4 and t₃₀: l4→l6 to t₇₅: l1→l6

Chain transitions t₂₅: l1→l4 and t₂₉: l4→l6 to t₇₆: l1→l6

Chain transitions t₃₁: l5→l4 and t₂₉: l4→l6 to t₇₇: l5→l6

Chain transitions t₂₄: l1→l4 and t₂₉: l4→l6 to t₇₈: l1→l6

Chain transitions t₂₄: l1→l4 and t₃₀: l4→l6 to t₇₉: l1→l6

Chain transitions t₂₄: l1→l4 and t₂₈: l4→l5 to t₈₀: l1→l5

Chain transitions t₂₅: l1→l4 and t₂₈: l4→l5 to t₈₁: l1→l5

Chain transitions t₃₁: l5→l4 and t₂₈: l4→l5 to t₈₂: l5→l5

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

Chain transitions t₂₃: l1→l4 and t₂₉: l4→l6 to t₈₄: l1→l6

Chain transitions t₂₃: l1→l4 and t₃₀: l4→l6 to t₈₅: l1→l6

Analysing control-flow refined program

Found invariant X₀ ≤ 1 ∧ 0 ≤ 1+X₀ for location l6

Found invariant X₀ ≤ 1 ∧ 0 ≤ 1+X₀ for location l7

Found invariant X₅ ≤ 99 ∧ X₄+X₅ ≤ 198 ∧ X₂+X₅ ≤ 198 ∧ X₁+X₅ ≤ 198 ∧ X₅ ≤ 100+X₀ ∧ X₀+X₅ ≤ 100 ∧ X₄ ≤ 99 ∧ X₂+X₄ ≤ 198 ∧ X₁+X₄ ≤ 198 ∧ X₄ ≤ 100+X₀ ∧ X₀+X₄ ≤ 100 ∧ X₂ ≤ 99 ∧ X₁+X₂ ≤ 198 ∧ X₂ ≤ 100+X₀ ∧ X₀+X₂ ≤ 100 ∧ X₁ ≤ 99 ∧ X₁ ≤ 100+X₀ ∧ X₀+X₁ ≤ 100 ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ for location l5

Found invariant X₀ ≤ 1 ∧ 0 ≤ 1+X₀ for location l4

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

Analysing control-flow refined program

Cut unsatisfiable transition t₂₀₁: n_l4___2→l6

Found invariant X₅ ≤ 98 ∧ X₄+X₅ ≤ 197 ∧ X₅ ≤ 98+X₃ ∧ X₃+X₅ ≤ 98 ∧ 1+X₅ ≤ X₂ ∧ X₂+X₅ ≤ 197 ∧ X₁+X₅ ≤ 196 ∧ X₅ ≤ 99+X₀ ∧ X₀+X₅ ≤ 97 ∧ X₂ ≤ 1+X₅ ∧ X₄ ≤ 99 ∧ X₄ ≤ 99+X₃ ∧ X₃+X₄ ≤ 99 ∧ X₂+X₄ ≤ 198 ∧ X₄ ≤ 1+X₁ ∧ X₁+X₄ ≤ 197 ∧ X₄ ≤ 100+X₀ ∧ X₀+X₄ ≤ 98 ∧ 1+X₁ ≤ X₄ ∧ X₃ ≤ 0 ∧ X₂+X₃ ≤ 99 ∧ X₁+X₃ ≤ 98 ∧ X₃ ≤ 1+X₀ ∧ 1+X₀+X₃ ≤ 0 ∧ 0 ≤ X₃ ∧ X₂ ≤ 99+X₃ ∧ X₁ ≤ 98+X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ X₂ ≤ 99 ∧ X₁+X₂ ≤ 197 ∧ X₂ ≤ 100+X₀ ∧ X₀+X₂ ≤ 98 ∧ X₁ ≤ 98 ∧ X₁ ≤ 99+X₀ ∧ X₀+X₁ ≤ 97 ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ for location n_l5___1

Found invariant X₀ ≤ 1 for location l6

Found invariant X₅ ≤ 99 ∧ X₄+X₅ ≤ 198 ∧ X₅ ≤ 99+X₃ ∧ X₃+X₅ ≤ 99 ∧ 1+X₅ ≤ X₂ ∧ X₂+X₅ ≤ 199 ∧ X₁+X₅ ≤ 197 ∧ X₅ ≤ 100+X₀ ∧ X₀+X₅ ≤ 98 ∧ X₂ ≤ 1+X₅ ∧ X₄ ≤ 99 ∧ X₄ ≤ 99+X₃ ∧ X₃+X₄ ≤ 99 ∧ X₂+X₄ ≤ 199 ∧ X₄ ≤ 1+X₁ ∧ X₁+X₄ ≤ 197 ∧ X₄ ≤ 100+X₀ ∧ X₀+X₄ ≤ 98 ∧ 1+X₁ ≤ X₄ ∧ X₃ ≤ 0 ∧ X₂+X₃ ≤ 100 ∧ X₁+X₃ ≤ 98 ∧ X₃ ≤ 1+X₀ ∧ 1+X₀+X₃ ≤ 0 ∧ 0 ≤ X₃ ∧ X₂ ≤ 100+X₃ ∧ X₁ ≤ 98+X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ X₂ ≤ 100 ∧ X₁+X₂ ≤ 198 ∧ X₂ ≤ 101+X₀ ∧ X₀+X₂ ≤ 99 ∧ X₁ ≤ 98 ∧ X₁ ≤ 99+X₀ ∧ X₀+X₁ ≤ 97 ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ for location n_l4___2

Found invariant X₅ ≤ 99 ∧ X₄+X₅ ≤ 198 ∧ X₅ ≤ X₂ ∧ X₂+X₅ ≤ 198 ∧ X₁+X₅ ≤ 198 ∧ X₅ ≤ 100+X₀ ∧ X₀+X₅ ≤ 100 ∧ X₂ ≤ X₅ ∧ X₄ ≤ 99 ∧ X₂+X₄ ≤ 198 ∧ X₄ ≤ X₁ ∧ X₁+X₄ ≤ 198 ∧ X₄ ≤ 100+X₀ ∧ X₀+X₄ ≤ 100 ∧ X₁ ≤ X₄ ∧ X₂ ≤ 99 ∧ X₁+X₂ ≤ 198 ∧ X₂ ≤ 100+X₀ ∧ X₀+X₂ ≤ 100 ∧ X₁ ≤ 99 ∧ X₁ ≤ 100+X₀ ∧ X₀+X₁ ≤ 100 ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ for location n_l5___6

Found invariant X₅ ≤ 99 ∧ X₁+X₅ ≤ 199 ∧ X₀+X₅ ≤ 100 ∧ X₁+X₂ ≤ 198 ∧ X₀+X₂ ≤ 99 ∧ X₁ ≤ 100 ∧ X₁ ≤ 99+X₀ ∧ X₀+X₁ ≤ 101 ∧ X₀ ≤ 1 for location n_l4___5

Found invariant X₅ ≤ 99 ∧ X₂+X₅ ≤ 198 ∧ X₁+X₅ ≤ 198 ∧ X₀+X₅ ≤ 100 ∧ X₂ ≤ 99 ∧ X₁+X₂ ≤ 198 ∧ X₀+X₂ ≤ 99 ∧ X₁ ≤ 99 ∧ X₁ ≤ 99+X₀ ∧ X₀+X₁ ≤ 100 ∧ X₀ ≤ 1 for location n_l5___4

Found invariant X₀ ≤ 1 for location l7

Found invariant X₅ ≤ X₂ ∧ X₂ ≤ X₅ ∧ X₄ ≤ X₁ ∧ X₁ ≤ X₄ ∧ X₀ ≤ 1 ∧ 0 ≤ 1+X₀ for location l4

Found invariant X₅ ≤ 99 ∧ X₄+X₅ ≤ 198 ∧ X₅ ≤ 99+X₃ ∧ X₃+X₅ ≤ 99 ∧ X₅ ≤ X₂ ∧ X₂+X₅ ≤ 198 ∧ X₁+X₅ ≤ 198 ∧ X₅ ≤ 100+X₀ ∧ X₀+X₅ ≤ 98 ∧ X₂ ≤ X₅ ∧ X₄ ≤ 99 ∧ X₄ ≤ 99+X₃ ∧ X₃+X₄ ≤ 99 ∧ X₂+X₄ ≤ 198 ∧ X₄ ≤ X₁ ∧ X₁+X₄ ≤ 198 ∧ X₄ ≤ 100+X₀ ∧ X₀+X₄ ≤ 98 ∧ X₁ ≤ X₄ ∧ X₃ ≤ 0 ∧ X₂+X₃ ≤ 99 ∧ X₁+X₃ ≤ 99 ∧ X₃ ≤ 1+X₀ ∧ 1+X₀+X₃ ≤ 0 ∧ 0 ≤ X₃ ∧ X₂ ≤ 99+X₃ ∧ X₁ ≤ 99+X₃ ∧ 0 ≤ 1+X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ X₂ ≤ 99 ∧ X₁+X₂ ≤ 198 ∧ X₂ ≤ 100+X₀ ∧ X₀+X₂ ≤ 98 ∧ X₁ ≤ 99 ∧ X₁ ≤ 100+X₀ ∧ X₀+X₁ ≤ 98 ∧ 1+X₀ ≤ 0 ∧ 0 ≤ 1+X₀ for location n_l5___3

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₂₃: 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₃₀: 1 {O(1)}
t₃₁: inf {Infinity}
t₃₂: 1 {O(1)}

Costbounds

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₃₀: 1 {O(1)}
t₃₁: inf {Infinity}
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₀: 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₀: 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₀: 1 {O(1)}
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₂: X₂ {O(n)}
t₂₇, X₄: X₄ {O(n)}
t₂₇, X₅: X₅ {O(n)}
t₂₈, X₀: 3 {O(1)}
t₂₈, X₄: 3⋅X₄ {O(n)}
t₂₈, X₅: 3⋅X₅ {O(n)}
t₂₉, X₀: 6 {O(1)}
t₂₉, X₄: 6⋅X₄ {O(n)}
t₂₉, X₅: 6⋅X₅ {O(n)}
t₃₀, X₀: 6 {O(1)}
t₃₀, X₄: 6⋅X₄ {O(n)}
t₃₀, X₅: 6⋅X₅ {O(n)}
t₃₁, X₀: 3 {O(1)}
t₃₁, X₄: 3⋅X₄ {O(n)}
t₃₁, X₅: 3⋅X₅ {O(n)}
t₃₂, X₀: 12 {O(1)}
t₃₂, X₄: 12⋅X₄ {O(n)}
t₃₂, X₅: 12⋅X₅ {O(n)}