Analysing control-flow refined program

knowledge_propagation leads to new time bound 2⋅X₀+2 {O(n)} for transition t₁₁₄: evalNestedLoopbb6in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → evalNestedLoopbb8in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: X₁ ≤ X₄ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₀+X₄ ∧ 1+X₄ ≤ X₀ ∧ 1 ≤ X₀+X₅ ∧ 1+X₅ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₁+X₄ ∧ X₄ ≤ X₁ ∧ 0 ≤ X₁+X₅ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂+X₄ ∧ X₄ ≤ X₂ ∧ 0 ≤ X₂+X₅ ∧ 0 ≤ X₃ ∧ 0 ≤ X₃+X₄ ∧ X₄ ≤ X₃ ∧ 0 ≤ X₃+X₅ ∧ X₅ ≤ X₃ ∧ X₃ ≤ X₅ ∧ 0 ≤ X₄ ∧ 0 ≤ X₄+X₅ ∧ X₄ ≤ 0 ∧ X₄ ≤ X₅ ∧ 0 ≤ X₅

knowledge_propagation leads to new time bound 2⋅X₀+2 {O(n)} for transition t₁₁₅: evalNestedLoopbb6in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → evalNestedLoopbb7in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1+X₄ ≤ X₁ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₁ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₀+X₄ ∧ 1+X₄ ≤ X₀ ∧ 1 ≤ X₀+X₅ ∧ 1+X₅ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₁+X₂ ∧ 0 ≤ X₁+X₃ ∧ 0 ≤ X₁+X₄ ∧ X₄ ≤ X₁ ∧ 0 ≤ X₁+X₅ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂+X₄ ∧ X₄ ≤ X₂ ∧ 0 ≤ X₂+X₅ ∧ 0 ≤ X₃ ∧ 0 ≤ X₃+X₄ ∧ X₄ ≤ X₃ ∧ 0 ≤ X₃+X₅ ∧ X₅ ≤ X₃ ∧ X₃ ≤ X₅ ∧ 0 ≤ X₄ ∧ 0 ≤ X₄+X₅ ∧ X₄ ≤ 0 ∧ X₄ ≤ X₅ ∧ 0 ≤ X₅

