Initial Problem

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

Preprocessing

Found invariant 2 ≤ X₀ for location l6

Found invariant 2 ≤ X₀ for location l5

Found invariant 2 ≤ X₀ for location l4

Problem after Preprocessing

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

Analysing control-flow refined program

Found invariant X₄ ≤ X₀ ∧ 2 ≤ X₄ ∧ 4 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ 2 ≤ X₀ for location n_l6___6

Found invariant X₄ ≤ X₀ ∧ X₀ ≤ X₄ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ for location l2

Found invariant 2+X₄ ≤ X₂ ∧ X₄ ≤ X₁ ∧ 2+X₄ ≤ X₀ ∧ 2 ≤ X₄ ∧ 6 ≤ X₂+X₄ ∧ 4 ≤ X₁+X₄ ∧ 6 ≤ X₀+X₄ ∧ X₂ ≤ X₀ ∧ 4 ≤ X₂ ∧ 6 ≤ X₁+X₂ ∧ 2+X₁ ≤ X₂ ∧ 8 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 2+X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 6 ≤ X₀+X₁ ∧ 4 ≤ X₀ for location n_l6___2

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

Found invariant X₄ ≤ X₁ ∧ 2+X₄ ≤ X₀ ∧ 2 ≤ X₄ ∧ 4 ≤ X₁+X₄ ∧ 6 ≤ X₀+X₄ ∧ 2+X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 6 ≤ X₀+X₁ ∧ 4 ≤ X₀ for location n_l4___1

Found invariant X₄ ≤ X₀ ∧ 2 ≤ X₄ ∧ 4 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ X₃ ≤ X₁ ∧ X₁ ≤ X₃ ∧ 2 ≤ X₀ for location n_l5___7

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

Found invariant 2+X₄ ≤ X₂ ∧ X₄ ≤ X₁ ∧ 2+X₄ ≤ X₀ ∧ 2 ≤ X₄ ∧ 6 ≤ X₂+X₄ ∧ 4 ≤ X₁+X₄ ∧ 6 ≤ X₀+X₄ ∧ X₂ ≤ X₀ ∧ 4 ≤ X₂ ∧ 6 ≤ X₁+X₂ ∧ 2+X₁ ≤ X₂ ∧ 8 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 2+X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 6 ≤ X₀+X₁ ∧ 4 ≤ X₀ for location n_l5___3

CFR did not improve the program. Rolling back

All Bounds

Timebounds

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

Costbounds

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