No solution after strong branching

When running a model with lazy constraints generator enabled I observe that strong branching finds an integer solution but finally there is no solution found. Below you can find log from the solver run:

```
Welcome to the CBC MILP Solver
Version: Trunk
Build Date: Feb 14 2020

Starting solution of the Linear programming relaxation problem using Dual Simplex

Coin0506I Presolve 2565 (-2323) rows, 9680 (-3902) columns and 161473 (-42575) elements
Clp0014I Perturbing problem by 0.001% of 4.4283328 - largest nonzero change 9.0462078e-07 ( 2.0428022e-05%) - largest zero change 9.046106e-07
Clp0000I Optimal - objective value 5044
Coin0511I After Postsolve, objective 5044, infeasibilities - dual 0 (0), primal 0 (0)
Clp0032I Optimal objective 5044 - 1967 iterations time 0.102, Presolve 0.05

Starting MIP optimization
Option for timeMode changed from cpu to elapsed
Option for preprocess changed from sos to off
Option for heuristicsOnOff changed from on to off
maxSavedSolutions was changed from 0 to 10
integerTolerance was changed from 1e-06 to 1e-06
Option for mergeCliques changed from off to after
Option for cliqueCuts changed from ifmove to off
Option for bkcliqueCuts changed from off to ifmove
Option for oddholewcCuts changed from off to ifmove
Continuous objective value is 5044 - 0.00 seconds
Cgl0015I Clique merge extended 0 cliques, 0 were dominated
Cbc0045I Fixing only non-zero variables.
Cbc0045I MIPStart solution provided values for 9114 of 9115 integer variables, 31 variables are still fractional.
Cbc0038I Full problem 4888 rows 13582 columns, reduced to 1768 rows 8884 columns
Cbc0038I Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Cbc0045I Mini branch and bound defined values for remaining variables in 2.02 seconds.
Cbc0045I MIPStart provided solution with cost 10519
Cbc0012I Integer solution of 5244 found by Reduced search after 0 iterations and 0 nodes (2.55 seconds)
Cbc0013I At root node, 0 cuts changed objective from 5044 to 5044 in 1 passes
Cbc0014I Cut generator 0 (LazyConstraints) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1
Cbc0014I Cut generator 1 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 2 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 3 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 4 (BKClique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 5 (OddHoleWC) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 6 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 7 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 8 (TwoMirCuts) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0014I Cut generator 9 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100
Cbc0010I After 0 nodes, 1 on tree, 5244 best solution, best possible 5044 (2.64 seconds)
Cbc0010I After 17 nodes, 12 on tree, 5244 best solution, best possible 5044 (3.65 seconds)
Cbc0010I After 33 nodes, 22 on tree, 5244 best solution, best possible 5044 (4.77 seconds)
Cbc0010I After 48 nodes, 25 on tree, 5244 best solution, best possible 5044 (5.86 seconds)
Cbc0038I Full problem 4888 rows 13582 columns, reduced to 1769 rows 8884 columns
Cbc0044I Reduced cost fixing - 1769 rows, 8884 columns - restarting search
Cbc0012I Integer solution of 5244 found by Previous solution after 0 iterations and 0 nodes (6.54 seconds)
Cbc0031I 36 added rows had average density of 650.05556
Cbc0013I At root node, 36 cuts changed objective from 5044 to 5044 in 10 passes
Cbc0014I Cut generator 0 (LazyConstraints) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is 1
Cbc0014I Cut generator 1 (Probing) - 27 row cuts average 291.4 elements, 1 column cuts (1 active) in 0.753 seconds - new frequency is 1
Cbc0014I Cut generator 2 (Gomory) - 182 row cuts average 1378.5 elements, 0 column cuts (0 active) in 0.191 seconds - new frequency is -100
Cbc0014I Cut generator 3 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.011 seconds - new frequency is -100
Cbc0014I Cut generator 4 (BKClique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100
Cbc0014I Cut generator 5 (OddHoleWC) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100
Cbc0014I Cut generator 6 (MixedIntegerRounding2) - 186 row cuts average 610.7 elements, 0 column cuts (0 active) in 0.170 seconds - new frequency is 1
Cbc0014I Cut generator 7 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.043 seconds - new frequency is -100
Cbc0014I Cut generator 8 (TwoMirCuts) - 19 row cuts average 284.7 elements, 0 column cuts (0 active) in 0.098 seconds - new frequency is -100
Cbc0014I Cut generator 9 (ZeroHalf) - 2 row cuts average 7226.5 elements, 0 column cuts (0 active) in 0.049 seconds - new frequency is -100
Cbc0014I Cut generator 10 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100
Cbc0010I After 0 nodes, 1 on tree, 5244 best solution, best possible 5044 (8.33 seconds)
Cbc0010I After 11 nodes, 11 on tree, 5244 best solution, best possible 5044 (9.54 seconds)
Cbc0010I After 19 nodes, 15 on tree, 5244 best solution, best possible 5044 (10.63 seconds)
Cbc0010I After 29 nodes, 18 on tree, 5244 best solution, best possible 5044 (11.71 seconds)
Cbc0010I After 38 nodes, 20 on tree, 5244 best solution, best possible 5044 (12.78 seconds)
Cbc0010I After 46 nodes, 22 on tree, 5244 best solution, best possible 5044 (13.81 seconds)
**Cbc0016I Integer solution of 5076 found by strong branching after 4509 iterations and 51 nodes (14.21 seconds)
Cbc0016I Integer solution of 5074 found by strong branching after 4543 iterations and 51 nodes (14.25 seconds)**
Cbc0010I After 58 nodes, 25 on tree, 5074 best solution, best possible 5044 (14.84 seconds)
Cbc0010I After 68 nodes, 30 on tree, 5074 best solution, best possible 5044 (15.85 seconds)
Cbc0010I After 77 nodes, 34 on tree, 5074 best solution, best possible 5044 (16.92 seconds)
Cbc0010I After 88 nodes, 36 on tree, 5074 best solution, best possible 5044 (17.93 seconds)
Cbc0010I After 102 nodes, 42 on tree, 5074 best solution, best possible 5044 (19.01 seconds)
Cbc0010I After 114 nodes, 48 on tree, 5074 best solution, best possible 5044 (20.03 seconds)
Cbc0010I After 128 nodes, 53 on tree, 5074 best solution, best possible 5044 (21.11 seconds)
Cbc0010I After 141 nodes, 56 on tree, 5074 best solution, best possible 5044 (22.21 seconds)
Cbc0010I After 154 nodes, 60 on tree, 5074 best solution, best possible 5044 (23.34 seconds)
Cbc0010I After 167 nodes, 64 on tree, 5074 best solution, best possible 5044 (24.41 seconds)
Cbc0010I After 179 nodes, 71 on tree, 5074 best solution, best possible 5044 (25.49 seconds)
Cbc0010I After 195 nodes, 71 on tree, 5074 best solution, best possible 5044 (26.61 seconds)
Cbc0010I After 210 nodes, 76 on tree, 5074 best solution, best possible 5044 (27.66 seconds)
Cbc0010I After 222 nodes, 79 on tree, 5074 best solution, best possible 5044 (28.70 seconds)
Cbc0010I After 238 nodes, 83 on tree, 5074 best solution, best possible 5044 (29.77 seconds)
Cbc0010I After 252 nodes, 87 on tree, 5074 best solution, best possible 5044 (30.82 seconds)
Cbc0010I After 262 nodes, 92 on tree, 5074 best solution, best possible 5044 (31.85 seconds)
Cbc0010I After 276 nodes, 93 on tree, 5074 best solution, best possible 5044 (32.93 seconds)
Cbc0010I After 286 nodes, 95 on tree, 5074 best solution, best possible 5044 (33.93 seconds)
Cbc0010I After 299 nodes, 99 on tree, 5074 best solution, best possible 5044 (34.94 seconds)
Cbc0010I After 314 nodes, 101 on tree, 5074 best solution, best possible 5044 (36.02 seconds)
Cbc0010I After 325 nodes, 103 on tree, 5074 best solution, best possible 5044 (37.04 seconds)
Cbc0010I After 336 nodes, 106 on tree, 5074 best solution, best possible 5044 (38.16 seconds)
Cbc0010I After 344 nodes, 110 on tree, 5074 best solution, best possible 5044 (39.25 seconds)
Cbc0010I After 353 nodes, 114 on tree, 5074 best solution, best possible 5044 (40.33 seconds)
Cbc0010I After 365 nodes, 117 on tree, 5074 best solution, best possible 5044 (41.36 seconds)
Cbc0010I After 373 nodes, 121 on tree, 5074 best solution, best possible 5044 (42.43 seconds)
Cbc0010I After 386 nodes, 123 on tree, 5074 best solution, best possible 5044 (43.55 seconds)
Cbc0010I After 406 nodes, 126 on tree, 5074 best solution, best possible 5044 (44.62 seconds)
Cbc0010I After 423 nodes, 129 on tree, 5074 best solution, best possible 5044 (45.67 seconds)
Cbc0010I After 435 nodes, 130 on tree, 5074 best solution, best possible 5044 (46.80 seconds)
Cbc0010I After 453 nodes, 131 on tree, 5074 best solution, best possible 5044 (47.84 seconds)
Cbc0010I After 466 nodes, 137 on tree, 5074 best solution, best possible 5044 (48.90 seconds)
Cbc0010I After 484 nodes, 142 on tree, 5074 best solution, best possible 5044 (49.96 seconds)
Cbc0010I After 500 nodes, 145 on tree, 5074 best solution, best possible 5044 (51.04 seconds)
Cbc0010I After 518 nodes, 149 on tree, 5074 best solution, best possible 5044 (52.07 seconds)
Cbc0010I After 537 nodes, 151 on tree, 5074 best solution, best possible 5044 (53.08 seconds)
Cbc0010I After 549 nodes, 155 on tree, 5074 best solution, best possible 5044 (54.16 seconds)
Cbc0010I After 564 nodes, 157 on tree, 5074 best solution, best possible 5044 (55.21 seconds)
Cbc0010I After 576 nodes, 163 on tree, 5074 best solution, best possible 5044 (56.28 seconds)
Cbc0010I After 585 nodes, 166 on tree, 5074 best solution, best possible 5044 (57.32 seconds)
Cbc0010I After 602 nodes, 169 on tree, 5074 best solution, best possible 5044 (58.36 seconds)
Cbc0010I After 614 nodes, 170 on tree, 5074 best solution, best possible 5044 (59.41 seconds)
Cbc0020I Exiting on maximum time
Cbc0005I Partial search - best objective 5074 (best possible 5044), took 40366 iterations and 627 nodes (60.03 seconds)
Cbc0032I Strong branching done 7854 times (43294 iterations), fathomed 29 nodes and fixed 2403 variables
Cbc0035I Maximum depth 32, 64266 variables fixed on reduced cost
Cbc0038I LazyConstraints was tried 555 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.124 seconds)
Cbc0038I Probing was tried 148 times and created 53 cuts of which 0 were active after adding rounds of cuts (1.128 seconds)
Cbc0038I Gomory was tried 10 times and created 182 cuts of which 0 were active after adding rounds of cuts (0.191 seconds)
Cbc0038I Knapsack was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.011 seconds)
Cbc0038I BKClique was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds)
Cbc0038I OddHoleWC was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.002 seconds)
Cbc0038I MixedIntegerRounding2 was tried 148 times and created 2108 cuts of which 0 were active after adding rounds of cuts (2.013 seconds)
Cbc0038I FlowCover was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.043 seconds)
Cbc0038I TwoMirCuts was tried 10 times and created 19 cuts of which 0 were active after adding rounds of cuts (0.098 seconds)
Cbc0038I ZeroHalf was tried 10 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.049 seconds)
Cbc0038I Clique was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds)
Cbc0020I Exiting on maximum time
Cbc0005I Partial search - best objective 5244 (best possible 5044), took 42187 iterations and 677 nodes (60.28 seconds)
Cbc0032I Strong branching done 884 times (3724 iterations), fathomed 7 nodes and fixed 212 variables
Cbc0035I Maximum depth 19, 6 variables fixed on reduced cost
Cuts at root node changed objective from 5044 to 5044
LazyConstraints was tried 53 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.019 seconds)
Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
BKClique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
OddHoleWC was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)
ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds)

Result - Stopped on time limit

**Objective value: 100000000000000007629769841091887003294964970946560.00000000
Lower bound: 5044.000
Gap: 19825535289452817607210609730501152828622372864.00**
Enumerated nodes: 677
Total iterations: 42187
Time (CPU seconds): 60.23
Time (Wallclock seconds): 60.46

Total time (CPU seconds): 60.23 (Wallclock seconds): 60.46
```