knowledge_propagation leads to new time bound 2⋅X₀+2 {O(n)} for transition t₁₁₆: evalNestedLoopbb7in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → evalNestedLoopbb8in(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₀+X₄ ∧ 1+X₄ ≤ X₀ ∧ 1 ≤ X₀+X₅ ∧ 1+X₅ ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₁+X₄ ∧ 1+X₄ ≤ X₁ ∧ 1 ≤ X₁+X₅ ∧ 2 ≤ X₀+X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂+X₄ ∧ X₄ ≤ X₂ ∧ 0 ≤ X₂+X₅ ∧ 0 ≤ X₃ ∧ 0 ≤ X₃+X₄ ∧ X₄ ≤ X₃ ∧ 0 ≤ X₃+X₅ ∧ X₅ ≤ X₃ ∧ X₃ ≤ X₅ ∧ 0 ≤ X₄ ∧ 0 ≤ X₄+X₅ ∧ X₄ ≤ 0 ∧ X₄ ≤ X₅ ∧ 0 ≤ X₅

knowledge_propagation leads to new time bound 2⋅X₀+2 {O(n)} for transition t₁₁₇: evalNestedLoopbb7in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → evalNestedLoopbb1in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1 ≤ I ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₀+X₄ ∧ 1+X₄ ≤ X₀ ∧ 1 ≤ X₀+X₅ ∧ 1+X₅ ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₁+X₄ ∧ 1+X₄ ≤ X₁ ∧ 1 ≤ X₁+X₅ ∧ 2 ≤ X₀+X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂+X₄ ∧ X₄ ≤ X₂ ∧ 0 ≤ X₂+X₅ ∧ 0 ≤ X₃ ∧ 0 ≤ X₃+X₄ ∧ X₄ ≤ X₃ ∧ 0 ≤ X₃+X₅ ∧ X₅ ≤ X₃ ∧ X₃ ≤ X₅ ∧ 0 ≤ X₄ ∧ 0 ≤ X₄+X₅ ∧ X₄ ≤ 0 ∧ X₄ ≤ X₅ ∧ 0 ≤ X₅

knowledge_propagation leads to new time bound 2⋅X₀+2 {O(n)} for transition t₁₁₈: evalNestedLoopbb7in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → evalNestedLoopbb1in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1+I ≤ 0 ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₀+X₄ ∧ 1+X₄ ≤ X₀ ∧ 1 ≤ X₀+X₅ ∧ 1+X₅ ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₁+X₄ ∧ 1+X₄ ≤ X₁ ∧ 1 ≤ X₁+X₅ ∧ 2 ≤ X₀+X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂+X₄ ∧ X₄ ≤ X₂ ∧ 0 ≤ X₂+X₅ ∧ 0 ≤ X₃ ∧ 0 ≤ X₃+X₄ ∧ X₄ ≤ X₃ ∧ 0 ≤ X₃+X₅ ∧ X₅ ≤ X₃ ∧ X₃ ≤ X₅ ∧ 0 ≤ X₄ ∧ 0 ≤ X₄+X₅ ∧ X₄ ≤ 0 ∧ X₄ ≤ X₅ ∧ 0 ≤ X₅

knowledge_propagation leads to new time bound 4⋅X₀+4 {O(n)} for transition t₁₁₉: evalNestedLoopbb1in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → evalNestedLoopbb3in_v1(X₀, X₁, X₂, X₃, X₄, X₅, 1+X₄, X₅) :|: 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₀+X₄ ∧ 1+X₄ ≤ X₀ ∧ 1 ≤ X₀+X₅ ∧ 1+X₅ ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₁+X₄ ∧ 1+X₄ ≤ X₁ ∧ 1 ≤ X₁+X₅ ∧ 2 ≤ X₀+X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂+X₄ ∧ X₄ ≤ X₂ ∧ 0 ≤ X₂+X₅ ∧ 0 ≤ X₃ ∧ 0 ≤ X₃+X₄ ∧ X₄ ≤ X₃ ∧ 0 ≤ X₃+X₅ ∧ X₅ ≤ X₃ ∧ X₃ ≤ X₅ ∧ 0 ≤ X₄ ∧ 0 ≤ X₄+X₅ ∧ X₄ ≤ 0 ∧ X₄ ≤ X₅ ∧ 0 ≤ X₅

knowledge_propagation leads to new time bound 4⋅X₀+4 {O(n)} for transition t₁₂₀: evalNestedLoopbb3in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → evalNestedLoopbb6in_v1(X₀, X₁, X₂, X₃, X₆, X₇, X₆, X₇) :|: X₂ ≤ X₇ ∧ X₆ ≤ 1+X₂ ∧ X₆ ≤ 1+X₃ ∧ X₆ ≤ 1+X₄ ∧ X₄+X₆ ≤ 1 ∧ X₆ ≤ 1+X₅ ∧ X₆ ≤ 1 ∧ X₆ ≤ 1+X₇ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₀+X₄ ∧ 1+X₄ ≤ X₀ ∧ 1 ≤ X₀+X₅ ∧ 1+X₅ ≤ X₀ ∧ 1 ≤ X₀+X₇ ∧ 1+X₇ ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₁+X₄ ∧ 1+X₄ ≤ X₁ ∧ 1 ≤ X₁+X₅ ∧ 1 ≤ X₁+X₇ ∧ 1 ≤ X₂+X₆ ∧ 1 ≤ X₃+X₆ ∧ 1 ≤ X₄+X₆ ∧ 1+X₄ ≤ X₆ ∧ 1 ≤ X₅+X₆ ∧ 1 ≤ X₆ ∧ 1 ≤ X₆+X₇ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀+X₆ ∧ 2 ≤ X₁+X₆ ∧ X₆ ≤ X₀ ∧ X₆ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂+X₄ ∧ X₄ ≤ X₂ ∧ 0 ≤ X₂+X₅ ∧ 0 ≤ X₂+X₇ ∧ 0 ≤ X₃ ∧ 0 ≤ X₃+X₄ ∧ X₄ ≤ X₃ ∧ 0 ≤ X₃+X₅ ∧ X₅ ≤ X₃ ∧ 0 ≤ X₃+X₇ ∧ X₇ ≤ X₃ ∧ X₃ ≤ X₅ ∧ X₃ ≤ X₇ ∧ 0 ≤ X₄ ∧ 0 ≤ X₄+X₅ ∧ 0 ≤ X₄+X₇ ∧ X₄ ≤ 0 ∧ X₄ ≤ X₅ ∧ X₄ ≤ X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₇ ∧ X₇ ≤ X₅ ∧ X₅ ≤ X₇ ∧ 0 ≤ X₇

knowledge_propagation leads to new time bound 4⋅X₀+4 {O(n)} for transition t₁₂₁: evalNestedLoopbb3in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) → evalNestedLoopbb4in_v1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇) :|: 1+X₇ ≤ X₂ ∧ X₆ ≤ 1+X₂ ∧ X₆ ≤ 1+X₃ ∧ X₆ ≤ 1+X₄ ∧ X₄+X₆ ≤ 1 ∧ X₆ ≤ 1+X₅ ∧ X₆ ≤ 1 ∧ X₆ ≤ 1+X₇ ∧ 1 ≤ X₀ ∧ 1 ≤ X₀+X₂ ∧ 1 ≤ X₀+X₃ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₀+X₄ ∧ 1+X₄ ≤ X₀ ∧ 1 ≤ X₀+X₅ ∧ 1+X₅ ≤ X₀ ∧ 1 ≤ X₀+X₇ ∧ 1+X₇ ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₁+X₄ ∧ 1+X₄ ≤ X₁ ∧ 1 ≤ X₁+X₅ ∧ 1 ≤ X₁+X₇ ∧ 1 ≤ X₂+X₆ ∧ 1 ≤ X₃+X₆ ∧ 1 ≤ X₄+X₆ ∧ 1+X₄ ≤ X₆ ∧ 1 ≤ X₅+X₆ ∧ 1 ≤ X₆ ∧ 1 ≤ X₆+X₇ ∧ 2 ≤ X₀+X₁ ∧ 2 ≤ X₀+X₆ ∧ 2 ≤ X₁+X₆ ∧ X₆ ≤ X₀ ∧ X₆ ≤ X₁ ∧ 0 ≤ X₂ ∧ 0 ≤ X₂+X₃ ∧ 0 ≤ X₂+X₄ ∧ X₄ ≤ X₂ ∧ 0 ≤ X₂+X₅ ∧ 0 ≤ X₂+X₇ ∧ 0 ≤ X₃ ∧ 0 ≤ X₃+X₄ ∧ X₄ ≤ X₃ ∧ 0 ≤ X₃+X₅ ∧ X₅ ≤ X₃ ∧ 0 ≤ X₃+X₇ ∧ X₇ ≤ X₃ ∧ X₃ ≤ X₅ ∧ X₃ ≤ X₇ ∧ 0 ≤ X₄ ∧ 0 ≤ X₄+X₅ ∧ 0 ≤ X₄+X₇ ∧ X₄ ≤ 0 ∧ X₄ ≤ X₅ ∧ X₄ ≤ X₇ ∧ 0 ≤ X₅ ∧ 0 ≤ X₅+X₇ ∧ X₇ ≤ X₅ ∧ X₅ ≤ X₇ ∧ 0 ≤ X₇

