Skip to content

[BUG] Cpp test failures in arm for cuts #972

@rgsl888prabhu

Description

@rgsl888prabhu

Describe the bug

[ RUN      ] cuts.clique_neos8_phase2_no_cut_off_optimal_solution_validation
optimization_problem_t constructor: Using GPU backend
optimization_problem_t constructor: Using GPU backend
optimization_problem_t constructor: Using GPU backend
optimization_problem_t constructor: Using GPU backend
cuOpt version: 26.4.0, git hash: b7ea46d1, host arch: aarch64, device archs: 75-real,80-real,86-real,90a-real,100f-real,120a-real,120
CPU: Unknown, threads (physical/logical): 1/12, RAM: 43.74 GiB
CUDA 13.1, device: NVIDIA L4 (ID 0), VRAM: 22.03 GiB
CUDA device UUID: 23c178ad-8149-b011-2af3-d975d9ff8f13

Solving a problem with 46324 constraints, 23228 variables (23228 integers), and 313180 nonzeros
Problem scaling:
Objective coefficents range:          [1e+00, 3e+03]
Constraint matrix coefficients range: [1e+00, 6e+00]
Constraint rhs / bounds range:        [0e+00, 2e+00]
Variable bounds range:                [0e+00, 9e+02]

Presolve is disabled, skipping
Objective offset 0.000000 scaling_factor 1.000000
Model fingerprint: 0xe9a43c38
Objective function is integral, scale 1
Reduced cost strengthening enabled: 2
313180 variable upper bounds in 0.01 seconds
2376 variable lower bounds in 0.02 seconds

Solving LP root relaxation in concurrent mode
Skipping column scaling
Dual Simplex Phase 1
Dual feasible solution found.
Dual Simplex Phase 2
 Iter     Objective           Num Inf.  Sum Inf.     Perturb  Time
    0 -4.4150000000000000e+04   22744 4.02680000e+04 0.00e+00 0.47
    1 -4.4150000000000000e+04   22749 3.58704000e+04 0.00e+00 0.47
 1000 -3.7500000000000029e+04     157 2.69550333e+03 0.00e+00 1.28
New solution from primal heuristics. Objective -2.628000e+03. Gap 1326.9%. Time 2.07
New solution from primal heuristics. Objective -2.636000e+03. Gap 1322.6%. Time 2.08
 2000 -3.7500000000000029e+04     194 1.56193382e+04 0.00e+00 2.30
New solution from primal heuristics. Objective -2.842000e+03. Gap 1219.5%. Time 3.70
 3000 -3.7500000000000029e+04     207 2.82277243e+05 0.00e+00 3.76
New solution from primal heuristics. Objective -2.852000e+03. Gap 1214.9%. Time 4.86
 4000 -3.7500000000000029e+04     240 7.15193513e+04 0.00e+00 5.52
New solution from primal heuristics. Objective -3.019000e+03. Gap 1142.1%. Time 6.16
 5000 -3.7500000000000029e+04     150 4.77640145e+05 0.00e+00 7.35
New solution from primal heuristics. Objective -3.106000e+03. Gap 1107.3%. Time 7.44
New solution from primal heuristics. Objective -3.224000e+03. Gap 1063.2%. Time 8.69
 6000 -3.7500000000000029e+04     287 2.59564089e+05 0.00e+00 9.49


Root relaxation solution found in 1219 iterations and 9.36s by Barrier/PDLP and Crossover
Root relaxation objective -3.77350793e+03


Strong branching using 11 threads and 165 fractional variables
Strong branching completed in 4.03s
Reduced costs: Found 2 improved bounds and 0 fixed variables
Exploring the B&B tree using 11 threads

 | Explored | Unexplored |    Objective    |     Bound     | IntInf | Depth | Iter/Node |   Gap    |  Time  |
H                            -3.493000e+03    -3.772000e+03                                 8.0%     18.96
H                            -3.501000e+03    -3.772000e+03                                 7.7%     22.76
D         29            9    -3.706000e+03    -3.772000e+03        0     12   4.9e+01       1.8%     23.05
D         62           11    -3.717000e+03    -3.772000e+03        0     18   2.4e+01       1.5%     23.65
B         79           11    -3.719000e+03    -3.772000e+03        0     17   4.7e+01       1.4%     24.55
          83            7    -3.719000e+03    -3.772000e+03        1     17   4.4e+01       1.4%     43.82
          83            7    -3.719000e+03    -3.772000e+03        1     17   4.4e+01       1.4%     73.82
          83            7    -3.719000e+03    -3.772000e+03        1     17   4.4e+01       1.4%    103.82
          83            7    -3.719000e+03    -3.772000e+03        1     17   4.4e+01       1.4%    120.00
