Analysing control-flow refined program

knowledge_propagation leads to new time bound X₃ {O(n)} for transition t₁₄₂: eval_terminatorbubble_bb2_in(X₀, X₁, X₂, X₃, X₄) → eval_terminatorbubble_bb6_in(X₀, X₁, X₂, X₃, X₄) :|: X₁ ≤ X₂ ∧ X₂ ≤ 1 ∧ X₂ ≤ 1+X₄ ∧ X₂+X₄ ≤ 1 ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₄ ∧ 1+X₄ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂+X₄ ∧ 1+X₄ ≤ X₂ ∧ 1 ≤ X₃ ∧ 1 ≤ X₃+X₄ ∧ 1+X₄ ≤ X₃ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₁+X₃ ∧ 2 ≤ X₂+X₃ ∧ X₂ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₃ ∧ 0 ≤ X₄ ∧ X₄ ≤ 0

knowledge_propagation leads to new time bound X₃ {O(n)} for transition t₁₄₃: eval_terminatorbubble_bb2_in(X₀, X₁, X₂, X₃, X₄) → eval_terminatorbubble_bb3_in_v1(X₀, X₁, X₂, X₃, X₄) :|: 1+X₂ ≤ X₁ ∧ X₂ ≤ 1 ∧ X₂ ≤ 1+X₄ ∧ X₂+X₄ ≤ 1 ∧ 1 ≤ X₁ ∧ 1 ≤ X₁+X₄ ∧ 1+X₄ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂+X₄ ∧ 1+X₄ ≤ X₂ ∧ 1 ≤ X₃ ∧ 1 ≤ X₃+X₄ ∧ 1+X₄ ≤ X₃ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₁+X₃ ∧ 2 ≤ X₂+X₃ ∧ X₂ ≤ X₁ ∧ X₁ ≤ X₃ ∧ X₂ ≤ X₃ ∧ 0 ≤ X₄ ∧ X₄ ≤ 0

knowledge_propagation leads to new time bound X₃ {O(n)} for transition t₁₄₄: eval_terminatorbubble_bb3_in_v1(X₀, X₁, X₂, X₃, X₄) → eval_terminatorbubble_bb4_in_v1(X₀, X₁, X₂, X₃, X₄) :|: 1 ≤ X₂ ∧ X₂ ≤ X₃ ∧ X₂ ≤ 1 ∧ X₂ ≤ 1+X₄ ∧ X₂+X₄ ≤ 1 ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₂+X₄ ∧ 1+X₄ ≤ X₂ ∧ 1+X₂ ≤ X₃ ∧ 2 ≤ X₁ ∧ 2 ≤ X₁+X₄ ∧ 2+X₄ ≤ X₁ ∧ 2 ≤ X₃ ∧ 2 ≤ X₃+X₄ ∧ 2+X₄ ≤ X₃ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₂+X₃ ∧ 4 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₄ ∧ X₄ ≤ 0

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

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

knowledge_propagation leads to new time bound X₃ {O(n)} for transition t₁₄₇: eval_terminatorbubble_9_v1(X₀, X₁, X₂, X₃, X₄) → eval_terminatorbubble_10_v1(nondef_0, X₁, X₂, X₃, X₄) :|: X₂ ≤ 1 ∧ X₂ ≤ 1+X₄ ∧ X₂+X₄ ≤ 1 ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂+X₄ ∧ 1+X₄ ≤ X₂ ∧ 1+X₂ ≤ X₃ ∧ 2 ≤ X₁ ∧ 2 ≤ X₁+X₄ ∧ 2+X₄ ≤ X₁ ∧ 2 ≤ X₃ ∧ 2 ≤ X₃+X₄ ∧ 2+X₄ ≤ X₃ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₂+X₃ ∧ 4 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₄ ∧ X₄ ≤ 0

knowledge_propagation leads to new time bound X₃ {O(n)} for transition t₁₄₈: eval_terminatorbubble_10_v1(X₀, X₁, X₂, X₃, X₄) → eval_terminatorbubble_bb2_in_v1(X₀, X₁, 1+X₂, X₃, X₄) :|: X₀ ≤ 0 ∧ X₂ ≤ 1 ∧ X₂ ≤ 1+X₄ ∧ X₂+X₄ ≤ 1 ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂+X₄ ∧ 1+X₄ ≤ X₂ ∧ 1+X₂ ≤ X₃ ∧ 2 ≤ X₁ ∧ 2 ≤ X₁+X₄ ∧ 2+X₄ ≤ X₁ ∧ 2 ≤ X₃ ∧ 2 ≤ X₃+X₄ ∧ 2+X₄ ≤ X₃ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₂+X₃ ∧ 4 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₄ ∧ X₄ ≤ 0

knowledge_propagation leads to new time bound X₃ {O(n)} for transition t₁₄₉: eval_terminatorbubble_10_v1(X₀, X₁, X₂, X₃, X₄) → eval_terminatorbubble_bb2_in_v2(X₀, X₁, 1+X₂, X₃, X₂) :|: 1 ≤ X₀ ∧ X₂ ≤ 1 ∧ X₂ ≤ 1+X₄ ∧ X₂+X₄ ≤ 1 ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₂+X₄ ∧ 1+X₄ ≤ X₂ ∧ 1+X₂ ≤ X₃ ∧ 2 ≤ X₁ ∧ 2 ≤ X₁+X₄ ∧ 2+X₄ ≤ X₁ ∧ 2 ≤ X₃ ∧ 2 ≤ X₃+X₄ ∧ 2+X₄ ≤ X₃ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₂+X₃ ∧ 4 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 0 ≤ X₄ ∧ X₄ ≤ 0

All Bounds

Timebounds

Overall timebound:24⋅X₃⋅X₃+30⋅X₃+13 {O(n^2)}
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₉: X₃ {O(n)}
t₁₀: 2⋅X₃⋅X₃+2⋅X₃ {O(n^2)}
t₁₁: X₃+1 {O(n)}
t₁₄: 6⋅X₃⋅X₃+6⋅X₃ {O(n^2)}
t₁₇: 4⋅X₃⋅X₃+4⋅X₃ {O(n^2)}
t₁₈: 4⋅X₃⋅X₃+6⋅X₃+2 {O(n^2)}
t₁₉: 4⋅X₃⋅X₃+4⋅X₃ {O(n^2)}
t₂₀: 2⋅X₃⋅X₃+2⋅X₃ {O(n^2)}
t₂₁: 2⋅X₃⋅X₃+2⋅X₃ {O(n^2)}
t₂₂: 1 {O(1)}
t₂₄: 2⋅X₃+1 {O(n)}
t₂₅: 1 {O(1)}

Costbounds

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