Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉, X₂₀
Temp_Vars: A1, B1, C1, D1, V, W, X, Y, Z
Locations: l0, l1, l2, l3
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉, X₂₀) → l1(V, W, X, Y, Z, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉, X₂₀)
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉, X₂₀) → l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, 256, V, W, X, Y, Z, B1, C1, D1, X₁₆, X₁₇, X₁₈, X₁₉, X₂₀) :|: 1 ≤ A1 ∧ X₅+1 ≤ X₆ ∧ X₆ ≤ X₅+1 ∧ X₇ ≤ 256 ∧ 256 ≤ X₇
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉, X₂₀) → l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, V, W, X, Y, Z, B1, C1, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉, X₂₀) :|: X₇ ≤ 0 ∧ X₅+1 ≤ X₆ ∧ X₆ ≤ X₅+1
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉, X₂₀) → l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, V, W, X, Y, Z, B1, C1, D1, 256, X₁₇, X₁₈, X₁₉, X₂₀) :|: 1 ≤ A1 ∧ 1+X₅ ≤ X₆ ∧ 2+X₅ ≤ X₆ ∧ X₁₆ ≤ 256 ∧ 256 ≤ X₁₆
t₄: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉, X₂₀) → l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, V, W, X, Y, Z, B1, C1, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉, X₂₀) :|: X₁₆ ≤ 0 ∧ 1+X₅ ≤ X₆ ∧ 2+X₅ ≤ X₆
t₅: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉, X₂₀) → l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, V, W, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, 0, 0, 0, X₂₀) :|: X₆ ≤ X₅
t₆: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉, X₂₀) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, V, W, X, Y, Z, B1, C1, D1, X₁₆, X₇, X₇, X₇, A1) :|: 1 ≤ X₇ ∧ 257 ≤ X₇ ∧ X₅+1 ≤ X₆ ∧ X₆ ≤ X₅+1
t₇: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉, X₂₀) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, V, W, X, Y, Z, B1, C1, D1, X₁₆, X₇, X₇, X₇, A1) :|: 1 ≤ X₇ ∧ X₇ ≤ 255 ∧ X₅+1 ≤ X₆ ∧ X₆ ≤ X₅+1
t₈: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉, X₂₀) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, V, W, X, Y, Z, B1, C1, D1, X₁₆, X₁₆, X₁₆, X₁₆, A1) :|: 1 ≤ X₁₆ ∧ 257 ≤ X₁₆ ∧ 1+X₅ ≤ X₆ ∧ 2+X₅ ≤ X₆
t₉: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉, X₂₀) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, V, W, X, Y, Z, B1, C1, D1, X₁₆, X₁₆, X₁₆, X₁₆, A1) :|: 1 ≤ X₁₆ ∧ X₁₆ ≤ 255 ∧ 1+X₅ ≤ X₆ ∧ 2+X₅ ≤ X₆

Preprocessing

Eliminate variables {B1,C1,D1,V,W,X,Y,Z,X₀,X₁,X₂,X₃,X₄,X₈,X₉,X₁₀,X₁₁,X₁₂,X₁₃,X₁₄,X₁₅,X₁₇,X₁₈,X₁₉,X₂₀} that do not contribute to the problem

Found invariant X₆ ≤ X₅ for location l2

Found invariant 1+X₅ ≤ X₆ for location l3

Problem after Preprocessing

Start: l0
Program_Vars: X₅, X₆, X₇, X₁₆
Temp_Vars: A1
Locations: l0, l1, l2, l3
Transitions:
t₅₆: l0(X₅, X₆, X₇, X₁₆) → l1(X₅, X₆, X₇, X₁₆)
t₅₇: l1(X₅, X₆, X₇, X₁₆) → l1(X₅, X₆, 256, X₁₆) :|: 1 ≤ A1 ∧ X₅+1 ≤ X₆ ∧ X₆ ≤ X₅+1 ∧ X₇ ≤ 256 ∧ 256 ≤ X₇
t₅₈: l1(X₅, X₆, X₇, X₁₆) → l1(X₅, X₆, X₇, X₁₆) :|: X₇ ≤ 0 ∧ X₅+1 ≤ X₆ ∧ X₆ ≤ X₅+1
t₅₉: l1(X₅, X₆, X₇, X₁₆) → l1(X₅, X₆, X₇, 256) :|: 1 ≤ A1 ∧ 1+X₅ ≤ X₆ ∧ 2+X₅ ≤ X₆ ∧ X₁₆ ≤ 256 ∧ 256 ≤ X₁₆
t₆₀: l1(X₅, X₆, X₇, X₁₆) → l1(X₅, X₆, X₇, X₁₆) :|: X₁₆ ≤ 0 ∧ 1+X₅ ≤ X₆ ∧ 2+X₅ ≤ X₆
t₆₁: l1(X₅, X₆, X₇, X₁₆) → l2(X₅, X₆, X₇, X₁₆) :|: X₆ ≤ X₅
t₆₂: l1(X₅, X₆, X₇, X₁₆) → l3(X₅, X₆, X₇, X₁₆) :|: 1 ≤ X₇ ∧ 257 ≤ X₇ ∧ X₅+1 ≤ X₆ ∧ X₆ ≤ X₅+1
t₆₃: l1(X₅, X₆, X₇, X₁₆) → l3(X₅, X₆, X₇, X₁₆) :|: 1 ≤ X₇ ∧ X₇ ≤ 255 ∧ X₅+1 ≤ X₆ ∧ X₆ ≤ X₅+1
t₆₄: l1(X₅, X₆, X₇, X₁₆) → l3(X₅, X₆, X₇, X₁₆) :|: 1 ≤ X₁₆ ∧ 257 ≤ X₁₆ ∧ 1+X₅ ≤ X₆ ∧ 2+X₅ ≤ X₆
t₆₅: l1(X₅, X₆, X₇, X₁₆) → l3(X₅, X₆, X₇, X₁₆) :|: 1 ≤ X₁₆ ∧ X₁₆ ≤ 255 ∧ 1+X₅ ≤ X₆ ∧ 2+X₅ ≤ X₆

