Iteration     │  Time  │  Dual cuts  │     Objective value     │   Objective gap   │     Current solution
     #: type      │  tot.  │   + | tot.  │       dual | primal     │    abs. | rel.    │    obj.fn. | max.err.
╶─────────────────┴────────┴─────────────┴─────────────────────────┴───────────────────┴───────────────────────────╴)

     1: MILP-O       0.09                           0 | inf.            inf. | 1.0e+00            0 | 9: 1.00e+00      
     1: NLPNEWDB-O   0.16                           0 | inf.            inf. | 1.0e+00            0 | 43: 1.72e-25     
gmsgenux.out: MIPSolverCbc.cpp:1271: virtual bool SHOT::MIPSolverCbc::createIntegerCut(SHOT::IntegerCut&): Assertion `variableValue >= VAR->lowerBound' failed.

(gdb) print variableValue
$1 = 0
(gdb) print VAR->lowerBound
$2 = 1

g3 1 1 0
 1 1 1 0 0 0
 1 1
 0 0
 1 0 0
 0 0 0 1
 0 0 0 0 0
 1 1
 0 0
 0 0 0 0 0
C0
o1
o5
v0
n2
n1
O0 0
n0
x1
0 0
r
2 0
b
3
k0
J0 1
0 0
G0 1
0 1

╶ Supporting Hyperplane Optimization Toolkit (SHOT) ──────────────────────────────────────────────────────────────────╴

 Andreas Lundell and Jan Kronqvist, Åbo Akademi University, Finland.
 See documentation for full list of contributors and utilized software libraries.

 Version: 1.0.1. Git hash: 9306c402. Released: Jul  1 2020.

 For more information visit https://shotsolver.dev

╶ Modeling system ────────────────────────────────────────────────────────────────────────────────────────────────────╴

 Modeling system:            OSiL
 Problem read from file:     160139061642117510802438150482602.osil

 Performing bound tightening on original problem.
  - Bounds for 0 variables tightened in 0.00 s.
 Performing bound tightening on reformulated problem.
  - Bounds for 0 variables tightened in 0.00 s.

╶ Problem instance ───────────────────────────────────────────────────────────────────────────────────────────────────╴

                                    Original             Reformulated

 Problem classification:            MIQCQP, nonconvex    MINLP, nonconvex

 Objective function direction:      maximize             maximize
 Objective function type:           linear               linear

 Number of constraints:             845                  845
  - linear:                         844                  844
  - nonconvex quadratic:            1                    0
  - nonconvex nonlinear:            0                    1

 Number of variables:               452                  452
  - real:                           226                  226
  - binary:                         226                  226
  - nonlinear:                      226                  226

╶ Options ────────────────────────────────────────────────────────────────────────────────────────────────────────────╴

 No options file specified.

 Nondefault options used:

  - Dual.ESH.InteriorPoint.CuttingPlane.IterationLimit = 50
  - Dual.HyperplaneCuts.ConstraintSelectionFactor = 1.0
  - Dual.HyperplaneCuts.UseIntegerCuts = true
  - Dual.MIP.Presolve.UpdateObtainedBounds = false
  - Dual.MIP.SolutionLimit.Initial = 2147483647
  - Dual.MIP.Solver = 2
  - Dual.Relaxation.Use = false
  - Dual.TreeStrategy = 0
  - Model.BoundTightening.FeasibilityBased.TimeLimit = 5.0
  - Model.Reformulation.Constraint.PartitionNonlinearTerms = 1
  - Model.Reformulation.Constraint.PartitionQuadraticTerms = 0
  - Model.Reformulation.ObjectiveFunction.PartitionNonlinearTerms = 1
  - Model.Reformulation.ObjectiveFunction.PartitionQuadraticTerms = 0
  - Model.Reformulation.Quadratics.Strategy = 0
  - Primal.FixedInteger.CallStrategy = 0
  - Primal.FixedInteger.OnlyUniqueIntegerCombinations = false
  - Primal.FixedInteger.Source = 0
  - Primal.Tolerance.TrustLinearConstraintValues = false
  - Termination.TimeLimit = 2.0

 Dual strategy:              Multi-tree
  - cut algorithm:           ESH
  - solver:                  Cbc 2.10.4

 Primal NLP solver:          Ipopt 3.13.3 (with default linear solver)


╶ Interior point search ──────────────────────────────────────────────────────────────────────────────────────────────╴

 Strategy selected:          cutting plane minimax


    Iteration     │  Time  │    Cuts     │     Objective value     │  Objective diff.
     #: type      │  tot.  │   + | tot.  │    problem | line srch  │    abs. | rel.
╶─────────────────┴────────┴─────────────┴─────────────────────────┴──────────────────╴
     1: LP           0.14                      -1e+12 | -1e+12          inf. | inf.
     2: LP           0.17      1 | 1      -0.00748551 | -0.00228258  5.2e-03 | 7.0e-01

 Valid interior point with constraint deviation -0.002 found.


    Iteration     │  Time  │  Dual cuts  │     Objective value     │   Objective gap   │     Current solution
     #: type      │  tot.  │   + | tot.  │     primal | dual       │    abs. | rel.    │    obj.fn. | max.err.)
╶─────────────────┴────────┴─────────────┴─────────────────────────┴───────────────────┴───────────────────────────╴)

     1: MILP-O       0.20                       -inf. | -0.703175       inf. | 1.0e+00    -0.703175 | 0: 4.80e-04
     1: NLPNEWDB-O   1.38                       -inf. | -0.703175       inf. | 1.0e+00              | inf.
        Solution is no longer global since integer cut has been added.
     2: MILP-O       1.44      2 | 2            -inf. |*-0.705359       inf. | 1.0e+00    -0.705359 | 0: 1.73e-05
     2: NLPNEWDB-O   2.12      2 | 2         -1.22593 |*-0.705359    5.2e-01 | 4.3e-01     -1.22593 | 0: -1.70e-03
     3: MILP-TL      2.16      5 | 7        -0.705445 |*-0.705359    8.6e-05 | 1.2e-04    -0.705445 | 0: 3.38e-08
     1: REDCUT-1     2.79   Obj.cut: -0.704739                                                                          
        Forced optimal iteration since difference between MIP solution and primal is small
     4: MILP-I       2.81                   -0.705445 |*inf.            inf. | inf.                 | inf.
     1: REP-SUCC     2.82   Repairs: 5
     5: MILP-I       2.84      2 | 9        -0.705445 |*inf.            inf. | inf.                 | inf.
     2: REP-SUCC     2.86   Repairs: 2
Segmentation fault (core dumped)

$ ./SHOT "spaaa  aa ce.osil"

╶ Supporting Hyperplane Optimization Toolkit (SHOT) ──────────────────────────────────────────────────────────────────╴

  Andreas Lundell and Jan Kronqvist, Åbo Akademi University, Finland.
  See documentation for full list of contributors and utilized software libraries.

  Version: 1.0.alpha 1. Git hash: 222ecf2. Released Jan 18 2020. 

  For more information visit https://shotsolver.dev

   Problem file spaaa not found!

--- jit.gms(112) 3 Mb
--- Generating MINLP model jit
--- jit.gms(119) 5 Mb
--- LOOPS c = case6
---   33 rows  26 columns  112 non-zeroes
---   50 nl-code  12 nl-non-zeroes
---   4 discrete-columns
***
***   4 Integer +INF Bounds have been reset to 100 (see Option IntVarUp)
***
--- jit.gms(119) 3 Mb
--- Executing SHOT: elapsed 0:00:01.304

SHOT             31.0.0 rb9ce796 ALFA Released  6Apr20 LEG x86 64bit/Linux    

╶ Supporting Hyperplane Optimization Toolkit (SHOT) ──────────────────────────────────────────────────────────────────╴

 Andreas Lundell and Jan Kronqvist, Åbo Akademi University, Finland.
 See documentation for full list of contributors and utilized software libraries.

 Version: 1.0.alpha 1. Git hash: fe4ddfe5. Released Apr  8 2020. 

 For more information visit https://shotsolver.dev

 Performing bound tightening on original problem.
  - Bounds for 16 variables tightened in 0.00 s.
 Performing bound tightening on reformulated problem.
  - Bounds for 37 variables tightened in 0.00 s.

╶ Problem instance ───────────────────────────────────────────────────────────────────────────────────────────────────╴

                                    Original             Reformulated

 Problem classification:            MINLP, convex        MINLP, convex

 Objective function direction:      minimize             minimize
 Objective function type:           nonlinear, convex    linear

 Number of constraints:             32                   44
  - linear:                         32                   32
  - convex nonlinear:               0                    12

 Number of variables:               25                   37
  - real:                           21                   33
  - integer:                        4                    4
  - nonlinear:                      12                   12

 Number of transformations performed:                    12
 - nonlinear expression partitioning:                    12


╶ Options ────────────────────────────────────────────────────────────────────────────────────────────────────────────╴

 No options file specified.

 Nondefault options used:

  - Dual.MIP.NumberOfThreads = 1
  - Model.Variables.Continuous.MaximumUpperBound = 1e+20
  - Model.Variables.Continuous.MinimumLowerBound = -1e+20
  - Subsolver.Ipopt.LinearSolver = 1
  - Termination.IterationLimit = 2147483647
  - Termination.ObjectiveGap.Absolute = 1e-10
  - Termination.ObjectiveGap.Relative = 1e-10
  - Termination.TimeLimit = 1000.0

 Dual strategy:              Single-tree
  - cut algorithm:           ESH
  - solver:                  CPLEX 12.10

 Primal NLP solver:          Ipopt 3.13.1 (with HSL MA27)


╶ Interior point search ──────────────────────────────────────────────────────────────────────────────────────────────╴

 Strategy selected:          cutting plane minimax
                                                                                     
    Iteration     │  Time  │    Cuts     │     Objective value     │  Objective diff.   
     #: type      │  tot.  │   + | tot.  │    problem | line srch  │    abs. | rel.    
╶─────────────────┴────────┴─────────────┴─────────────────────────┴──────────────────╴

     1: LP           0.01                      -1e+12 | -1e+12          inf. | inf.    
     2: LP           0.01      3 | 3          -686267 | 25758.3      7.1e+05 | 1.0e+00 
     3: LP           0.01      3 | 6          -303458 | 1542.13      3.1e+05 | 1.0e+00 
     4: LP           0.01      3 | 9         -11715.8 | 614.968      1.2e+04 | 1.1e+00 
     5: LP           0.02      3 | 12        -8339.16 | 413.795      8.8e+03 | 1.0e+00 
     6: LP           0.02      3 | 15        -8027.39 | -5351.59     2.7e+03 | 3.3e-01 

 Valid interior point with constraint deviation -5351.589 found.

                                                                                     
    Iteration     │  Time  │  Dual cuts  │     Objective value     │   Objective gap   │     Current solution
     #: type      │  tot.  │   + | tot.  │       dual | primal     │    abs. | rel.    │    obj.fn. | max.err.
╶─────────────────┴────────┴─────────────┴─────────────────────────┴───────────────────┴───────────────────────────╴

     1: LP-O         0.02                     46923.4 | inf.            inf. | 1.0e+00      46923.4 | 40: 3.88e+04     
     2: LP-O         0.02      6 | 6           143185 | inf.            inf. | 1.0e+00       143185 | 42: 2.67e+04     
     3: LP-O         0.02      6 | 12          188475 | inf.            inf. | 1.0e+00       188475 | 40: 9.16e+03     
     4: LP-O         0.02      4 | 16          195632 | inf.            inf. | 1.0e+00       195632 | 42: 2.90e+03     
     5: LP-O         0.03      6 | 22          198898 | inf.            inf. | 1.0e+00       198898 | 36: 6.31e+02     
     6: LP-O         0.03      6 | 28          200351 | inf.            inf. | 1.0e+00       200351 | 39: 2.79e+02     
     7: LP-O         0.03      6 | 34          200690 | inf.            inf. | 1.0e+00       200690 | 39: 6.86e+01     
     8: LP-O         0.03      6 | 40          200767 | inf.            inf. | 1.0e+00       200767 | 41: 2.26e+01     
     9: LP-O         0.04      6 | 46          200831 | inf.            inf. | 1.0e+00       200831 | 42: 4.46e+00     
    10: LP-O         0.04      6 | 52          200845 | inf.            inf. | 1.0e+00       200845 | 42: 6.37e-01     
    11: LP-O         0.04      6 | 58          200847 | inf.            inf. | 1.0e+00       200847 | 43: 6.02e-01     
    12: LP-O         0.04      6 | 64          200848 | inf.            inf. | 1.0e+00       200848 | 34: 1.59e-01     
    13: CB (th: 0)   0.05                      200849 | inf.            inf. | 1.0e+00       203454 | 37: 1.50e+02     
     1: NLPSOLPT-O   0.08      6 | 70          200849 | 204396       3.5e+03 | 1.7e-02       204396 | -1: 0.00e+00     
    20: CB (th: 0)   0.09                      201966 | 204396       2.4e+03 | 1.2e-02       204359 | 41: 2.41e+02     
...
 36078: MIP-O       166.71                     204359 | 204396       3.8e+01 | 1.9e-04       204198 | 41: 2.41e+02     
 36146: MIP-O       167.05                     204359 | 204396       3.8e+01 | 1.9e-04       204198 | 41: 2.41e+02     
 36214: MIP-O       167.45                     204359 | 204396       3.8e+01 | 1.9e-04       204198 | 41: 2.41e+02     
 36282: MIP-O       167.74                     204359 | 204396       3.8e+01 | 1.9e-04       204198 | 41: 2.41e+02     
 36350: MIP-O       168.08                     204359 | 204396       3.8e+01 | 1.9e-04       204198 | 41: 2.41e+02     
 36418: MIP-O       168.43                     204359 | 204396       3.8e+01 | 1.9e-04       204198 | 41: 2.41e+02     
^C        Terminated due to termination by user.


╶ Solution report ────────────────────────────────────────────────────────────────────────────────────────────────────╴

 Terminated by user.

 Feasible primal solution found to convex problem. Can not guarantee optimality to the given termination criteria.

 Objective bound (minimization) [dual, primal]:  [204359, 204396]
 Objective gap absolute / relative:              37.8156 / 0.000185011

 Fulfilled termination criteria: 

 Unfulfilled termination criteria: 
  - absolute objective gap tolerance             37.8156 > 1e-10
  - relative objective gap tolerance             0.000185011 > 1e-10
  - iteration limit                              36427 <= 2147483647
  - solution time limit (s)                      168.469 <= 1000

 Dual problems solved in main step:              18213
  - LP problems                                  12
  - MILP problems, optimal                       18201

 Problems solved during interior point search: 
 - LP problems:                                  6

 Fixed primal NLP problems solved:               3

 Number of primal solutions found:               1
 - NLP problem with fixed integers:              1

 Total solution time:                            168.469
  - problem initialization:                      0.00212419
  - problem reformulation:                       0.00180914
  - bound tightening:                            0.00182063
    - feasibility based (original problem:       0.000704119
    - feasibility based (reformulated problem:   0.00108138
  - interior point search:                       1.08863
    - solving relaxed problems:                  0.0273926
  - dual strategy:                               148.277
    - solving MIP problems:                      168.425
    - root search for constraint cuts:           28.6154
  - primal strategy:                             33.4185
    - solving NLP problems:                      16.3668
    - performing root searches:                  3.05559

(base) PS C:\Users\Damdae\OneDrive - SNU\Installation Files\solvers\shot\SHOT\build> cmake .. -DCMAKE-BUILD_TYPE=Release -DHAS_IPOPT=on -DHAS_CPLEX_=on -DHAS_GUROBI=on

-- Selecting Windows SDK version 10.0.22000.0 to target Windows 10.0.19044.
-- Git hash: 7f2b2af7
-- Found Gurobi folder: C:/Users/Damdae/OneDrive - SNU/Installation Files/solvers/gurobi/win64
-- Using Gurobi include folder: C:/Users/Damdae/OneDrive - SNU/Installation Files/solvers/gurobi/win64/include
-- Using Gurobi library folder: C:/Users/Damdae/OneDrive - SNU/Installation Files/solvers/gurobi/win64/lib
-- Found Gurobi library: C:/Users/Damdae/OneDrive - SNU/Installation Files/solvers/gurobi/win64/lib/gurobi_c++md2017.lib
-- Found Gurobi C++ library: C:/Users/Damdae/OneDrive - SNU/Installation Files/solvers/gurobi/win64/lib/gurobi95.lib
CMake Warning (dev) at C:/Program Files/CMake/share/cmake-3.22/Modules/FindPackageHandleStandardArgs.cmake:438 (message):
  The package name passed to `find_package_handle_standard_args` (GUROBI)
  does not match the name of the calling package (Gurobi).  This can lead to
  problems in calling code that expects `find_package` result variables
  (e.g., `_FOUND`) to follow a certain pattern.
Call Stack (most recent call first):
  misc/FindGurobi.cmake:114 (find_package_handle_standard_args)
  CMakeLists.txt:229 (find_package)
This warning is for project developers.  Use -Wno-dev to suppress it.

-- Could NOT find PkgConfig (missing: PKG_CONFIG_EXECUTABLE)
-- Checking for one of the modules 'ipopt'
CMake Error at C:/Program Files/CMake/share/cmake-3.22/Modules/FindPkgConfig.cmake:890 (message):
  None of the required 'ipopt' found
Call Stack (most recent call first):
  CMakeLists.txt:251 (pkg_search_module)


-- Gurobi include files will be used from: C:/Users/Damdae/OneDrive - SNU/Installation Files/solvers/gurobi/win64/include
-- The following Gurobi libraries will be used:
   C:/Users/Damdae/OneDrive - SNU/Installation Files/solvers/gurobi/win64/lib/gurobi_c++md2017.lib
   C:/Users/Damdae/OneDrive - SNU/Installation Files/solvers/gurobi/win64/lib/gurobi95.lib
-- Ipopt include files will be used from: C:\Users\Damdae\OneDrive - SNU\Installation Files\solvers\ipopt\bin\ipopt.exe/include/coin
-- The following Ipopt libraries will be used from:

-- Configuring incomplete, errors occurred!
See also "C:/Users/Damdae/OneDrive - SNU/Installation Files/solvers/shot/SHOT/build/CMakeFiles/CMakeOutput.log".

(base) PS C:\Users\Damdae\OneDrive - SNU\Installation Files\solvers\shot\SHOT\build> gcm ipopt

CommandType     Name                                               Version    Source
-----------     ----                                               -------    ------
Application     ipopt.exe                                          0.0.0.0    C:\Users\Damdae\OneDrive - SNU\Installation Files\solvers\ipopt\bin\ipopt.exe

    if(env->reformulatedProblem->properties.numberOfNonlinearConstraints == 0)
        env->settings->updateSetting("Console.DualSolver.Show", "Output", true);

*** gevCallSolver: Solve failed (ipopth,RMINLP,sl=5)
*** gevCallSolver: rc=2 msg=ipoReadyAPI failed

./SHOT ~/Research/minlplib/gms/tls4.gms --mip=cbc Subsolver.GAMS.NLP.Solver=ipopth --nlp=gams

╶ Supporting Hyperplane Optimization Toolkit (SHOT) ──────────────────────────────────────────────────────────────────╴

 Andreas Lundell and Jan Kronqvist, Åbo Akademi University, Finland.
 See documentation for full list of contributors and utilized software libraries.

 Version: 1.1.0. Git hash: d77d9bab. Released: Aug 20 2021.

 For more information visit https://shotsolver.dev

╶ Modeling system ────────────────────────────────────────────────────────────────────────────────────────────────────╴

 Modeling system:            GAMS
 Problem read from file:     /home/andreas/Research/minlplib/gms/tls4.gms

 Time to extract information on quadratics: 0.000000
 Performing bound tightening on original problem.
  - Bounds for 18 variables tightened in 0.00 s and 2 passes.
 Performing bound tightening on reformulated problem.
  - Bounds for 8 variables tightened in 0.00 s and 2 passes.

╶ Problem instance ───────────────────────────────────────────────────────────────────────────────────────────────────╴

                                    Original             Reformulated

 Problem classification:            MINLP, nonconvex     MINLP, convex

 Objective function direction:      minimize             minimize
 Objective function type:           linear               linear

 Number of constraints:             64                   72
  - linear:                         60                   60
  - convex nonlinear:               0                    12
  - nonconvex nonlinear:            4                    0

 Number of variables:               105                  113
  - real:                           16                   24
  - binary:                         85                   85
  - integer:                        4                    4
  - nonlinear:                      20                   20

 Number of transformations performed:                    8
  - signomial terms partitioning:                        8

╶ Options ────────────────────────────────────────────────────────────────────────────────────────────────────────────╴

 No options file specified.

 Options specified:

  - Dual.MIP.Solver = 2
  - Dual.TreeStrategy = 0
  - Model.Reformulation.Quadratics.Strategy = 0
  - Primal.FixedInteger.Solver = 1
  - Primal.Tolerance.TrustLinearConstraintValues = false
  - Subsolver.GAMS.NLP.Solver = ipopth

 Dual strategy:              Multi-tree
  - cut algorithm:           ESH
  - solver:                  Cbc 2.10

 Primal NLP solver:          IPOPTH in GAMS 36.1


╶ Interior point search ──────────────────────────────────────────────────────────────────────────────────────────────╴

 Strategy selected:          cutting plane minimax

    Iteration     │  Time  │    Cuts     │     Objective value     │  Objective diff.
     #: type      │  tot.  │   + | tot.  │    problem | line srch  │    abs. | rel.
╶─────────────────┴────────┴─────────────┴─────────────────────────┴──────────────────╴
     1: LP           0.05                      -1e+12 | -1e+12          inf. | inf.
     2: LP           0.05      3 | 3              -24 | 29.8059      5.4e+01 | 2.2e+00
     3: LP           0.05      3 | 6           -12.78 | 17.8589      3.1e+01 | 2.4e+00
     4: LP           0.06      3 | 9         -9.43449 | 8.2712       1.8e+01 | 1.9e+00
     5: LP           0.06      3 | 12          -7.973 | 3.41603      1.1e+01 | 1.4e+00
     6: LP           0.07      3 | 15        -7.77878 | 2.98475      1.1e+01 | 1.4e+00
     7: LP           0.07      3 | 18        -7.76863 | 2.7315       1.1e+01 | 1.4e+00
     8: LP           0.08      3 | 21        -7.74951 | 0.440303     8.2e+00 | 1.1e+00
     9: LP           0.08      3 | 24        -7.72154 | -0.126149    7.6e+00 | 9.8e-01

 Valid interior point with constraint deviation -0.126 found.

╶ Main iteration step ────────────────────────────────────────────────────────────────────────────────────────────────╴

    Iteration     │  Time  │  Dual cuts  │     Objective value     │   Objective gap   │     Current solution
     #: type      │  tot.  │   + | tot.  │       dual | primal     │    abs. | rel.    │    obj.fn. | max.err.
╶─────────────────┴────────┴─────────────┴─────────────────────────┴───────────────────┴──────────────────────────────╴

     1: LP-O         0.08                           0 | inf.            inf. | 1.0e+00            0 | 63: 6.34e+01
     4: LP-O         0.09      5 | 16        0.677373 | inf.            inf. | 1.0e+00     0.677373 | 62: 7.42e+00
     5: LP-O         0.10      6 | 22         1.30029 | inf.            inf. | 1.0e+00      1.30029 | 61: 3.47e+00
     6: LP-O         0.10      6 | 28         1.59129 | inf.            inf. | 1.0e+00      1.59129 | 64: 3.82e+00
     7: LP-O         0.11      4 | 32         1.64324 | inf.            inf. | 1.0e+00      1.64324 | 65: 1.73e+00
     8: LP-O         0.12      5 | 37         1.68228 | inf.            inf. | 1.0e+00      1.68228 | 60: 2.38e+00
    11: LP-O         0.13      4 | 48         1.68228 | inf.            inf. | 1.0e+00      1.68228 | 62: 2.89e-01
    12: MILP-SL1     0.16      5 | 53         1.74656 | inf.            inf. | 1.0e+00          6.1 | 68: 1.30e+01
*** gevCallSolver: Solve failed (ipopth,RMINLP,sl=5)
*** gevCallSolver: rc=2 msg=ipoReadyAPI failed
terminate called after throwing an instance of 'std::logic_error'
  what():  Calling GAMS NLP solver failed: Solve failed (ipopth,RMINLP,sl=5)
[1]    31037 abort      ./SHOT ~/Research/minlplib/gms/tls4.gms --mip=cbc  --nlp=gams

        Error when initializing problem:: "No Gurobi license found (...)"

Program received signal SIGSEGV, Segmentation fault.
0x00007fffefca8186 in GRBModel::addVar(double, double, double, char, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >) ()

g3 1 1 0
 1 1 1 0 0 0
 1 1
 0 0
 1 0 0
 0 0 0 1
 0 0 0 0 0
 1 1
 0 0
 0 0 0 0 0
C0
o1
o5
v0
n2
n1
O0 1
n0
x1
0 0
r
1 0
b
3
k0
J0 1
0 0
G0 1
0 1

       fs::filesystem::path source(
          fs::filesystem::canonical(env->settings->getSetting<std::string>("ProblemFile", "Input")));

       fs::filesystem::copy_file(
          source.string(), (debugDir / source.filename()).string(), fs::filesystem::copy_options::overwrite_existing);

    if(static_cast<ES_OutputDirectory>(env->settings->getSetting<int>("OutputDirectory", "Output"))
        == ES_OutputDirectory::Program)
    {
        fs::filesystem::path debugPath(fs::filesystem::current_path());
        debugPath /= problem->name;

        env->settings->updateSetting("Debug.Path", "Output", debugPath.string());
        env->settings->updateSetting("ResultPath", "Output", fs::filesystem::current_path().string());
    }

Variables  x1,x2,x3,b4,b5;
Binary Variables  b4,b5;
Equations  e1,e2,e3,e4;

e1.. -(sqr((-1.9) + x1) + sqr((-1.15) + x2)) + x3 =E= 0;
e2..    x1 + x2 - 2*b4 =L= 2.8;
e3..    x1 + x2 - 2*b4 =G= 1.2;
e4..    x1 - b5 =E= 1;

Model m / all /;
m.optcr      = 1E-6;
Solve m using MIQCP minimizing x3;

SHOT             31.0.0 re4be038 ALFA Released 19Dec19 LEG x86 64bit/Linux    

╶ Supporting Hyperplane Optimization Toolkit (SHOT) ──────────────────────────────────────────────────────────────────╴

  Andreas Lundell and Jan Kronqvist, Åbo Akademi University, Finland.
  See documentation for full list of contributors and utilized software libraries.

  Version: 1.0.alpha 1. Git hash: be1dabb. Released Jan 17 2020. 

  For more information visit https://shotsolver.dev

 Reading options from shot.opt

╶ Problem instance ───────────────────────────────────────────────────────────────────────────────────────────────────╴

                             Original             Reformulated

 Problem classification:     MIQP, convex         MIQP, convex
 Objective function type:    quadratic            quadratic

 Number of constraints:      3                    3
  - linear:                  3                    3

 Number of variables:        4                    4
  - real:                    2                    2
  - binary:                  2                    2


╶ Options ────────────────────────────────────────────────────────────────────────────────────────────────────────────╴

 No options file specified.

 Nondefault options used:

  - Dual.MIP.NumberOfThreads = 1
  - Dual.MIP.Solver = 2
  - Dual.TreeStrategy = 0
  - Model.Reformulation.Quadratics.Strategy = 0
  - Primal.Tolerance.TrustLinearConstraintValues = false
  - Subsolver.Ipopt.LinearSolver = 1
  - Termination.IterationLimit = 2147483647
  - Termination.ObjectiveGap.Absolute = 1e-10
  - Termination.ObjectiveGap.Relative = 1e-06
  - Termination.TimeLimit = 1000

  - solver:                  Cbc

 Primal NLP solver:          Ipopt with HSL MA27 linear solver


free(): invalid pointer

Program received signal SIGABRT, Aborted.
0x00007ffff7a89f25 in raise () from /usr/lib/libc.so.6
(gdb) bt
#0  0x00007ffff7a89f25 in raise () from /usr/lib/libc.so.6
#1  0x00007ffff7a73897 in abort () from /usr/lib/libc.so.6
#2  0x00007ffff7acd258 in __libc_message () from /usr/lib/libc.so.6
#3  0x00007ffff7ad477a in malloc_printerr () from /usr/lib/libc.so.6
#4  0x00007ffff7ad614c in _int_free () from /usr/lib/libc.so.6
#5  0x00007fffeff32c07 in ClpSimplexDual::dual(int, int) () from 
#6  0x00007fffeff0fbd9 in ClpSimplex::dual(int, int) () from 
#7  0x00007fffefe7c55f in OsiClpSolverInterface::resolve() () from 
#8  0x00007fffefd5276a in CbcModel::initialSolve() () from 
#9  0x00007fffefc8593d in CbcMain1(int, char const**, CbcModel&, int (*)(CbcModel*, int), CbcSolverUsefulData&) () from 
#10 0x00007fffefcb0655 in CbcMain1(int, char const**, CbcModel&) () from 
#11 0x00007fffef6f3447 in SHOT::MIPSolverCbc::solveProblem (this=0x55555565b8d0) at MIPSolverCbc.cpp:440
#12 0x00007fffef7622a2 in SHOT::TaskSolveIteration::run (this=0x55555568f6d0) at TaskSolveIteration.cpp:128
#13 0x00007fffef6d29f2 in SHOT::SolutionStrategyMultiTree::solveProblem (this=0x555555673ca0) at SolutionStrategyMultiTree.cpp:305
#14 0x00007fffef67084b in SHOT::Solver::solveProblem (this=0x7fffffffc840) at Solver.cpp:552
#15 0x00007fffef7df565 in shtCallSolver (Cptr=0x555555623530) at EntryPointsGAMS.cpp:201
#16 0x00007fffef7dfa64 in C__shtCallSolver (Cptr=0x555555623530) at EntryPointsGAMS.cpp:252

 Primal NLP solver:          Ipopt with HSL MA27 linear solver


Invalid read of size 1
   at 0x6046E67: CbcMain1(int, char const**, CbcModel&, int (*)(CbcModel*, int), CbcSolverUsefulData&) (in )
   by 0x6079654: CbcMain1(int, char const**, CbcModel&) (in )
   by 0x5ABC446: SHOT::MIPSolverCbc::solveProblem() (MIPSolverCbc.cpp:440)
   by 0x5B2B2A1: SHOT::TaskSolveIteration::run() (TaskSolveIteration.cpp:128)
   by 0x5A9B9F1: SHOT::SolutionStrategyMultiTree::solveProblem() (SolutionStrategyMultiTree.cpp:305)
   by 0x5A3984A: SHOT::Solver::solveProblem() (Solver.cpp:552)
   by 0x5BA8564: shtCallSolver (EntryPointsGAMS.cpp:201)
   by 0x5BA8A63: C__shtCallSolver (EntryPointsGAMS.cpp:252)
   by 0x52AFFEE: GMSCONF_tgmsconf_DOT_sccallsolver(GMSCONF_tgmsconf_OD_S*, int, void*, void*) (gmsconf.c:2443)
   by 0x52A4B6D: libsolver(unsigned char*, unsigned char*, unsigned char const*, GMOMDODEFEX_tgmomodel_OD_S**, GEVDOORG_tgmsenvironment_OD_S**) (gevdoorg.c:3042)
   by 0x52A61A3: GEVDOORG_tgmsenvironment_DOT_gevcallsolver(GEVDOORG_tgmsenvironment_OD_S*, void*, unsigned char const*, unsigned char const*, int, int, unsigned char const*, unsigned char const*, double, int, int, double, double, void**, unsigned char*) (gevdoorg.c:3427)
   by 0x5241786: gevcallsolver (joatdclib.c:5854)
 Address 0x5158ab0 is 0 bytes inside a block of size 31 free'd
   at 0x4839EAB: operator delete(void*) (vg_replace_malloc.c:586)
   by 0x5ABBBB2: SHOT::MIPSolverCbc::solveProblem() (MIPSolverCbc.cpp:390)
   by 0x5B2B2A1: SHOT::TaskSolveIteration::run() (TaskSolveIteration.cpp:128)
   by 0x5A9B9F1: SHOT::SolutionStrategyMultiTree::solveProblem() (SolutionStrategyMultiTree.cpp:305)
   by 0x5A3984A: SHOT::Solver::solveProblem() (Solver.cpp:552)
   by 0x5BA8564: shtCallSolver (EntryPointsGAMS.cpp:201)
   by 0x5BA8A63: C__shtCallSolver (EntryPointsGAMS.cpp:252)
   by 0x52AFFEE: GMSCONF_tgmsconf_DOT_sccallsolver(GMSCONF_tgmsconf_OD_S*, int, void*, void*) (gmsconf.c:2443)
   by 0x52A4B6D: libsolver(unsigned char*, unsigned char*, unsigned char const*, GMOMDODEFEX_tgmomodel_OD_S**, GEVDOORG_tgmsenvironment_OD_S**) (gevdoorg.c:3042)
   by 0x52A61A3: GEVDOORG_tgmsenvironment_DOT_gevcallsolver(GEVDOORG_tgmsenvironment_OD_S*, void*, unsigned char const*, unsigned char const*, int, int, unsigned char const*, unsigned char const*, double, int, int, double, double, void**, unsigned char*) (gevdoorg.c:3427)
   by 0x5241786: gevcallsolver (joatdclib.c:5854)
   by 0x11ECE9: GEVMDODEF_tgmsenvironment_DOT_gevcallsolver(GEVMDODEF_tgmsenvironment_OD_S*, void*, unsigned char const*, unsigned char const*, int, int, unsigned char const*, unsigned char const*, double, int, int, double, double, void**, unsigned char*) (gevmdodef.c:848)
 Block was alloc'd at
   at 0x4838DEF: operator new(unsigned long) (vg_replace_malloc.c:344)
   by 0x49D5631: std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_mutate(unsigned long, unsigned long, char const*, unsigned long) (basic_string.tcc:317)
   by 0x49D6581: std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_replace(unsigned long, unsigned long, char const*, unsigned long) (basic_string.tcc:466)
   by 0x59D7489: std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(char const*, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&&) (basic_string.h:6111)
   by 0x5ABBB90: SHOT::MIPSolverCbc::solveProblem() (MIPSolverCbc.cpp:390)
   by 0x5B2B2A1: SHOT::TaskSolveIteration::run() (TaskSolveIteration.cpp:128)
   by 0x5A9B9F1: SHOT::SolutionStrategyMultiTree::solveProblem() (SolutionStrategyMultiTree.cpp:305)
   by 0x5A3984A: SHOT::Solver::solveProblem() (Solver.cpp:552)
   by 0x5BA8564: shtCallSolver (EntryPointsGAMS.cpp:201)
   by 0x5BA8A63: C__shtCallSolver (EntryPointsGAMS.cpp:252)
   by 0x52AFFEE: GMSCONF_tgmsconf_DOT_sccallsolver(GMSCONF_tgmsconf_OD_S*, int, void*, void*) (gmsconf.c:2443)
   by 0x52A4B6D: libsolver(unsigned char*, unsigned char*, unsigned char const*, GMOMDODEFEX_tgmomodel_OD_S**, GEVDOORG_tgmsenvironment_OD_S**) (gevdoorg.c:3042)

Invalid read of size 1
   at 0x6046E3B: CbcMain1(int, char const**, CbcModel&, int (*)(CbcModel*, int), CbcSolverUsefulData&) (in )
   by 0x6079654: CbcMain1(int, char const**, CbcModel&) (in )
   by 0x5ABC446: SHOT::MIPSolverCbc::solveProblem() (MIPSolverCbc.cpp:440)
   by 0x5B2B2A1: SHOT::TaskSolveIteration::run() (TaskSolveIteration.cpp:128)
   by 0x5A9B9F1: SHOT::SolutionStrategyMultiTree::solveProblem() (SolutionStrategyMultiTree.cpp:305)
   by 0x5A3984A: SHOT::Solver::solveProblem() (Solver.cpp:552)
   by 0x5BA8564: shtCallSolver (EntryPointsGAMS.cpp:201)
   by 0x5BA8A63: C__shtCallSolver (EntryPointsGAMS.cpp:252)
   by 0x52AFFEE: GMSCONF_tgmsconf_DOT_sccallsolver(GMSCONF_tgmsconf_OD_S*, int, void*, void*) (gmsconf.c:2443)
   by 0x52A4B6D: libsolver(unsigned char*, unsigned char*, unsigned char const*, GMOMDODEFEX_tgmomodel_OD_S**, GEVDOORG_tgmsenvironment_OD_S**) (gevdoorg.c:3042)
   by 0x52A61A3: GEVDOORG_tgmsenvironment_DOT_gevcallsolver(GEVDOORG_tgmsenvironment_OD_S*, void*, unsigned char const*, unsigned char const*, int, int, unsigned char const*, unsigned char const*, double, int, int, double, double, void**, unsigned char*) (gevdoorg.c:3427)
   by 0x5241786: gevcallsolver (joatdclib.c:5854)
 Address 0x5158ab0 is 0 bytes inside a block of size 31 free'd
   at 0x4839EAB: operator delete(void*) (vg_replace_malloc.c:586)
   by 0x5ABBBB2: SHOT::MIPSolverCbc::solveProblem() (MIPSolverCbc.cpp:390)
   by 0x5B2B2A1: SHOT::TaskSolveIteration::run() (TaskSolveIteration.cpp:128)
   by 0x5A9B9F1: SHOT::SolutionStrategyMultiTree::solveProblem() (SolutionStrategyMultiTree.cpp:305)
   by 0x5A3984A: SHOT::Solver::solveProblem() (Solver.cpp:552)
   by 0x5BA8564: shtCallSolver (EntryPointsGAMS.cpp:201)
   by 0x5BA8A63: C__shtCallSolver (EntryPointsGAMS.cpp:252)
   by 0x52AFFEE: GMSCONF_tgmsconf_DOT_sccallsolver(GMSCONF_tgmsconf_OD_S*, int, void*, void*) (gmsconf.c:2443)
   by 0x52A4B6D: libsolver(unsigned char*, unsigned char*, unsigned char const*, GMOMDODEFEX_tgmomodel_OD_S**, GEVDOORG_tgmsenvironment_OD_S**) (gevdoorg.c:3042)
   by 0x52A61A3: GEVDOORG_tgmsenvironment_DOT_gevcallsolver(GEVDOORG_tgmsenvironment_OD_S*, void*, unsigned char const*, unsigned char const*, int, int, unsigned char const*, unsigned char const*, double, int, int, double, double, void**, unsigned char*) (gevdoorg.c:3427)
   by 0x5241786: gevcallsolver (joatdclib.c:5854)
   by 0x11ECE9: GEVMDODEF_tgmsenvironment_DOT_gevcallsolver(GEVMDODEF_tgmsenvironment_OD_S*, void*, unsigned char const*, unsigned char const*, int, int, unsigned char const*, unsigned char const*, double, int, int, double, double, void**, unsigned char*) (gevmdodef.c:848)
 Block was alloc'd at
   at 0x4838DEF: operator new(unsigned long) (vg_replace_malloc.c:344)
   by 0x49D5631: std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_mutate(unsigned long, unsigned long, char const*, unsigned long) (basic_string.tcc:317)
   by 0x49D6581: std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >::_M_replace(unsigned long, unsigned long, char const*, unsigned long) (basic_string.tcc:466)
   by 0x59D7489: std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > std::operator+<char, std::char_traits<char>, std::allocator<char> >(char const*, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >&&) (basic_string.h:6111)
   by 0x5ABBB90: SHOT::MIPSolverCbc::solveProblem() (MIPSolverCbc.cpp:390)
   by 0x5B2B2A1: SHOT::TaskSolveIteration::run() (TaskSolveIteration.cpp:128)
   by 0x5A9B9F1: SHOT::SolutionStrategyMultiTree::solveProblem() (SolutionStrategyMultiTree.cpp:305)
   by 0x5A3984A: SHOT::Solver::solveProblem() (Solver.cpp:552)
   by 0x5BA8564: shtCallSolver (EntryPointsGAMS.cpp:201)
   by 0x5BA8A63: C__shtCallSolver (EntryPointsGAMS.cpp:252)
   by 0x52AFFEE: GMSCONF_tgmsconf_DOT_sccallsolver(GMSCONF_tgmsconf_OD_S*, int, void*, void*) (gmsconf.c:2443)
   by 0x52A4B6D: libsolver(unsigned char*, unsigned char*, unsigned char const*, GMOMDODEFEX_tgmomodel_OD_S**, GEVDOORG_tgmsenvironment_OD_S**) (gevdoorg.c:3042)

Invalid write of size 8
   at 0x6284FB7: ClpModel::emptyProblem(int*, double*, bool) (in )
   by 0x62E62A0: ClpSimplex::startup(int, int) (in )
   by 0x62F9690: ClpSimplexDual::startupSolve(int, double*, int) (in )
   by 0x62FBCDD: ClpSimplexDual::dual(int, int) (in )
   by 0x62D8BD8: ClpSimplex::dual(int, int) (in )
   by 0x633F07D: ClpSimplex::initialSolve(ClpSolve&) (in )
   by 0x624255C: OsiClpSolverInterface::initialSolve() (in )
   by 0x611B738: CbcModel::initialSolve() (in )
   by 0x604E93C: CbcMain1(int, char const**, CbcModel&, int (*)(CbcModel*, int), CbcSolverUsefulData&) (in )
   by 0x6079654: CbcMain1(int, char const**, CbcModel&) (in )
   by 0x5ABC446: SHOT::MIPSolverCbc::solveProblem() (MIPSolverCbc.cpp:440)
   by 0x5B2B2A1: SHOT::TaskSolveIteration::run() (TaskSolveIteration.cpp:128)
 Address 0x101f9be8 is 8 bytes before a block of size 32 alloc'd
   at 0x483950F: operator new[](unsigned long) (vg_replace_malloc.c:433)
   by 0x6284EF2: ClpModel::emptyProblem(int*, double*, bool) (in )
   by 0x62E62A0: ClpSimplex::startup(int, int) (in )
   by 0x62F9690: ClpSimplexDual::startupSolve(int, double*, int) (in )
   by 0x62FBCDD: ClpSimplexDual::dual(int, int) (in )
   by 0x62D8BD8: ClpSimplex::dual(int, int) (in )
   by 0x633F07D: ClpSimplex::initialSolve(ClpSolve&) (in )
   by 0x624255C: OsiClpSolverInterface::initialSolve() (in )
   by 0x611B738: CbcModel::initialSolve() (in )
   by 0x604E93C: CbcMain1(int, char const**, CbcModel&, int (*)(CbcModel*, int), CbcSolverUsefulData&) (in )
   by 0x6079654: CbcMain1(int, char const**, CbcModel&) (in )
   by 0x5ABC446: SHOT::MIPSolverCbc::solveProblem() (MIPSolverCbc.cpp:440)

release git:(stability) ./SHOT ~/Research/minlplib2/21122018/minlplib/gms/autocorr_bern25-13.gms --mip=cbc --timelimit=70 Dual.Relaxation.Use=false Subsolver.Cbc.DeterministicParallelMode=true --threads=1 --debug

╶ Supporting Hyperplane Optimization Toolkit (SHOT) ──────────────────────────────────────────────────────────────────╴

 Andreas Lundell and Jan Kronqvist, Åbo Akademi University, Finland.
 See documentation for full list of contributors and utilized software libraries.

 Version: 1.0.alpha 1. Git hash: 4be53ff4. Released Mar  7 2020.

 For more information visit https://shotsolver.dev

╶ Modeling system ────────────────────────────────────────────────────────────────────────────────────────────────────╴

 Modeling system:            GAMS
 Problem read from file:     /home/aton3/alundell/Research/minlplib2/21122018/minlplib/gms/autocorr_bern25-13.gms

 Performing bound tightening on original problem.
  - Bounds for 1 variables tightened in 0.36 s.

╶ Problem instance ───────────────────────────────────────────────────────────────────────────────────────────────────╴

                                    Original             Reformulated

 Problem classification:            MINLP, nonconvex     MILP, convex

 Objective function direction:      minimize             minimize
 Objective function type:           linear               linear

 Number of constraints:             1                    3737
  - linear:                         0                    3737
  - nonconvex nonlinear:            1                    0

 Number of variables:               26                   1783
  - real:                           1                    223
  - binary:                         25                   1560
  - nonlinear:                      25                   0


╶ Options ────────────────────────────────────────────────────────────────────────────────────────────────────────────╴

 No options file specified.

 Nondefault options used:

  - Dual.MIP.NumberOfThreads = 1
  - Dual.MIP.Solver = 2
  - Dual.Relaxation.Use = false
  - Dual.TreeStrategy = 0
  - Model.Reformulation.Quadratics.Strategy = 0
  - Output.Console.DualSolver.Show = true
  - Primal.Tolerance.TrustLinearConstraintValues = false
  - Subsolver.Cbc.DeterministicParallelMode = true
  - Termination.TimeLimit = 70.0

 Dual strategy:              Multi-tree
  - cut algorithm:           ESH
  - solver:                  Cbc 2.10.4

 Primal NLP solver:          Ipopt 3.13.0 with Ipopt default linear solver




    Iteration     │  Time  │  Dual cuts  │     Objective value     │   Objective gap   │     Current solution
     #: type      │  tot.  │   + | tot.  │       dual | primal     │    abs. | rel.    │    obj.fn. | max.err.
╶─────────────────┴────────┴─────────────┴─────────────────────────┴───────────────────┴───────────────────────────╴

Welcome to the CBC MILP Solver
Version: 2.10.4
Build Date: Feb 17 2020

command line -  -autoscale off -nodestrategy fewest -scaling automatic -strategy 1 -cutoff 1e+100 -sec 69.478272985 -threads 101 -solve -quit
Option for nodeStrategy changed from hybrid to fewest
cutoff was changed from 1e+100 to 1e+100
seconds was changed from 1e+100 to 69.4783
threads was changed from 0 to 101
Continuous objective value is -131872 - 0.19 seconds
Cgl0004I processed model has 3737 rows, 1783 columns (1560 integer (1560 of which binary)) and 16587 elements
Cbc0031I 1342 added rows had average density of 9.7242921
Cbc0013I At root node, 1342 cuts changed objective from -131872 to -70095.095 in 85 passes
Cbc0014I Cut generator 0 (Probing) - 14259 row cuts average 2.0 elements, 0 column cuts (739 active)  in 3.506 seconds - new frequency is 1
Cbc0014I Cut generator 1 (Gomory) - 21638 row cuts average 42.2 elements, 0 column cuts (0 active)  in 3.766 seconds - new frequency is 1
Cbc0014I Cut generator 2 (Knapsack) - 336 row cuts average 2.0 elements, 0 column cuts (0 active)  in 0.787 seconds - new frequency is 1
Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active)  in 0.286 seconds - new frequency is -100
Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 18 row cuts average 32.1 elements, 0 column cuts (0 active)  in 2.082 seconds - new frequency is -100
Cbc0014I Cut generator 5 (FlowCover) - 1 row cuts average 9.0 elements, 0 column cuts (0 active)  in 0.080 seconds - new frequency is -100
Cbc0014I Cut generator 6 (TwoMirCuts) - 2658 row cuts average 30.9 elements, 0 column cuts (0 active)  in 0.665 seconds - new frequency is 1
Cbc0010I After 0 nodes, 1 on tree, 1e+50 best solution, best possible -70095.095 (31.98 seconds)
Cbc0016I Integer solution of -7636 found by strong branching after 94997 iterations and 21 nodes (61.21 seconds)
Cbc0012I Integer solution of -7916 found by heuristic after 94589 iterations and 18 nodes (65.26 seconds)
Cbc0030I Thread 0 used 5 times,  waiting to start 20.832898, 16.763806 cpu time, 0 locks, 0 locked, 0 waiting for locks
Cbc0030I Main thread 16.856859 waiting for threads,  0 locks, 0 locked, 0 waiting for locks
Cbc0020I Exiting on maximum time
Cbc0005I Partial search - best objective -7916 (best possible -66530.32), took 106525 iterations and 39 nodes (69.54 seconds)
Cbc0032I Strong branching done 606 times (47018 iterations), fathomed 2 nodes and fixed 0 variables
Cbc0035I Maximum depth 7, 8 variables fixed on reduced cost
Cuts at root node changed objective from -131872 to -70095.1
Probing was tried 292 times and created 56631 cuts of which 1478 were active after adding rounds of cuts (5.380 seconds)
Gomory was tried 291 times and created 56774 cuts of which 0 were active after adding rounds of cuts (5.212 seconds)
Knapsack was tried 291 times and created 2076 cuts of which 0 were active after adding rounds of cuts (1.098 seconds)
Clique was tried 170 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.286 seconds)
MixedIntegerRounding2 was tried 170 times and created 36 cuts of which 0 were active after adding rounds of cuts (2.082 seconds)
FlowCover was tried 170 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.080 seconds)
TwoMirCuts was tried 291 times and created 10239 cuts of which 0 were active after adding rounds of cuts (1.762 seconds)
ZeroHalf was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.065 seconds)
ImplicationCuts was tried 93 times and created 2223 cuts of which 0 were active after adding rounds of cuts (0.595 seconds)

Result - Stopped on time limit

Objective value:                100000000000000007629769841091887003294964970946560.00000000
Lower bound:                    -66530.320
Gap:                            1503074085339087925432970472628447629652525056.00
Enumerated nodes:               39
Total iterations:               106525
Time (CPU seconds):             69.63
Time (Wallclock seconds):       70.05

Total time (CPU seconds):       69.63   (Wallclock seconds):       70.05

     1: MIP-TL      70.58                       -inf. | inf.            inf. | inf.                 | inf.


╶ Solution report ────────────────────────────────────────────────────────────────────────────────────────────────────╴

 Terminated since time limit was reached.

 No solution found. Try modifying the termination criteria.

 Objective bound (minimization) [dual, primal]:  [-inf., inf.]
 Objective gap absolute / relative:              inf. / inf.

 Fulfilled termination criteria:
  - solution time limit (s)                      70.5761 > 70

 Unfulfilled termination criteria:
  - absolute objective gap tolerance             inf > 0.001
  - relative objective gap tolerance             inf > 0.001
  - maximal constraint tolerance                 1.79769e+308 > 1e-08
  - iteration limit                              1 <= 200000

 Dual problems solved in main step:              1
  - MILP problems, feasible                      1

 Number of explored nodes:                       39

 Total solution time:                            70.5761
  - problem reformulation:                       0.00574987
  - bound tightening:                            0.364141
    - feasibility based (original problem):      0.364127
  - dual strategy:                               70.0614
    - root search for constraint cuts:           8.351e-06
  - primal strategy:                             0.000580469
    - solving NLP problems:                      0.000495661

╶─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────╴

 Results written to: /home/aton3/alundell/Research/SHOT/SHOT-COINOR/build/release/autocorr_bern25-13.osrl
 Log written to:     /home/aton3/alundell/Research/SHOT/SHOT-COINOR/build/release/SHOT.log

Welcome to the CBC MILP Solver
Version: 2.10.4
Build Date: Feb 17 2020

command line - /opt/cbc-2.10.4/bin/cbc lp0.lp -autoscale off -nodestrategy fewest -scaling automatic -strategy 1 -cutoff 1e+100 -sec 69.478272985 -threads 101 -solve -quit
cutoff was changed from 1e+100 to 1e+100
seconds was changed from 1e+100 to 69.4783
threads was changed from 0 to 101
Continuous objective value is -131872 - 0.20 seconds
Cgl0004I processed model has 3737 rows, 1783 columns (1560 integer (1560 of which binary)) and 16587 elements
Cbc0038I Initial state - 1075 integers unsatisfied sum - 537.5
Cbc0038I Pass   1: (0.35 seconds) suminf.  118.51282 (449) obj. -39926.9 iterations 1380
Cbc0038I Pass   2: (0.36 seconds) suminf.  118.25000 (419) obj. -38690 iterations 37
Cbc0038I Pass   3: (0.37 seconds) suminf.  118.25000 (419) obj. -38690 iterations 31
Cbc0038I Pass   4: (0.38 seconds) suminf.  112.16667 (396) obj. -36811.7 iterations 91
Cbc0038I Pass   5: (0.39 seconds) suminf.  111.95833 (403) obj. -36430 iterations 35
Cbc0038I Pass   6: (0.39 seconds) suminf.  111.95833 (403) obj. -36430 iterations 31
Cbc0038I Pass   7: (0.40 seconds) suminf.  111.95833 (403) obj. -36430 iterations 13
Cbc0038I Pass   8: (0.41 seconds) suminf.  108.45455 (418) obj. -37136.1 iterations 85
Cbc0038I Pass   9: (0.42 seconds) suminf.  108.16667 (384) obj. -34832.2 iterations 41
Cbc0038I Pass  10: (0.43 seconds) suminf.  103.44444 (386) obj. -34836.8 iterations 70
Cbc0038I Pass  11: (0.44 seconds) suminf.  103.25000 (366) obj. -34295 iterations 52
Cbc0038I Pass  12: (0.45 seconds) suminf.  103.25000 (366) obj. -34295 iterations 18
Cbc0038I Pass  13: (0.46 seconds) suminf.  103.25000 (366) obj. -34295 iterations 15
Cbc0038I Pass  14: (0.51 seconds) suminf.   96.66667 (290) obj. -8682.67 iterations 620
Cbc0038I Pass  15: (0.52 seconds) suminf.   96.66667 (290) obj. -8682.67 iterations 26
Cbc0038I Pass  16: (0.53 seconds) suminf.   93.66667 (281) obj. -7786.67 iterations 58
Cbc0038I Pass  17: (0.54 seconds) suminf.   93.66667 (281) obj. -7786.67 iterations 27
Cbc0038I Pass  18: (0.55 seconds) suminf.   88.00000 (264) obj. -6954.67 iterations 98
Cbc0038I Pass  19: (0.56 seconds) suminf.   88.00000 (264) obj. -6954.67 iterations 34
Cbc0038I Pass  20: (0.57 seconds) suminf.   86.66667 (260) obj. -6677.33 iterations 50
Cbc0038I Pass  21: (0.57 seconds) suminf.   86.66667 (260) obj. -6677.33 iterations 25
Cbc0038I Pass  22: (0.58 seconds) suminf.   82.66667 (248) obj. -5717.33 iterations 57
Cbc0038I Pass  23: (0.59 seconds) suminf.   82.66667 (248) obj. -5717.33 iterations 18
Cbc0038I Pass  24: (0.60 seconds) suminf.   75.61111 (226) obj. -5761.78 iterations 105
Cbc0038I Pass  25: (0.61 seconds) suminf.   75.16667 (225) obj. -5690.67 iterations 22
Cbc0038I Pass  26: (0.61 seconds) suminf.   74.66667 (224) obj. -5754.67 iterations 2
Cbc0038I Pass  27: (0.62 seconds) suminf.   71.33333 (214) obj. -5882.67 iterations 55
Cbc0038I Pass  28: (0.62 seconds) suminf.   71.33333 (214) obj. -5882.67 iterations 17
Cbc0038I Pass  29: (0.63 seconds) suminf.   68.66667 (206) obj. -5221.33 iterations 59
Cbc0038I Pass  30: (0.64 seconds) suminf.   68.66667 (206) obj. -5221.33 iterations 32
Cbc0038I Rounding solution of 5889.33 is better than previous of 1e+50

Cbc0038I Before mini branch and bound, 430 integers at bound fixed and 0 continuous
Cbc0038I Full problem 3737 rows 1783 columns, reduced to 3307 rows 1353 columns - too large
Cbc0038I Mini branch and bound did not improve solution (0.66 seconds)
Cbc0038I Round again with cutoff of -7886.8
Cbc0038I Pass  30: (0.66 seconds) suminf.  118.51282 (449) obj. -39926.9 iterations 0
Cbc0038I Pass  31: (0.67 seconds) suminf.  118.25000 (419) obj. -38690 iterations 70
Cbc0038I Pass  32: (0.68 seconds) suminf.  110.08333 (398) obj. -34710 iterations 66
Cbc0038I Pass  33: (0.69 seconds) suminf.  110.08333 (398) obj. -34710 iterations 22
Cbc0038I Pass  34: (0.69 seconds) suminf.  110.08333 (398) obj. -34710 iterations 16
Cbc0038I Pass  35: (0.74 seconds) suminf.  102.66667 (308) obj. -7886.8 iterations 579
Cbc0038I Pass  36: (0.74 seconds) suminf.  102.66667 (308) obj. -7886.8 iterations 31
Cbc0038I Pass  37: (0.77 seconds) suminf.   98.66667 (296) obj. -7886.8 iterations 141
Cbc0038I Pass  38: (0.77 seconds) suminf.   98.66667 (296) obj. -7886.8 iterations 26
Cbc0038I Pass  39: (0.80 seconds) suminf.   95.82796 (287) obj. -7886.8 iterations 213
Cbc0038I Pass  40: (0.81 seconds) suminf.   95.80786 (287) obj. -7886.8 iterations 30
Cbc0038I Pass  41: (0.82 seconds) suminf.   87.33333 (262) obj. -9930.67 iterations 106
Cbc0038I Pass  42: (0.83 seconds) suminf.   87.33333 (262) obj. -9930.67 iterations 30
Cbc0038I Pass  43: (0.84 seconds) suminf.   82.00000 (246) obj. -8032 iterations 57
Cbc0038I Pass  44: (0.85 seconds) suminf.   82.00000 (246) obj. -8032 iterations 20
Cbc0038I Pass  45: (0.87 seconds) suminf.   76.20080 (228) obj. -7886.8 iterations 197
Cbc0038I Pass  46: (0.88 seconds) suminf.   76.07585 (228) obj. -7886.8 iterations 24
Cbc0038I Pass  47: (0.88 seconds) suminf.   73.25126 (218) obj. -7886.8 iterations 42
Cbc0038I Pass  48: (0.89 seconds) suminf.   73.25126 (218) obj. -7886.8 iterations 25
Cbc0038I Pass  49: (0.90 seconds) suminf.   68.33333 (205) obj. -10712 iterations 68
Cbc0038I Pass  50: (0.91 seconds) suminf.   68.33333 (205) obj. -10712 iterations 15
Cbc0038I Pass  51: (0.92 seconds) suminf.   64.72222 (193) obj. -10098.7 iterations 75
Cbc0038I Pass  52: (0.92 seconds) suminf.   63.33333 (190) obj. -10088 iterations 25
Cbc0038I Pass  53: (0.93 seconds) suminf.   59.33333 (178) obj. -8530.67 iterations 59
Cbc0038I Pass  54: (0.94 seconds) suminf.   59.33333 (178) obj. -8530.67 iterations 28
Cbc0038I Pass  55: (0.95 seconds) suminf.   54.05556 (161) obj. -8152 iterations 105
Cbc0038I Pass  56: (0.96 seconds) suminf.   53.16667 (159) obj. -7896 iterations 31
Cbc0038I Pass  57: (0.97 seconds) suminf.   50.44663 (150) obj. -7886.8 iterations 64
Cbc0038I Pass  58: (0.97 seconds) suminf.   50.44663 (150) obj. -7886.8 iterations 20
Cbc0038I Pass  59: (0.99 seconds) suminf.   45.60220 (136) obj. -7886.8 iterations 127
Cbc0038I Rounding solution of -3525.33 is better than previous of 5889.33

Cbc0038I Before mini branch and bound, 431 integers at bound fixed and 0 continuous
Cbc0038I Full problem 3737 rows 1783 columns, reduced to 3306 rows 1352 columns - too large
Cbc0038I Mini branch and bound did not improve solution (1.00 seconds)
Cbc0038I Round again with cutoff of -32683.8
Cbc0038I Pass  59: (1.01 seconds) suminf.  118.51282 (449) obj. -39926.9 iterations 0
Cbc0038I Pass  60: (1.02 seconds) suminf.  118.25000 (419) obj. -38690 iterations 70
Cbc0038I Pass  61: (1.02 seconds) suminf.  118.25000 (419) obj. -38690 iterations 10
Cbc0038I Pass  62: (1.04 seconds) suminf.  112.25926 (420) obj. -38372.6 iterations 93
Cbc0038I Pass  63: (1.05 seconds) suminf.  112.25926 (420) obj. -38372.6 iterations 59
Cbc0038I Pass  64: (1.06 seconds) suminf.  111.92593 (426) obj. -36912 iterations 49
Cbc0038I Pass  65: (1.07 seconds) suminf.  111.91667 (394) obj. -36832.2 iterations 57
Cbc0038I Pass  66: (1.07 seconds) suminf.  110.00000 (414) obj. -36852 iterations 59
Cbc0038I Pass  67: (1.08 seconds) suminf.  110.00000 (414) obj. -36852 iterations 52
Cbc0038I Pass  68: (1.10 seconds) suminf.  105.11111 (407) obj. -36018.9 iterations 119
Cbc0038I Pass  69: (1.11 seconds) suminf.  104.37037 (399) obj. -34869.2 iterations 87
Cbc0038I Pass  70: (1.12 seconds) suminf.  104.37037 (399) obj. -34869.2 iterations 9
Cbc0038I Pass  71: (1.13 seconds) suminf.   98.18519 (381) obj. -32850.6 iterations 122
Cbc0038I Pass  72: (1.15 seconds) suminf.   96.80000 (335) obj. -36657.6 iterations 85
Cbc0038I Pass  73: (1.15 seconds) suminf.   96.33333 (334) obj. -36642.7 iterations 6
Cbc0038I Pass  74: (1.16 seconds) suminf.   93.91667 (344) obj. -35420.2 iterations 51
Cbc0038I Pass  75: (1.17 seconds) suminf.   93.92500 (343) obj. -35451.5 iterations 43
Cbc0038I Pass  76: (1.18 seconds) suminf.   90.96795 (358) obj. -33252.5 iterations 70
Cbc0038I Pass  77: (1.18 seconds) suminf.   90.58333 (349) obj. -33897.2 iterations 40
Cbc0038I Pass  78: (1.19 seconds) suminf.   81.83333 (322) obj. -32683.8 iterations 71
Cbc0038I Pass  79: (1.20 seconds) suminf.   81.56061 (325) obj. -32683.8 iterations 24
Cbc0038I Pass  80: (1.21 seconds) suminf.   81.31818 (326) obj. -32683.8 iterations 37
Cbc0038I Pass  81: (1.22 seconds) suminf.   74.81004 (311) obj. -32683.8 iterations 54
Cbc0038I Pass  82: (1.22 seconds) suminf.   74.80133 (310) obj. -32683.8 iterations 27
Cbc0038I Pass  83: (1.24 seconds) suminf.   69.10270 (265) obj. -32683.8 iterations 132
Cbc0038I Pass  84: (1.24 seconds) suminf.   69.10270 (265) obj. -32683.8 iterations 22
Cbc0038I Pass  85: (1.25 seconds) suminf.   68.98541 (265) obj. -32683.8 iterations 35
Cbc0038I Pass  86: (1.26 seconds) suminf.   68.98541 (265) obj. -32683.8 iterations 25
Cbc0038I Pass  87: (1.26 seconds) suminf.   67.51870 (261) obj. -32683.8 iterations 49
Cbc0038I Pass  88: (1.27 seconds) suminf.   67.20352 (261) obj. -32683.8 iterations 15
Cbc0038I No solution found this major pass
Cbc0038I Before mini branch and bound, 450 integers at bound fixed and 19 continuous
Cbc0038I Full problem 3737 rows 1783 columns, reduced to 3249 rows 1314 columns - too large
Cbc0038I Mini branch and bound did not improve solution (1.29 seconds)
Cbc0038I After 1.29 seconds - Feasibility pump exiting with objective of -3525.33 - took 1.02 seconds
Cbc0012I Integer solution of -7520 found by feasibility pump after 0 iterations and 0 nodes (1.29 seconds)
Cbc0031I 1344 added rows had average density of 11.306548
Cbc0013I At root node, 1344 cuts changed objective from -131872 to -69829.321 in 91 passes
Cbc0014I Cut generator 0 (Probing) - 12737 row cuts average 2.0 elements, 0 column cuts (377 active)  in 7.849 seconds - new frequency is 1
Cbc0014I Cut generator 1 (Gomory) - 17555 row cuts average 44.3 elements, 0 column cuts (0 active)  in 5.412 seconds - new frequency is 1
Cbc0014I Cut generator 2 (Knapsack) - 989 row cuts average 2.0 elements, 0 column cuts (0 active)  in 0.818 seconds - new frequency is 1
Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active)  in 0.298 seconds - new frequency is -100
Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 47 row cuts average 36.0 elements, 0 column cuts (0 active)  in 2.428 seconds - new frequency is -100
Cbc0014I Cut generator 5 (FlowCover) - 3 row cuts average 2.0 elements, 0 column cuts (0 active)  in 0.107 seconds - new frequency is -100
Cbc0014I Cut generator 6 (TwoMirCuts) - 2614 row cuts average 31.3 elements, 0 column cuts (0 active)  in 0.784 seconds - new frequency is 1
Cbc0010I After 0 nodes, 1 on tree, -7520 best solution, best possible -69829.321 (40.70 seconds)
Cbc0016I Integer solution of -7832 found by strong branching after 98191 iterations and 28 nodes (69.15 seconds)
Clp0006I 0  Obj -7840.0005 Primal inf 0.20250189 (1)
Cbc0012I Integer solution of -7832 found by heuristic after 98148 iterations and 27 nodes (69.49 seconds)
Cbc0030I Thread 0 used 3 times,  waiting to start 14.004904, 14.835831 cpu time, 0 locks, 0 locked, 0 waiting for locks
Cbc0030I Main thread 14.890258 waiting for threads,  0 locks, 0 locked, 0 waiting for locks
Cbc0020I Exiting on maximum time
Cbc0005I Partial search - best objective -7832 (best possible -69829.321), took 98602 iterations and 37 nodes (69.54 seconds)
Cbc0032I Strong branching done 696 times (33924 iterations), fathomed 1 nodes and fixed 0 variables
Cbc0035I Maximum depth 26, 15 variables fixed on reduced cost
Cuts at root node changed objective from -131872 to -69829.3
Probing was tried 301 times and created 56797 cuts of which 754 were active after adding rounds of cuts (9.763 seconds)
Gomory was tried 300 times and created 51105 cuts of which 0 were active after adding rounds of cuts (7.003 seconds)
Knapsack was tried 300 times and created 3547 cuts of which 0 were active after adding rounds of cuts (1.087 seconds)
Clique was tried 182 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.298 seconds)
MixedIntegerRounding2 was tried 182 times and created 94 cuts of which 0 were active after adding rounds of cuts (2.428 seconds)
FlowCover was tried 182 times and created 6 cuts of which 0 were active after adding rounds of cuts (0.107 seconds)
TwoMirCuts was tried 300 times and created 8827 cuts of which 0 were active after adding rounds of cuts (1.604 seconds)
ZeroHalf was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.068 seconds)
ImplicationCuts was tried 80 times and created 3007 cuts of which 0 were active after adding rounds of cuts (1.876 seconds)

Result - Stopped on time limit

Objective value:                -7832.00000000
Lower bound:                    -69829.321
Gap:                            0.89
Enumerated nodes:               37
Total iterations:               98602
Time (CPU seconds):             69.67
Time (Wallclock seconds):       69.92

Total time (CPU seconds):       69.67   (Wallclock seconds):       69.93

            solver.registerCallback(
                E_EventType::UserTerminationCheck, [&env, gev = (gevHandle_t)gmoEnvironment(gs->gmo)] {
                    if(gevTerminateGet(gev))
                        env->tasks->terminate();
                });

Model/Simplifications.h:1061:42: warning: ‘constant’ may be used uninitialized in this function [-Wmaybe-uninitialized]
 1061 |         std::make_shared<LinearTerm>(2.0 * constant * variableCoefficient, variable), constant * constant);
      |                                      ~~~~^~~~~~~~~~

        cplexInstance.addMIPStart(cplexVars, startVal, IloCplex::MIPStartRepair);

╶ Supporting Hyperplane Optimization Toolkit (SHOT) ──────────────────────────────────────────────────────────────────╴

 Andreas Lundell and Jan Kronqvist, Åbo Akademi University, Finland.
 See documentation for full list of contributors and utilized software libraries.

 Version: 1.0.1. Git hash: 2083800b. Released: Jun 30 2021.

 For more information visit https://shotsolver.dev

 Time to extract information on quadratics: 0.033000
 Performing bound tightening on reformulated problem.
  - Bounds for 0 variables tightened in 0.05 s and 1 passes.

╶ Problem instance ───────────────────────────────────────────────────────────────────────────────────────────────────╴

                                    Original             Reformulated

 Problem classification:            MINLP, nonconvex     MINLP, nonconvex

 Objective function direction:      minimize             minimize
 Objective function type:           nonlinear            nonlinear

 Number of constraints:             2                    2
  - linear:                         2                    2

 Number of variables:               4                    4
  - integer:                        4                    4
  - nonlinear:                      4                    4

╶ Options ────────────────────────────────────────────────────────────────────────────────────────────────────────────╴

 No options file specified.

 Options specified:

  - Dual.ESH.InteriorPoint.CuttingPlane.IterationLimit = 50
  - Dual.HyperplaneCuts.ConstraintSelectionFactor = 1
  - Dual.HyperplaneCuts.UseIntegerCuts = true
  - Dual.MIP.NumberOfThreads = 1
  - Dual.MIP.Presolve.UpdateObtainedBounds = false
  - Dual.MIP.SolutionLimit.Initial = 2147483647
  - Dual.Relaxation.Use = false
  - Dual.TreeStrategy = 0
  - Model.Variables.Continuous.MaximumUpperBound = 1e+20
  - Model.Variables.Continuous.MinimumLowerBound = -1e+20
  - Primal.FixedInteger.CallStrategy = 0
  - Primal.FixedInteger.OnlyUniqueIntegerCombinations = false
  - Primal.FixedInteger.Solver = 1
  - Primal.FixedInteger.Source = 0
  - Subsolver.Ipopt.LinearSolver = 1
  - Termination.IterationLimit = 2147483647
  - Termination.ObjectiveGap.Absolute = 1e-10
  - Termination.ObjectiveGap.Relative = 1e-05
  - Termination.TimeLimit = 10000000000

 Dual strategy:              Multi-tree
  - cut algorithm:           ESH
  - solver:                  CPLEX 20.1

 Primal NLP solver:          CONOPT (automatically selected) in GAMS 36.0


╶ Main iteration step ────────────────────────────────────────────────────────────────────────────────────────────────╴

    Iteration     │  Time  │  Dual cuts  │     Objective value     │   Objective gap   │     Current solution
     #: type      │  tot.  │   + | tot.  │       dual | primal     │    abs. | rel.    │    obj.fn. | max.err.
╶─────────────────┴────────┴─────────────┴─────────────────────────┴───────────────────┴──────────────────────────────╴

     1: MILP-O       4.11                           0 | 36.1768      3.6e+01 | 1.0e+00            0 | 0                
     1: NLPNEWDB-O   5.60                           0 | 36.1768      3.6e+01 | 1.0e+00      36.1768 | 0                
     2: MILP-O       6.05      2 | 2                0*| 9.10921      9.1e+00 | 1.0e+00            0 | 0                
     3: MILP-O       6.21      2 | 4                0*| 2.31395      2.3e+00 | 1.0e+00            0 | 0                
     4: MILP-O       8.58      2 | 6                0*| 1.00702      1.0e+00 | 1.0e+00            0 | 0                
==1758163== Invalid read of size 8
==1758163==    at 0x5D4E815: IloCplexI::addMIPStart(IloNumVarArray, IloNumArray, IloCplex::MIPStartEffort, char const*) (in /home/stefan/work/gams/build/gms test/libshtcclib64.so)
==1758163==    by 0x58E8920: IloCplex::addMIPStart(IloNumVarArray, IloNumArray, IloCplex::MIPStartEffort, char const*) (ilocplex.h:516)
==1758163==    by 0x58E2354: SHOT::MIPSolverCplex::addMIPStart(std::vector<double, std::allocator<double> >) (MIPSolverCplex.cpp:1275)
==1758163==    by 0x5AF570F: SHOT::TaskPresolve::run() (TaskPresolve.cpp:72)
==1758163==    by 0x5AC2DD2: SHOT::SolutionStrategyMultiTree::solveProblem() (SolutionStrategyMultiTree.cpp:330)
==1758163==    by 0x58786DD: SHOT::Solver::solveProblem() (Solver.cpp:597)
==1758163==    by 0x5983838: shtCallSolver (EntryPointsGAMS.cpp:213)
==1758163==    by 0x5983E90: C__shtCallSolver (EntryPointsGAMS.cpp:270)
==1758163==    by 0x52E03F5: GMSCONF_tgmsconf_DOT_sccallsolver(GMSCONF_tgmsconf_OD_S*, int, void*, void*) (gmsconf.c:2783)
==1758163==    by 0x52D3B61: libsolver(unsigned char*, unsigned char*, unsigned char const*, GMOMDODEFEX_tgmomodel_OD_S**, GEVDOORG_tgmsenvironment_OD_S**) (gevdoorg.c:3068)
==1758163==    by 0x52D5263: GEVDOORG_tgmsenvironment_DOT_gevcallsolver(GEVDOORG_tgmsenvironment_OD_S*, void*, unsigned char const*, unsigned char const*, int, int, unsigned char const*, unsigned char const*, double, int, int, double, double, void**, unsigned char*) (gevdoorg.c:3457)
==1758163==    by 0x52634E7: gevcallsolver (joatdclib.c:5867)
==1758163==  Address 0x0 is not stack'd, malloc'd or (recently) free'd
==1758163== 

     1: LP           0.02                      -1e+12 | -1e+12          inf. | inf.    
        Hyperplane for constraint SPP(L10)_rf  not generated,  NaN or inf found in linear terms for f(R1,L10) = 0.400000
        Hyperplane for constraint SPP(L10)_rf  not generated,  NaN or inf found in linear terms for f(R2,L10) = 0.400000
        Hyperplane for constraint SPP(L10)_rf  not generated,  NaN or inf found in linear terms for vR(R1) = 102.140000
        Hyperplane for constraint SPP(L10)_rf  not generated,  NaN or inf found in linear terms for vR(R2) = 176.070000
        Hyperplane for constraint SPP(L10)_rf  not generated,  NaN or inf found in linear terms for nB(R1,L10) = 0.000000
        Hyperplane for constraint SPP(L10)_rf  not generated,  NaN or inf found in linear terms for nB(R2,L10) = 0.000000

 Terminated since no additional dual cuts can be added.

 No solution found. Try modifying the termination criteria.

MIPSolverCplexSingleTreeLegacy.cpp:278:27: warning: ‘IloCplex::Callback SHOT::CtCallback(SHOT::EnvironmentPtr, IloEnv, IloNumVarArray)’ defined but not used [-Wunused-function]
  278 | static IloCplex::Callback CtCallback(EnvironmentPtr envPtr, IloEnv iloEnv, IloNumVarArray cplexVars)
      |                           ^~~~~~~~~~
MIPSolverCplexSingleTreeLegacy.cpp:174:27: warning: ‘IloCplex::Callback SHOT::InfoCallback(SHOT::EnvironmentPtr, IloEnv)’ defined but not used [-Wunused-function]
  174 | static IloCplex::Callback InfoCallback(EnvironmentPtr envPtr, IloEnv iloEnv)
      |                           ^~~~~~~~~~~~
MIPSolverCplexSingleTreeLegacy.cpp:57:27: warning: ‘IloCplex::Callback SHOT::HCallback(SHOT::EnvironmentPtr, IloEnv, IloNumVarArray)’ defined but not used [-Wunused-function]
   57 | static IloCplex::Callback HCallback(EnvironmentPtr envPtr, IloEnv iloEnv, IloNumVarArray cplexVars)
      |                           ^~~~~~~~~

libSHOTSolver.so: undefined reference to `GC_mutex_unlock'
libSHOTSolver.so: undefined reference to `GC_mutex_lock'
libSHOTSolver.so: undefined reference to `GC_mutex_delete'
libSHOTSolver.so: undefined reference to `GC_mutex_init'
collect2: error: ld returned 1 exit status

set(PRIMAL_SOURCES ${PRIMAL_SOURCES} "${GAMS_DIR}/apifiles/C/api/gcmt.c")
set(PRIMAL_HEADERS ${PRIMAL_HEADERS} "${GAMS_DIR}/apifiles/C/api/gcmt.h")

    Iteration     │  Time  │    Cuts     │     Objective value     │  Objective diff.   
     #: type      │  tot.  │   + | tot.  │    problem | line srch  │    abs. | rel.    
╶─────────────────┴────────┴─────────────┴─────────────────────────┴──────────────────╴

     1: LP           0.05                      -1e+12 | -1e+12          inf. | inf.    
     2: LP           0.05      2 | 2             -550 | 755.127      1.3e+03 | 2.4e+00 
     3: LP           0.08      2 | 4             -550 | 254.386      8.0e+02 | 1.5e+00 
     4: LP           0.08      2 | 6          -307.27 | 204.461      5.1e+02 | 1.7e+00 
     5: LP           0.08      2 | 8         -100.909 | 127.407      2.3e+02 | 2.3e+00 

-  set(ENV{PKG_CONFIG_PATH} "${CBC_DIR}/lib/pkgconfig")
+  set(ENV{PKG_CONFIG_PATH} "X:/msys64_coin/usr/local/lib/pkgconfig")

-  set(ENV{PKG_CONFIG_PATH} "${IPOPT_DIR}/lib/pkgconfig")
+  set(ENV{PKG_CONFIG_PATH} "X:/msys64_coin/usr/local/lib/pkgconfig")

cmake -G "Unix Makefiles" -DHAS_GAMS=False -DHAS_GUROBI=False -DHAS_CPLEX=False -DCMAKE_BUILD_TYPE=Release ..

-- The C compiler identification is GNU 8.3.0
-- The CXX compiler identification is GNU 8.3.0
-- Check for working C compiler: X:/msys64_coin/mingw64/bin/cc.exe
-- Check for working C compiler: X:/msys64_coin/mingw64/bin/cc.exe -- works
-- Detecting C compiler ABI info
-- Detecting C compiler ABI info - done
-- Detecting C compile features
-- Detecting C compile features - done
-- Check for working CXX compiler: X:/msys64_coin/mingw64/bin/c++.exe
-- Check for working CXX compiler: X:/msys64_coin/mingw64/bin/c++.exe -- works
-- Detecting CXX compiler ABI info
-- Detecting CXX compiler ABI info - done
-- Detecting CXX compile features
-- Detecting CXX compile features - done
-- Looking for C++ include filesystem
-- Looking for C++ include filesystem - found
-- Performing Test CAN_COMPILE_FS_WITHOUT_LINK
-- Performing Test CAN_COMPILE_FS_WITHOUT_LINK - Failed
-- Performing Test CAN_COMPILE_FS_WITH_LINK
-- Performing Test CAN_COMPILE_FS_WITH_LINK - Success
-- Git hash: 59178b4-dirty
-- Found PkgConfig: X:/msys64_coin/mingw64/bin/pkg-config.exe (found version "0.29.2")
-- Checking for one of the modules 'cbc'
-- Cbc found using Pkg-config:
   Include directories found: X:/msys64_coin/usr/local/include/coin;X:/msys64_coin/usr/local/include/coin/ThirdParty;X:/msys64_coin/usr/local/include/coin;X:/msys64_coin/usr/local/include/coin/ThirdParty
   Library directories found: X:/msys64_coin/usr/local/lib
-- Found CBC: CbcSolver;Cbc;pthread;Cgl;OsiClp;ClpSolver;Clp;coinasl;m;Osi;CoinUtils;bz2;z;lapack;blas;m;coinglpk;m;gmp
-- Checking for one of the modules 'ipopt'
-- Cbc include files will be used from: X:/msys64_coin/usr/local/include/coin;X:/msys64_coin/usr/local/include/coin/ThirdParty;X:/msys64_coin/usr/local/include/coin;X:/msys64_coin/usr/local/include/coin/ThirdParty
-- The following Cbc libraries will be used from: X:/msys64_coin/usr/local/lib
   CbcSolver;Cbc;pthread;Cgl;OsiClp;ClpSolver;Clp;coinasl;m;Osi;CoinUtils;bz2;z;lapack;blas;m;coinglpk;m;gmp
-- Configuring done
-- Generating done
-- Build files have been written to: X:/COIN_BUILD/2/SHOT/build

[ 96%] Building CXX object CMakeFiles/SHOTSolver.dir/ThirdParty/ampl/src/os.cc.obj
[ 97%] Linking CXX shared library libSHOTSolver.dll
X:/msys64_coin/usr/local/lib/libClp.a(ClpCholeskyMumps.o):ClpCholeskyMumps.cpp:(.text+0x68): undefined reference to `dmumps_c'
X:/msys64_coin/usr/local/lib/libClp.a(ClpCholeskyMumps.o):ClpCholeskyMumps.cpp:(.text+0x6d): undefined reference to `MPI_Finalize'

X:/msys64_coin/usr/local/lib/libClp.a(ClpCholeskyMumps.o):ClpCholeskyMumps.cpp:(.text+0x68): undefined reference to `dmumps_c'

