Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅)
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ < X₁
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ ≤ X₀
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l1(13, 17, X₂, X₃, X₄, X₅)
t₄: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(2, X₀+1, X₂, X₃, X₄, X₅) :|: 2 < X₁
t₅: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(2, X₀+1, X₂, X₃, X₄, X₅) :|: 1 < X₀
t₆: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₁, X₀+1, X₂, X₃, X₄, X₅) :|: X₁ ≤ 2 ∧ X₀ ≤ 1
t₇: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅)

Preprocessing

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

Found invariant 1 ≤ 0 for location l5

Found invariant X₁ ≤ 17 ∧ X₁ ≤ 12+X₀ ∧ X₀+X₁ ≤ 30 ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 13 ∧ 2 ≤ X₀ for location l1

Found invariant 1 ≤ 0 for location l4

Found invariant X₁ ≤ 17 ∧ X₁ ≤ 12+X₀ ∧ X₀+X₁ ≤ 30 ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 13 ∧ 2 ≤ X₀ for location l3

Cut unsatisfiable transition t₁₈: l1→l4

Cut unsatisfiable transition t₂₂: l3→l1

Cut unsatisfiable transition t₂₃: l4→l5

Cut unreachable locations [l4; l5] from the program graph

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2, l3
Transitions:
t₁₆: l0(X₀, X₁) → l2(X₀, X₁)
t₁₇: l1(X₀, X₁) → l3(X₀, X₁) :|: X₀ < X₁ ∧ X₁ ≤ 17 ∧ X₁ ≤ 12+X₀ ∧ X₀+X₁ ≤ 30 ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 13 ∧ 2 ≤ X₀
t₁₉: l2(X₀, X₁) → l1(13, 17)
t₂₀: l3(X₀, X₁) → l1(2, X₀+1) :|: 2 < X₁ ∧ X₁ ≤ 17 ∧ X₁ ≤ 12+X₀ ∧ X₀+X₁ ≤ 30 ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 13 ∧ 2 ≤ X₀
t₂₁: l3(X₀, X₁) → l1(2, X₀+1) :|: 1 < X₀ ∧ X₁ ≤ 17 ∧ X₁ ≤ 12+X₀ ∧ X₀+X₁ ≤ 30 ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 13 ∧ 2 ≤ X₀

Found invariant X₁ ≤ 17 ∧ X₁ ≤ 12+X₀ ∧ X₀+X₁ ≤ 30 ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 13 ∧ 2 ≤ X₀ for location l1

Found invariant X₁ ≤ 17 ∧ X₁ ≤ 12+X₀ ∧ X₀+X₁ ≤ 30 ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 13 ∧ 2 ≤ X₀ for location l3

Analysing control-flow refined program

Found invariant X₁ ≤ 17 ∧ X₁ ≤ 4+X₀ ∧ X₀+X₁ ≤ 30 ∧ 17 ≤ X₁ ∧ 30 ≤ X₀+X₁ ∧ 4+X₀ ≤ X₁ ∧ X₀ ≤ 13 ∧ 13 ≤ X₀ for location n_l3___3

Found invariant X₁ ≤ 14 ∧ X₁ ≤ 12+X₀ ∧ X₀+X₁ ≤ 16 ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 2 ∧ 2 ≤ X₀ for location n_l1___2

Found invariant X₁ ≤ 17 ∧ X₁ ≤ 4+X₀ ∧ X₀+X₁ ≤ 30 ∧ 17 ≤ X₁ ∧ 30 ≤ X₀+X₁ ∧ 4+X₀ ≤ X₁ ∧ X₀ ≤ 13 ∧ 13 ≤ X₀ for location l1

Found invariant X₁ ≤ 14 ∧ X₁ ≤ 12+X₀ ∧ X₀+X₁ ≤ 16 ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 2 ∧ 2 ≤ X₀ for location n_l3___1

Found invariant X₁ ≤ 17 ∧ X₁ ≤ 4+X₀ ∧ X₀+X₁ ≤ 30 ∧ 17 ≤ X₁ ∧ 30 ≤ X₀+X₁ ∧ 4+X₀ ≤ X₁ ∧ X₀ ≤ 13 ∧ 13 ≤ X₀ for location n_l3___3

Found invariant X₁ ≤ 14 ∧ X₁ ≤ 12+X₀ ∧ X₀+X₁ ≤ 16 ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 2 ∧ 2 ≤ X₀ for location n_l1___2

Found invariant X₁ ≤ 17 ∧ X₁ ≤ 4+X₀ ∧ X₀+X₁ ≤ 30 ∧ 17 ≤ X₁ ∧ 30 ≤ X₀+X₁ ∧ 4+X₀ ≤ X₁ ∧ X₀ ≤ 13 ∧ 13 ≤ X₀ for location l1

Found invariant X₁ ≤ 14 ∧ X₁ ≤ 12+X₀ ∧ X₀+X₁ ≤ 16 ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 2 ∧ 2 ≤ X₀ for location n_l3___1

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}

Costbounds

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

Sizebounds

t₁₆, X₀: X₀ {O(n)}
t₁₆, X₁: X₁ {O(n)}
t₁₇, X₀: 13 {O(1)}
t₁₇, X₁: 17 {O(1)}
t₁₉, X₀: 13 {O(1)}
t₁₉, X₁: 17 {O(1)}
t₂₀, X₀: 2 {O(1)}
t₂₀, X₁: 14 {O(1)}
t₂₁, X₀: 2 {O(1)}
t₂₁, X₁: 14 {O(1)}