Found invariant X₆ ≤ X₅ for location l2

Found invariant 1+X₅ ≤ X₆ for location l3

Analysing control-flow refined program

Found invariant X₆ ≤ X₅ for location l2

Found invariant X₇ ≤ 256 ∧ 256 ≤ X₇ ∧ X₆ ≤ 1+X₅ ∧ 1+X₅ ≤ X₆ for location n_l1___4

Found invariant 2+X₅ ≤ X₆ ∧ X₁₆ ≤ 256 ∧ 256 ≤ X₁₆ for location n_l1___2

Found invariant X₇ ≤ 0 ∧ X₆ ≤ 1+X₅ ∧ 1+X₅ ≤ X₆ for location n_l1___3

Found invariant 1+X₅ ≤ X₆ for location l3

Found invariant 2+X₅ ≤ X₆ ∧ X₁₆ ≤ 0 for location n_l1___1

Found invariant X₆ ≤ X₅ for location l2

Found invariant X₇ ≤ 256 ∧ 256 ≤ X₇ ∧ X₆ ≤ 1+X₅ ∧ 1+X₅ ≤ X₆ for location n_l1___4

Found invariant 2+X₅ ≤ X₆ ∧ X₁₆ ≤ 256 ∧ 256 ≤ X₁₆ for location n_l1___2

Found invariant X₇ ≤ 0 ∧ X₆ ≤ 1+X₅ ∧ 1+X₅ ≤ X₆ for location n_l1___3

Found invariant 1+X₅ ≤ X₆ for location l3

Found invariant 2+X₅ ≤ X₆ ∧ X₁₆ ≤ 0 for location n_l1___1

Found invariant X₆ ≤ X₅ for location l2

Found invariant X₇ ≤ 256 ∧ 256 ≤ X₇ ∧ X₆ ≤ 1+X₅ ∧ 1+X₅ ≤ X₆ for location n_l1___4

Found invariant 2+X₅ ≤ X₆ ∧ X₁₆ ≤ 256 ∧ 256 ≤ X₁₆ for location n_l1___2

Found invariant X₇ ≤ 0 ∧ X₆ ≤ 1+X₅ ∧ 1+X₅ ≤ X₆ for location n_l1___3

Found invariant 1+X₅ ≤ X₆ for location l3

Found invariant 2+X₅ ≤ X₆ ∧ X₁₆ ≤ 0 for location n_l1___1

Found invariant X₆ ≤ X₅ for location l2

Found invariant X₇ ≤ 256 ∧ 256 ≤ X₇ ∧ X₆ ≤ 1+X₅ ∧ 1+X₅ ≤ X₆ for location n_l1___4

Found invariant 2+X₅ ≤ X₆ ∧ X₁₆ ≤ 256 ∧ 256 ≤ X₁₆ for location n_l1___2

Found invariant X₇ ≤ 0 ∧ X₆ ≤ 1+X₅ ∧ 1+X₅ ≤ X₆ for location n_l1___3

Found invariant 1+X₅ ≤ X₆ for location l3

Found invariant 2+X₅ ≤ X₆ ∧ X₁₆ ≤ 0 for location n_l1___1

Found invariant X₆ ≤ X₅ for location l2

Found invariant X₇ ≤ 256 ∧ 256 ≤ X₇ ∧ X₆ ≤ 1+X₅ ∧ 1+X₅ ≤ X₆ for location n_l1___4

Found invariant 2+X₅ ≤ X₆ ∧ X₁₆ ≤ 256 ∧ 256 ≤ X₁₆ for location n_l1___2

Found invariant X₇ ≤ 0 ∧ X₆ ≤ 1+X₅ ∧ 1+X₅ ≤ X₆ for location n_l1___3

Found invariant 1+X₅ ≤ X₆ for location l3

Found invariant 2+X₅ ≤ X₆ ∧ X₁₆ ≤ 0 for location n_l1___1

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

Costbounds

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

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₇: 256 {O(1)}
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₆: X₆ {O(n)}
t₅₉, X₇: X₇ {O(n)}
t₅₉, X₁₆: 256 {O(1)}
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₇: 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₅: X₅ {O(n)}
t₆₃, X₆: X₆ {O(n)}
t₆₃, X₇: 255 {O(1)}
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₆: X₆ {O(n)}
t₆₅, X₇: X₇ {O(n)}
t₆₅, X₁₆: 255 {O(1)}