#define MPI_COMM_WORLD CLP_MPI_COMM_WORLD
#define JOB_INIT -1
#define JOB_END -2
#define USE_COMM_WORLD -987654
extern "C" {
#include "dmumps_c.h"
// In newer ThirdParty/Mumps, mpi.h is renamed to mumps_mpi.h.
// We get informed about this by having COIN_USE_MUMPS_MPI_H defined.
#ifdef COIN_USE_MUMPS_MPI_H
#include "mumps_mpi.h"
#else
#include "mpi.h"
#endif
}

╶ Supporting Hyperplane Optimization Toolkit (SHOT) ──────────────────────────────────────────────────────────────────╴

  Andreas Lundell and Jan Kronqvist, Åbo Akademi University, Finland.
  See documentation for full list of contributors and utilized software libraries.

  Version: 1.0.alpha 1. Git hash: 80e02ff. Released Oct 15 2019. 

  For more information visit https://shotsolver.dev

 Reading options from shot.op9
** duplicate name s_bl_d(N1)_omega(P1,N1)

Program received signal SIGABRT, Aborted.
0x00007ffff7a8df25 in raise () from /usr/lib/libc.so.6
(gdb) bt
#0  0x00007ffff7a8df25 in raise () from /usr/lib/libc.so.6
#1  0x00007ffff7a77897 in abort () from /usr/lib/libc.so.6
#2  0x00007ffff0c2d7cf in CoinModelHash::addHash(int, char const*) ()
#3  0x00007ffff02fa022 in CoinModel::setColName (this=0x5555556c4790, whichColumn=56, columnName=0x5555556ce420 "s_bl_d(N1)_omega(P1,N1)")
    at CoinModel.hpp:337
