Initial Problem

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

Preprocessing

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

Found invariant X₁ ≤ 1 ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location l6

Found invariant X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location l7

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

Found invariant X₁ ≤ 1 ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location l8

Found invariant X₀ ≤ 1 for location l10

Found invariant X₀ ≤ 1 for location l4

Found invariant 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location l9

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

Cut unsatisfiable transition t₄₁: l8→l6

Problem after Preprocessing

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

Chain transitions t₃₈: l6→l1 and t₃₁: l1→l4 to t₁₆₆: l6→l4

Chain transitions t₃₆: l5→l1 and t₃₁: l1→l4 to t₁₆₇: l5→l4

Chain transitions t₃₆: l5→l1 and t₃₀: l1→l3 to t₁₆₈: l5→l3

Chain transitions t₃₈: l6→l1 and t₃₀: l1→l3 to t₁₆₉: l6→l3

Chain transitions t₃₂: l2→l1 and t₃₀: l1→l3 to t₁₇₀: l2→l3

Chain transitions t₃₂: l2→l1 and t₃₁: l1→l4 to t₁₇₁: l2→l4

Chain transitions t₃₉: l7→l3 and t₃₄: l3→l8 to t₁₇₂: l7→l8

Chain transitions t₁₆₉: l6→l3 and t₃₄: l3→l8 to t₁₇₃: l6→l8

Chain transitions t₁₆₉: l6→l3 and t₃₃: l3→l7 to t₁₇₄: l6→l7

Chain transitions t₃₉: l7→l3 and t₃₃: l3→l7 to t₁₇₅: l7→l7

Chain transitions t₁₆₈: l5→l3 and t₃₃: l3→l7 to t₁₇₆: l5→l7

Chain transitions t₁₆₈: l5→l3 and t₃₄: l3→l8 to t₁₇₇: l5→l8

Chain transitions t₁₇₀: l2→l3 and t₃₃: l3→l7 to t₁₇₈: l2→l7

Chain transitions t₁₇₀: l2→l3 and t₃₄: l3→l8 to t₁₇₉: l2→l8

Chain transitions t₄₃: l9→l5 and t₃₇: l5→l9 to t₁₈₀: l9→l9

Chain transitions t₄₀: l8→l5 and t₃₇: l5→l9 to t₁₈₁: l8→l9

Chain transitions t₄₀: l8→l5 and t₁₇₇: l5→l8 to t₁₈₂: l8→l8

Chain transitions t₄₃: l9→l5 and t₁₇₇: l5→l8 to t₁₈₃: l9→l8

Chain transitions t₄₀: l8→l5 and t₁₇₆: l5→l7 to t₁₈₄: l8→l7

Chain transitions t₄₃: l9→l5 and t₁₇₆: l5→l7 to t₁₈₅: l9→l7

Chain transitions t₄₀: l8→l5 and t₁₆₇: l5→l4 to t₁₈₆: l8→l4

Chain transitions t₄₃: l9→l5 and t₁₆₇: l5→l4 to t₁₈₇: l9→l4

Chain transitions t₄₀: l8→l5 and t₁₆₈: l5→l3 to t₁₈₈: l8→l3

Chain transitions t₄₃: l9→l5 and t₁₆₈: l5→l3 to t₁₈₉: l9→l3

Chain transitions t₄₀: l8→l5 and t₃₆: l5→l1 to t₁₉₀: l8→l1

Chain transitions t₄₃: l9→l5 and t₃₆: l5→l1 to t₁₉₁: l9→l1

Chain transitions t₄₂: l8→l6 and t₁₇₃: l6→l8 to t₁₉₂: l8→l8

Chain transitions t₄₂: l8→l6 and t₁₇₄: l6→l7 to t₁₉₃: l8→l7

Chain transitions t₄₂: l8→l6 and t₁₆₆: l6→l4 to t₁₉₄: l8→l4

Chain transitions t₄₂: l8→l6 and t₁₆₉: l6→l3 to t₁₉₅: l8→l3

Chain transitions t₄₂: l8→l6 and t₃₈: l6→l1 to t₁₉₆: l8→l1

Analysing control-flow refined program

Cut unsatisfiable transition t₁₇₉: l2→l8

Cut unsatisfiable transition t₁₈₂: l8→l8

Cut unsatisfiable transition t₁₈₃: l9→l8

Cut unsatisfiable transition t₁₈₄: l8→l7

Cut unsatisfiable transition t₁₈₆: l8→l4

Cut unsatisfiable transition t₁₈₈: l8→l3

Cut unsatisfiable transition t₁₉₀: l8→l1

Cut unsatisfiable transition t₁₉₂: l8→l8

Cut unsatisfiable transition t₁₉₄: l8→l4

Found invariant 2 ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 5 ≤ X₀+X₃ ∧ X₁ ≤ 1 ∧ 2+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location l6

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

Found invariant 2 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 2+X₁ ≤ X₃ ∧ 4 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location l5

Found invariant 2 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 4 ≤ X₀+X₃ ∧ X₁ ≤ 1 ∧ 2+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location l8

Found invariant X₀ ≤ X₃ ∧ X₀ ≤ 1 for location l10

Found invariant X₀ ≤ X₃ ∧ X₀ ≤ 1 for location l4

Found invariant 2 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ 2+X₁ ≤ X₃ ∧ 4 ≤ X₀+X₃ ∧ 2+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location l9

Found invariant 2 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 4 ≤ X₀+X₃ ∧ 0 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ 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

Cut unsatisfiable transition t₄₄₈: n_l1___3→l4

Found invariant X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₁+X₂ ≤ 0 ∧ 2+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l5___9

Found invariant 2+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 4 ≤ X₀+X₂ ∧ X₁ ≤ 0 ∧ 3+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location n_l9___4

Found invariant X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₁+X₂ ≤ 0 ∧ 2+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l9___7

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

Found invariant 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l5___6

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

Found invariant X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l3___14

Found invariant X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l7___13

Found invariant X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1+X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l1___5

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

Found invariant X₁ ≤ 1 ∧ 2+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location n_l6___8

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

Found invariant X₀ ≤ 1 for location l10

Found invariant X₀ ≤ 1 for location l4

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

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

Found invariant X₁ ≤ 1 ∧ 2+X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l8___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₃₁: 1 {O(1)}
t₃₂: 1 {O(1)}
t₃₃: inf {Infinity}
t₃₄: 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₄₃: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
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)}
t₃₆: inf {Infinity}
t₃₇: inf {Infinity}
t₃₈: inf {Infinity}
t₃₉: inf {Infinity}
t₄₀: inf {Infinity}
t₄₂: inf {Infinity}
t₄₃: inf {Infinity}

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