Initial Problem

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

Preprocessing

Found invariant X₁ ≤ 6 ∧ X₁ ≤ 5+X₀ ∧ X₀+X₁ ≤ 11 ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ 4+X₁ ∧ X₀ ≤ 5 ∧ 1 ≤ X₀ for location l2

Found invariant X₂ ≤ 6 ∧ X₂ ≤ 5+X₁ ∧ X₁+X₂ ≤ 11 ∧ X₂ ≤ 5+X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ 4+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ 5 ∧ X₁ ≤ 4+X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l6

Found invariant 6 ≤ X₀ for location l5

Found invariant X₀ ≤ 6 ∧ 1 ≤ X₀ for location l1

Found invariant X₁ ≤ 6 ∧ X₁ ≤ 5+X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l4

Found invariant 1 ≤ X₀ for location l3

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5, l6
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(1, X₁, X₂)
t₁: l1(X₀, X₁, X₂) → l2(X₀, 1, X₂) :|: X₀ ≤ 5 ∧ X₀ ≤ 6 ∧ 1 ≤ X₀
t₁₀: l1(X₀, X₁, X₂) → l3(1, X₁, X₂) :|: 6 ≤ X₀ ∧ X₀ ≤ 6 ∧ 1 ≤ X₀
t₉: l2(X₀, X₁, X₂) → l1(X₀+1, X₁, X₂) :|: 6 ≤ X₁ ∧ X₁ ≤ 6 ∧ X₁ ≤ 5+X₀ ∧ X₀+X₁ ≤ 11 ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ 4+X₁ ∧ X₀ ≤ 5 ∧ 1 ≤ X₀
t₂: l2(X₀, X₁, X₂) → l2(X₀, X₁+1, X₂) :|: X₁ ≤ 5 ∧ X₁ ≤ 6 ∧ X₁ ≤ 5+X₀ ∧ X₀+X₁ ≤ 11 ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ 4+X₁ ∧ X₀ ≤ 5 ∧ 1 ≤ X₀
t₃: l3(X₀, X₁, X₂) → l4(X₀, 1, X₂) :|: X₀ ≤ 5 ∧ 1 ≤ X₀
t₈: l3(X₀, X₁, X₂) → l5(X₀, X₁, X₂) :|: 6 ≤ X₀ ∧ 1 ≤ X₀
t₇: l4(X₀, X₁, X₂) → l3(X₀+1, X₁, X₂) :|: 6 ≤ X₁ ∧ X₁ ≤ 6 ∧ X₁ ≤ 5+X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₄: l4(X₀, X₁, X₂) → l6(X₀, X₁, 1) :|: X₁ ≤ 5 ∧ X₁ ≤ 6 ∧ X₁ ≤ 5+X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₆: l6(X₀, X₁, X₂) → l4(X₀, X₁+1, X₂) :|: 6 ≤ X₂ ∧ X₂ ≤ 6 ∧ X₂ ≤ 5+X₁ ∧ X₁+X₂ ≤ 11 ∧ X₂ ≤ 5+X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ 4+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ 5 ∧ X₁ ≤ 4+X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₅: l6(X₀, X₁, X₂) → l6(X₀, X₁, X₂+1) :|: X₂ ≤ 5 ∧ X₂ ≤ 6 ∧ X₂ ≤ 5+X₁ ∧ X₁+X₂ ≤ 11 ∧ X₂ ≤ 5+X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ 4+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ 5 ∧ X₁ ≤ 4+X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀

Analysing control-flow refined program

Cut unsatisfiable transition t₁₀: l1→l3

Found invariant X₂ ≤ 6 ∧ X₂ ≤ 5+X₁ ∧ X₁+X₂ ≤ 11 ∧ X₂ ≤ 5+X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ 4+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ 5 ∧ X₁ ≤ 4+X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l6

Found invariant X₁ ≤ 6 ∧ X₁ ≤ 5+X₀ ∧ X₀+X₁ ≤ 11 ∧ 3 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ 2+X₁ ∧ X₀ ≤ 5 ∧ 1 ≤ X₀ for location n_l2___2

Found invariant X₁ ≤ 2 ∧ X₁ ≤ 1+X₀ ∧ X₀+X₁ ≤ 7 ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ X₀ ≤ 3+X₁ ∧ X₀ ≤ 5 ∧ 1 ≤ X₀ for location n_l2___3

Found invariant X₁ ≤ 6 ∧ X₁ ≤ X₀ ∧ 6 ≤ X₁ ∧ 12 ≤ X₀+X₁ ∧ 6 ≤ X₀ for location l5

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

Found invariant X₁ ≤ 6 ∧ X₁ ≤ 5+X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l4

Found invariant X₁ ≤ 6 ∧ X₁ ≤ 5+X₀ ∧ 6 ≤ X₁ ∧ 7 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l3