#4  0x00007ffff02f331c in SHOT::MIPSolverCbc::addVariable (this=0x5555556bfae0, name=..., type=SHOT::E_VariableType::Real, lowerBound=1, upperBound=40) at MIPSolverCbc.cpp:77
#5  0x00007ffff03cf0ff in SHOT::TaskCreateDualProblem::createProblem (this=0x5555556bee80, destination=..., sourceProblem=...) at TaskCreateDualProblem.cpp:82
#6  0x00007ffff03ce1a6 in SHOT::TaskCreateDualProblem::TaskCreateDualProblem (this=0x5555556bee80, envPtr=...) at TaskCreateDualProblem.cpp:29

╶ Problem instance ───────────────────────────────────────────────────────────────────────────────────────────────────╴

                                    Original             Reformulated

 Problem classification:            MIQCQP, convex       MINLP, convex

 Objective function direction:      minimize             minimize
 Objective function type:           linear               linear

 Number of constraints:             26                   76
  - linear:                         1                    26
  - convex quadratic:               25                   0
  - convex nonlinear:               0                    50

 Number of variables:               75                   125
  - real:                           50                   100
  - binary:                         25                   25
  - nonlinear:                      50                   0

 Number of transformations performed:                    50

╶ Options ────────────────────────────────────────────────────────────────────────────────────────────────────────────╴

 No options file specified.

 Nondefault options used:

  - Dual.MIP.NumberOfThreads = 1
  - Dual.MIP.Solver = 2
  - Dual.TreeStrategy = 0
  - Model.Reformulation.Quadratics.Strategy = 0
  - Primal.FixedInteger.Solver = 1
  - Primal.Tolerance.TrustLinearConstraintValues = false
  - Subsolver.Ipopt.LinearSolver = 1
  - Termination.IterationLimit = 2147483647
  - Termination.ObjectiveGap.Absolute = 1e-10
  - Termination.ObjectiveGap.Relative = 1e-10
  - Termination.TimeLimit = 1000.0

 Dual strategy:              Multi-tree
  - cut algorithm:           ESH
  - solver:                  Cbc 2.10

 Primal NLP solver:          CONOPT (automatically selected) in GAMS 31.0


