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₂₀, X₂₁, X₂₂
Temp_Vars: A1, B1, C1, D1, E1, F1, G1, X, Y, Z
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁, 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, 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₂₀, X₂₁, X₂₂) → l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X, Z, A1, B1, C1, D1, X₁₆, X₁₇, X₁₈, X₁₉, X₂₀, X₂₁, X₂₂) :|: Y ≤ 0 ∧ X₉+1 ≤ 0
t₂: l1(X₀, X₁, 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₇, X₈, X₉, X, Z, A1, B1, X₁₄, X₁₅, C1, D1, Y, X₁₉, X₂₀, X₂₁, X₂₂) :|: X₉+1 ≤ 0 ∧ 1 ≤ E1 ∧ 2 ≤ F1
t₃: l1(X₀, X₁, 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₇, X₈, X₉, X, X₁₁, X₁₂, Z, A1, B1, X₁₆, X₁₇, X₁₈, C1, D1, Y, X₂₂) :|: 2+E1 ≤ 0 ∧ 1 ≤ X₉
t₄: l1(X₀, X₁, 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₇, X₈, X₉, X, X₁₁, X₁₂, Z, X₁₄, X₁₅, A1, B1, C1, D1, Y, E1, X₂₂) :|: 1 ≤ X₉ ∧ 0 ≤ F1 ∧ 0 ≤ 1+G1
t₅: l1(X₀, X₁, 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₇, X₈, X₉, X, Z, A1, B1, X₁₄, X₁₅, C1, X₁₇, X₁₈, X₁₉, X₂₀, X₂₁, D1) :|: Y ≤ 1 ∧ X₉+1 ≤ 0 ∧ 1 ≤ E1
t₆: l1(X₀, X₁, 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₇, X₈, X₉, X, X₁₁, X₁₂, Z, X₁₄, X₁₅, A1, X₁₇, X₁₈, B1, C1, D1, Y) :|: E1+1 ≤ 0 ∧ 1 ≤ X₉ ∧ 0 ≤ 1+F1
t₇: l1(X₀, X₁, 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₇, X₈, X₉, X, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, Z, X₂₀, X₂₁, A1) :|: X₉ ≤ 0 ∧ 0 ≤ X₉

Preprocessing

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

Problem after Preprocessing

Start: l0
Program_Vars: X₉
Temp_Vars: E1, F1, G1, Y
Locations: l0, l1, l2
Transitions:
t₂₈: l0(X₉) → l1(X₉)
t₂₉: l1(X₉) → l1(X₉) :|: Y ≤ 0 ∧ X₉+1 ≤ 0
t₃₀: l1(X₉) → l1(X₉) :|: X₉+1 ≤ 0 ∧ 1 ≤ E1 ∧ 2 ≤ F1
t₃₁: l1(X₉) → l1(X₉) :|: 2+E1 ≤ 0 ∧ 1 ≤ X₉
t₃₂: l1(X₉) → l1(X₉) :|: 1 ≤ X₉ ∧ 0 ≤ F1 ∧ 0 ≤ 1+G1
t₃₃: l1(X₉) → l2(X₉) :|: Y ≤ 1 ∧ X₉+1 ≤ 0 ∧ 1 ≤ E1
t₃₄: l1(X₉) → l2(X₉) :|: E1+1 ≤ 0 ∧ 1 ≤ X₉ ∧ 0 ≤ 1+F1
t₃₅: l1(X₉) → l2(X₉) :|: X₉ ≤ 0 ∧ 0 ≤ X₉

Analysing control-flow refined program

Cut unsatisfiable transition t₁₅₁: n_l1___1→l2

Cut unsatisfiable transition t₁₅₀: n_l1___2→l2

Found invariant 1+X₉ ≤ 0 for location n_l1___2

Found invariant 1 ≤ X₉ 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)}

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)}

Sizebounds

t₂₈, X₉: X₉ {O(n)}
t₂₉, X₉: 2⋅X₉ {O(n)}
t₃₀, X₉: 2⋅X₉ {O(n)}
t₃₁, X₉: 2⋅X₉ {O(n)}
t₃₂, X₉: 2⋅X₉ {O(n)}
t₃₃, X₉: 5⋅X₉ {O(n)}
t₃₄, X₉: 5⋅X₉ {O(n)}
t₃₅, X₉: 0 {O(1)}