All Bounds

Timebounds

Overall timebound:7⋅X₀⋅X₁+X₀⋅X₂+4⋅X₂+7⋅X₀+7⋅X₁+12 {O(n^2)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₃: X₀+1 {O(n)}
t₄: X₀+1 {O(n)}
t₅: X₀+1 {O(n)}
t₆: 1 {O(1)}
t₇: X₀+1 {O(n)}
t₈: X₀⋅X₁+X₀+X₁+1 {O(n^2)}
t₉: X₀⋅X₁+X₁ {O(n^2)}
t₁₀: X₀⋅X₁+X₁ {O(n^2)}
t₁₁: X₀+1 {O(n)}
t₁₂: X₀⋅X₁+X₁ {O(n^2)}
t₁₃: X₀⋅X₁+X₁ {O(n^2)}
t₁₄: X₀⋅X₁+X₀⋅X₂+X₁+X₂ {O(n^2)}
t₁₅: X₂+1 {O(n)}
t₁₆: X₂ {O(n)}
t₁₇: X₀⋅X₁+X₁ {O(n^2)}
t₁₈: X₂ {O(n)}
t₁₉: X₀ {O(n)}
t₂₀: 1 {O(1)}

Costbounds

Overall costbound: 7⋅X₀⋅X₁+X₀⋅X₂+4⋅X₂+7⋅X₀+7⋅X₁+12 {O(n^2)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₃: X₀+1 {O(n)}
t₄: X₀+1 {O(n)}
t₅: X₀+1 {O(n)}
t₆: 1 {O(1)}
t₇: X₀+1 {O(n)}
t₈: X₀⋅X₁+X₀+X₁+1 {O(n^2)}
t₉: X₀⋅X₁+X₁ {O(n^2)}
t₁₀: X₀⋅X₁+X₁ {O(n^2)}
t₁₁: X₀+1 {O(n)}
t₁₂: X₀⋅X₁+X₁ {O(n^2)}
t₁₃: X₀⋅X₁+X₁ {O(n^2)}
t₁₄: X₀⋅X₁+X₀⋅X₂+X₁+X₂ {O(n^2)}
t₁₅: X₂+1 {O(n)}
t₁₆: X₂ {O(n)}
t₁₇: X₀⋅X₁+X₁ {O(n^2)}
t₁₈: X₂ {O(n)}
t₁₉: X₀ {O(n)}
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₆: 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₃: 0 {O(1)}
t₁, X₄: X₄ {O(n)}
t₁, X₅: X₅ {O(n)}
t₁, X₆: X₆ {O(n)}
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₃: X₀+X₂ {O(n)}
t₂, X₄: 6⋅X₀⋅X₁+6⋅X₁+X₄ {O(n^2)}
t₂, X₅: 2⋅X₀+2⋅X₂+X₅ {O(n)}
t₂, X₆: 12⋅X₀⋅X₁+12⋅X₁+2⋅X₆+6 {O(n^2)}
t₂, X₇: 2⋅X₇+3⋅X₀+3⋅X₂ {O(n)}
t₃, X₀: X₀ {O(n)}
t₃, X₁: X₁ {O(n)}
t₃, X₂: X₂ {O(n)}
t₃, X₃: X₀+X₂ {O(n)}
t₃, X₄: 6⋅X₀⋅X₁+6⋅X₁+X₄ {O(n^2)}
t₃, X₅: 2⋅X₀+2⋅X₂+X₅ {O(n)}
t₃, X₆: 12⋅X₀⋅X₁+12⋅X₁+X₆+6 {O(n^2)}
t₃, X₇: 3⋅X₀+3⋅X₂+X₇ {O(n)}
t₄, X₀: X₀ {O(n)}
t₄, X₁: X₁ {O(n)}
t₄, X₂: X₂ {O(n)}
t₄, X₃: X₀+X₂ {O(n)}
t₄, X₄: 0 {O(1)}
t₄, X₅: X₀+X₂ {O(n)}
t₄, X₆: 12⋅X₀⋅X₁+12⋅X₁+X₆+6 {O(n^2)}
t₄, X₇: 3⋅X₀+3⋅X₂+X₇ {O(n)}
t₅, X₀: X₀ {O(n)}
t₅, X₁: X₁ {O(n)}
t₅, X₂: X₂ {O(n)}
t₅, X₃: X₀+X₂ {O(n)}
t₅, X₄: 0 {O(1)}
t₅, X₅: X₀+X₂ {O(n)}
t₅, X₆: 12⋅X₀⋅X₁+12⋅X₁+X₆+6 {O(n^2)}
t₅, X₇: 3⋅X₀+3⋅X₂+X₇ {O(n)}
t₆, X₀: X₀ {O(n)}
t₆, X₁: X₁ {O(n)}
t₆, X₂: X₂ {O(n)}
t₆, X₃: X₀+X₂ {O(n)}
t₆, X₄: 6⋅X₀⋅X₁+6⋅X₁+X₄ {O(n^2)}
t₆, X₅: 2⋅X₀+2⋅X₂+X₅ {O(n)}
t₆, X₆: 12⋅X₀⋅X₁+12⋅X₁+X₆+6 {O(n^2)}
t₆, X₇: 3⋅X₀+3⋅X₂+X₇ {O(n)}
t₇, X₀: X₀ {O(n)}
t₇, X₁: X₁ {O(n)}
t₇, X₂: X₂ {O(n)}
t₇, X₃: 6⋅X₀+6⋅X₂ {O(n)}
t₇, X₄: 4⋅X₀⋅X₁+4⋅X₁ {O(n^2)}
t₇, X₅: X₀+X₂ {O(n)}
t₇, X₆: 12⋅X₀⋅X₁+12⋅X₁+X₆+6 {O(n^2)}
t₇, X₇: 3⋅X₀+3⋅X₂+X₇ {O(n)}
t₈, X₀: X₀ {O(n)}
t₈, X₁: X₁ {O(n)}
t₈, X₂: X₂ {O(n)}
t₈, X₃: 2⋅X₀+2⋅X₂ {O(n)}
t₈, X₄: 2⋅X₀⋅X₁+2⋅X₁ {O(n^2)}
t₈, X₅: X₀+X₂ {O(n)}
t₈, X₆: 12⋅X₀⋅X₁+12⋅X₁+X₆+6 {O(n^2)}
t₈, X₇: 3⋅X₀+3⋅X₂+X₇ {O(n)}
t₉, X₀: X₀ {O(n)}
t₉, X₁: X₁ {O(n)}
t₉, X₂: X₂ {O(n)}
t₉, X₃: 2⋅X₀+2⋅X₂ {O(n)}
t₉, X₄: 2⋅X₀⋅X₁+2⋅X₁ {O(n^2)}
t₉, X₅: X₀+X₂ {O(n)}
t₉, X₆: 12⋅X₀⋅X₁+12⋅X₁+X₆+6 {O(n^2)}
t₉, X₇: 3⋅X₀+3⋅X₂+X₇ {O(n)}
t₁₀, X₀: X₀ {O(n)}
t₁₀, X₁: X₁ {O(n)}
t₁₀, X₂: X₂ {O(n)}
t₁₀, X₃: 2⋅X₀+2⋅X₂ {O(n)}
t₁₀, X₄: 2⋅X₀⋅X₁+2⋅X₁ {O(n^2)}
t₁₀, X₅: X₀+X₂ {O(n)}
t₁₀, X₆: 12⋅X₀⋅X₁+12⋅X₁+X₆+6 {O(n^2)}
t₁₀, X₇: 3⋅X₀+3⋅X₂+X₇ {O(n)}
t₁₁, X₀: X₀ {O(n)}
t₁₁, X₁: X₁ {O(n)}
t₁₁, X₂: X₂ {O(n)}
t₁₁, X₃: 2⋅X₀+2⋅X₂ {O(n)}
t₁₁, X₄: 2⋅X₀⋅X₁+2⋅X₁ {O(n^2)}
t₁₁, X₅: X₀+X₂ {O(n)}
t₁₁, X₆: 12⋅X₀⋅X₁+12⋅X₁+X₆+6 {O(n^2)}
t₁₁, X₇: 3⋅X₀+3⋅X₂+X₇ {O(n)}
t₁₂, X₀: X₀ {O(n)}
t₁₂, X₁: X₁ {O(n)}
t₁₂, X₂: X₂ {O(n)}
t₁₂, X₃: 2⋅X₀+2⋅X₂ {O(n)}
t₁₂, X₄: 2⋅X₀⋅X₁+2⋅X₁ {O(n^2)}
t₁₂, X₅: 2⋅X₀+2⋅X₂ {O(n)}
t₁₂, X₆: 4⋅X₀⋅X₁+4⋅X₁+2 {O(n^2)}
t₁₂, X₇: X₀+X₂ {O(n)}
t₁₃, X₀: X₀ {O(n)}
t₁₃, X₁: X₁ {O(n)}
t₁₃, X₂: X₂ {O(n)}
t₁₃, X₃: 2⋅X₀+2⋅X₂ {O(n)}
t₁₃, X₄: 2⋅X₀⋅X₁+2⋅X₁ {O(n^2)}
t₁₃, X₅: X₀+X₂ {O(n)}
t₁₃, X₆: 8⋅X₀⋅X₁+8⋅X₁+4 {O(n^2)}
t₁₃, X₇: 2⋅X₀+2⋅X₂ {O(n)}
t₁₄, X₀: X₀ {O(n)}
t₁₄, X₁: X₁ {O(n)}
t₁₄, X₂: X₂ {O(n)}
t₁₄, X₃: 2⋅X₀+2⋅X₂ {O(n)}
t₁₄, X₄: 2⋅X₀⋅X₁+2⋅X₁ {O(n^2)}
t₁₄, X₅: 2⋅X₀+2⋅X₂ {O(n)}
t₁₄, X₆: 4⋅X₀⋅X₁+4⋅X₁+2 {O(n^2)}
t₁₄, X₇: X₀+X₂ {O(n)}
t₁₅, X₀: X₀ {O(n)}
t₁₅, X₁: X₁ {O(n)}
t₁₅, X₂: X₂ {O(n)}
t₁₅, X₃: 2⋅X₀+2⋅X₂ {O(n)}
t₁₅, X₄: 2⋅X₀⋅X₁+2⋅X₁ {O(n^2)}
t₁₅, X₅: 2⋅X₀+2⋅X₂ {O(n)}
t₁₅, X₆: 4⋅X₀⋅X₁+4⋅X₁+2 {O(n^2)}
t₁₅, X₇: X₀+X₂ {O(n)}
t₁₆, X₀: X₀ {O(n)}
t₁₆, X₁: X₁ {O(n)}
t₁₆, X₂: X₂ {O(n)}
t₁₆, X₃: 2⋅X₀+2⋅X₂ {O(n)}
t₁₆, X₄: 2⋅X₀⋅X₁+2⋅X₁ {O(n^2)}
t₁₆, X₅: 2⋅X₀+2⋅X₂ {O(n)}
t₁₆, X₆: 4⋅X₀⋅X₁+4⋅X₁+2 {O(n^2)}
t₁₆, X₇: X₀+X₂ {O(n)}
t₁₇, X₀: X₀ {O(n)}
t₁₇, X₁: X₁ {O(n)}
t₁₇, X₂: X₂ {O(n)}
t₁₇, X₃: 2⋅X₀+2⋅X₂ {O(n)}
t₁₇, X₄: 2⋅X₀⋅X₁+2⋅X₁ {O(n^2)}
t₁₇, X₅: X₀+X₂ {O(n)}
t₁₇, X₆: 4⋅X₀⋅X₁+4⋅X₁+2 {O(n^2)}
t₁₇, X₇: X₀+X₂ {O(n)}
t₁₈, X₀: X₀ {O(n)}
t₁₈, X₁: X₁ {O(n)}
t₁₈, X₂: X₂ {O(n)}
t₁₈, X₃: 2⋅X₀+2⋅X₂ {O(n)}
t₁₈, X₄: 2⋅X₀⋅X₁+2⋅X₁ {O(n^2)}
t₁₈, X₅: 2⋅X₀+2⋅X₂ {O(n)}
t₁₈, X₆: 4⋅X₀⋅X₁+4⋅X₁+2 {O(n^2)}
t₁₈, X₇: X₀+X₂ {O(n)}
t₁₉, X₀: X₀ {O(n)}
t₁₉, X₁: X₁ {O(n)}
t₁₉, X₂: X₂ {O(n)}
t₁₉, X₃: X₀+X₂ {O(n)}
t₁₉, X₄: 6⋅X₀⋅X₁+6⋅X₁ {O(n^2)}
t₁₉, X₅: 2⋅X₀+2⋅X₂ {O(n)}
t₁₉, X₆: 12⋅X₀⋅X₁+12⋅X₁+X₆+6 {O(n^2)}
t₁₉, X₇: 3⋅X₀+3⋅X₂+X₇ {O(n)}
t₂₀, X₀: 3⋅X₀ {O(n)}
t₂₀, X₁: 3⋅X₁ {O(n)}
t₂₀, X₂: 3⋅X₂ {O(n)}
t₂₀, X₃: 2⋅X₀+2⋅X₂ {O(n)}
t₂₀, X₄: 12⋅X₀⋅X₁+12⋅X₁+2⋅X₄ {O(n^2)}
t₂₀, X₅: 2⋅X₅+4⋅X₀+4⋅X₂ {O(n)}
t₂₀, X₆: 24⋅X₀⋅X₁+24⋅X₁+3⋅X₆+12 {O(n^2)}
t₂₀, X₇: 3⋅X₇+6⋅X₀+6⋅X₂ {O(n)}