Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆
Temp_Vars: R, S
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₉: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l1(0, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, 0, X₁₅, X₁₆)
t₀: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l2(X₀, 0, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) :|: X₀ ≤ 9
t₈: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l3(X₀, X₁, 0, X₃, 0, 0, 0, 0, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, 1000) :|: 10 ≤ X₀
t₇: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l1(X₀+1, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) :|: 10 ≤ X₁
t₆: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l2(X₀, X₁+1, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, S, S, X₁₆) :|: X₁ ≤ 9
t₁: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l4(X₀, X₁, X₂, 0, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) :|: X₂ ≤ 9
t₅: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₄, X₅, X₆, X₇, 1500, S, X₁₄, X₁₅, X₁₆) :|: 10 ≤ X₂
t₄: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l3(X₀, X₁, X₂+1, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) :|: 10 ≤ X₃
t₂: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l4(X₀, X₁, X₂, X₃+1, X₄+S, X₅+1, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) :|: X₃ ≤ 9 ∧ R+1 ≤ 0
t₃: l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) → l4(X₀, X₁, X₂, X₃+1, X₄, X₅, X₆+S, X₇+1, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆) :|: X₃ ≤ 9

Preprocessing

Eliminate variables {S,X₄,X₅,X₆,X₇,X₈,X₉,X₁₀,X₁₁,X₁₂,X₁₃,X₁₄,X₁₅,X₁₆} that do not contribute to the problem

Found invariant X₁ ≤ 10 ∧ X₁ ≤ 10+X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l2

Found invariant 10 ≤ X₂ ∧ 20 ≤ X₀+X₂ ∧ 10 ≤ X₀ for location l5

Found invariant 0 ≤ X₀ for location l1

Found invariant X₃ ≤ 10 ∧ X₃ ≤ 10+X₂ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 10 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 10 ≤ X₀+X₂ ∧ 10 ≤ X₀ for location l4