Found invariant X₁ ≤ 6 ∧ X₁ ≤ 4+X₀ ∧ X₀+X₁ ≤ 12 ∧ 6 ≤ X₁ ∧ 8 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 6 ∧ 2 ≤ X₀ for location n_l1___1

Found invariant X₁ ≤ 1 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 6 ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ 4+X₁ ∧ X₀ ≤ 5 ∧ 1 ≤ 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₂ ≤ 6 ∧ X₂ ≤ 5+X₁ ∧ X₁+X₂ ≤ 11 ∧ X₂ ≤ 5+X₀ ∧ 3 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ X₁ ≤ 2+X₂ ∧ 4 ≤ X₀+X₂ ∧ X₁ ≤ 5 ∧ X₁ ≤ 4+X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l6___3

Found invariant X₁ ≤ 6 ∧ X₁ ≤ 5+X₀ ∧ X₀+X₁ ≤ 11 ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ 4+X₁ ∧ X₀ ≤ 5 ∧ 1 ≤ X₀ for location l2

Found invariant X₂ ≤ 1 ∧ X₂ ≤ X₁ ∧ X₁+X₂ ≤ 6 ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ 4+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ 5 ∧ X₁ ≤ 4+X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l6___5

Found invariant X₁ ≤ 1 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 6 ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ 4+X₁ ∧ X₀ ≤ 5 ∧ 1 ≤ X₀ for location n_l4___6

Found invariant X₂ ≤ 2 ∧ X₂ ≤ 1+X₁ ∧ X₁+X₂ ≤ 7 ∧ X₂ ≤ 1+X₀ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ X₁ ≤ 3+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ 5 ∧ X₁ ≤ 4+X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l6___4

Found invariant X₂ ≤ 6 ∧ X₂ ≤ 4+X₁ ∧ X₁+X₂ ≤ 12 ∧ X₂ ≤ 5+X₀ ∧ 6 ≤ X₂ ∧ 8 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 7 ≤ X₀+X₂ ∧ X₁ ≤ 6 ∧ X₁ ≤ 5+X₀ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l4___2

Found invariant X₂ ≤ 6 ∧ X₂ ≤ X₁ ∧ X₁+X₂ ≤ 12 ∧ X₂ ≤ X₀ ∧ 6 ≤ X₂ ∧ 12 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 12 ≤ X₀+X₂ ∧ X₁ ≤ 6 ∧ X₁ ≤ X₀ ∧ 6 ≤ X₁ ∧ 12 ≤ X₀+X₁ ∧ 6 ≤ X₀ for location l5

Found invariant X₀ ≤ 6 ∧ 1 ≤ X₀ for location l1

Found invariant X₂ ≤ 6 ∧ X₂ ≤ X₁ ∧ X₁+X₂ ≤ 12 ∧ X₂ ≤ 4+X₀ ∧ 6 ≤ X₂ ∧ 12 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 8 ≤ X₀+X₂ ∧ X₁ ≤ 6 ∧ X₁ ≤ 4+X₀ ∧ 6 ≤ X₁ ∧ 8 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l3___1

Found invariant X₀ ≤ 1 ∧ 1 ≤ 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}
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}
t₆: inf {Infinity}

Sizebounds

t₀, X₀: 1 {O(1)}
t₀, X₁: X₁ {O(n)}
t₀, X₂: X₂ {O(n)}
t₁, X₀: 5 {O(1)}
t₁, X₁: 1 {O(1)}
t₁, X₂: X₂ {O(n)}
t₁₀, X₀: 1 {O(1)}
t₁₀, X₁: 6 {O(1)}
t₁₀, X₂: X₂ {O(n)}
t₂, X₀: 5 {O(1)}
t₂, X₁: 6 {O(1)}
t₂, X₂: X₂ {O(n)}
t₉, X₀: 6 {O(1)}
t₉, X₁: 6 {O(1)}
t₉, X₂: X₂ {O(n)}
t₃, X₀: 5 {O(1)}
t₃, X₁: 1 {O(1)}
t₃, X₂: X₂+6 {O(n)}
t₈, X₀: 6 {O(1)}
t₈, X₁: 6 {O(1)}
t₈, X₂: 6 {O(1)}
t₄, X₀: 5 {O(1)}
t₄, X₁: 5 {O(1)}
t₄, X₂: 1 {O(1)}
t₇, X₀: 6 {O(1)}
t₇, X₁: 6 {O(1)}
t₇, X₂: 6 {O(1)}
t₅, X₀: 5 {O(1)}
t₅, X₁: 5 {O(1)}
t₅, X₂: 6 {O(1)}
t₆, X₀: 5 {O(1)}
t₆, X₁: 6 {O(1)}
t₆, X₂: 6 {O(1)}