Time limit reached. Stopping the solver...
Explored 83 nodes in 120.01s.
Absolute Gap 5.450793e+01 Objective -3.7190000000000000e+03 Lower Bound -3.7735079271873165e+03
Root LP dual objective (last): -3.7500000000000029e+04
/tmp/conda-bld-output/bld/rattler-build_libmps-parser/work/cpp/tests/mip/cuts_test.cu:1259: Failure
Expected equality of these values:
  no_cut_mip.status
    Which is: 1-byte object <08>
  mip_termination_status_t::Optimal
    Which is: 1-byte object <01>

[  FAILED  ] cuts.clique_neos8_phase2_no_cut_off_optimal_solution_validation (120144 ms)
[ RUN      ] cuts.clique_neos8_phase3_fractional_separation_must_cut_off
optimization_problem_t constructor: Using GPU backend
cuOpt version: 26.4.0, git hash: b7ea46d1, host arch: aarch64, device archs: 75-real,80-real,86-real,90a-real,100f-real,120a-real,120
CPU: Unknown, threads (physical/logical): 1/12, RAM: 43.28 GiB
CUDA 13.1, device: NVIDIA L4 (ID 0), VRAM: 22.03 GiB
CUDA device UUID: 23c178ad-8149-b011-2af3-d975d9ff8f13

Solving a problem with 46324 constraints, 23228 variables (0 integers), and 313180 nonzeros
Problem scaling:
Objective coefficents range:          [1e+00, 3e+03]
Constraint matrix coefficients range: [1e+00, 6e+00]
Constraint rhs / bounds range:        [0e+00, 2e+00]
Variable bounds range:                [0e+00, 9e+02]

Objective offset 0.000000 scaling_factor 1.000000
Running concurrent (showing only PDLP log)

   Iter    Primal Obj.      Dual Obj.    Gap        Primal Res.  Dual Res.   Time
      0 +0.00000000e+00 +0.00000000e+00  0.00e+00   0.00e+00     8.94e+03   0.038s
   1000 -3.71684190e+03 -3.67135336e+03  4.55e+01   4.48e-01     9.52e+01   0.114s
   2000 -3.79929022e+03 -3.79019328e+03  9.10e+00   2.81e+00     9.52e-02   0.167s
   3000 -3.77027876e+03 -3.77903713e+03  8.76e+00   2.39e-02     5.15e+00   0.221s
   4000 -3.77296882e+03 -3.77778052e+03  4.81e+00   9.34e-03     3.46e+00   0.273s
   5000 -3.77348983e+03 -3.77775218e+03  4.26e+00   1.11e-03     3.45e+00   0.336s
   6000 -3.77503841e+03 -3.77326347e+03  1.77e+00   2.28e-02     2.72e-01   0.406s
   7000 -3.77433715e+03 -3.77352642e+03  8.11e-01   1.45e-02     1.47e-02   0.477s
Dual simplex finished in 0.52 seconds
Barrier finished in 0.54 seconds
PDLP finished
Concurrent time: 0.548s
Solved with dual simplex
Status: Optimal   Objective: -3.77350793e+03  Iterations: 606  Time: 0.548s
Primal residual (abs/rel): 6.01e-14/6.72e-18
Dual   residual (abs/rel): 2.05e-12/6.85e-15
[       OK ] cuts.clique_neos8_phase3_fractional_separation_must_cut_off (734 ms)
[ RUN      ] cuts.clique_neos8_phase4_fault_isolation_binary_search
/tmp/conda-bld-output/bld/rattler-build_libmps-parser/work/cpp/tests/mip/cuts_test.cu:1302: Failure
Expected equality of these values:
  no_cut_mip.status
    Which is: 1-byte object <08>
  mip_termination_status_t::Optimal
    Which is: 1-byte object <01>

[  FAILED  ] cuts.clique_neos8_phase4_fault_isolation_binary_search (0 ms)

logs.txt

Metadata

Metadata

Assignees

Labels

awaiting responseThis expects a response from maintainer or contributor depending on who requested in last comment.bugSomething isn't working

Type

No type

Projects

No projects

Relationships

None yet

Development

No branches or pull requests

Issue actions