{"action":"opened","issue":{"url":"https://api.github.com/repos/stanle/madopt/issues/15","repository_url":"https://api.github.com/repos/stanle/madopt","labels_url":"https://api.github.com/repos/stanle/madopt/issues/15/labels{/name}","comments_url":"https://api.github.com/repos/stanle/madopt/issues/15/comments","events_url":"https://api.github.com/repos/stanle/madopt/issues/15/events","html_url":"https://github.com/stanle/madopt/issues/15","id":220081482,"number":15,"title":"Segfault in C++ example","user":{"login":"domluna","id":1907223,"avatar_url":"https://avatars1.githubusercontent.com/u/1907223?v=3","gravatar_id":"","url":"https://api.github.com/users/domluna","html_url":"https://github.com/domluna","followers_url":"https://api.github.com/users/domluna/followers","following_url":"https://api.github.com/users/domluna/following{/other_user}","gists_url":"https://api.github.com/users/domluna/gists{/gist_id}","starred_url":"https://api.github.com/users/domluna/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/domluna/subscriptions","organizations_url":"https://api.github.com/users/domluna/orgs","repos_url":"https://api.github.com/users/domluna/repos","events_url":"https://api.github.com/users/domluna/events{/privacy}","received_events_url":"https://api.github.com/users/domluna/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2017-04-07T01:27:12Z","updated_at":"2017-04-07T01:27:12Z","closed_at":null,"body":"```\r\n******************************************************************************\r\nThis program contains Ipopt, a library for large-scale nonlinear optimization.\r\n Ipopt is released as open source code under the Eclipse Public License (EPL).\r\n         For more information visit http://projects.coin-or.org/Ipopt\r\n******************************************************************************\r\n\r\nThis is Ipopt version 3.12.1, running with linear solver mumps.\r\nNOTE: Other linear solvers might be more efficient (see Ipopt documentation).\r\n\r\nNumber of nonzeros in equality constraint Jacobian...:     2994\r\nNumber of nonzeros in inequality constraint Jacobian.:        0\r\nNumber of nonzeros in Lagrangian Hessian.............:     1997\r\n\r\nTotal number of variables............................:     1000\r\n                     variables with only lower bounds:        0\r\n                variables with lower and upper bounds:     1000\r\n                     variables with only upper bounds:        0\r\nTotal number of equality constraints.................:      998\r\nTotal number of inequality constraints...............:        0\r\n        inequality constraints with only lower bounds:        0\r\n   inequality constraints with lower and upper bounds:        0\r\n        inequality constraints with only upper bounds:        0\r\n\r\nSegmentation fault: 11\r\n```\r\n\r\nthe segfault is happening when calling `m.solve()`. Tried also with Ipopt 3.12.7 and get the same result."}}
{"actor":{"display_login":"domluna"}}