Initial Problem

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

Preprocessing

Found invariant X₄ ≤ X₁ ∧ X₂ ≤ 1+X₃ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁ for location l7

Found invariant X₄ ≤ X₁ ∧ 2+X₃ ≤ X₂ ∧ 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ X₂ ≤ X₁ ∧ X₂ ≤ 1+X₀ ∧ 1+X₀ ≤ X₂ ∧ 1+X₀ ≤ X₁ for location l5

Found invariant X₄ ≤ X₁ ∧ X₂ ≤ X₁ for location l1

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

Analysing control-flow refined program

Cut unsatisfiable transition t₃: l1→l2

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

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

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

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

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

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

CFR did not improve the program. Rolling back

All Bounds

Timebounds

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

Costbounds

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

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