╶ Interior point search ──────────────────────────────────────────────────────────────────────────────────────────────╴

 Strategy selected:          cutting plane minimax


    Iteration     │  Time  │    Cuts     │     Objective value     │  Objective diff.   
     #: type      │  tot.  │   + | tot.  │    problem | line srch  │    abs. | rel.    
╶─────────────────┴────────┴─────────────┴─────────────────────────┴──────────────────╴
     1: LP           0.02                      -1e+12 | -1e+12          inf. | inf.    
     2: LP           0.02     13 | 13           -4.84 | -2.22045e-16 4.8e+00 | 1.0e+00 

 Valid interior point with constraint deviation -0.000 found.


    Iteration     │  Time  │  Dual cuts  │     Objective value     │   Objective gap   │     Current solution
     #: type      │  tot.  │   + | tot.  │       dual | primal     │    abs. | rel.    │    obj.fn. | max.err.
╶─────────────────┴────────┴─────────────┴─────────────────────────┴───────────────────┴───────────────────────────╴)

     1: LP-O         0.02                    -24.6965 | inf.            inf. | 1.0e+00     -24.6965 | 26: 0.00e+00     
     2: MILP-I       0.02                    -24.6965 | inf.            inf. | 1.0e+00              | inf.             

╶ Solution report ────────────────────────────────────────────────────────────────────────────────────────────────────╴

 Terminated since the dual problem is infeasible.

 Problem is infeasible.