Hi Bob,
I have attatched the related files which produce the crash.
On my computer, the crash occurs after printing the following output message:
.............
.............
.............
------- GROUP 5: PHASE II: OPTIMIZATION ITERATION #1 --------
FINDING NEW CONFLICT TUPLES ... OK
nAdded = 12
set Conf :=
(28,29,43) (28,30,29) (29,31,33) (30,32,12) (31,32,11) (27,29,12)
(28,29,44) (29,30,32) (30,31,44) (30,32,15) (31,32,42) (27,29,15);
CPLEX 12.6.3.0: mipdisplay=2
integrality=1e-08
absmipgap=0
mipgap=0
Reduced MIP has 21553 rows, 26219 columns, and 127828 nonzeros.
Reduced MIP has 21372 binaries, 78 generals, 0 SOSs, and 33862 indicators.
Retaining values of one MIP start for possible repair.
MIP Presolve eliminated 3079 rows and 2874 columns.
MIP Presolve modified 17151 coefficients.
Reduced MIP has 17754 rows, 21259 columns, and 122597 nonzeros.
Reduced MIP has 18305 binaries, 78 generals, 0 SOSs, and 29059 indicators.
Probing fixed 15749 vars, tightened 2033 bounds.
Probing changed sense of 63 constraints.
Probing time = 4.02 sec. (1053.16 ticks)
Cover probing fixed 1 vars, tightened 4017 bounds.
MIP Presolve eliminated 15620 rows and 19288 columns.
MIP Presolve modified 2279 coefficients.
Reduced MIP has 1847 rows, 1553 columns, and 8419 nonzeros.
Reduced MIP has 1218 binaries, 73 generals, 0 SOSs, and 2294 indicators.
Probing fixed 27 vars, tightened 193 bounds.
Probing changed sense of 6 constraints.
Probing time = 0.13 sec. (70.85 ticks)
Cover probing fixed 0 vars, tightened 209 bounds.
MIP Presolve eliminated 84 rows and 55 columns.
MIP Presolve modified 1100 coefficients.
Reduced MIP has 1763 rows, 1496 columns, and 8130 nonzeros.
Reduced MIP has 1165 binaries, 69 generals, 0 SOSs, and 2236 indicators.
Probing fixed 0 vars, tightened 9 bounds.
Probing time = 0.03 sec. (23.68 ticks)
Clique table members: 38487.
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 8 threads.
Root relaxation solution time = 0.06 sec. (19.35 ticks)
Nodes Cuts/
Node Left Objective IInf Best Integer Best Bound ItCnt Gap
0 0 190413.5709 45 190413.5709 802
* 0+ 0 190540.9994 190413.5709 0.07%
0 0 190523.0000 17 190540.9994 Cuts: 117 913 0.01%
0 0 190523.0000 5 190540.9994 Cuts: 10 924 0.01%
* 0+ 0 190540.9988 190523.0000 0.01%
Repair heuristic found nothing.
Repeating presolve.
MIP Presolve eliminated 1496 rows and 1235 columns.
MIP Presolve modified 780 coefficients.
Reduced MIP has 220 rows, 173 columns, and 764 nonzeros.
Reduced MIP has 98 binaries, 20 generals, 0 SOSs, and 232 indicators.
Probing fixed 16 vars, tightened 116 bounds.
Probing changed sense of 10 constraints.
Probing time = 0.00 sec. (1.23 ticks)
Cover probing fixed 0 vars, tightened 97 bounds.
MIP Presolve eliminated 64 rows and 39 columns.
MIP Presolve modified 164 coefficients.
Reduced MIP has 191 rows, 133 columns, and 629 nonzeros.
Reduced MIP has 66 binaries, 13 generals, 0 SOSs, and 148 indicators.
Probing fixed 0 vars, tightened 28 bounds.
Probing changed sense of 1 constraints.
Probing time = 0.00 sec. (0.65 ticks)
Cover probing fixed 0 vars, tightened 24 bounds.
MIP Presolve eliminated 23 rows and 5 columns.
MIP Presolve modified 77 coefficients.
Reduced MIP has 168 rows, 128 columns, and 580 nonzeros.
Reduced MIP has 61 binaries, 13 generals, 0 SOSs, and 148 indicators.
Probing fixed 0 vars, tightened 14 bounds.
Probing time = 0.00 sec. (0.56 ticks)
Cover probing fixed 0 vars, tightened 6 bounds.
MIP Presolve modified 38 coefficients.
Reduced MIP has 168 rows, 128 columns, and 580 nonzeros.
Reduced MIP has 61 binaries, 13 generals, 0 SOSs, and 148 indicators.
Represolve time = 0.02 sec. (17.50 ticks)
Probing fixed 0 vars, tightened 13 bounds.
Probing time = 0.02 sec. (0.56 ticks)
Cover probing fixed 0 vars, tightened 67 bounds.
Clique table members: 420.
MIP emphasis: balance optimality and feasibility.
MIP search method: dynamic search.
Parallel mode: deterministic, using up to 8 threads.
Root relaxation solution time = 0.00 sec. (0.53 ticks)
Nodes Cuts/
Node Left Objective IInf Best Integer Best Bound ItCnt Gap
* 0+ 0 190540.9988 190523.0000 0.01%
0 0 190523.0000 6 190540.9988 190523.0000 973 0.01%
* 0 0 integral 0 190531.0000 Cuts: 20 1009 0.00%
0 0 cutoff 190531.0000 190531.0000 1009 0.00%
Elapsed time = 6.75 sec. (4410.13 ticks, tree = 0.01 MB)
Clique cuts applied: 16
Cover cuts applied: 1
Implied bound cuts applied: 20
Mixed integer rounding cuts applied: 6
Lift and project cuts applied: 1
Gomory fractional cuts applied: 4
Root node processing (before b&c):
Real time = 6.75 sec. (4410.48 ticks)
Parallel b&c, 8 threads:
Real time = 0.00 sec. (0.00 ticks)
Sync time (average) = 0.00 sec.
Wait time (average) = 0.00 sec.
------------
Total (root+branch&cut) = 6.75 sec. (4410.48 ticks)
CPLEX 12.6.3.0: optimal integer solution; objective 190531
1009 MIP simplex iterations
0 branch-and-bound nodes
No basis.
>Exit code: 3221225477
By the way, I have used the latest AMPL download to run the code.
Regards,
Tianci
在 2016年5月16日星期一 UTC+8下午11:34:50,Robert Fourer写道: