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₁₉
Temp_Vars: U, V, W, X, Y
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₁₀: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉) → l1(X₀, X₁, 0, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, 0)
t₉: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉) → l1(X₀+1, X₁, X₂, X₃, 1, X₅, U, V, W, X, X₃, U, U, U, X₁₅, X₁₅, 1, 1, 0, X₁₉) :|: U ≤ 0 ∧ X₀+1 ≤ X₁
t₇: l1(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₃, Y, X₅, U, V, W, X, X₃, U, U, U, X₁₅, 0, Y, Y, 0, X₁₉) :|: X₀+1 ≤ X₁ ∧ U ≤ 0 ∧ 2 ≤ Y
t₈: l1(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₃, Y, X₅, U, V, W, X, X₃, U, U, U, X₁₅, 0, Y, Y, 0, X₁₉) :|: X₀+1 ≤ X₁ ∧ U ≤ 0 ∧ Y ≤ 0
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉) → l3(X₀, X₁, 0, 0, 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₁₉) → l3(X₀, X₁, 0, 0, X₄, X₅, U, V, W, X, X₃, U, U, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉) :|: 1 ≤ U ∧ X₀+1 ≤ X₁
t₃: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉) → l3(X₀, X₁, 0, 0, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉) :|: 3 ≤ X₄
t₄: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉) → l3(X₀, X₁, 0, 0, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉) :|: X₄ ≤ 1
t₅: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉) → l3(X₀, X₁, 0, 0, 2, X₆, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉) :|: X₄ ≤ 2 ∧ 2 ≤ X₄
t₀: l3(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₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉)
t₁: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉) → l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀, X₁₁, X₁₂, X₁₃, X₁₄, X₁₅, X₁₆, X₁₇, X₁₈, X₁₉)

Preprocessing

Cut unreachable locations [l4; l5] from the program graph

Eliminate variables {V,W,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

Found invariant 1+X₀ ≤ X₁ for location l2

Problem after Preprocessing

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

MPRF for transition t₂₅: l1(X₀, X₁, X₂) → l1(X₀+1, X₁, 1) :|: U ≤ 0 ∧ X₀+1 ≤ X₁ of depth 1:

new bound:

X₀+X₁ {O(n)}

Analysing control-flow refined program

Found invariant 1+X₀ ≤ X₁ for location l2

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₂₅: X₀+X₁ {O(n)}
t₂₆: 1 {O(1)}
t₂₇: 1 {O(1)}
t₂₈: 1 {O(1)}
t₂₉: 1 {O(1)}
t₃₀: 1 {O(1)}
t₃₁: 1 {O(1)}
t₃₂: 1 {O(1)}
t₃₃: inf {Infinity}

Costbounds

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

Sizebounds

t₂₄, X₀: X₀ {O(n)}
t₂₄, X₁: X₁ {O(n)}
t₂₄, X₂: X₂ {O(n)}
t₂₅, X₀: 2⋅X₀+X₁ {O(n)}
t₂₅, X₁: X₁ {O(n)}
t₂₅, X₂: 1 {O(1)}
t₂₆, X₀: 3⋅X₀+X₁ {O(n)}
t₂₆, X₁: 2⋅X₁ {O(n)}
t₂₇, X₀: 3⋅X₀+X₁ {O(n)}
t₂₇, X₁: 2⋅X₁ {O(n)}
t₂₈, X₀: 3⋅X₀+X₁ {O(n)}
t₂₈, X₁: 2⋅X₁ {O(n)}
t₂₈, X₂: X₂+1 {O(n)}
t₂₉, X₀: 3⋅X₀+X₁ {O(n)}
t₂₉, X₁: 2⋅X₁ {O(n)}
t₂₉, X₂: X₂+1 {O(n)}
t₃₀, X₀: 3⋅X₀+X₁ {O(n)}
t₃₀, X₁: 2⋅X₁ {O(n)}
t₃₁, X₀: 3⋅X₀+X₁ {O(n)}
t₃₁, X₁: 2⋅X₁ {O(n)}
t₃₂, X₀: 3⋅X₀+X₁ {O(n)}
t₃₂, X₁: 2⋅X₁ {O(n)}
t₃₂, X₂: 2 {O(1)}
t₃₃, X₀: 15⋅X₀+5⋅X₁ {O(n)}
t₃₃, X₁: 10⋅X₁ {O(n)}