Initial Problem

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

Preprocessing

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 l6

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

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

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

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

Problem after Preprocessing

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

Cut unsatisfiable transition t₆₁₈: n_l1___3→l4

Cut unreachable locations [n_l5___10; n_l5___7; n_l8___5; n_l8___8] from the program graph

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_l6___6

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_l5___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_l8___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_l5___9

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___4

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

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

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

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