Initial Problem

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

Preprocessing

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

Found invariant 1+X₁ ≤ X₀ for location l2

Found invariant 1+X₁ ≤ X₀ for location l5

Found invariant X₀ ≤ X₁ for location l8

Found invariant 1+X₁ ≤ X₀ for location l1

Found invariant 1+X₁ ≤ X₀ for location l4

Found invariant X₀ ≤ X₁ for location l9

Found invariant 1+X₁ ≤ X₀ for location l3

Problem after Preprocessing

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

Chain transitions t₂₄: l3→l1 and t₂₂: l1→l4 to t₆₆: l3→l4

Chain transitions t₂₇: l6→l2 and t₂₃: l2→l3 to t₆₇: l6→l3

Chain transitions t₆₇: l6→l3 and t₆₆: l3→l4 to t₆₈: l6→l4

Chain transitions t₆₇: l6→l3 and t₂₄: l3→l1 to t₆₉: l6→l1

Chain transitions t₆₈: l6→l4 and t₂₅: l4→l5 to t₇₀: l6→l5

Chain transitions t₇₀: l6→l5 and t₂₆: l5→l6 to t₇₁: l6→l6

Analysing control-flow refined program

Eliminate variables {Temp_Int₃₉₀,X₂,X₃,X₄} that do not contribute to the problem

Found invariant 1+X₁ ≤ X₀ for location l2

Found invariant 1+X₁ ≤ X₀ for location l5

Found invariant X₀ ≤ X₁ for location l8

Found invariant 1+X₁ ≤ X₀ for location l1

Found invariant 1+X₁ ≤ X₀ for location l4

Found invariant X₀ ≤ X₁ for location l9

Found invariant 1+X₁ ≤ X₀ for location l3

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

Analysing control-flow refined program

Found invariant 1+X₆ ≤ X₅ ∧ X₃ ≤ X₀ ∧ X₀ ≤ X₃ for location n_l6___6

Found invariant 1+X₆ ≤ X₅ ∧ 1+X₁ ≤ X₀ for location n_l5___1

Found invariant 1+X₆ ≤ X₅ ∧ X₃ ≤ X₀ ∧ 1+X₁ ≤ X₃ ∧ X₀ ≤ X₃ ∧ 1+X₁ ≤ X₀ for location n_l3___4

Found invariant X₆ ≤ X₁ ∧ X₁ ≤ X₆ ∧ X₅ ≤ X₀ ∧ X₀ ≤ X₅ for location l6

Found invariant 1+X₆ ≤ X₅ ∧ X₆ ≤ X₁ ∧ 1+X₆ ≤ X₀ ∧ X₁ ≤ X₆ ∧ X₅ ≤ X₀ ∧ 1+X₁ ≤ X₅ ∧ X₀ ≤ X₅ ∧ 1+X₁ ≤ X₀ for location n_l1___9

Found invariant 1+X₆ ≤ X₅ ∧ X₃ ≤ X₀ ∧ 1+X₁ ≤ X₃ ∧ X₀ ≤ X₃ ∧ 1+X₁ ≤ X₀ for location n_l2___5

Found invariant 1+X₆ ≤ X₅ ∧ 1+X₁ ≤ X₀ for location n_l4___2

Found invariant 1+X₆ ≤ X₅ ∧ X₃ ≤ X₀ ∧ 1+X₁ ≤ X₃ ∧ X₀ ≤ X₃ ∧ 1+X₁ ≤ X₀ for location n_l1___3

Found invariant 1+X₆ ≤ X₅ ∧ X₆ ≤ X₁ ∧ 1+X₆ ≤ X₀ ∧ X₁ ≤ X₆ ∧ X₅ ≤ X₀ ∧ 1+X₁ ≤ X₅ ∧ X₀ ≤ X₅ ∧ 1+X₁ ≤ X₀ for location n_l2___11

Found invariant X₀ ≤ X₁ for location l8

Found invariant 1+X₆ ≤ X₅ ∧ X₆ ≤ X₁ ∧ 1+X₆ ≤ X₀ ∧ X₁ ≤ X₆ ∧ X₅ ≤ X₀ ∧ 1+X₁ ≤ X₅ ∧ X₀ ≤ X₅ ∧ 1+X₁ ≤ X₀ for location n_l5___7

Found invariant X₀ ≤ X₁ for location l9

Found invariant 1+X₆ ≤ X₅ ∧ X₆ ≤ X₁ ∧ 1+X₆ ≤ X₀ ∧ X₁ ≤ X₆ ∧ X₅ ≤ X₀ ∧ 1+X₁ ≤ X₅ ∧ X₀ ≤ X₅ ∧ 1+X₁ ≤ X₀ for location n_l4___8

Found invariant 1+X₆ ≤ X₅ ∧ X₆ ≤ X₁ ∧ 1+X₆ ≤ X₀ ∧ X₁ ≤ X₆ ∧ X₅ ≤ X₀ ∧ 1+X₁ ≤ X₅ ∧ X₀ ≤ X₅ ∧ 1+X₁ ≤ X₀ for location n_l3___10

CFR did not improve the program. Rolling back

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₂₆: 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₂₆: 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₅: 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₅: X₅ {O(n)}
t₂₉, X₆: X₆ {O(n)}
t₃₀, X₅: 2⋅X₅ {O(n)}
t₃₀, X₆: 2⋅X₆ {O(n)}