Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars: H, I
Locations: l0, l1, l2, l3
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(8, 0, 14, -1, X₄, X₅, X₆)
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀, X₁, X₁-1, I, H, X₅, X₆) :|: X₁ ≤ X₂
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₀, X₁, X₂, X₃, I, X₅, X₆) :|: X₁ ≤ X₂ ∧ H+1 ≤ X₀
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₀, X₁, X₂, X₃, I, X₅, X₆) :|: X₁ ≤ X₂
t₆: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l3(X₀, X₁, X₂, X₃, X₄, X₃, X₃) :|: 1+X₂ ≤ X₁
t₄: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀, X₁, X₄-1, X₃, X₄, X₅, X₆)
t₅: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀, X₄+1, X₂, X₃, X₄, X₅, X₆)

Preprocessing

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

Found invariant X₁ ≤ X₂ ∧ X₀ ≤ 8 ∧ 8 ≤ X₀ for location l2

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

Found invariant 1+X₂ ≤ X₁ ∧ X₀ ≤ 8 ∧ 8 ≤ X₀ for location l3

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₄
Temp_Vars: H, I
Locations: l0, l1, l2, l3
Transitions:
t₁₄: l0(X₀, X₁, X₂, X₄) → l1(8, 0, 14, X₄)
t₁₇: l1(X₀, X₁, X₂, X₄) → l1(X₀, X₁, X₁-1, H) :|: X₁ ≤ X₂ ∧ X₀ ≤ 8 ∧ 8 ≤ X₀
t₁₅: l1(X₀, X₁, X₂, X₄) → l2(X₀, X₁, X₂, I) :|: X₁ ≤ X₂ ∧ H+1 ≤ X₀ ∧ X₀ ≤ 8 ∧ 8 ≤ X₀
t₁₆: l1(X₀, X₁, X₂, X₄) → l2(X₀, X₁, X₂, I) :|: X₁ ≤ X₂ ∧ X₀ ≤ 8 ∧ 8 ≤ X₀
t₁₈: l1(X₀, X₁, X₂, X₄) → l3(X₀, X₁, X₂, X₄) :|: 1+X₂ ≤ X₁ ∧ X₀ ≤ 8 ∧ 8 ≤ X₀
t₁₉: l2(X₀, X₁, X₂, X₄) → l1(X₀, X₁, X₄-1, X₄) :|: X₁ ≤ X₂ ∧ X₀ ≤ 8 ∧ 8 ≤ X₀
t₂₀: l2(X₀, X₁, X₂, X₄) → l1(X₀, X₄+1, X₂, X₄) :|: X₁ ≤ X₂ ∧ X₀ ≤ 8 ∧ 8 ≤ X₀

Analysing control-flow refined program

Cut unsatisfiable transition t₁₈: l1→l3

Found invariant 1+X₄ ≤ X₁ ∧ X₁ ≤ 1+X₄ ∧ X₀ ≤ 8 ∧ 8 ≤ X₀ for location n_l1___2

Found invariant X₄ ≤ 1+X₂ ∧ 1+X₂ ≤ X₄ ∧ X₀ ≤ 8 ∧ 8 ≤ X₀ for location n_l1___3

Found invariant X₁ ≤ X₂ ∧ X₀ ≤ 8 ∧ 8 ≤ X₀ for location n_l2___1

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

Found invariant X₂ ≤ 14 ∧ X₂ ≤ 14+X₁ ∧ X₁+X₂ ≤ 14 ∧ X₂ ≤ 6+X₀ ∧ X₀+X₂ ≤ 22 ∧ 14 ≤ X₂ ∧ 14 ≤ X₁+X₂ ∧ 14+X₁ ≤ X₂ ∧ 22 ≤ X₀+X₂ ∧ 6+X₀ ≤ X₂ ∧ X₁ ≤ 0 ∧ 8+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 8 ∧ 0 ≤ X₁ ∧ 8 ≤ X₀+X₁ ∧ X₀ ≤ 8+X₁ ∧ X₀ ≤ 8 ∧ 8 ≤ X₀ for location l1

Found invariant 1+X₂ ≤ X₁ ∧ X₀ ≤ 8 ∧ 8 ≤ X₀ for location l3

Found invariant X₂ ≤ 14 ∧ X₂ ≤ 14+X₁ ∧ X₁+X₂ ≤ 14 ∧ X₂ ≤ 6+X₀ ∧ X₀+X₂ ≤ 22 ∧ 14 ≤ X₂ ∧ 14 ≤ X₁+X₂ ∧ 14+X₁ ≤ X₂ ∧ 22 ≤ X₀+X₂ ∧ 6+X₀ ≤ X₂ ∧ X₁ ≤ 0 ∧ 8+X₁ ≤ X₀ ∧ X₀+X₁ ≤ 8 ∧ 0 ≤ X₁ ∧ 8 ≤ X₀+X₁ ∧ X₀ ≤ 8+X₁ ∧ X₀ ≤ 8 ∧ 8 ≤ X₀ for location n_l2___4

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

Costbounds

Overall costbound: 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}

Sizebounds

t₁₄, X₀: 8 {O(1)}
t₁₄, X₁: 0 {O(1)}
t₁₄, X₂: 14 {O(1)}
t₁₄, X₄: X₄ {O(n)}
t₁₅, X₀: 8 {O(1)}
t₁₆, X₀: 8 {O(1)}
t₁₇, X₀: 8 {O(1)}
t₁₈, X₀: 8 {O(1)}
t₁₉, X₀: 8 {O(1)}
t₂₀, X₀: 8 {O(1)}