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₁

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 X₃ ≤ 256 ∧ 256 ≤ X₃ ∧ 2+X₀ ≤ 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 X₃ ≤ 0 ∧ 2+X₀ ≤ X₁ for location n_l1___1

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₅₇: 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)}