Skip to content
[Jenkins]Jenkins
log in

Failed

gpkit.tests.t_model.TestGP_cvxopt.test_dup_eq_constraint (from gpkit.tests.t_model.TestGP_cvxopt-20210816154213)

Failing for the past 1 build (Since Failed #3180 )
Took 18 ms.

Error Message

The model ran to an infinitely low cost (or was otherwise dual infeasible); bounding the right variables will probably fix this. Running `.debug()` or increasing verbosity may pinpoint the trouble.

Stacktrace

Traceback (most recent call last):
  File "/jenkins/workspace/CE_gpkit_PR_unit_tests/cvxopt/venv2_gpkit/lib/python3.5/site-packages/cvxopt/cvxprog.py", line 778, in cpl
    try: f3 = kktsolver(x, z[:mnl], W)
  File "/jenkins/workspace/CE_gpkit_PR_unit_tests/cvxopt/venv2_gpkit/lib/python3.5/site-packages/cvxopt/cvxprog.py", line 1901, in kktsolver_e
    g = kktsolver(x[0], znl, We)
  File "/jenkins/workspace/CE_gpkit_PR_unit_tests/cvxopt/venv2_gpkit/lib/python3.5/site-packages/cvxopt/cvxprog.py", line 1893, in kktsolver
    return factor(W, H, Df[1:,:])
  File "/jenkins/workspace/CE_gpkit_PR_unit_tests/cvxopt/venv2_gpkit/lib/python3.5/site-packages/cvxopt/misc.py", line 1099, in factor
    lapack.sytrf(K, ipiv)
ArithmeticError: 5

During handling of the above exception, another exception occurred:

Traceback (most recent call last):
  File "/jenkins/workspace/CE_gpkit_PR_unit_tests/cvxopt/gpkit/solvers/cvxopt.py", line 88, in optimize
    solution = gp(k_lse, F, g, **kwargs)
  File "/jenkins/workspace/CE_gpkit_PR_unit_tests/cvxopt/venv2_gpkit/lib/python3.5/site-packages/cvxopt/cvxprog.py", line 2161, in gp
    return cp(Fgp, G, h, dims, A, b, kktsolver = kktsolver, options = options)
  File "/jenkins/workspace/CE_gpkit_PR_unit_tests/cvxopt/venv2_gpkit/lib/python3.5/site-packages/cvxopt/cvxprog.py", line 1966, in cp
    xdot_e, xaxpy_e, xscal_e, options = options)
  File "/jenkins/workspace/CE_gpkit_PR_unit_tests/cvxopt/venv2_gpkit/lib/python3.5/site-packages/cvxopt/cvxprog.py", line 782, in cpl
    raise ValueError("Rank(A) < p or "\
ValueError: Rank(A) < p or Rank([H(x); A; Df(x); G]) < n

The above exception was the direct cause of the following exception:

Traceback (most recent call last):
  File "/jenkins/workspace/CE_gpkit_PR_unit_tests/cvxopt/gpkit/constraints/gp.py", line 207, in solve
    k=self.k, p_idxs=self.p_idxs, **solverargs)
  File "/jenkins/workspace/CE_gpkit_PR_unit_tests/cvxopt/gpkit/solvers/cvxopt.py", line 90, in optimize
    raise DualInfeasible() from e
gpkit.exceptions.DualInfeasible

The above exception was the direct cause of the following exception:

Traceback (most recent call last):
  File "/jenkins/workspace/CE_gpkit_PR_unit_tests/cvxopt/gpkit/tests/t_model.py", line 91, in test_dup_eq_constraint
    m.solve(verbosity=0, solver=self.solver)
  File "/jenkins/workspace/CE_gpkit_PR_unit_tests/cvxopt/gpkit/constraints/prog_factories.py", line 133, in solvefn
    result = progsolve(solver, verbosity=verbosity, **kwargs)
  File "/jenkins/workspace/CE_gpkit_PR_unit_tests/cvxopt/gpkit/constraints/gp.py", line 244, in solve
    raise infeasibility.__class__(msg) from infeasibility
gpkit.exceptions.DualInfeasible: The model ran to an infinitely low cost (or was otherwise dual infeasible); bounding the right variables will probably fix this. Running `.debug()` or increasing verbosity may pinpoint the trouble.

Standard Output

Standard Error