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

Preprocessing

Found invariant 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀ for location l5

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

Analysing control-flow refined program

Found invariant X₄ ≤ X₂ ∧ 0 ≤ X₄ ∧ 0 ≤ X₂+X₄ ∧ X₁ ≤ X₄ ∧ 0 ≤ X₀+X₄ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ X₁ ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₀ for location n_l5___1

Found invariant X₄ ≤ X₂ ∧ 0 ≤ X₄ ∧ 0 ≤ X₂+X₄ ∧ X₁ ≤ X₄ ∧ 0 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ X₁ ≤ X₂ ∧ X₁ ≤ 0 for location n_l4___3

Found invariant X₄ ≤ X₂ ∧ X₄ ≤ X₀ ∧ 0 ≤ X₄ ∧ 0 ≤ X₂+X₄ ∧ 0 ≤ X₀+X₄ ∧ X₀ ≤ X₄ ∧ 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀ for location n_l5___5

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

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

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