No incumbent solution for MIQP program

Dear gurobi forum, 

when I try to solve my MIQP program I have the problem that gurobi does not find an incumbent solution and gives me the following output. Do you have any ideas on how to deal with this? Thank you in advance!

Anita

Set parameter LogFile to value "./gurobi.log"
Warning: parameter changes on this environment will not affect existing models.
Set parameter FeasibilityTol to value 0.0001
Set parameter MIPGapAbs to value 0.0001
Set parameter Threads to value 5
Set parameter IntegralityFocus to value 1
Warning: Q constraint 0 doesn't have a name
Gurobi Optimizer version 9.5.0 build v9.5.0rc5 (win64)
Thread count: 6 physical cores, 6 logical processors, using up to 5 threads
Optimize a model with 42820 rows, 51490 columns and 227332 nonzeros
Model fingerprint: 0xbe486d53
Model has 3380 quadratic constraints
Variable types: 45401 continuous, 6089 integer (6089 binary)
Coefficient statistics:
  Matrix range     [1e-04, 5e+02]
  QMatrix range    [6e-02, 1e+02]
  QLMatrix range   [1e-04, 7e+03]
  Objective range  [1e+00, 1e+00]
  Bounds range     [1e+00, 1e+05]
  RHS range        [1e-04, 7e+03]
Presolve removed 25026 rows and 17835 columns
Presolve time: 1.29s
Presolved: 34314 rows, 39161 columns, 181065 nonzeros
Variable types: 37373 continuous, 1788 integer (1784 binary)

Deterministic concurrent LP optimizer: primal and dual simplex
Showing first log only...


Root simplex log...

Iteration    Objective       Primal Inf.    Dual Inf.      Time
   23031    0.0000000e+00   2.404187e+05   8.581151e+09      5s
   43890    0.0000000e+00   1.689014e+05   1.141097e+09     10s
   66642    0.0000000e+00   1.373171e+04   1.091688e+12     15s
   77713    0.0000000e+00   3.238401e+03   7.313837e+07     20s
Concurrent spin time: 3.52s

Solved with dual simplex

Root relaxation: objective -1.617966e+01, 24032 iterations, 18.47 seconds (22.41 work units)
Total elapsed time = 21.40s
Total elapsed time = 25.49s
Total elapsed time = 32.94s

    Nodes    |    Current Node    |     Objective Bounds      |     Work
 Expl Unexpl |  Obj  Depth IntInf | Incumbent    BestBd   Gap | It/Node Time

     0     0  -16.17966    0    3          -  -16.17966      -     -   39s
     0     0  -16.17966    0    3          -  -16.17966      -     -  128s
     0     0  -16.17966    0    3          -  -16.17966      -     -  129s
     0     0  -16.17966    0    3          -  -16.17966      -     -  130s
     0     2  -16.17966    0    3          -  -16.17966      -     -  139s
     1     3 infeasible    1               -  -16.17966      - 18142  153s
     3     2  -16.17966    2   39          -  -16.17966      -  7376  238s
     5     2 infeasible    3               -  -16.17966      - 29253  247s
     7     3  -16.17966    4   33          -  -16.17966      - 21349  302s
     9     3  postponed    5               -  -16.17966      - 34377  383s
    11     2  -16.17966    6   47          -  -16.17966      - 29363  489s
    13     2 infeasible    7               -  -16.17966      - 33904  512s
    15     3  -16.17966    8   63          -  -16.17966      - 29627  638s
    17     2 infeasible    9               -  -16.17966      - 31810  671s
    19     2  -16.17966   10   38          -  -16.17966      - 29854  687s
    21     2 infeasible   11               -  -16.17966      - 29783  746s
    23     2  -16.17966   12   49          -  -16.17966      - 27218  758s
    25     3 infeasible   13               -  -16.17966      - 25837  772s
    28     2  -16.17966   15   51          -  -16.17966      - 23416  806s

Cutting planes:
  MIR: 1

Explored 31 nodes (771825 simplex iterations) in 806.45 seconds (1244.90 work units)
Thread count was 5 (of 6 available processors)

Solution count 0

Sub-optimal termination (unable to solve some node relaxations)
Best objective -, best bound -1.617966181733e+01, gap -

User-callback calls 63511, time in user-callback 0.02 sec
IIS runtime: 4813.84 seconds (7138.95 work units)