Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇
Temp_Vars: S, T, U, V, W, X, Y
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₁₇) → l1(S, T, U, V, W, 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₁₇) → l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, 256, S, T, U, V, W, Y, X₁₄, X₁₅, X₁₆, X₁₇) :|: 1+X₅ ≤ X₆ ∧ 1 ≤ 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₁₇) → l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, S, T, U, V, W, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇) :|: 1+X₅ ≤ X₆ ∧ X₇ ≤ 0
t₄: l1(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₇, S, T, U, V, W, Y, X₇, X₇, X₇, X) :|: 1 ≤ X₇ ∧ 1+X₅ ≤ X₆ ∧ 257 ≤ X₇
t₅: l1(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₇, S, T, U, V, W, Y, X₇, X₇, X₇, X) :|: 1 ≤ X₇ ∧ 1+X₅ ≤ X₆ ∧ X₇ ≤ 255
t₃: l1(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₇, S, T, X₁₀, X₁₁, X₁₂, X₁₃, 0, 0, 0, X₁₇) :|: X₆ ≤ X₅
Eliminate variables {S,T,U,V,W,Y,X₀,X₁,X₂,X₃,X₄,X₈,X₉,X₁₀,X₁₁,X₁₂,X₁₃,X₁₄,X₁₅,X₁₆,X₁₇} that do not contribute to the problem
Found invariant 1 ≤ X₂ ∧ 1+X₀ ≤ X₁ for location l2
Found invariant X₁ ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: X
Locations: l0, l1, l2, l3
Transitions:
t₂₁: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₂₂: l1(X₀, X₁, X₂) → l1(X₀, X₁, 256) :|: 1+X₀ ≤ X₁ ∧ 1 ≤ X ∧ X₂ ≤ 256 ∧ 256 ≤ X₂
t₂₃: l1(X₀, X₁, X₂) → l1(X₀, X₁, X₂) :|: 1+X₀ ≤ X₁ ∧ X₂ ≤ 0
t₂₄: l1(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: 1 ≤ X₂ ∧ 1+X₀ ≤ X₁ ∧ 257 ≤ X₂
t₂₅: l1(X₀, X₁, X₂) → l2(X₀, X₁, X₂) :|: 1 ≤ X₂ ∧ 1+X₀ ≤ X₁ ∧ X₂ ≤ 255
t₂₆: l1(X₀, X₁, X₂) → l3(X₀, X₁, X₂) :|: X₁ ≤ X₀
Found invariant 1 ≤ X₂ ∧ 1+X₀ ≤ X₁ for location l2
Found invariant X₂ ≤ 256 ∧ 256 ≤ X₂ ∧ 1+X₀ ≤ X₁ for location n_l1___2
Found invariant X₁ ≤ X₀ for location l3
Found invariant X₂ ≤ 0 ∧ 1+X₀ ≤ X₁ for location n_l1___1
Overall timebound:inf {Infinity}
t₂₁: 1 {O(1)}
t₂₂: inf {Infinity}
t₂₃: inf {Infinity}
t₂₄: 1 {O(1)}
t₂₅: 1 {O(1)}
t₂₆: 1 {O(1)}
Overall costbound: inf {Infinity}
t₂₁: 1 {O(1)}
t₂₂: inf {Infinity}
t₂₃: inf {Infinity}
t₂₄: 1 {O(1)}
t₂₅: 1 {O(1)}
t₂₆: 1 {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₂: 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₂: 255 {O(1)}
t₂₆, X₀: X₀ {O(n)}
t₂₆, X₁: X₁ {O(n)}
t₂₆, X₂: X₂ {O(n)}