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

Preprocessing

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

Found invariant 1 ≤ X₁ for location l2

Found invariant X₁ ≤ 0 for location l6

Found invariant X₁ ≤ 0 for location l7

Found invariant 1 ≤ X₁ for location l1

Found invariant 1 ≤ X₁ for location l3

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

Analysing control-flow refined program

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

Found invariant X₁ ≤ X₄ ∧ X₁ ≤ 0 for location l6

Found invariant 1 ≤ X₄ for location n_l4___4

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

Found invariant 1 ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2 ≤ X₀+X₄ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l2___3

Found invariant X₁ ≤ X₄ ∧ X₁ ≤ 0 for location l7

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

Found invariant 1 ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2 ≤ X₀+X₄ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l3___2

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

Found invariant 1 ≤ X₄ ∧ 2 ≤ X₁+X₄ ∧ 2 ≤ X₀+X₄ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l1___1

CFR did not improve the program. Rolling back

All Bounds

Timebounds

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

Costbounds

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