Initial Problem
Start: eval_realheapsort_step1_start
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: nondef_0, nondef_1, nondef_2, nondef_3
Locations: eval_realheapsort_step1_0, eval_realheapsort_step1_1, eval_realheapsort_step1_2, eval_realheapsort_step1_28, eval_realheapsort_step1_29, eval_realheapsort_step1__critedge_in, eval_realheapsort_step1_bb0_in, eval_realheapsort_step1_bb1_in, eval_realheapsort_step1_bb2_in, eval_realheapsort_step1_bb3_in, eval_realheapsort_step1_bb4_in, eval_realheapsort_step1_bb5_in, eval_realheapsort_step1_start, eval_realheapsort_step1_stop
Transitions:
t₂: eval_realheapsort_step1_0(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_1(X₀, X₁, X₂, X₃)
t₃: eval_realheapsort_step1_1(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_2(X₀, X₁, X₂, X₃)
t₄: eval_realheapsort_step1_2(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb1_in(X₀, X₁, X₂, 1) :|: 3 ≤ X₁
t₅: eval_realheapsort_step1_2(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb5_in(X₀, X₁, X₂, X₃) :|: X₁ ≤ 2
t₄₄: eval_realheapsort_step1_28(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_29(X₀, X₁, X₂, X₃)
t₄₅: eval_realheapsort_step1_29(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb1_in(X₀, X₁, X₂, X₀)
t₄₃: eval_realheapsort_step1__critedge_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_28(1+X₃, X₁, X₂, X₃)
t₁: eval_realheapsort_step1_bb0_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_0(X₀, X₁, X₂, X₃)
t₆: eval_realheapsort_step1_bb1_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, X₃, X₃) :|: 1+X₃ ≤ X₁
t₇: eval_realheapsort_step1_bb1_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb5_in(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃
t₉: eval_realheapsort_step1_bb2_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1__critedge_in(X₀, X₁, X₂, X₃) :|: X₂ ≤ 0
t₈: eval_realheapsort_step1_bb2_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb3_in(X₀, X₁, X₂, X₃) :|: 1 ≤ X₂
t₁₃: eval_realheapsort_step1_bb3_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1__critedge_in(X₀, X₁, X₂, X₃) :|: 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 0 ∧ 0 ≤ nondef_0 ∧ nondef_0 ≤ 0
t₁₄: eval_realheapsort_step1_bb3_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1__critedge_in(X₀, X₁, X₂, X₃) :|: 2⋅nondef_0 ≤ 1+X₂ ∧ X₂ ≤ 2⋅nondef_0 ∧ 0 ≤ nondef_0 ∧ 0 ≤ X₂
t₁₅: eval_realheapsort_step1_bb3_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1__critedge_in(X₀, X₁, X₂, X₃) :|: 2⋅nondef_0 ≤ 2+X₂ ∧ 1+X₂ ≤ 2⋅nondef_0 ∧ 2+X₂ ≤ 0 ∧ nondef_0 ≤ 0
t₁₀: eval_realheapsort_step1_bb3_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) :|: 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 0 ∧ 0 ≤ nondef_0 ∧ nondef_0 ≤ 0
t₁₁: eval_realheapsort_step1_bb3_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) :|: 2⋅nondef_0 ≤ 1+X₂ ∧ X₂ ≤ 2⋅nondef_0 ∧ 0 ≤ nondef_0 ∧ 0 ≤ X₂
t₁₂: eval_realheapsort_step1_bb3_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) :|: 2⋅nondef_0 ≤ 2+X₂ ∧ 1+X₂ ≤ 2⋅nondef_0 ∧ 2+X₂ ≤ 0 ∧ nondef_0 ≤ 0
t₁₆: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 0 ∧ 0 ≤ nondef_1 ∧ nondef_1 ≤ 0 ∧ 0 ≤ nondef_2 ∧ nondef_2 ≤ 0 ∧ 0 ≤ nondef_3 ∧ nondef_3 ≤ 0
t₁₇: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_3 ≤ 1+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 0 ∧ 0 ≤ nondef_1 ∧ nondef_1 ≤ 0 ∧ 0 ≤ nondef_2 ∧ nondef_2 ≤ 0 ∧ X₂ ≤ 2⋅nondef_3 ∧ 0 ≤ nondef_3 ∧ 0 ≤ X₂
t₁₈: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_3 ≤ 2+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_3 ∧ 1+X₂ ≤ 0 ∧ 2+X₂ ≤ 0 ∧ 0 ≤ nondef_1 ∧ nondef_1 ≤ 0 ∧ 0 ≤ nondef_2 ∧ nondef_2 ≤ 0 ∧ nondef_3 ≤ 0
t₁₉: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_2 ≤ 1+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 0 ∧ 0 ≤ nondef_1 ∧ nondef_1 ≤ 0 ∧ X₂ ≤ 2⋅nondef_2 ∧ 0 ≤ nondef_2 ∧ 0 ≤ nondef_3 ∧ nondef_3 ≤ 0 ∧ 0 ≤ X₂
t₂₀: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_2 ≤ 1+X₂ ∧ 2⋅nondef_3 ≤ 1+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 0 ∧ 0 ≤ nondef_1 ∧ nondef_1 ≤ 0 ∧ X₂ ≤ 2⋅nondef_2 ∧ 0 ≤ nondef_2 ∧ X₂ ≤ 2⋅nondef_3 ∧ 0 ≤ nondef_3 ∧ 0 ≤ X₂
t₂₁: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_3 ≤ 2+X₂ ∧ 2⋅nondef_2 ≤ 1+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_3 ∧ 1+X₂ ≤ 0 ∧ 2+X₂ ≤ 0 ∧ 0 ≤ nondef_1 ∧ nondef_1 ≤ 0 ∧ X₂ ≤ 2⋅nondef_2 ∧ 0 ≤ nondef_2 ∧ nondef_3 ≤ 0 ∧ 0 ≤ X₂
t₂₂: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_2 ≤ 2+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_2 ∧ 1+X₂ ≤ 0 ∧ 2+X₂ ≤ 0 ∧ 0 ≤ nondef_1 ∧ nondef_1 ≤ 0 ∧ nondef_2 ≤ 0 ∧ 0 ≤ nondef_3 ∧ nondef_3 ≤ 0
t₂₃: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_2 ≤ 2+X₂ ∧ 2⋅nondef_3 ≤ 1+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_2 ∧ 1+X₂ ≤ 0 ∧ 2+X₂ ≤ 0 ∧ 0 ≤ nondef_1 ∧ nondef_1 ≤ 0 ∧ nondef_2 ≤ 0 ∧ X₂ ≤ 2⋅nondef_3 ∧ 0 ≤ nondef_3 ∧ 0 ≤ X₂
t₂₄: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_2 ≤ 2+X₂ ∧ 2⋅nondef_3 ≤ 2+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_2 ∧ 1+X₂ ≤ 2⋅nondef_3 ∧ 1+X₂ ≤ 0 ∧ 2+X₂ ≤ 0 ∧ 0 ≤ nondef_1 ∧ nondef_1 ≤ 0 ∧ nondef_2 ≤ 0 ∧ nondef_3 ≤ 0
t₂₅: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_1 ≤ 1+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 0 ∧ X₂ ≤ 2⋅nondef_1 ∧ 0 ≤ nondef_1 ∧ 0 ≤ nondef_2 ∧ nondef_2 ≤ 0 ∧ 0 ≤ nondef_3 ∧ nondef_3 ≤ 0 ∧ 0 ≤ X₂
t₂₆: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_1 ≤ 1+X₂ ∧ 2⋅nondef_3 ≤ 1+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 0 ∧ X₂ ≤ 2⋅nondef_1 ∧ 0 ≤ nondef_1 ∧ 0 ≤ nondef_2 ∧ nondef_2 ≤ 0 ∧ X₂ ≤ 2⋅nondef_3 ∧ 0 ≤ nondef_3 ∧ 0 ≤ X₂
t₂₇: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_3 ≤ 2+X₂ ∧ 2⋅nondef_1 ≤ 1+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_3 ∧ 1+X₂ ≤ 0 ∧ 2+X₂ ≤ 0 ∧ X₂ ≤ 2⋅nondef_1 ∧ 0 ≤ nondef_1 ∧ 0 ≤ nondef_2 ∧ nondef_2 ≤ 0 ∧ nondef_3 ≤ 0 ∧ 0 ≤ X₂
t₂₈: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_1 ≤ 1+X₂ ∧ 2⋅nondef_2 ≤ 1+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 0 ∧ X₂ ≤ 2⋅nondef_1 ∧ 0 ≤ nondef_1 ∧ X₂ ≤ 2⋅nondef_2 ∧ 0 ≤ nondef_2 ∧ 0 ≤ nondef_3 ∧ nondef_3 ≤ 0 ∧ 0 ≤ X₂
t₂₉: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_1 ≤ 1+X₂ ∧ 2⋅nondef_2 ≤ 1+X₂ ∧ 2⋅nondef_3 ≤ 1+X₂ ∧ X₂ ≤ 2⋅nondef_1 ∧ 0 ≤ nondef_1 ∧ X₂ ≤ 2⋅nondef_2 ∧ 0 ≤ nondef_2 ∧ X₂ ≤ 2⋅nondef_3 ∧ 0 ≤ nondef_3 ∧ 0 ≤ X₂
t₃₀: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_3 ≤ 2+X₂ ∧ 2⋅nondef_1 ≤ 1+X₂ ∧ 2⋅nondef_2 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_3 ∧ 2+X₂ ≤ 0 ∧ X₂ ≤ 2⋅nondef_1 ∧ 0 ≤ nondef_1 ∧ X₂ ≤ 2⋅nondef_2 ∧ 0 ≤ nondef_2 ∧ nondef_3 ≤ 0 ∧ 0 ≤ X₂
t₃₁: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_2 ≤ 2+X₂ ∧ 2⋅nondef_1 ≤ 1+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_2 ∧ 1+X₂ ≤ 0 ∧ 2+X₂ ≤ 0 ∧ X₂ ≤ 2⋅nondef_1 ∧ 0 ≤ nondef_1 ∧ nondef_2 ≤ 0 ∧ 0 ≤ nondef_3 ∧ nondef_3 ≤ 0 ∧ 0 ≤ X₂
t₃₂: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_2 ≤ 2+X₂ ∧ 2⋅nondef_1 ≤ 1+X₂ ∧ 2⋅nondef_3 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_2 ∧ 2+X₂ ≤ 0 ∧ X₂ ≤ 2⋅nondef_1 ∧ 0 ≤ nondef_1 ∧ nondef_2 ≤ 0 ∧ X₂ ≤ 2⋅nondef_3 ∧ 0 ≤ nondef_3 ∧ 0 ≤ X₂
t₃₃: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_2 ≤ 2+X₂ ∧ 2⋅nondef_3 ≤ 2+X₂ ∧ 2⋅nondef_1 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_2 ∧ 1+X₂ ≤ 2⋅nondef_3 ∧ 2+X₂ ≤ 0 ∧ X₂ ≤ 2⋅nondef_1 ∧ 0 ≤ nondef_1 ∧ nondef_2 ≤ 0 ∧ nondef_3 ≤ 0 ∧ 0 ≤ X₂
t₃₄: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_1 ≤ 2+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_1 ∧ 1+X₂ ≤ 0 ∧ 2+X₂ ≤ 0 ∧ nondef_1 ≤ 0 ∧ 0 ≤ nondef_2 ∧ nondef_2 ≤ 0 ∧ 0 ≤ nondef_3 ∧ nondef_3 ≤ 0
t₃₅: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_1 ≤ 2+X₂ ∧ 2⋅nondef_3 ≤ 1+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_1 ∧ 1+X₂ ≤ 0 ∧ 2+X₂ ≤ 0 ∧ nondef_1 ≤ 0 ∧ 0 ≤ nondef_2 ∧ nondef_2 ≤ 0 ∧ X₂ ≤ 2⋅nondef_3 ∧ 0 ≤ nondef_3 ∧ 0 ≤ X₂
t₃₆: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_1 ≤ 2+X₂ ∧ 2⋅nondef_3 ≤ 2+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_1 ∧ 1+X₂ ≤ 2⋅nondef_3 ∧ 1+X₂ ≤ 0 ∧ 2+X₂ ≤ 0 ∧ nondef_1 ≤ 0 ∧ 0 ≤ nondef_2 ∧ nondef_2 ≤ 0 ∧ nondef_3 ≤ 0
t₃₇: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_1 ≤ 2+X₂ ∧ 2⋅nondef_2 ≤ 1+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_1 ∧ 1+X₂ ≤ 0 ∧ 2+X₂ ≤ 0 ∧ nondef_1 ≤ 0 ∧ X₂ ≤ 2⋅nondef_2 ∧ 0 ≤ nondef_2 ∧ 0 ≤ nondef_3 ∧ nondef_3 ≤ 0 ∧ 0 ≤ X₂
t₃₈: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_1 ≤ 2+X₂ ∧ 2⋅nondef_2 ≤ 1+X₂ ∧ 2⋅nondef_3 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_1 ∧ 2+X₂ ≤ 0 ∧ nondef_1 ≤ 0 ∧ X₂ ≤ 2⋅nondef_2 ∧ 0 ≤ nondef_2 ∧ X₂ ≤ 2⋅nondef_3 ∧ 0 ≤ nondef_3 ∧ 0 ≤ X₂
t₃₉: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_1 ≤ 2+X₂ ∧ 2⋅nondef_3 ≤ 2+X₂ ∧ 2⋅nondef_2 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_1 ∧ 1+X₂ ≤ 2⋅nondef_3 ∧ 2+X₂ ≤ 0 ∧ nondef_1 ≤ 0 ∧ X₂ ≤ 2⋅nondef_2 ∧ 0 ≤ nondef_2 ∧ nondef_3 ≤ 0 ∧ 0 ≤ X₂
t₄₀: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_1 ≤ 2+X₂ ∧ 2⋅nondef_2 ≤ 2+X₂ ∧ 0 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_1 ∧ 1+X₂ ≤ 2⋅nondef_2 ∧ 1+X₂ ≤ 0 ∧ 2+X₂ ≤ 0 ∧ nondef_1 ≤ 0 ∧ nondef_2 ≤ 0 ∧ 0 ≤ nondef_3 ∧ nondef_3 ≤ 0
t₄₁: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_1 ≤ 2+X₂ ∧ 2⋅nondef_2 ≤ 2+X₂ ∧ 2⋅nondef_3 ≤ 1+X₂ ∧ 1+X₂ ≤ 2⋅nondef_1 ∧ 1+X₂ ≤ 2⋅nondef_2 ∧ 2+X₂ ≤ 0 ∧ nondef_1 ≤ 0 ∧ nondef_2 ≤ 0 ∧ X₂ ≤ 2⋅nondef_3 ∧ 0 ≤ nondef_3 ∧ 0 ≤ X₂
t₄₂: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_1 ≤ 2+X₂ ∧ 2⋅nondef_2 ≤ 2+X₂ ∧ 2⋅nondef_3 ≤ 2+X₂ ∧ 1+X₂ ≤ 2⋅nondef_1 ∧ 1+X₂ ≤ 2⋅nondef_2 ∧ 1+X₂ ≤ 2⋅nondef_3 ∧ 2+X₂ ≤ 0 ∧ nondef_1 ≤ 0 ∧ nondef_2 ≤ 0 ∧ nondef_3 ≤ 0
t₄₆: eval_realheapsort_step1_bb5_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_stop(X₀, X₁, X₂, X₃)
t₀: eval_realheapsort_step1_start(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb0_in(X₀, X₁, X₂, X₃)
Preprocessing
Cut unsatisfiable transition [t₁₀: eval_realheapsort_step1_bb3_in→eval_realheapsort_step1_bb4_in; t₁₂: eval_realheapsort_step1_bb3_in→eval_realheapsort_step1_bb4_in; t₁₃: eval_realheapsort_step1_bb3_in→eval_realheapsort_step1__critedge_in; t₁₅: eval_realheapsort_step1_bb3_in→eval_realheapsort_step1__critedge_in; t₁₇: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₁₈: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₁₉: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₂₀: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₂₁: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₂₂: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₂₃: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₂₄: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₂₅: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₂₆: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₂₇: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₂₈: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₃₀: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₃₁: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₃₂: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₃₃: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₃₄: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₃₅: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₃₆: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₃₇: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₃₈: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₃₉: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₄₀: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₄₁: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in]
Cut unsatisfiable transition [t₁₆: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in; t₄₂: eval_realheapsort_step1_bb4_in→eval_realheapsort_step1_bb2_in]
Found invariant 1+X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 4 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₁ for location eval_realheapsort_step1_bb4_in
Found invariant 1+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 4 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 0 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location eval_realheapsort_step1_29
Found invariant X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 4 ≤ X₁+X₃ ∧ 3 ≤ X₁ for location eval_realheapsort_step1_bb1_in
Found invariant 1+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 4 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 0 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location eval_realheapsort_step1_28
Found invariant 1+X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 4 ≤ X₁+X₃ ∧ 0 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₁ for location eval_realheapsort_step1_bb2_in
Found invariant 1+X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 4 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₁ for location eval_realheapsort_step1_bb3_in
Found invariant 1+X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 4 ≤ X₁+X₃ ∧ 0 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₁ for location eval_realheapsort_step1__critedge_in
Problem after Preprocessing
Start: eval_realheapsort_step1_start
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: nondef_0, nondef_1, nondef_2, nondef_3
Locations: eval_realheapsort_step1_0, eval_realheapsort_step1_1, eval_realheapsort_step1_2, eval_realheapsort_step1_28, eval_realheapsort_step1_29, eval_realheapsort_step1__critedge_in, eval_realheapsort_step1_bb0_in, eval_realheapsort_step1_bb1_in, eval_realheapsort_step1_bb2_in, eval_realheapsort_step1_bb3_in, eval_realheapsort_step1_bb4_in, eval_realheapsort_step1_bb5_in, eval_realheapsort_step1_start, eval_realheapsort_step1_stop
Transitions:
t₂: eval_realheapsort_step1_0(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_1(X₀, X₁, X₂, X₃)
t₃: eval_realheapsort_step1_1(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_2(X₀, X₁, X₂, X₃)
t₄: eval_realheapsort_step1_2(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb1_in(X₀, X₁, X₂, 1) :|: 3 ≤ X₁
t₅: eval_realheapsort_step1_2(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb5_in(X₀, X₁, X₂, X₃) :|: X₁ ≤ 2
t₄₄: eval_realheapsort_step1_28(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_29(X₀, X₁, X₂, X₃) :|: X₀ ≤ 1+X₃ ∧ 1+X₃ ≤ X₀ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀ ∧ 2 ≤ X₀+X₂ ∧ 3 ≤ X₀+X₃ ∧ 3 ≤ X₁ ∧ 3 ≤ X₁+X₂ ∧ 4 ≤ X₁+X₃ ∧ 5 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₂
t₄₅: eval_realheapsort_step1_29(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb1_in(X₀, X₁, X₂, X₀) :|: X₀ ≤ 1+X₃ ∧ 1+X₃ ≤ X₀ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀ ∧ 2 ≤ X₀+X₂ ∧ 3 ≤ X₀+X₃ ∧ 3 ≤ X₁ ∧ 3 ≤ X₁+X₂ ∧ 4 ≤ X₁+X₃ ∧ 5 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₂
t₄₃: eval_realheapsort_step1__critedge_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_28(1+X₃, X₁, X₂, X₃) :|: 1+X₃ ≤ X₁ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₃ ∧ 3 ≤ X₁ ∧ 3 ≤ X₁+X₂ ∧ 4 ≤ X₁+X₃ ∧ 0 ≤ X₂
t₁: eval_realheapsort_step1_bb0_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_0(X₀, X₁, X₂, X₃)
t₆: eval_realheapsort_step1_bb1_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, X₃, X₃) :|: 1+X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 3 ≤ X₁ ∧ 4 ≤ X₁+X₃ ∧ X₃ ≤ X₁
t₇: eval_realheapsort_step1_bb1_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb5_in(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ 1 ≤ X₃ ∧ 3 ≤ X₁ ∧ 4 ≤ X₁+X₃ ∧ X₃ ≤ X₁
t₉: eval_realheapsort_step1_bb2_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1__critedge_in(X₀, X₁, X₂, X₃) :|: X₂ ≤ 0 ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₃ ∧ 3 ≤ X₁ ∧ 3 ≤ X₁+X₂ ∧ 4 ≤ X₁+X₃ ∧ 0 ≤ X₂
t₈: eval_realheapsort_step1_bb2_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb3_in(X₀, X₁, X₂, X₃) :|: 1 ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₃ ∧ 3 ≤ X₁ ∧ 3 ≤ X₁+X₂ ∧ 4 ≤ X₁+X₃ ∧ 0 ≤ X₂
t₁₄: eval_realheapsort_step1_bb3_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1__critedge_in(X₀, X₁, X₂, X₃) :|: 2⋅nondef_0 ≤ 1+X₂ ∧ X₂ ≤ 2⋅nondef_0 ∧ 0 ≤ nondef_0 ∧ 0 ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 3 ≤ X₁ ∧ 4 ≤ X₁+X₂ ∧ 4 ≤ X₁+X₃
t₁₁: eval_realheapsort_step1_bb3_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) :|: 2⋅nondef_0 ≤ 1+X₂ ∧ X₂ ≤ 2⋅nondef_0 ∧ 0 ≤ nondef_0 ∧ 0 ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 3 ≤ X₁ ∧ 4 ≤ X₁+X₂ ∧ 4 ≤ X₁+X₃
t₂₉: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_1 ≤ 1+X₂ ∧ 2⋅nondef_2 ≤ 1+X₂ ∧ 2⋅nondef_3 ≤ 1+X₂ ∧ X₂ ≤ 2⋅nondef_1 ∧ 0 ≤ nondef_1 ∧ X₂ ≤ 2⋅nondef_2 ∧ 0 ≤ nondef_2 ∧ X₂ ≤ 2⋅nondef_3 ∧ 0 ≤ nondef_3 ∧ 0 ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 3 ≤ X₁ ∧ 4 ≤ X₁+X₂ ∧ 4 ≤ X₁+X₃
t₄₆: eval_realheapsort_step1_bb5_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_stop(X₀, X₁, X₂, X₃)
t₀: eval_realheapsort_step1_start(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb0_in(X₀, X₁, X₂, X₃)
MPRF for transition t₆: eval_realheapsort_step1_bb1_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, X₃, X₃) :|: 1+X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 3 ≤ X₁ ∧ 4 ≤ X₁+X₃ ∧ X₃ ≤ X₁ of depth 1:
new bound:
X₁+1 {O(n)}
MPRF:
• eval_realheapsort_step1_28: [X₁-X₀]
• eval_realheapsort_step1_29: [X₁-X₀]
• eval_realheapsort_step1__critedge_in: [X₁-1-X₃]
• eval_realheapsort_step1_bb1_in: [X₁-X₃]
• eval_realheapsort_step1_bb2_in: [X₁-1-X₃]
• eval_realheapsort_step1_bb3_in: [X₁-1-X₃]
• eval_realheapsort_step1_bb4_in: [X₁-1-X₃]
MPRF for transition t₉: eval_realheapsort_step1_bb2_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1__critedge_in(X₀, X₁, X₂, X₃) :|: X₂ ≤ 0 ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₃ ∧ 3 ≤ X₁ ∧ 3 ≤ X₁+X₂ ∧ 4 ≤ X₁+X₃ ∧ 0 ≤ X₂ of depth 1:
new bound:
X₁+1 {O(n)}
MPRF:
• eval_realheapsort_step1_28: [X₁-X₀]
• eval_realheapsort_step1_29: [X₁-X₀]
• eval_realheapsort_step1__critedge_in: [X₁-1-X₃]
• eval_realheapsort_step1_bb1_in: [X₁-X₃]
• eval_realheapsort_step1_bb2_in: [X₁-X₃]
• eval_realheapsort_step1_bb3_in: [X₁-X₃]
• eval_realheapsort_step1_bb4_in: [X₁-X₃]
MPRF for transition t₁₄: eval_realheapsort_step1_bb3_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1__critedge_in(X₀, X₁, X₂, X₃) :|: 2⋅nondef_0 ≤ 1+X₂ ∧ X₂ ≤ 2⋅nondef_0 ∧ 0 ≤ nondef_0 ∧ 0 ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 3 ≤ X₁ ∧ 4 ≤ X₁+X₂ ∧ 4 ≤ X₁+X₃ of depth 1:
new bound:
X₁+1 {O(n)}
MPRF:
• eval_realheapsort_step1_28: [X₁-1-X₃]
• eval_realheapsort_step1_29: [X₁-1-X₃]
• eval_realheapsort_step1__critedge_in: [X₁-1-X₃]
• eval_realheapsort_step1_bb1_in: [X₁-X₃]
• eval_realheapsort_step1_bb2_in: [X₁-X₃]
• eval_realheapsort_step1_bb3_in: [X₁-X₃]
• eval_realheapsort_step1_bb4_in: [X₁-X₃]
MPRF for transition t₄₃: eval_realheapsort_step1__critedge_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_28(1+X₃, X₁, X₂, X₃) :|: 1+X₃ ≤ X₁ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₃ ∧ 3 ≤ X₁ ∧ 3 ≤ X₁+X₂ ∧ 4 ≤ X₁+X₃ ∧ 0 ≤ X₂ of depth 1:
new bound:
X₁+1 {O(n)}
MPRF:
• eval_realheapsort_step1_28: [X₁-1-X₃]
• eval_realheapsort_step1_29: [X₁-X₀]
• eval_realheapsort_step1__critedge_in: [X₁-X₃]
• eval_realheapsort_step1_bb1_in: [X₁-X₃]
• eval_realheapsort_step1_bb2_in: [X₁-X₃]
• eval_realheapsort_step1_bb3_in: [X₁-X₃]
• eval_realheapsort_step1_bb4_in: [X₁-X₃]
MPRF for transition t₄₄: eval_realheapsort_step1_28(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_29(X₀, X₁, X₂, X₃) :|: X₀ ≤ 1+X₃ ∧ 1+X₃ ≤ X₀ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀ ∧ 2 ≤ X₀+X₂ ∧ 3 ≤ X₀+X₃ ∧ 3 ≤ X₁ ∧ 3 ≤ X₁+X₂ ∧ 4 ≤ X₁+X₃ ∧ 5 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₂ of depth 1:
new bound:
X₁+2 {O(n)}
MPRF:
• eval_realheapsort_step1_28: [1+X₁-X₃]
• eval_realheapsort_step1_29: [X₁-X₃]
• eval_realheapsort_step1__critedge_in: [1+X₁-X₃]
• eval_realheapsort_step1_bb1_in: [1+X₁-X₃]
• eval_realheapsort_step1_bb2_in: [1+X₁-X₃]
• eval_realheapsort_step1_bb3_in: [1+X₁-X₃]
• eval_realheapsort_step1_bb4_in: [1+X₁-X₃]
MPRF for transition t₄₅: eval_realheapsort_step1_29(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb1_in(X₀, X₁, X₂, X₀) :|: X₀ ≤ 1+X₃ ∧ 1+X₃ ≤ X₀ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₃ ∧ 2 ≤ X₀ ∧ 2 ≤ X₀+X₂ ∧ 3 ≤ X₀+X₃ ∧ 3 ≤ X₁ ∧ 3 ≤ X₁+X₂ ∧ 4 ≤ X₁+X₃ ∧ 5 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 0 ≤ X₂ of depth 1:
new bound:
X₁+1 {O(n)}
MPRF:
• eval_realheapsort_step1_28: [X₁-X₃]
• eval_realheapsort_step1_29: [X₁-X₃]
• eval_realheapsort_step1__critedge_in: [X₁-X₃]
• eval_realheapsort_step1_bb1_in: [X₁-X₃]
• eval_realheapsort_step1_bb2_in: [X₁-X₃]
• eval_realheapsort_step1_bb3_in: [X₁-X₃]
• eval_realheapsort_step1_bb4_in: [X₁-X₃]
MPRF for transition t₈: eval_realheapsort_step1_bb2_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb3_in(X₀, X₁, X₂, X₃) :|: 1 ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂+X₃ ∧ 1 ≤ X₃ ∧ 3 ≤ X₁ ∧ 3 ≤ X₁+X₂ ∧ 4 ≤ X₁+X₃ ∧ 0 ≤ X₂ of depth 1:
new bound:
2⋅X₁⋅X₁+7⋅X₁+8 {O(n^2)}
MPRF:
• eval_realheapsort_step1_28: [0]
• eval_realheapsort_step1_29: [0]
• eval_realheapsort_step1__critedge_in: [0]
• eval_realheapsort_step1_bb1_in: [1+2⋅X₃]
• eval_realheapsort_step1_bb2_in: [1+2⋅X₂]
• eval_realheapsort_step1_bb3_in: [2⋅X₂]
• eval_realheapsort_step1_bb4_in: [X₂]
MPRF for transition t₁₁: eval_realheapsort_step1_bb3_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) :|: 2⋅nondef_0 ≤ 1+X₂ ∧ X₂ ≤ 2⋅nondef_0 ∧ 0 ≤ nondef_0 ∧ 0 ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 3 ≤ X₁ ∧ 4 ≤ X₁+X₂ ∧ 4 ≤ X₁+X₃ of depth 1:
new bound:
2⋅X₁⋅X₁+7⋅X₁+8 {O(n^2)}
MPRF:
• eval_realheapsort_step1_28: [0]
• eval_realheapsort_step1_29: [0]
• eval_realheapsort_step1__critedge_in: [2⋅X₂]
• eval_realheapsort_step1_bb1_in: [1+2⋅X₃]
• eval_realheapsort_step1_bb2_in: [1+2⋅X₂]
• eval_realheapsort_step1_bb3_in: [1+2⋅X₂]
• eval_realheapsort_step1_bb4_in: [2⋅X₂]
MPRF for transition t₂₉: eval_realheapsort_step1_bb4_in(X₀, X₁, X₂, X₃) → eval_realheapsort_step1_bb2_in(X₀, X₁, nondef_3-1, X₃) :|: 2⋅nondef_1 ≤ 1+X₂ ∧ 2⋅nondef_2 ≤ 1+X₂ ∧ 2⋅nondef_3 ≤ 1+X₂ ∧ X₂ ≤ 2⋅nondef_1 ∧ 0 ≤ nondef_1 ∧ X₂ ≤ 2⋅nondef_2 ∧ 0 ≤ nondef_2 ∧ X₂ ≤ 2⋅nondef_3 ∧ 0 ≤ nondef_3 ∧ 0 ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 3 ≤ X₁ ∧ 4 ≤ X₁+X₂ ∧ 4 ≤ X₁+X₃ of depth 1:
new bound:
2⋅X₁⋅X₁+7⋅X₁+8 {O(n^2)}
MPRF:
• eval_realheapsort_step1_28: [0]
• eval_realheapsort_step1_29: [0]
• eval_realheapsort_step1__critedge_in: [0]
• eval_realheapsort_step1_bb1_in: [1+2⋅X₃]
• eval_realheapsort_step1_bb2_in: [1+2⋅X₂]
• eval_realheapsort_step1_bb3_in: [1+2⋅X₂]
• eval_realheapsort_step1_bb4_in: [1+2⋅X₂]
Cut unreachable locations [eval_realheapsort_step1_bb3_in] from the program graph
Cut unsatisfiable transition [t₉: eval_realheapsort_step1_bb2_in→eval_realheapsort_step1__critedge_in; t₂₄₉: eval_realheapsort_step1_bb2_in→eval_realheapsort_step1__critedge_in]
Found invariant 1+X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 4 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₁ for location eval_realheapsort_step1_bb4_in_v1
Found invariant 1+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 4 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 0 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location eval_realheapsort_step1_29
Found invariant X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 4 ≤ X₁+X₃ ∧ 3 ≤ X₁ for location eval_realheapsort_step1_bb1_in
Found invariant 1+X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 4 ≤ X₁+X₃ ∧ 0 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₁ for location eval_realheapsort_step1_bb2_in_v1
Found invariant 1+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 4 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 0 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location eval_realheapsort_step1_28
Found invariant X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 4 ≤ X₁+X₃ ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₁ for location eval_realheapsort_step1_bb2_in
Found invariant 1+X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 4 ≤ X₁+X₃ ∧ 1 ≤ X₂ ∧ 4 ≤ X₁+X₂ ∧ 3 ≤ X₁ for location eval_realheapsort_step1_bb3_in_v1
Found invariant 1+X₃ ≤ X₁ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 4 ≤ X₁+X₃ ∧ 0 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₁ for location eval_realheapsort_step1__critedge_in
All Bounds
Timebounds
Overall timebound:6⋅X₁⋅X₁+27⋅X₁+39 {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₆: X₁+1 {O(n)}
t₇: 1 {O(1)}
t₈: 2⋅X₁⋅X₁+7⋅X₁+8 {O(n^2)}
t₉: X₁+1 {O(n)}
t₁₁: 2⋅X₁⋅X₁+7⋅X₁+8 {O(n^2)}
t₁₄: X₁+1 {O(n)}
t₂₉: 2⋅X₁⋅X₁+7⋅X₁+8 {O(n^2)}
t₄₃: X₁+1 {O(n)}
t₄₄: X₁+2 {O(n)}
t₄₅: X₁+1 {O(n)}
t₄₆: 1 {O(1)}
Costbounds
Overall costbound: 6⋅X₁⋅X₁+27⋅X₁+39 {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₆: X₁+1 {O(n)}
t₇: 1 {O(1)}
t₈: 2⋅X₁⋅X₁+7⋅X₁+8 {O(n^2)}
t₉: X₁+1 {O(n)}
t₁₁: 2⋅X₁⋅X₁+7⋅X₁+8 {O(n^2)}
t₁₄: X₁+1 {O(n)}
t₂₉: 2⋅X₁⋅X₁+7⋅X₁+8 {O(n^2)}
t₄₃: X₁+1 {O(n)}
t₄₄: X₁+2 {O(n)}
t₄₅: 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₃: 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₀+X₁+2 {O(n)}
t₆, X₁: X₁ {O(n)}
t₆, X₂: X₁+3 {O(n)}
t₆, X₃: X₁+2 {O(n)}
t₇, X₀: X₁+2 {O(n)}
t₇, X₁: X₁ {O(n)}
t₇, X₂: X₁+3 {O(n)}
t₇, X₃: X₁+2 {O(n)}
t₈, X₀: X₀+X₁+2 {O(n)}
t₈, X₁: X₁ {O(n)}
t₈, X₂: X₁+3 {O(n)}
t₈, X₃: X₁+2 {O(n)}
t₉, X₀: X₀+X₁+2 {O(n)}
t₉, X₁: X₁ {O(n)}
t₉, X₂: 0 {O(1)}
t₉, X₃: X₁+2 {O(n)}
t₁₁, X₀: X₀+X₁+2 {O(n)}
t₁₁, X₁: X₁ {O(n)}
t₁₁, X₂: X₁+3 {O(n)}
t₁₁, X₃: X₁+2 {O(n)}
t₁₄, X₀: X₀+X₁+2 {O(n)}
t₁₄, X₁: X₁ {O(n)}
t₁₄, X₂: X₁+3 {O(n)}
t₁₄, X₃: X₁+2 {O(n)}
t₂₉, X₀: X₀+X₁+2 {O(n)}
t₂₉, X₁: X₁ {O(n)}
t₂₉, X₂: X₁+3 {O(n)}
t₂₉, X₃: X₁+2 {O(n)}
t₄₃, X₀: X₁+2 {O(n)}
t₄₃, X₁: X₁ {O(n)}
t₄₃, X₂: X₁+3 {O(n)}
t₄₃, X₃: 2⋅X₁+4 {O(n)}
t₄₄, X₀: X₁+2 {O(n)}
t₄₄, X₁: X₁ {O(n)}
t₄₄, X₂: X₁+3 {O(n)}
t₄₄, X₃: 2⋅X₁+4 {O(n)}
t₄₅, X₀: X₁+2 {O(n)}
t₄₅, X₁: X₁ {O(n)}
t₄₅, X₂: X₁+3 {O(n)}
t₄₅, X₃: X₁+2 {O(n)}
t₄₆, X₀: X₀+X₁+2 {O(n)}
t₄₆, X₁: 2⋅X₁ {O(n)}
t₄₆, X₂: X₁+X₂+3 {O(n)}
t₄₆, X₃: X₁+X₃+2 {O(n)}