Found invariant 0 ≤ X₂ ∧ 10 ≤ X₀+X₂ ∧ 10 ≤ X₀ for location l3

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: R
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₂₂: l0(X₀, X₁, X₂, X₃) → l1(0, X₁, X₂, X₃)
t₂₃: l1(X₀, X₁, X₂, X₃) → l2(X₀, 0, X₂, X₃) :|: X₀ ≤ 9 ∧ 0 ≤ X₀
t₂₄: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, 0, X₃) :|: 10 ≤ X₀ ∧ 0 ≤ X₀
t₂₆: l2(X₀, X₁, X₂, X₃) → l1(X₀+1, X₁, X₂, X₃) :|: 10 ≤ X₁ ∧ X₁ ≤ 10 ∧ X₁ ≤ 10+X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₂₅: l2(X₀, X₁, X₂, X₃) → l2(X₀, X₁+1, X₂, X₃) :|: X₁ ≤ 9 ∧ X₁ ≤ 10 ∧ X₁ ≤ 10+X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₂₇: l3(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, 0) :|: X₂ ≤ 9 ∧ 0 ≤ X₂ ∧ 10 ≤ X₀+X₂ ∧ 10 ≤ X₀
t₂₈: l3(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: 10 ≤ X₂ ∧ 0 ≤ X₂ ∧ 10 ≤ X₀+X₂ ∧ 10 ≤ X₀
t₃₁: l4(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂+1, X₃) :|: 10 ≤ X₃ ∧ X₃ ≤ 10 ∧ X₃ ≤ 10+X₂ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 10 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 10 ≤ X₀+X₂ ∧ 10 ≤ X₀
t₂₉: l4(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃+1) :|: X₃ ≤ 9 ∧ R+1 ≤ 0 ∧ X₃ ≤ 10 ∧ X₃ ≤ 10+X₂ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 10 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 10 ≤ X₀+X₂ ∧ 10 ≤ X₀
t₃₀: l4(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃+1) :|: X₃ ≤ 9 ∧ X₃ ≤ 10 ∧ X₃ ≤ 10+X₂ ∧ X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 10 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 10 ≤ X₀+X₂ ∧ 10 ≤ X₀

Analysing control-flow refined program

Cut unsatisfiable transition t₂₄: l1→l3

Found invariant X₁ ≤ 10 ∧ X₁ ≤ 10+X₀ ∧ 2 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location n_l2___2

Found invariant X₁ ≤ 1 ∧ X₁ ≤ 1+X₀ ∧ X₀+X₁ ≤ 10 ∧ 1 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 8+X₁ ∧ X₀ ≤ 9 ∧ 0 ≤ X₀ for location n_l2___3

Found invariant 10 ≤ X₂ ∧ 20 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 20 ≤ X₀+X₂ ∧ X₁ ≤ 10 ∧ X₁ ≤ X₀ ∧ 10 ≤ X₁ ∧ 20 ≤ X₀+X₁ ∧ 10 ≤ X₀ for location l5

Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l1

Found invariant X₃ ≤ 10 ∧ X₃ ≤ 10+X₂ ∧ X₃ ≤ X₁ ∧ X₁+X₃ ≤ 20 ∧ X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ 10 ≤ X₁+X₃ ∧ X₁ ≤ 10+X₃ ∧ 10 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 10 ≤ X₁+X₂ ∧ X₁ ≤ 10+X₂ ∧ 10 ≤ X₀+X₂ ∧ X₁ ≤ 10 ∧ X₁ ≤ X₀ ∧ 10 ≤ X₁ ∧ 20 ≤ X₀+X₁ ∧ 10 ≤ X₀ for location l4

Found invariant 0 ≤ X₂ ∧ 10 ≤ X₁+X₂ ∧ X₁ ≤ 10+X₂ ∧ 10 ≤ X₀+X₂ ∧ X₁ ≤ 10 ∧ X₁ ≤ X₀ ∧ 10 ≤ X₁ ∧ 20 ≤ X₀+X₁ ∧ 10 ≤ X₀ for location l3

Found invariant X₁ ≤ 10 ∧ X₁ ≤ 9+X₀ ∧ 10 ≤ X₁ ∧ 11 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l1___1

Found invariant X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 9 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ 9+X₁ ∧ X₀ ≤ 9 ∧ 0 ≤ X₀ for location n_l2___4

CFR did not improve the program. Rolling back

Analysing control-flow refined program

Cut unsatisfiable transition t₂₈: l3→l5

Found invariant X₁ ≤ 10 ∧ X₁ ≤ 10+X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l2

Found invariant X₃ ≤ 1 ∧ X₃ ≤ 1+X₂ ∧ X₂+X₃ ≤ 10 ∧ 9+X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ X₂ ≤ 8+X₃ ∧ 11 ≤ X₀+X₃ ∧ X₂ ≤ 9 ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 10 ≤ X₀+X₂ ∧ 10 ≤ X₀ for location n_l4___3

Found invariant X₃ ≤ 10 ∧ X₃ ≤ 10+X₂ ∧ X₃ ≤ X₀ ∧ 2 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 12 ≤ X₀+X₃ ∧ 0 ≤ X₂ ∧ 10 ≤ X₀+X₂ ∧ 10 ≤ X₀ for location n_l4___2

Found invariant X₃ ≤ 0 ∧ X₃ ≤ X₂ ∧ X₂+X₃ ≤ 9 ∧ 10+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ 9+X₃ ∧ 10 ≤ X₀+X₃ ∧ X₂ ≤ 9 ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 10 ≤ X₀+X₂ ∧ 10 ≤ X₀ for location n_l4___4

Found invariant X₃ ≤ 10 ∧ X₃ ≤ X₂ ∧ X₃ ≤ X₀ ∧ 10 ≤ X₃ ∧ 20 ≤ X₂+X₃ ∧ 20 ≤ X₀+X₃ ∧ 10 ≤ X₂ ∧ 20 ≤ X₀+X₂ ∧ 10 ≤ X₀ for location l5

Found invariant 0 ≤ X₀ for location l1

Found invariant X₃ ≤ 10 ∧ X₃ ≤ 9+X₂ ∧ X₃ ≤ X₀ ∧ 10 ≤ X₃ ∧ 11 ≤ X₂+X₃ ∧ 20 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 11 ≤ X₀+X₂ ∧ 10 ≤ X₀ for location n_l3___1

Found invariant X₂ ≤ 0 ∧ 10+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 10 ≤ X₀+X₂ ∧ 10 ≤ X₀ for location l3

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₂₅: inf {Infinity}
t₂₆: inf {Infinity}
t₂₇: inf {Infinity}
t₂₈: 1 {O(1)}
t₂₉: inf {Infinity}
t₃₀: inf {Infinity}
t₃₁: inf {Infinity}

Costbounds

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

Sizebounds

t₂₂, X₀: 0 {O(1)}
t₂₂, X₁: X₁ {O(n)}
t₂₂, X₂: X₂ {O(n)}
t₂₂, X₃: X₃ {O(n)}
t₂₃, X₀: 9 {O(1)}
t₂₃, X₁: 0 {O(1)}
t₂₃, X₂: X₂ {O(n)}
t₂₃, X₃: X₃ {O(n)}
t₂₄, X₀: 10 {O(1)}
t₂₄, X₁: 10 {O(1)}
t₂₄, X₂: 0 {O(1)}
t₂₄, X₃: X₃ {O(n)}
t₂₅, X₀: 9 {O(1)}
t₂₅, X₁: 10 {O(1)}
t₂₅, X₂: X₂ {O(n)}
t₂₅, X₃: X₃ {O(n)}
t₂₆, X₀: 10 {O(1)}
t₂₆, X₁: 10 {O(1)}
t₂₆, X₂: X₂ {O(n)}
t₂₆, X₃: X₃ {O(n)}
t₂₇, X₀: 10 {O(1)}
t₂₇, X₁: 10 {O(1)}
t₂₇, X₂: 9 {O(1)}
t₂₇, X₃: 0 {O(1)}
t₂₈, X₀: 10 {O(1)}
t₂₈, X₁: 10 {O(1)}
t₂₈, X₂: 38 {O(1)}
t₂₈, X₃: 10 {O(1)}
t₂₉, X₀: 10 {O(1)}
t₂₉, X₁: 10 {O(1)}
t₂₉, X₂: 18 {O(1)}
t₂₉, X₃: 10 {O(1)}
t₃₀, X₀: 10 {O(1)}
t₃₀, X₁: 10 {O(1)}
t₃₀, X₂: 18 {O(1)}
t₃₀, X₃: 10 {O(1)}
t₃₁, X₀: 10 {O(1)}
t₃₁, X₁: 10 {O(1)}
t₃₁, X₂: 38 {O(1)}
t₃₁, X₃: 10 {O(1)}