I: pbuilder: network access will be disabled during build I: Current time: Thu Feb 13 21:08:42 +14 2025 I: pbuilder-time-stamp: 1739430522 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/unstable-reproducible-base.tgz] I: copying local configuration W: --override-config is not set; not updating apt.conf Read the manpage for details. I: mounting /proc filesystem I: mounting /sys filesystem I: creating /{dev,run}/shm I: mounting /dev/pts filesystem I: redirecting /dev/ptmx to /dev/pts/ptmx I: policy-rc.d already exists I: Copying source file I: copying [papilo_2.4.1+ds-1.dsc] I: copying [./papilo_2.4.1+ds.orig.tar.xz] I: copying [./papilo_2.4.1+ds-1.debian.tar.xz] I: Extracting source dpkg-source: warning: cannot verify inline signature for ./papilo_2.4.1+ds-1.dsc: unsupported subcommand dpkg-source: info: extracting papilo in papilo-2.4.1+ds dpkg-source: info: unpacking papilo_2.4.1+ds.orig.tar.xz dpkg-source: info: unpacking papilo_2.4.1+ds-1.debian.tar.xz dpkg-source: info: using patch list from debian/patches/series dpkg-source: info: applying 0001-Build-shared-libraries.patch dpkg-source: info: applying 0002-Use-external-libraries.patch dpkg-source: info: applying 0003-libfmt-10-compat.patch dpkg-source: info: applying 0004-Do-not-hide-symbols.patch dpkg-source: info: applying 0005-Link-against-SoPlex-shared-library.patch I: Not using root during the build. I: Installing the build-deps I: user script /srv/workspace/pbuilder/1828/tmp/hooks/D01_modify_environment starting debug: Running on virt64a. I: Changing host+domainname to test build reproducibility I: Adding a custom variable just for the fun of it... I: Changing /bin/sh to bash '/bin/sh' -> '/bin/bash' lrwxrwxrwx 1 root root 9 Feb 13 07:09 /bin/sh -> /bin/bash I: Setting pbuilder2's login shell to /bin/bash I: Setting pbuilder2's GECOS to second user,second room,second work-phone,second home-phone,second other I: user script /srv/workspace/pbuilder/1828/tmp/hooks/D01_modify_environment finished I: user script /srv/workspace/pbuilder/1828/tmp/hooks/D02_print_environment starting I: set BASH=/bin/sh BASHOPTS=checkwinsize:cmdhist:complete_fullquote:extquote:force_fignore:globasciiranges:globskipdots:hostcomplete:interactive_comments:patsub_replacement:progcomp:promptvars:sourcepath BASH_ALIASES=() BASH_ARGC=() BASH_ARGV=() BASH_CMDS=() BASH_LINENO=([0]="12" [1]="0") BASH_LOADABLES_PATH=/usr/local/lib/bash:/usr/lib/bash:/opt/local/lib/bash:/usr/pkg/lib/bash:/opt/pkg/lib/bash:. BASH_SOURCE=([0]="/tmp/hooks/D02_print_environment" [1]="/tmp/hooks/D02_print_environment") BASH_VERSINFO=([0]="5" [1]="2" [2]="37" [3]="1" [4]="release" [5]="arm-unknown-linux-gnueabihf") BASH_VERSION='5.2.37(1)-release' BUILDDIR=/build/reproducible-path BUILDUSERGECOS='second user,second room,second work-phone,second home-phone,second other' BUILDUSERNAME=pbuilder2 BUILD_ARCH=armhf DEBIAN_FRONTEND=noninteractive DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=4 ' DIRSTACK=() DISTRIBUTION=unstable EUID=0 FUNCNAME=([0]="Echo" [1]="main") GROUPS=() HOME=/root HOSTNAME=i-capture-the-hostname HOSTTYPE=arm HOST_ARCH=armhf IFS=' ' INVOCATION_ID=4c9bf669998b4ee1a4f237c9838bf86e LANG=C LANGUAGE=it_CH:it LC_ALL=C MACHTYPE=arm-unknown-linux-gnueabihf MAIL=/var/mail/root OPTERR=1 OPTIND=1 OSTYPE=linux-gnueabihf PATH=/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path PBCURRENTCOMMANDLINEOPERATION=build PBUILDER_OPERATION=build PBUILDER_PKGDATADIR=/usr/share/pbuilder PBUILDER_PKGLIBDIR=/usr/lib/pbuilder PBUILDER_SYSCONFDIR=/etc PIPESTATUS=([0]="0") POSIXLY_CORRECT=y PPID=1828 PS4='+ ' PWD=/ SHELL=/bin/bash SHELLOPTS=braceexpand:errexit:hashall:interactive-comments:posix SHLVL=3 SUDO_COMMAND='/usr/bin/timeout -k 24.1h 24h /usr/bin/ionice -c 3 /usr/bin/nice -n 11 /usr/bin/unshare --uts -- /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.ErDNlW5u/pbuilderrc_JiFp --distribution unstable --hookdir /etc/pbuilder/rebuild-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/unstable-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.ErDNlW5u/b2 --logfile b2/build.log papilo_2.4.1+ds-1.dsc' SUDO_GID=114 SUDO_UID=108 SUDO_USER=jenkins TERM=unknown TZ=/usr/share/zoneinfo/Etc/GMT-14 UID=0 USER=root _='I: set' http_proxy=http://10.0.0.15:3142/ I: uname -a Linux i-capture-the-hostname 6.1.0-31-arm64 #1 SMP Debian 6.1.128-1 (2025-02-07) aarch64 GNU/Linux I: ls -l /bin lrwxrwxrwx 1 root root 7 Nov 22 14:40 /bin -> usr/bin I: user script /srv/workspace/pbuilder/1828/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy Version: 0.invalid.0 Architecture: armhf Maintainer: Debian Pbuilder Team Description: Dummy package to satisfy dependencies with aptitude - created by pbuilder This package was created automatically by pbuilder to satisfy the build-dependencies of the package being currently built. Depends: debhelper-compat (= 13), catch2, cmake, gfortran, libblas-dev, libboost-dev, libboost-iostreams-dev, libboost-program-options-dev, libboost-serialization-dev, libfmt-dev, libsoplex-dev, libtbb-dev (>= 2020) dpkg-deb: building package 'pbuilder-satisfydepends-dummy' in '/tmp/satisfydepends-aptitude/pbuilder-satisfydepends-dummy.deb'. Selecting previously unselected package pbuilder-satisfydepends-dummy. (Reading database ... 19533 files and directories currently installed.) Preparing to unpack .../pbuilder-satisfydepends-dummy.deb ... Unpacking pbuilder-satisfydepends-dummy (0.invalid.0) ... dpkg: pbuilder-satisfydepends-dummy: dependency problems, but configuring anyway as you requested: pbuilder-satisfydepends-dummy depends on debhelper-compat (= 13); however: Package debhelper-compat is not installed. pbuilder-satisfydepends-dummy depends on catch2; however: Package catch2 is not installed. pbuilder-satisfydepends-dummy depends on cmake; however: Package cmake is not installed. pbuilder-satisfydepends-dummy depends on gfortran; however: Package gfortran is not installed. pbuilder-satisfydepends-dummy depends on libblas-dev; however: Package libblas-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-dev; however: Package libboost-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-iostreams-dev; however: Package libboost-iostreams-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-program-options-dev; however: Package libboost-program-options-dev is not installed. pbuilder-satisfydepends-dummy depends on libboost-serialization-dev; however: Package libboost-serialization-dev is not installed. pbuilder-satisfydepends-dummy depends on libfmt-dev; however: Package libfmt-dev is not installed. pbuilder-satisfydepends-dummy depends on libsoplex-dev; however: Package libsoplex-dev is not installed. pbuilder-satisfydepends-dummy depends on libtbb-dev (>= 2020); however: Package libtbb-dev is not installed. Setting up pbuilder-satisfydepends-dummy (0.invalid.0) ... Reading package lists... Building dependency tree... Reading state information... Initializing package states... Writing extended state information... Building tag database... pbuilder-satisfydepends-dummy is already installed at the requested version (0.invalid.0) pbuilder-satisfydepends-dummy is already installed at the requested version (0.invalid.0) The following NEW packages will be installed: autoconf{a} automake{a} autopoint{a} autotools-dev{a} bsdextrautils{a} catch2{a} cmake{a} cmake-data{a} debhelper{a} dh-autoreconf{a} dh-strip-nondeterminism{a} dwz{a} file{a} gettext{a} gettext-base{a} gfortran{a} gfortran-14{a} gfortran-14-arm-linux-gnueabihf{a} gfortran-arm-linux-gnueabihf{a} groff-base{a} icu-devtools{a} intltool-debian{a} libarchive-zip-perl{a} libarchive13t64{a} libblas-dev{a} libblas3{a} libboost-dev{a} libboost-iostreams-dev{a} libboost-iostreams1.83-dev{a} libboost-program-options-dev{a} libboost-program-options1.83-dev{a} libboost-program-options1.83.0{a} libboost-regex1.83-dev{a} libboost-regex1.83.0{a} libboost-serialization-dev{a} libboost-serialization1.83-dev{a} libboost-serialization1.83.0{a} libboost1.83-dev{a} libbrotli1{a} libcatch2-dev{a} libcom-err2{a} libcurl4t64{a} libdebhelper-perl{a} libelf1t64{a} libexpat1{a} libffi8{a} libfile-stripnondeterminism-perl{a} libfmt-dev{a} libfmt10{a} libgfortran-14-dev{a} libgfortran5{a} libgmp-dev{a} libgmpxx4ldbl{a} libgnutls30t64{a} libgssapi-krb5-2{a} libhwloc15{a} libicu-dev{a} libicu72{a} libidn2-0{a} libjsoncpp26{a} libk5crypto3{a} libkeyutils1{a} libkrb5-3{a} libkrb5support0{a} libldap2{a} libmagic-mgc{a} libmagic1t64{a} libnghttp2-14{a} libp11-kit0{a} libpipeline1{a} libproc2-0{a} libpsl5t64{a} librhash1{a} librtmp1{a} libsasl2-2{a} libsasl2-modules-db{a} libsoplex-dev{a} libsoplexshared7.1{a} libssh2-1t64{a} libtasn1-6{a} libtbb-dev{a} libtbb12{a} libtbbbind-2-5{a} libtbbmalloc2{a} libtool{a} libuchardet0{a} libunistring5{a} libuv1t64{a} libxml2{a} m4{a} man-db{a} po-debconf{a} procps{a} sensible-utils{a} zlib1g-dev{a} The following packages are RECOMMENDED but will NOT be installed: ca-certificates curl krb5-locales libarchive-cpio-perl libhwloc-plugins libldap-common libltdl-dev libmail-sendmail-perl libsasl2-modules linux-sysctl-defaults lynx psmisc publicsuffix wget 0 packages upgraded, 95 newly installed, 0 to remove and 0 not upgraded. Need to get 72.3 MB of archives. After unpacking 406 MB will be used. Writing extended state information... Get: 1 http://deb.debian.org/debian unstable/main armhf libproc2-0 armhf 2:4.0.4-7 [56.3 kB] Get: 2 http://deb.debian.org/debian unstable/main armhf procps armhf 2:4.0.4-7 [866 kB] Get: 3 http://deb.debian.org/debian unstable/main armhf sensible-utils all 0.0.24 [24.8 kB] Get: 4 http://deb.debian.org/debian unstable/main armhf libmagic-mgc armhf 1:5.45-3+b1 [314 kB] Get: 5 http://deb.debian.org/debian unstable/main armhf libmagic1t64 armhf 1:5.45-3+b1 [98.5 kB] Get: 6 http://deb.debian.org/debian unstable/main armhf file armhf 1:5.45-3+b1 [42.3 kB] Get: 7 http://deb.debian.org/debian unstable/main armhf gettext-base armhf 0.23.1-1 [238 kB] Get: 8 http://deb.debian.org/debian unstable/main armhf libuchardet0 armhf 0.0.8-1+b2 [65.6 kB] Get: 9 http://deb.debian.org/debian unstable/main armhf groff-base armhf 1.23.0-7 [1095 kB] Get: 10 http://deb.debian.org/debian unstable/main armhf bsdextrautils armhf 2.40.4-3 [84.6 kB] Get: 11 http://deb.debian.org/debian unstable/main armhf libpipeline1 armhf 1.5.8-1 [35.0 kB] Get: 12 http://deb.debian.org/debian unstable/main armhf man-db armhf 2.13.0-1 [1382 kB] Get: 13 http://deb.debian.org/debian unstable/main armhf m4 armhf 1.4.19-5 [272 kB] Get: 14 http://deb.debian.org/debian unstable/main armhf autoconf all 2.72-3 [493 kB] Get: 15 http://deb.debian.org/debian unstable/main armhf autotools-dev all 20220109.1 [51.6 kB] Get: 16 http://deb.debian.org/debian unstable/main armhf automake all 1:1.17-3 [862 kB] Get: 17 http://deb.debian.org/debian unstable/main armhf autopoint all 0.23.1-1 [770 kB] Get: 18 http://deb.debian.org/debian unstable/main armhf libcatch2-dev armhf 3.7.1-0.5 [584 kB] Get: 19 http://deb.debian.org/debian unstable/main armhf catch2 all 3.7.1-0.5 [5144 B] Get: 20 http://deb.debian.org/debian unstable/main armhf cmake-data all 3.31.5-2 [2267 kB] Get: 21 http://deb.debian.org/debian unstable/main armhf libicu72 armhf 72.1-6 [9086 kB] Get: 22 http://deb.debian.org/debian unstable/main armhf libxml2 armhf 2.12.7+dfsg+really2.9.14-0.2+b1 [605 kB] Get: 23 http://deb.debian.org/debian unstable/main armhf libarchive13t64 armhf 3.7.4-1.1 [306 kB] Get: 24 http://deb.debian.org/debian unstable/main armhf libbrotli1 armhf 1.1.0-2+b6 [282 kB] Get: 25 http://deb.debian.org/debian unstable/main armhf libkrb5support0 armhf 1.21.3-4 [30.3 kB] Get: 26 http://deb.debian.org/debian unstable/main armhf libcom-err2 armhf 1.47.2-1 [23.3 kB] Get: 27 http://deb.debian.org/debian unstable/main armhf libk5crypto3 armhf 1.21.3-4 [75.8 kB] Get: 28 http://deb.debian.org/debian unstable/main armhf libkeyutils1 armhf 1.6.3-4 [8096 B] Get: 29 http://deb.debian.org/debian unstable/main armhf libkrb5-3 armhf 1.21.3-4 [285 kB] Get: 30 http://deb.debian.org/debian unstable/main armhf libgssapi-krb5-2 armhf 1.21.3-4 [116 kB] Get: 31 http://deb.debian.org/debian unstable/main armhf libunistring5 armhf 1.3-1 [444 kB] Get: 32 http://deb.debian.org/debian unstable/main armhf libidn2-0 armhf 2.3.7-2+b1 [125 kB] Get: 33 http://deb.debian.org/debian unstable/main armhf libsasl2-modules-db armhf 2.1.28+dfsg1-8+b1 [18.6 kB] Get: 34 http://deb.debian.org/debian unstable/main armhf libsasl2-2 armhf 2.1.28+dfsg1-8+b1 [50.6 kB] Get: 35 http://deb.debian.org/debian unstable/main armhf libldap2 armhf 2.6.9+dfsg-1 [167 kB] Get: 36 http://deb.debian.org/debian unstable/main armhf libnghttp2-14 armhf 1.64.0-1 [62.9 kB] Get: 37 http://deb.debian.org/debian unstable/main armhf libpsl5t64 armhf 0.21.2-1.1+b1 [55.8 kB] Get: 38 http://deb.debian.org/debian unstable/main armhf libffi8 armhf 3.4.7-1 [20.3 kB] Get: 39 http://deb.debian.org/debian unstable/main armhf libp11-kit0 armhf 0.25.5-3 [385 kB] Get: 40 http://deb.debian.org/debian unstable/main armhf libtasn1-6 armhf 4.20.0-1 [44.3 kB] Get: 41 http://deb.debian.org/debian unstable/main armhf libgnutls30t64 armhf 3.8.9-2 [1382 kB] Get: 42 http://deb.debian.org/debian unstable/main armhf librtmp1 armhf 2.4+20151223.gitfa8646d.1-2+b5 [53.2 kB] Get: 43 http://deb.debian.org/debian unstable/main armhf libssh2-1t64 armhf 1.11.1-1 [227 kB] Get: 44 http://deb.debian.org/debian unstable/main armhf libcurl4t64 armhf 8.12.0+git20250209.89ed161+ds-1 [308 kB] Get: 45 http://deb.debian.org/debian unstable/main armhf libexpat1 armhf 2.6.4-1 [83.5 kB] Get: 46 http://deb.debian.org/debian unstable/main armhf libjsoncpp26 armhf 1.9.6-3 [69.9 kB] Get: 47 http://deb.debian.org/debian unstable/main armhf librhash1 armhf 1.4.5-1 [143 kB] Get: 48 http://deb.debian.org/debian unstable/main armhf libuv1t64 armhf 1.50.0-2 [140 kB] Get: 49 http://deb.debian.org/debian unstable/main armhf cmake armhf 3.31.5-2 [5911 kB] Get: 50 http://deb.debian.org/debian unstable/main armhf libdebhelper-perl all 13.24.1 [90.9 kB] Get: 51 http://deb.debian.org/debian unstable/main armhf libtool all 2.5.4-3 [539 kB] Get: 52 http://deb.debian.org/debian unstable/main armhf dh-autoreconf all 20 [17.1 kB] Get: 53 http://deb.debian.org/debian unstable/main armhf libarchive-zip-perl all 1.68-1 [104 kB] Get: 54 http://deb.debian.org/debian unstable/main armhf libfile-stripnondeterminism-perl all 1.14.1-2 [19.7 kB] Get: 55 http://deb.debian.org/debian unstable/main armhf dh-strip-nondeterminism all 1.14.1-2 [8620 B] Get: 56 http://deb.debian.org/debian unstable/main armhf libelf1t64 armhf 0.192-4 [184 kB] Get: 57 http://deb.debian.org/debian unstable/main armhf dwz armhf 0.15-1+b2 [106 kB] Get: 58 http://deb.debian.org/debian unstable/main armhf gettext armhf 0.23.1-1 [1560 kB] Get: 59 http://deb.debian.org/debian unstable/main armhf intltool-debian all 0.35.0+20060710.6 [22.9 kB] Get: 60 http://deb.debian.org/debian unstable/main armhf po-debconf all 1.0.21+nmu1 [248 kB] Get: 61 http://deb.debian.org/debian unstable/main armhf debhelper all 13.24.1 [920 kB] Get: 62 http://deb.debian.org/debian unstable/main armhf libgfortran5 armhf 14.2.0-17 [263 kB] Get: 63 http://deb.debian.org/debian unstable/main armhf libgfortran-14-dev armhf 14.2.0-17 [315 kB] Get: 64 http://deb.debian.org/debian unstable/main armhf gfortran-14-arm-linux-gnueabihf armhf 14.2.0-17 [8720 kB] Get: 65 http://deb.debian.org/debian unstable/main armhf gfortran-14 armhf 14.2.0-17 [14.0 kB] Get: 66 http://deb.debian.org/debian unstable/main armhf gfortran-arm-linux-gnueabihf armhf 4:14.2.0-1 [1288 B] Get: 67 http://deb.debian.org/debian unstable/main armhf gfortran armhf 4:14.2.0-1 [1428 B] Get: 68 http://deb.debian.org/debian unstable/main armhf icu-devtools armhf 72.1-6 [189 kB] Get: 69 http://deb.debian.org/debian unstable/main armhf libblas3 armhf 3.12.1-2 [116 kB] Get: 70 http://deb.debian.org/debian unstable/main armhf libblas-dev armhf 3.12.1-2 [127 kB] Get: 71 http://deb.debian.org/debian unstable/main armhf libboost1.83-dev armhf 1.83.0-4 [10.6 MB] Get: 72 http://deb.debian.org/debian unstable/main armhf libboost-dev armhf 1.83.0.2+b2 [3832 B] Get: 73 http://deb.debian.org/debian unstable/main armhf libboost-regex1.83.0 armhf 1.83.0-4 [308 kB] Get: 74 http://deb.debian.org/debian unstable/main armhf libicu-dev armhf 72.1-6 [10.1 MB] Get: 75 http://deb.debian.org/debian unstable/main armhf libboost-regex1.83-dev armhf 1.83.0-4 [337 kB] Get: 76 http://deb.debian.org/debian unstable/main armhf libboost-iostreams1.83-dev armhf 1.83.0-4 [261 kB] Get: 77 http://deb.debian.org/debian unstable/main armhf libboost-iostreams-dev armhf 1.83.0.2+b2 [3568 B] Get: 78 http://deb.debian.org/debian unstable/main armhf libboost-program-options1.83.0 armhf 1.83.0-4 [327 kB] Get: 79 http://deb.debian.org/debian unstable/main armhf libboost-program-options1.83-dev armhf 1.83.0-4 [370 kB] Get: 80 http://deb.debian.org/debian unstable/main armhf libboost-program-options-dev armhf 1.83.0.2+b2 [3604 B] Get: 81 http://deb.debian.org/debian unstable/main armhf libboost-serialization1.83.0 armhf 1.83.0-4 [317 kB] Get: 82 http://deb.debian.org/debian unstable/main armhf libboost-serialization1.83-dev armhf 1.83.0-4 [385 kB] Get: 83 http://deb.debian.org/debian unstable/main armhf libboost-serialization-dev armhf 1.83.0.2+b2 [3816 B] Get: 84 http://deb.debian.org/debian unstable/main armhf libfmt10 armhf 10.1.1+ds1-4 [118 kB] Get: 85 http://deb.debian.org/debian unstable/main armhf libfmt-dev armhf 10.1.1+ds1-4 [177 kB] Get: 86 http://deb.debian.org/debian unstable/main armhf libgmpxx4ldbl armhf 2:6.3.0+dfsg-3 [328 kB] Get: 87 http://deb.debian.org/debian unstable/main armhf libgmp-dev armhf 2:6.3.0+dfsg-3 [592 kB] Get: 88 http://deb.debian.org/debian unstable/main armhf libhwloc15 armhf 2.11.2-1 [134 kB] Get: 89 http://deb.debian.org/debian unstable/main armhf libsoplexshared7.1 armhf 7.1.3+dfsg-1 [1086 kB] Get: 90 http://deb.debian.org/debian unstable/main armhf zlib1g-dev armhf 1:1.3.dfsg+really1.3.1-1+b1 [905 kB] Get: 91 http://deb.debian.org/debian unstable/main armhf libsoplex-dev armhf 7.1.3+dfsg-1 [1911 kB] Get: 92 http://deb.debian.org/debian unstable/main armhf libtbbmalloc2 armhf 2022.0.0-1 [43.1 kB] Get: 93 http://deb.debian.org/debian unstable/main armhf libtbbbind-2-5 armhf 2022.0.0-1 [13.3 kB] Get: 94 http://deb.debian.org/debian unstable/main armhf libtbb12 armhf 2022.0.0-1 [77.2 kB] Get: 95 http://deb.debian.org/debian unstable/main armhf libtbb-dev armhf 2022.0.0-1 [199 kB] Fetched 72.3 MB in 3s (26.3 MB/s) Preconfiguring packages ... Selecting previously unselected package libproc2-0:armhf. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 19533 files and directories currently installed.) Preparing to unpack .../00-libproc2-0_2%3a4.0.4-7_armhf.deb ... Unpacking libproc2-0:armhf (2:4.0.4-7) ... Selecting previously unselected package procps. Preparing to unpack .../01-procps_2%3a4.0.4-7_armhf.deb ... Unpacking procps (2:4.0.4-7) ... Selecting previously unselected package sensible-utils. Preparing to unpack .../02-sensible-utils_0.0.24_all.deb ... Unpacking sensible-utils (0.0.24) ... Selecting previously unselected package libmagic-mgc. Preparing to unpack .../03-libmagic-mgc_1%3a5.45-3+b1_armhf.deb ... Unpacking libmagic-mgc (1:5.45-3+b1) ... Selecting previously unselected package libmagic1t64:armhf. Preparing to unpack .../04-libmagic1t64_1%3a5.45-3+b1_armhf.deb ... Unpacking libmagic1t64:armhf (1:5.45-3+b1) ... Selecting previously unselected package file. Preparing to unpack .../05-file_1%3a5.45-3+b1_armhf.deb ... Unpacking file (1:5.45-3+b1) ... Selecting previously unselected package gettext-base. Preparing to unpack .../06-gettext-base_0.23.1-1_armhf.deb ... Unpacking gettext-base (0.23.1-1) ... Selecting previously unselected package libuchardet0:armhf. Preparing to unpack .../07-libuchardet0_0.0.8-1+b2_armhf.deb ... Unpacking libuchardet0:armhf (0.0.8-1+b2) ... Selecting previously unselected package groff-base. Preparing to unpack .../08-groff-base_1.23.0-7_armhf.deb ... Unpacking groff-base (1.23.0-7) ... Selecting previously unselected package bsdextrautils. Preparing to unpack .../09-bsdextrautils_2.40.4-3_armhf.deb ... Unpacking bsdextrautils (2.40.4-3) ... Selecting previously unselected package libpipeline1:armhf. Preparing to unpack .../10-libpipeline1_1.5.8-1_armhf.deb ... Unpacking libpipeline1:armhf (1.5.8-1) ... Selecting previously unselected package man-db. Preparing to unpack .../11-man-db_2.13.0-1_armhf.deb ... Unpacking man-db (2.13.0-1) ... Selecting previously unselected package m4. Preparing to unpack .../12-m4_1.4.19-5_armhf.deb ... Unpacking m4 (1.4.19-5) ... Selecting previously unselected package autoconf. Preparing to unpack .../13-autoconf_2.72-3_all.deb ... Unpacking autoconf (2.72-3) ... Selecting previously unselected package autotools-dev. Preparing to unpack .../14-autotools-dev_20220109.1_all.deb ... Unpacking autotools-dev (20220109.1) ... Selecting previously unselected package automake. Preparing to unpack .../15-automake_1%3a1.17-3_all.deb ... Unpacking automake (1:1.17-3) ... Selecting previously unselected package autopoint. Preparing to unpack .../16-autopoint_0.23.1-1_all.deb ... Unpacking autopoint (0.23.1-1) ... Selecting previously unselected package libcatch2-dev. Preparing to unpack .../17-libcatch2-dev_3.7.1-0.5_armhf.deb ... Unpacking libcatch2-dev (3.7.1-0.5) ... Selecting previously unselected package catch2. Preparing to unpack .../18-catch2_3.7.1-0.5_all.deb ... Unpacking catch2 (3.7.1-0.5) ... Selecting previously unselected package cmake-data. Preparing to unpack .../19-cmake-data_3.31.5-2_all.deb ... Unpacking cmake-data (3.31.5-2) ... Selecting previously unselected package libicu72:armhf. Preparing to unpack .../20-libicu72_72.1-6_armhf.deb ... Unpacking libicu72:armhf (72.1-6) ... Selecting previously unselected package libxml2:armhf. Preparing to unpack .../21-libxml2_2.12.7+dfsg+really2.9.14-0.2+b1_armhf.deb ... Unpacking libxml2:armhf (2.12.7+dfsg+really2.9.14-0.2+b1) ... Selecting previously unselected package libarchive13t64:armhf. Preparing to unpack .../22-libarchive13t64_3.7.4-1.1_armhf.deb ... Unpacking libarchive13t64:armhf (3.7.4-1.1) ... Selecting previously unselected package libbrotli1:armhf. Preparing to unpack .../23-libbrotli1_1.1.0-2+b6_armhf.deb ... Unpacking libbrotli1:armhf (1.1.0-2+b6) ... Selecting previously unselected package libkrb5support0:armhf. Preparing to unpack .../24-libkrb5support0_1.21.3-4_armhf.deb ... Unpacking libkrb5support0:armhf (1.21.3-4) ... Selecting previously unselected package libcom-err2:armhf. Preparing to unpack .../25-libcom-err2_1.47.2-1_armhf.deb ... Unpacking libcom-err2:armhf (1.47.2-1) ... Selecting previously unselected package libk5crypto3:armhf. Preparing to unpack .../26-libk5crypto3_1.21.3-4_armhf.deb ... Unpacking libk5crypto3:armhf (1.21.3-4) ... Selecting previously unselected package libkeyutils1:armhf. Preparing to unpack .../27-libkeyutils1_1.6.3-4_armhf.deb ... Unpacking libkeyutils1:armhf (1.6.3-4) ... Selecting previously unselected package libkrb5-3:armhf. Preparing to unpack .../28-libkrb5-3_1.21.3-4_armhf.deb ... Unpacking libkrb5-3:armhf (1.21.3-4) ... Selecting previously unselected package libgssapi-krb5-2:armhf. Preparing to unpack .../29-libgssapi-krb5-2_1.21.3-4_armhf.deb ... Unpacking libgssapi-krb5-2:armhf (1.21.3-4) ... Selecting previously unselected package libunistring5:armhf. Preparing to unpack .../30-libunistring5_1.3-1_armhf.deb ... Unpacking libunistring5:armhf (1.3-1) ... Selecting previously unselected package libidn2-0:armhf. Preparing to unpack .../31-libidn2-0_2.3.7-2+b1_armhf.deb ... Unpacking libidn2-0:armhf (2.3.7-2+b1) ... Selecting previously unselected package libsasl2-modules-db:armhf. Preparing to unpack .../32-libsasl2-modules-db_2.1.28+dfsg1-8+b1_armhf.deb ... Unpacking libsasl2-modules-db:armhf (2.1.28+dfsg1-8+b1) ... Selecting previously unselected package libsasl2-2:armhf. Preparing to unpack .../33-libsasl2-2_2.1.28+dfsg1-8+b1_armhf.deb ... Unpacking libsasl2-2:armhf (2.1.28+dfsg1-8+b1) ... Selecting previously unselected package libldap2:armhf. Preparing to unpack .../34-libldap2_2.6.9+dfsg-1_armhf.deb ... Unpacking libldap2:armhf (2.6.9+dfsg-1) ... Selecting previously unselected package libnghttp2-14:armhf. Preparing to unpack .../35-libnghttp2-14_1.64.0-1_armhf.deb ... Unpacking libnghttp2-14:armhf (1.64.0-1) ... Selecting previously unselected package libpsl5t64:armhf. Preparing to unpack .../36-libpsl5t64_0.21.2-1.1+b1_armhf.deb ... Unpacking libpsl5t64:armhf (0.21.2-1.1+b1) ... Selecting previously unselected package libffi8:armhf. Preparing to unpack .../37-libffi8_3.4.7-1_armhf.deb ... Unpacking libffi8:armhf (3.4.7-1) ... Selecting previously unselected package libp11-kit0:armhf. Preparing to unpack .../38-libp11-kit0_0.25.5-3_armhf.deb ... Unpacking libp11-kit0:armhf (0.25.5-3) ... Selecting previously unselected package libtasn1-6:armhf. Preparing to unpack .../39-libtasn1-6_4.20.0-1_armhf.deb ... Unpacking libtasn1-6:armhf (4.20.0-1) ... Selecting previously unselected package libgnutls30t64:armhf. Preparing to unpack .../40-libgnutls30t64_3.8.9-2_armhf.deb ... Unpacking libgnutls30t64:armhf (3.8.9-2) ... Selecting previously unselected package librtmp1:armhf. Preparing to unpack .../41-librtmp1_2.4+20151223.gitfa8646d.1-2+b5_armhf.deb ... Unpacking librtmp1:armhf (2.4+20151223.gitfa8646d.1-2+b5) ... Selecting previously unselected package libssh2-1t64:armhf. Preparing to unpack .../42-libssh2-1t64_1.11.1-1_armhf.deb ... Unpacking libssh2-1t64:armhf (1.11.1-1) ... Selecting previously unselected package libcurl4t64:armhf. Preparing to unpack .../43-libcurl4t64_8.12.0+git20250209.89ed161+ds-1_armhf.deb ... Unpacking libcurl4t64:armhf (8.12.0+git20250209.89ed161+ds-1) ... Selecting previously unselected package libexpat1:armhf. Preparing to unpack .../44-libexpat1_2.6.4-1_armhf.deb ... Unpacking libexpat1:armhf (2.6.4-1) ... Selecting previously unselected package libjsoncpp26:armhf. Preparing to unpack .../45-libjsoncpp26_1.9.6-3_armhf.deb ... Unpacking libjsoncpp26:armhf (1.9.6-3) ... Selecting previously unselected package librhash1:armhf. Preparing to unpack .../46-librhash1_1.4.5-1_armhf.deb ... Unpacking librhash1:armhf (1.4.5-1) ... Selecting previously unselected package libuv1t64:armhf. Preparing to unpack .../47-libuv1t64_1.50.0-2_armhf.deb ... Unpacking libuv1t64:armhf (1.50.0-2) ... Selecting previously unselected package cmake. Preparing to unpack .../48-cmake_3.31.5-2_armhf.deb ... Unpacking cmake (3.31.5-2) ... Selecting previously unselected package libdebhelper-perl. Preparing to unpack .../49-libdebhelper-perl_13.24.1_all.deb ... Unpacking libdebhelper-perl (13.24.1) ... Selecting previously unselected package libtool. Preparing to unpack .../50-libtool_2.5.4-3_all.deb ... Unpacking libtool (2.5.4-3) ... Selecting previously unselected package dh-autoreconf. Preparing to unpack .../51-dh-autoreconf_20_all.deb ... Unpacking dh-autoreconf (20) ... Selecting previously unselected package libarchive-zip-perl. Preparing to unpack .../52-libarchive-zip-perl_1.68-1_all.deb ... Unpacking libarchive-zip-perl (1.68-1) ... Selecting previously unselected package libfile-stripnondeterminism-perl. Preparing to unpack .../53-libfile-stripnondeterminism-perl_1.14.1-2_all.deb ... Unpacking libfile-stripnondeterminism-perl (1.14.1-2) ... Selecting previously unselected package dh-strip-nondeterminism. Preparing to unpack .../54-dh-strip-nondeterminism_1.14.1-2_all.deb ... Unpacking dh-strip-nondeterminism (1.14.1-2) ... Selecting previously unselected package libelf1t64:armhf. Preparing to unpack .../55-libelf1t64_0.192-4_armhf.deb ... Unpacking libelf1t64:armhf (0.192-4) ... Selecting previously unselected package dwz. Preparing to unpack .../56-dwz_0.15-1+b2_armhf.deb ... Unpacking dwz (0.15-1+b2) ... Selecting previously unselected package gettext. Preparing to unpack .../57-gettext_0.23.1-1_armhf.deb ... Unpacking gettext (0.23.1-1) ... Selecting previously unselected package intltool-debian. Preparing to unpack .../58-intltool-debian_0.35.0+20060710.6_all.deb ... Unpacking intltool-debian (0.35.0+20060710.6) ... Selecting previously unselected package po-debconf. Preparing to unpack .../59-po-debconf_1.0.21+nmu1_all.deb ... Unpacking po-debconf (1.0.21+nmu1) ... Selecting previously unselected package debhelper. Preparing to unpack .../60-debhelper_13.24.1_all.deb ... Unpacking debhelper (13.24.1) ... Selecting previously unselected package libgfortran5:armhf. Preparing to unpack .../61-libgfortran5_14.2.0-17_armhf.deb ... Unpacking libgfortran5:armhf (14.2.0-17) ... Selecting previously unselected package libgfortran-14-dev:armhf. Preparing to unpack .../62-libgfortran-14-dev_14.2.0-17_armhf.deb ... Unpacking libgfortran-14-dev:armhf (14.2.0-17) ... Selecting previously unselected package gfortran-14-arm-linux-gnueabihf. Preparing to unpack .../63-gfortran-14-arm-linux-gnueabihf_14.2.0-17_armhf.deb ... Unpacking gfortran-14-arm-linux-gnueabihf (14.2.0-17) ... Selecting previously unselected package gfortran-14. Preparing to unpack .../64-gfortran-14_14.2.0-17_armhf.deb ... Unpacking gfortran-14 (14.2.0-17) ... Selecting previously unselected package gfortran-arm-linux-gnueabihf. Preparing to unpack .../65-gfortran-arm-linux-gnueabihf_4%3a14.2.0-1_armhf.deb ... Unpacking gfortran-arm-linux-gnueabihf (4:14.2.0-1) ... Selecting previously unselected package gfortran. Preparing to unpack .../66-gfortran_4%3a14.2.0-1_armhf.deb ... Unpacking gfortran (4:14.2.0-1) ... Selecting previously unselected package icu-devtools. Preparing to unpack .../67-icu-devtools_72.1-6_armhf.deb ... Unpacking icu-devtools (72.1-6) ... Selecting previously unselected package libblas3:armhf. Preparing to unpack .../68-libblas3_3.12.1-2_armhf.deb ... Unpacking libblas3:armhf (3.12.1-2) ... Selecting previously unselected package libblas-dev:armhf. Preparing to unpack .../69-libblas-dev_3.12.1-2_armhf.deb ... Unpacking libblas-dev:armhf (3.12.1-2) ... Selecting previously unselected package libboost1.83-dev:armhf. Preparing to unpack .../70-libboost1.83-dev_1.83.0-4_armhf.deb ... Unpacking libboost1.83-dev:armhf (1.83.0-4) ... Selecting previously unselected package libboost-dev:armhf. Preparing to unpack .../71-libboost-dev_1.83.0.2+b2_armhf.deb ... Unpacking libboost-dev:armhf (1.83.0.2+b2) ... Selecting previously unselected package libboost-regex1.83.0:armhf. Preparing to unpack .../72-libboost-regex1.83.0_1.83.0-4_armhf.deb ... Unpacking libboost-regex1.83.0:armhf (1.83.0-4) ... Selecting previously unselected package libicu-dev:armhf. Preparing to unpack .../73-libicu-dev_72.1-6_armhf.deb ... Unpacking libicu-dev:armhf (72.1-6) ... Selecting previously unselected package libboost-regex1.83-dev:armhf. Preparing to unpack .../74-libboost-regex1.83-dev_1.83.0-4_armhf.deb ... Unpacking libboost-regex1.83-dev:armhf (1.83.0-4) ... Selecting previously unselected package libboost-iostreams1.83-dev:armhf. Preparing to unpack .../75-libboost-iostreams1.83-dev_1.83.0-4_armhf.deb ... Unpacking libboost-iostreams1.83-dev:armhf (1.83.0-4) ... Selecting previously unselected package libboost-iostreams-dev:armhf. Preparing to unpack .../76-libboost-iostreams-dev_1.83.0.2+b2_armhf.deb ... Unpacking libboost-iostreams-dev:armhf (1.83.0.2+b2) ... Selecting previously unselected package libboost-program-options1.83.0:armhf. Preparing to unpack .../77-libboost-program-options1.83.0_1.83.0-4_armhf.deb ... Unpacking libboost-program-options1.83.0:armhf (1.83.0-4) ... Selecting previously unselected package libboost-program-options1.83-dev:armhf. Preparing to unpack .../78-libboost-program-options1.83-dev_1.83.0-4_armhf.deb ... Unpacking libboost-program-options1.83-dev:armhf (1.83.0-4) ... Selecting previously unselected package libboost-program-options-dev:armhf. Preparing to unpack .../79-libboost-program-options-dev_1.83.0.2+b2_armhf.deb ... Unpacking libboost-program-options-dev:armhf (1.83.0.2+b2) ... Selecting previously unselected package libboost-serialization1.83.0:armhf. Preparing to unpack .../80-libboost-serialization1.83.0_1.83.0-4_armhf.deb ... Unpacking libboost-serialization1.83.0:armhf (1.83.0-4) ... Selecting previously unselected package libboost-serialization1.83-dev:armhf. Preparing to unpack .../81-libboost-serialization1.83-dev_1.83.0-4_armhf.deb ... Unpacking libboost-serialization1.83-dev:armhf (1.83.0-4) ... Selecting previously unselected package libboost-serialization-dev:armhf. Preparing to unpack .../82-libboost-serialization-dev_1.83.0.2+b2_armhf.deb ... Unpacking libboost-serialization-dev:armhf (1.83.0.2+b2) ... Selecting previously unselected package libfmt10:armhf. Preparing to unpack .../83-libfmt10_10.1.1+ds1-4_armhf.deb ... Unpacking libfmt10:armhf (10.1.1+ds1-4) ... Selecting previously unselected package libfmt-dev:armhf. Preparing to unpack .../84-libfmt-dev_10.1.1+ds1-4_armhf.deb ... Unpacking libfmt-dev:armhf (10.1.1+ds1-4) ... Selecting previously unselected package libgmpxx4ldbl:armhf. Preparing to unpack .../85-libgmpxx4ldbl_2%3a6.3.0+dfsg-3_armhf.deb ... Unpacking libgmpxx4ldbl:armhf (2:6.3.0+dfsg-3) ... Selecting previously unselected package libgmp-dev:armhf. Preparing to unpack .../86-libgmp-dev_2%3a6.3.0+dfsg-3_armhf.deb ... Unpacking libgmp-dev:armhf (2:6.3.0+dfsg-3) ... Selecting previously unselected package libhwloc15:armhf. Preparing to unpack .../87-libhwloc15_2.11.2-1_armhf.deb ... Unpacking libhwloc15:armhf (2.11.2-1) ... Selecting previously unselected package libsoplexshared7.1:armhf. Preparing to unpack .../88-libsoplexshared7.1_7.1.3+dfsg-1_armhf.deb ... Unpacking libsoplexshared7.1:armhf (7.1.3+dfsg-1) ... Selecting previously unselected package zlib1g-dev:armhf. Preparing to unpack .../89-zlib1g-dev_1%3a1.3.dfsg+really1.3.1-1+b1_armhf.deb ... Unpacking zlib1g-dev:armhf (1:1.3.dfsg+really1.3.1-1+b1) ... Selecting previously unselected package libsoplex-dev:armhf. Preparing to unpack .../90-libsoplex-dev_7.1.3+dfsg-1_armhf.deb ... Unpacking libsoplex-dev:armhf (7.1.3+dfsg-1) ... Selecting previously unselected package libtbbmalloc2:armhf. Preparing to unpack .../91-libtbbmalloc2_2022.0.0-1_armhf.deb ... Unpacking libtbbmalloc2:armhf (2022.0.0-1) ... Selecting previously unselected package libtbbbind-2-5:armhf. Preparing to unpack .../92-libtbbbind-2-5_2022.0.0-1_armhf.deb ... Unpacking libtbbbind-2-5:armhf (2022.0.0-1) ... Selecting previously unselected package libtbb12:armhf. Preparing to unpack .../93-libtbb12_2022.0.0-1_armhf.deb ... Unpacking libtbb12:armhf (2022.0.0-1) ... Selecting previously unselected package libtbb-dev:armhf. Preparing to unpack .../94-libtbb-dev_2022.0.0-1_armhf.deb ... Unpacking libtbb-dev:armhf (2022.0.0-1) ... Setting up libexpat1:armhf (2.6.4-1) ... Setting up libpipeline1:armhf (1.5.8-1) ... Setting up libtbbmalloc2:armhf (2022.0.0-1) ... Setting up libboost-program-options1.83.0:armhf (1.83.0-4) ... Setting up libkeyutils1:armhf (1.6.3-4) ... Setting up libboost1.83-dev:armhf (1.83.0-4) ... Setting up libicu72:armhf (72.1-6) ... Setting up bsdextrautils (2.40.4-3) ... Setting up libmagic-mgc (1:5.45-3+b1) ... Setting up libarchive-zip-perl (1.68-1) ... Setting up libboost-regex1.83.0:armhf (1.83.0-4) ... Setting up libdebhelper-perl (13.24.1) ... Setting up libbrotli1:armhf (1.1.0-2+b6) ... Setting up libuv1t64:armhf (1.50.0-2) ... Setting up libmagic1t64:armhf (1:5.45-3+b1) ... Setting up libboost-program-options1.83-dev:armhf (1.83.0-4) ... Setting up libnghttp2-14:armhf (1.64.0-1) ... Setting up gettext-base (0.23.1-1) ... Setting up m4 (1.4.19-5) ... Setting up libcom-err2:armhf (1.47.2-1) ... Setting up file (1:5.45-3+b1) ... Setting up libelf1t64:armhf (0.192-4) ... Setting up libkrb5support0:armhf (1.21.3-4) ... Setting up libsasl2-modules-db:armhf (2.1.28+dfsg1-8+b1) ... Setting up libboost-serialization1.83.0:armhf (1.83.0-4) ... Setting up autotools-dev (20220109.1) ... Setting up libblas3:armhf (3.12.1-2) ... update-alternatives: using /usr/lib/arm-linux-gnueabihf/blas/libblas.so.3 to provide /usr/lib/arm-linux-gnueabihf/libblas.so.3 (libblas.so.3-arm-linux-gnueabihf) in auto mode Setting up libgmpxx4ldbl:armhf (2:6.3.0+dfsg-3) ... Setting up libboost-program-options-dev:armhf (1.83.0.2+b2) ... Setting up libjsoncpp26:armhf (1.9.6-3) ... Setting up libproc2-0:armhf (2:4.0.4-7) ... Setting up libunistring5:armhf (1.3-1) ... Setting up libhwloc15:armhf (2.11.2-1) ... Setting up autopoint (0.23.1-1) ... Setting up icu-devtools (72.1-6) ... Setting up libk5crypto3:armhf (1.21.3-4) ... Setting up libsasl2-2:armhf (2.1.28+dfsg1-8+b1) ... Setting up libgfortran5:armhf (14.2.0-17) ... Setting up autoconf (2.72-3) ... Setting up zlib1g-dev:armhf (1:1.3.dfsg+really1.3.1-1+b1) ... Setting up libffi8:armhf (3.4.7-1) ... Setting up dwz (0.15-1+b2) ... Setting up sensible-utils (0.0.24) ... Setting up libuchardet0:armhf (0.0.8-1+b2) ... Setting up procps (2:4.0.4-7) ... Setting up libtasn1-6:armhf (4.20.0-1) ... Setting up cmake-data (3.31.5-2) ... Setting up librhash1:armhf (1.4.5-1) ... Setting up libkrb5-3:armhf (1.21.3-4) ... Setting up libboost-dev:armhf (1.83.0.2+b2) ... Setting up libssh2-1t64:armhf (1.11.1-1) ... Setting up libsoplexshared7.1:armhf (7.1.3+dfsg-1) ... Setting up libcatch2-dev (3.7.1-0.5) ... Setting up libicu-dev:armhf (72.1-6) ... Setting up libxml2:armhf (2.12.7+dfsg+really2.9.14-0.2+b1) ... Setting up libldap2:armhf (2.6.9+dfsg-1) ... Setting up libfmt10:armhf (10.1.1+ds1-4) ... Setting up libblas-dev:armhf (3.12.1-2) ... update-alternatives: using /usr/lib/arm-linux-gnueabihf/blas/libblas.so to provide /usr/lib/arm-linux-gnueabihf/libblas.so (libblas.so-arm-linux-gnueabihf) in auto mode Setting up automake (1:1.17-3) ... update-alternatives: using /usr/bin/automake-1.17 to provide /usr/bin/automake (automake) in auto mode Setting up libgfortran-14-dev:armhf (14.2.0-17) ... Setting up libfile-stripnondeterminism-perl (1.14.1-2) ... Setting up catch2 (3.7.1-0.5) ... Setting up gettext (0.23.1-1) ... Setting up libgmp-dev:armhf (2:6.3.0+dfsg-3) ... Setting up libtool (2.5.4-3) ... Setting up libboost-serialization1.83-dev:armhf (1.83.0-4) ... Setting up libidn2-0:armhf (2.3.7-2+b1) ... Setting up libtbbbind-2-5:armhf (2022.0.0-1) ... Setting up intltool-debian (0.35.0+20060710.6) ... Setting up dh-autoreconf (20) ... Setting up libp11-kit0:armhf (0.25.5-3) ... Setting up libgssapi-krb5-2:armhf (1.21.3-4) ... Setting up libfmt-dev:armhf (10.1.1+ds1-4) ... Setting up libboost-regex1.83-dev:armhf (1.83.0-4) ... Setting up libsoplex-dev:armhf (7.1.3+dfsg-1) ... Setting up libboost-serialization-dev:armhf (1.83.0.2+b2) ... Setting up dh-strip-nondeterminism (1.14.1-2) ... Setting up groff-base (1.23.0-7) ... Setting up libarchive13t64:armhf (3.7.4-1.1) ... Setting up gfortran-14-arm-linux-gnueabihf (14.2.0-17) ... Setting up libgnutls30t64:armhf (3.8.9-2) ... Setting up libboost-iostreams1.83-dev:armhf (1.83.0-4) ... Setting up po-debconf (1.0.21+nmu1) ... Setting up libpsl5t64:armhf (0.21.2-1.1+b1) ... Setting up libtbb12:armhf (2022.0.0-1) ... Setting up libboost-iostreams-dev:armhf (1.83.0.2+b2) ... Setting up man-db (2.13.0-1) ... Not building database; man-db/auto-update is not 'true'. Setting up gfortran-arm-linux-gnueabihf (4:14.2.0-1) ... Setting up librtmp1:armhf (2.4+20151223.gitfa8646d.1-2+b5) ... Setting up libtbb-dev:armhf (2022.0.0-1) ... Setting up gfortran-14 (14.2.0-17) ... Setting up libcurl4t64:armhf (8.12.0+git20250209.89ed161+ds-1) ... Setting up debhelper (13.24.1) ... Setting up gfortran (4:14.2.0-1) ... update-alternatives: using /usr/bin/gfortran to provide /usr/bin/f95 (f95) in auto mode update-alternatives: using /usr/bin/gfortran to provide /usr/bin/f77 (f77) in auto mode Setting up cmake (3.31.5-2) ... Processing triggers for libc-bin (2.40-6) ... Reading package lists... Building dependency tree... Reading state information... Reading extended state information... Initializing package states... Writing extended state information... Building tag database... -> Finished parsing the build-deps I: Building the package I: user script /srv/workspace/pbuilder/1828/tmp/hooks/A99_set_merged_usr starting Not re-configuring usrmerge for unstable I: user script /srv/workspace/pbuilder/1828/tmp/hooks/A99_set_merged_usr finished hostname: Name or service not known I: Running cd /build/reproducible-path/papilo-2.4.1+ds/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path" HOME="/nonexistent/second-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path" HOME="/nonexistent/second-build" dpkg-genchanges -S > ../papilo_2.4.1+ds-1_source.changes dpkg-buildpackage: info: source package papilo dpkg-buildpackage: info: source version 2.4.1+ds-1 dpkg-buildpackage: info: source distribution unstable dpkg-buildpackage: info: source changed by Timo Röhling dpkg-source --before-build . dpkg-buildpackage: info: host architecture armhf debian/rules clean dh clean --buildsystem=cmake dh_auto_clean -O--buildsystem=cmake dh_autoreconf_clean -O--buildsystem=cmake dh_clean -O--buildsystem=cmake debian/rules binary dh binary --buildsystem=cmake dh_update_autotools_config -O--buildsystem=cmake dh_autoreconf -O--buildsystem=cmake debian/rules override_dh_auto_configure make[1]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds' dh_auto_configure --buildsystem=cmake -- \ -DBUILD_TESTING=ON \ -DBUILD_SHARED_LIBS=ON \ -DPAPILO_CLUSOL_SOVERSION=0d \ -DPAPILO_CORE_SOVERSION=0d cd obj-arm-linux-gnueabihf && DEB_PYTHON_INSTALL_LAYOUT=deb PKG_CONFIG=/usr/bin/pkg-config cmake -DCMAKE_INSTALL_PREFIX=/usr -DCMAKE_BUILD_TYPE=None -DCMAKE_INSTALL_SYSCONFDIR=/etc -DCMAKE_INSTALL_LOCALSTATEDIR=/var -DCMAKE_EXPORT_NO_PACKAGE_REGISTRY=ON -DCMAKE_FIND_USE_PACKAGE_REGISTRY=OFF -DCMAKE_FIND_PACKAGE_NO_PACKAGE_REGISTRY=ON -DFETCHCONTENT_FULLY_DISCONNECTED=ON -DCMAKE_INSTALL_RUNSTATEDIR=/run -DCMAKE_SKIP_INSTALL_ALL_DEPENDENCY=ON "-GUnix Makefiles" -DCMAKE_VERBOSE_MAKEFILE=ON -DCMAKE_INSTALL_LIBDIR=lib/arm-linux-gnueabihf -DBUILD_TESTING=ON -DBUILD_SHARED_LIBS=ON -DPAPILO_CLUSOL_SOVERSION=0d -DPAPILO_CORE_SOVERSION=0d .. -- The C compiler identification is GNU 14.2.0 -- The CXX compiler identification is GNU 14.2.0 -- Detecting C compiler ABI info -- Detecting C compiler ABI info - done -- Check for working C compiler: /usr/bin/cc - skipped -- Detecting C compile features -- Detecting C compile features - done -- Detecting CXX compiler ABI info -- Detecting CXX compiler ABI info - done -- Check for working CXX compiler: /usr/bin/c++ - skipped -- Detecting CXX compile features -- Detecting CXX compile features - done -- Build type: None CMake Warning (dev) at CMakeLists.txt:80 (find_package): Policy CMP0167 is not set: The FindBoost module is removed. Run "cmake --help-policy CMP0167" for policy details. Use the cmake_policy command to set the policy and suppress this warning. This warning is for project developers. Use -Wno-dev to suppress it. -- Found Boost: /usr/lib/arm-linux-gnueabihf/cmake/Boost-1.83.0/BoostConfig.cmake (found suitable version "1.83.0", minimum required is "1.65") found components: iostreams program_options serialization -- Found GMP: /usr/include/arm-linux-gnueabihf -- Performing Test Quadmath_USE_DIRECTLY -- Performing Test Quadmath_USE_DIRECTLY - Failed -- Could NOT find Quadmath (missing: Quadmath_LIBRARY Quadmath_INCLUDE_DIR) -- Found TBB: /usr/lib/arm-linux-gnueabihf/cmake/TBB -- Performing Test CMAKE_HAVE_LIBC_PTHREAD -- Performing Test CMAKE_HAVE_LIBC_PTHREAD - Success -- Found Threads: TRUE -- Performing Test std_atomic_without_libatomic -- Performing Test std_atomic_without_libatomic - Success -- Looking for a Fortran compiler -- Looking for a Fortran compiler - /usr/bin/f95 -- Looking for sgemm_ -- Looking for sgemm_ - not found -- Looking for sgemm_ -- Looking for sgemm_ - found -- Found BLAS: /usr/lib/arm-linux-gnueabihf/libblas.so -- The Fortran compiler identification is GNU 14.2.0 -- Detecting Fortran compiler ABI info -- Detecting Fortran compiler ABI info - done -- Check for working Fortran compiler: /usr/bin/f95 - skipped -- Performing Test HAVE_FLAG_STD_CXX14 -- Performing Test HAVE_FLAG_STD_CXX14 - Success -- Performing Test PAPILO_BYTELL_HASHMAP_WORKS -- Performing Test PAPILO_BYTELL_HASHMAP_WORKS - Failed CMake Warning at binaries/CMakeLists.txt:7 (find_package): By not providing "FindSCIP.cmake" in CMAKE_MODULE_PATH this project has asked CMake to find a package configuration file provided by "SCIP", but CMake did not find one. Could not find a package configuration file provided by "SCIP" with any of the following names: SCIPConfig.cmake scip-config.cmake Add the installation prefix of "SCIP" to CMAKE_PREFIX_PATH or set "SCIP_DIR" to a directory containing one of the above files. If "SCIP" provides a separate development package or SDK, be sure it has been installed. -- Finding SCIP - not found -- Finding GUROBI - not found -- Finding GLOP - not found CMake Warning (dev) at /usr/lib/arm-linux-gnueabihf/cmake/soplex/soplex-config.cmake:12 (find_package): Policy CMP0167 is not set: The FindBoost module is removed. Run "cmake --help-policy CMP0167" for policy details. Use the cmake_policy command to set the policy and suppress this warning. Call Stack (most recent call first): binaries/CMakeLists.txt:43 (find_package) This warning is for project developers. Use -Wno-dev to suppress it. -- Found Boost: /usr/lib/arm-linux-gnueabihf/cmake/Boost-1.83.0/BoostConfig.cmake (found suitable version "1.83.0", minimum required is "1.65.0") -- Found SOPLEX: /usr/lib/arm-linux-gnueabihf/cmake/soplex/../../../include -- Finding HIGHS - not found -- Finding ROUNDINGSAT - not found CMake Warning (dev) at binaries/CMakeLists.txt:89 (find_package): Policy CMP0167 is not set: The FindBoost module is removed. Run "cmake --help-policy CMP0167" for policy details. Use the cmake_policy command to set the policy and suppress this warning. This warning is for project developers. Use -Wno-dev to suppress it. -- Found Boost: /usr/lib/arm-linux-gnueabihf/cmake/Boost-1.83.0/BoostConfig.cmake (found suitable version "1.83.0", minimum required is "1.65") found components: iostreams program_options serialization -- Performing Test PAPILO_USE_BOOST_IOSTREAMS_WITH_ZLIB -- Performing Test PAPILO_USE_BOOST_IOSTREAMS_WITH_ZLIB - Success -- Performing Test PAPILO_USE_BOOST_IOSTREAMS_WITH_BZIP2 -- Performing Test PAPILO_USE_BOOST_IOSTREAMS_WITH_BZIP2 - Success -- Linking solvers: SoPlex CMake Warning (dev) at test/CMakeLists.txt:1 (find_package): Policy CMP0167 is not set: The FindBoost module is removed. Run "cmake --help-policy CMP0167" for policy details. Use the cmake_policy command to set the policy and suppress this warning. This warning is for project developers. Use -Wno-dev to suppress it. -- Found Boost: /usr/lib/arm-linux-gnueabihf/cmake/Boost-1.83.0/BoostConfig.cmake (found version "1.83.0") found components: serialization program_options iostreams -- Configuring done (26.7s) -- Generating done (0.1s) CMake Warning: Manually-specified variables were not used by the project: CMAKE_EXPORT_NO_PACKAGE_REGISTRY CMAKE_FIND_PACKAGE_NO_PACKAGE_REGISTRY FETCHCONTENT_FULLY_DISCONNECTED -- Build files have been written to: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf make[1]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds' dh_auto_build -O--buildsystem=cmake cd obj-arm-linux-gnueabihf && make -j4 "INSTALL=install --strip-program=true" VERBOSE=1 make[1]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' /usr/bin/cmake -S/build/reproducible-path/papilo-2.4.1+ds -B/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf --check-build-system CMakeFiles/Makefile.cmake 0 /usr/bin/cmake -E cmake_progress_start /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf//CMakeFiles/progress.marks make -f CMakeFiles/Makefile2 all make[2]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' make -f CMakeFiles/papilo-clusol.dir/build.make CMakeFiles/papilo-clusol.dir/depend make[3]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/papilo-2.4.1+ds /build/reproducible-path/papilo-2.4.1+ds /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-clusol.dir/DependInfo.cmake "--color=" Dependee "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-clusol.dir/DependInfo.cmake" is newer than depender "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-clusol.dir/depend.internal". Dependee "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/CMakeDirectoryInformation.cmake" is newer than depender "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-clusol.dir/depend.internal". Scanning dependencies of target papilo-clusol make[3]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' make -f CMakeFiles/papilo-clusol.dir/build.make CMakeFiles/papilo-clusol.dir/build make[3]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' [ 1%] Building Fortran object CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol_precision.f90.o /usr/bin/f95 -Dpapilo_clusol_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/lusol -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -fPIC -ffp-contract=off -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/lusol/src/lusol_precision.f90 -o CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol_precision.f90.o [ 3%] Building Fortran object CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol6b.f.o /usr/bin/f95 -Dpapilo_clusol_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/lusol -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -fPIC -ffp-contract=off -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/lusol/src/lusol6b.f -o CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol6b.f.o [ 6%] Building Fortran object CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol8b.f.o [ 5%] Building Fortran object CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol7b.f.o /usr/bin/f95 -Dpapilo_clusol_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/lusol -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -fPIC -ffp-contract=off -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/lusol/src/lusol7b.f -o CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol7b.f.o /usr/bin/f95 -Dpapilo_clusol_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/lusol -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -fPIC -ffp-contract=off -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/lusol/src/lusol8b.f -o CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol8b.f.o [ 8%] Building Fortran object CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol_util.f.o /usr/bin/f95 -Dpapilo_clusol_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/lusol -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -fPIC -ffp-contract=off -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/lusol/src/lusol_util.f -o CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol_util.f.o [ 10%] Building C object CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/clusol.c.o /usr/bin/cc -Dpapilo_clusol_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/lusol -g -O2 -Werror=implicit-function-declaration -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -fPIC -ffp-contract=off -MD -MT CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/clusol.c.o -MF CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/clusol.c.o.d -o CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/clusol.c.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/lusol/src/clusol.c /usr/bin/cmake -E cmake_copy_f90_mod lusol_precision.mod CMakeFiles/papilo-clusol.dir/lusol_precision.mod.stamp GNU [ 11%] Building Fortran object CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol.f90.o /usr/bin/f95 -Dpapilo_clusol_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/lusol -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -fPIC -ffp-contract=off -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/lusol/src/lusol.f90 -o CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol.f90.o /usr/bin/cmake -E touch CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol_precision.f90.o.provides.build /usr/bin/cmake -E cmake_copy_f90_mod lusol.mod CMakeFiles/papilo-clusol.dir/lusol.mod.stamp GNU /usr/bin/cmake -E touch CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol.f90.o.provides.build [ 13%] Linking Fortran shared library libpapilo-clusol.so /usr/bin/cmake -E cmake_link_script CMakeFiles/papilo-clusol.dir/link.txt --verbose=1 /usr/bin/f95 -fPIC -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wl,--dependency-file=CMakeFiles/papilo-clusol.dir/link.d -Wl,-z,relro -Wl,-z,now -shared -Wl,-soname,libpapilo-clusol.so.0d -o libpapilo-clusol.so.0d "CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol6b.f.o" "CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol7b.f.o" "CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol8b.f.o" "CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol_util.f.o" "CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol.f90.o" "CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/clusol.c.o" "CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/lusol_precision.f90.o" /usr/lib/arm-linux-gnueabihf/libblas.so /usr/bin/cmake -E cmake_symlink_library libpapilo-clusol.so.0d libpapilo-clusol.so.0d libpapilo-clusol.so make[3]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' [ 13%] Built target papilo-clusol make -f CMakeFiles/papilo-core.dir/build.make CMakeFiles/papilo-core.dir/depend make -f test/CMakeFiles/unit_test.dir/build.make test/CMakeFiles/unit_test.dir/depend make[3]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/papilo-2.4.1+ds /build/reproducible-path/papilo-2.4.1+ds /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/DependInfo.cmake "--color=" make[3]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/papilo-2.4.1+ds /build/reproducible-path/papilo-2.4.1+ds/test /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/DependInfo.cmake "--color=" make[3]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' make[3]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' make -f CMakeFiles/papilo-core.dir/build.make CMakeFiles/papilo-core.dir/build make -f test/CMakeFiles/unit_test.dir/build.make test/CMakeFiles/unit_test.dir/build make[3]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' make[3]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' [ 15%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/core/VariableDomains.cpp.o [ 16%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/core/SparseStorage.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/core/VariableDomains.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/core/VariableDomains.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/core/VariableDomains.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/VariableDomains.cpp [ 18%] Building CXX object test/CMakeFiles/unit_test.dir/TestMain.cpp.o [ 20%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/core/MatrixBufferTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/core/MatrixBufferTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/core/MatrixBufferTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/core/MatrixBufferTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/core/MatrixBufferTest.cpp /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/core/SparseStorage.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/core/SparseStorage.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/core/SparseStorage.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.cpp cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/TestMain.cpp.o -MF CMakeFiles/unit_test.dir/TestMain.cpp.o.d -o CMakeFiles/unit_test.dir/TestMain.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/TestMain.cpp [ 21%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/core/SparseStorageTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/core/SparseStorageTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/core/SparseStorageTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/core/SparseStorageTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/core/SparseStorageTest.cpp [ 23%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/core/PresolveTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/core/PresolveTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/core/PresolveTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/core/PresolveTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/core/PresolveTest.cpp In file included from /usr/include/c++/14/vector:72, from /usr/include/boost/math/special_functions/math_fwd.hpp:26, from /usr/include/boost/math/special_functions/fpclassify.hpp:18, from /usr/include/boost/multiprecision/detail/fpclassify.hpp:16, from /usr/include/boost/multiprecision/detail/default_ops.hpp:15, from /usr/include/boost/multiprecision/detail/generic_interconvert.hpp:12, from /usr/include/boost/multiprecision/number.hpp:12, from /usr/include/boost/multiprecision/gmp.hpp:11, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/misc/MultiPrecision.hpp:42, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.cpp:23: /usr/include/c++/14/bits/vector.tcc: In function 'void std::vector<_Tp, _Alloc>::_M_range_insert(iterator, _ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = double*; _Tp = double; _Alloc = std::allocator]': /usr/include/c++/14/bits/vector.tcc:954:7: note: parameter passing for argument of type 'std::vector >::iterator' changed in GCC 7.1 954 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14/vector:66: In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = double*; = void; _Tp = double; _Alloc = std::allocator]', inlined from 'bool papilo::SparseStorage::shiftRows(const int*, int, int, papilo::Vec&) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:818:30: /usr/include/c++/14/bits/stl_vector.h:1488:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1488 | _M_range_insert(begin() + __offset, __first, __last, | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1489 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = double*; = void; _Tp = double; _Alloc = std::allocator]', inlined from 'bool papilo::SparseStorage::shiftRows(const int*, int, int, papilo::Vec&) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:866:30: /usr/include/c++/14/bits/stl_vector.h:1488:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1488 | _M_range_insert(begin() + __offset, __first, __last, | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1489 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14/bits/stl_algo.h:61, from /usr/include/c++/14/algorithm:61, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/test/papilo/core/SparseStorageTest.cpp:23: /usr/include/c++/14/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = tuple; _Compare = __gnu_cxx::__ops::_Iter_comp_iter > >]': /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 412 | inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, bool leftmost = true) { | ^~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 499 | pdqsort_loop(begin, pivot_pos, comp, bad_allowed, leftmost); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In function 'void pdqsort(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort(Iter, Iter) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:525:12, inlined from 'papilo::SparseStorage::SparseStorage(papilo::Vec >, int, int, bool, double, int) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:431:14: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:514:84: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 512 | pdqsort_detail::pdqsort_loop::type>::value && | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 514 | std::is_arithmetic::value_type>::value>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 515 | begin, end, comp, pdqsort_detail::log2(end - begin)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ [ 25%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/core/ProblemUpdateTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/core/ProblemUpdateTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/core/ProblemUpdateTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/core/ProblemUpdateTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/core/ProblemUpdateTest.cpp [ 26%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/core/ConstraintMatrix.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/core/ConstraintMatrix.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/core/ConstraintMatrix.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/core/ConstraintMatrix.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ConstraintMatrix.cpp [ 28%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/misc/VectorUtilsTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/misc/VectorUtilsTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/misc/VectorUtilsTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/misc/VectorUtilsTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/misc/VectorUtilsTest.cpp In file included from /usr/include/c++/14/vector:72, from /usr/include/boost/math/special_functions/math_fwd.hpp:26, from /usr/include/boost/math/special_functions/fpclassify.hpp:18, from /usr/include/boost/multiprecision/detail/fpclassify.hpp:16, from /usr/include/boost/multiprecision/detail/default_ops.hpp:15, from /usr/include/boost/multiprecision/detail/generic_interconvert.hpp:12, from /usr/include/boost/multiprecision/number.hpp:12, from /usr/include/boost/multiprecision/gmp.hpp:11, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/misc/MultiPrecision.hpp:42, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/MatrixBuffer.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ConstraintMatrix.hpp:29, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ConstraintMatrix.cpp:23: /usr/include/c++/14/bits/vector.tcc: In function 'void std::vector<_Tp, _Alloc>::_M_range_insert(iterator, _ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = double*; _Tp = double; _Alloc = std::allocator]': /usr/include/c++/14/bits/vector.tcc:954:7: note: parameter passing for argument of type 'std::vector >::iterator' changed in GCC 7.1 954 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14/bits/stl_algo.h:61, from /usr/include/c++/14/algorithm:61, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/MatrixBuffer.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ConstraintMatrix.hpp:29, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/Problem.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/misc/VectorUtils.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/test/papilo/misc/VectorUtilsTest.cpp:23: /usr/include/c++/14/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = tuple; _Compare = __gnu_cxx::__ops::_Iter_comp_iter > >]': /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 412 | inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, bool leftmost = true) { | ^~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 499 | pdqsort_loop(begin, pivot_pos, comp, bad_allowed, leftmost); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In function 'void pdqsort(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort(Iter, Iter) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:525:12, inlined from 'papilo::SparseStorage::SparseStorage(papilo::Vec >, int, int, bool, double, int) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:431:14: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:514:84: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 512 | pdqsort_detail::pdqsort_loop::type>::value && | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 514 | std::is_arithmetic::value_type>::value>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 515 | begin, end, comp, pdqsort_detail::log2(end - begin)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14/bits/stl_algo.h:61, from /usr/include/c++/14/algorithm:61, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/MatrixBuffer.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ConstraintMatrix.hpp:29, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/PresolveMethod.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/Presolve.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/test/papilo/core/PresolveTest.cpp:23: /usr/include/c++/14/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Distance = int; _Tp = double; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]': /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/14/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = tuple; _Compare = __gnu_cxx::__ops::_Iter_comp_iter > >]': /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'std::pair pdqsort_detail::partition_right_branchless(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator >; Compare = std::less]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:202:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 202 | inline std::pair partition_right_branchless(Iter begin, Iter end, Compare comp) { | ^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:202:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 In file included from /usr/include/c++/14/vector:66: In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = double*; = void; _Tp = double; _Alloc = std::allocator]', inlined from 'int papilo::SparseStorage::changeRow(int, Iter, Iter, GetCol&&, GetVal&&, MergeVals&&, CoeffChanged&&, papilo::Vec&, papilo::Vec&) [with Iter = int; GetCol = papilo::ConstraintMatrix::sparsify(const papilo::Num&, int, const double&, int, papilo::Vec&, papilo::Vec&, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; GetVal = papilo::ConstraintMatrix::sparsify(const papilo::Num&, int, const double&, int, papilo::Vec&, papilo::Vec&, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; MergeVals = papilo::ConstraintMatrix::sparsify(const papilo::Num&, int, const double&, int, papilo::Vec&, papilo::Vec&, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; CoeffChanged = papilo::ConstraintMatrix::sparsify(const papilo::Num&, int, const double&, int, papilo::Vec&, papilo::Vec&, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::&; REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:314:26: /usr/include/c++/14/bits/stl_vector.h:1488:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1488 | _M_range_insert(begin() + __offset, __first, __last, | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1489 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator >; Compare = std::less; bool Branchless = true]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 412 | inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, bool leftmost = true) { | ^~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:448:56: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 448 | Branchless ? partition_right_branchless(begin, end, comp) | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 499 | pdqsort_loop(begin, pivot_pos, comp, bad_allowed, leftmost); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = double*; = void; _Tp = double; _Alloc = std::allocator]', inlined from 'int papilo::SparseStorage::changeRow(int, Iter, Iter, GetCol&&, GetVal&&, MergeVals&&, CoeffChanged&&, papilo::Vec&, papilo::Vec&) [with Iter = int; GetCol = papilo::ConstraintMatrix::sparsify(const papilo::Num&, int, const double&, int, papilo::Vec&, papilo::Vec&, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; GetVal = papilo::ConstraintMatrix::sparsify(const papilo::Num&, int, const double&, int, papilo::Vec&, papilo::Vec&, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; MergeVals = papilo::ConstraintMatrix::sparsify(const papilo::Num&, int, const double&, int, papilo::Vec&, papilo::Vec&, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; CoeffChanged = papilo::ConstraintMatrix::sparsify(const papilo::Num&, int, const double&, int, papilo::Vec&, papilo::Vec&, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:314:26: /usr/include/c++/14/bits/stl_vector.h:1488:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1488 | _M_range_insert(begin() + __offset, __first, __last, | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1489 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14/vector:72, from /usr/include/boost/math/special_functions/math_fwd.hpp:26, from /usr/include/boost/math/special_functions/fpclassify.hpp:18, from /usr/include/boost/multiprecision/detail/fpclassify.hpp:16, from /usr/include/boost/multiprecision/detail/default_ops.hpp:15, from /usr/include/boost/multiprecision/detail/generic_interconvert.hpp:12, from /usr/include/boost/multiprecision/number.hpp:12, from /usr/include/boost/multiprecision/gmp.hpp:11, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/misc/MultiPrecision.hpp:42, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:27: /usr/include/c++/14/bits/vector.tcc: In function 'void std::vector<_Tp, _Alloc>::_M_range_insert(iterator, _ForwardIterator, _ForwardIterator, std::forward_iterator_tag) [with _ForwardIterator = double*; _Tp = double; _Alloc = std::allocator]': /usr/include/c++/14/bits/vector.tcc:954:7: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 954 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = double*; = void; _Tp = double; _Alloc = std::allocator]', inlined from 'int papilo::SparseStorage::changeRow(int, Iter, Iter, GetCol&&, GetVal&&, MergeVals&&, CoeffChanged&&, papilo::Vec&, papilo::Vec&) [with Iter = int; GetCol = papilo::ConstraintMatrix::aggregate(const papilo::Num&, int, papilo::SparseVectorView, double, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::::; GetVal = papilo::ConstraintMatrix::aggregate(const papilo::Num&, int, papilo::SparseVectorView, double, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::::; MergeVals = papilo::ConstraintMatrix::aggregate(const papilo::Num&, int, papilo::SparseVectorView, double, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::::; CoeffChanged = papilo::ConstraintMatrix::aggregate(const papilo::Num&, int, papilo::SparseVectorView, double, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::::; REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:314:26: /usr/include/c++/14/bits/stl_vector.h:1488:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1488 | _M_range_insert(begin() + __offset, __first, __last, | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1489 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = double*; = void; _Tp = double; _Alloc = std::allocator]', inlined from 'int papilo::SparseStorage::changeRow(int, Iter, Iter, GetCol&&, GetVal&&, MergeVals&&, CoeffChanged&&, papilo::Vec&, papilo::Vec&) [with Iter = int; GetCol = papilo::ConstraintMatrix::aggregate(const papilo::Num&, int, papilo::SparseVectorView, double, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; GetVal = papilo::ConstraintMatrix::aggregate(const papilo::Num&, int, papilo::SparseVectorView, double, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; MergeVals = papilo::ConstraintMatrix::aggregate(const papilo::Num&, int, papilo::SparseVectorView, double, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::&; CoeffChanged = papilo::ConstraintMatrix::aggregate(const papilo::Num&, int, papilo::SparseVectorView, double, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::&; REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:314:26: /usr/include/c++/14/bits/stl_vector.h:1488:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1488 | _M_range_insert(begin() + __offset, __first, __last, | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1489 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ [ 30%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/presolve/CoefficientStrengtheningTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/presolve/CoefficientStrengtheningTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/presolve/CoefficientStrengtheningTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/presolve/CoefficientStrengtheningTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/CoefficientStrengtheningTest.cpp /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 412 | inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, bool leftmost = true) { | ^~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 499 | pdqsort_loop(begin, pivot_pos, comp, bad_allowed, leftmost); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 [ 31%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/presolve/ConstraintPropagationTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/presolve/ConstraintPropagationTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/presolve/ConstraintPropagationTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/presolve/ConstraintPropagationTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/ConstraintPropagationTest.cpp In file included from /usr/include/c++/14/vector:66: In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = double*; = void; _Tp = double; _Alloc = std::allocator]', inlined from 'bool papilo::SparseStorage::shiftRows(const int*, int, int, papilo::Vec&) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:818:30: /usr/include/c++/14/bits/stl_vector.h:1488:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1488 | _M_range_insert(begin() + __offset, __first, __last, | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1489 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = double*; = void; _Tp = double; _Alloc = std::allocator]', inlined from 'bool papilo::SparseStorage::shiftRows(const int*, int, int, papilo::Vec&) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:866:30: /usr/include/c++/14/bits/stl_vector.h:1488:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1488 | _M_range_insert(begin() + __offset, __first, __last, | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1489 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = double*; = void; _Tp = double; _Alloc = std::allocator]', inlined from 'int papilo::SparseStorage::changeRow(int, Iter, Iter, GetCol&&, GetVal&&, MergeVals&&, CoeffChanged&&, papilo::Vec&, papilo::Vec&) [with Iter = int; GetCol = papilo::ConstraintMatrix::aggregate(const papilo::Num&, int, papilo::SparseVectorView, double, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::::; GetVal = papilo::ConstraintMatrix::aggregate(const papilo::Num&, int, papilo::SparseVectorView, double, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::::; MergeVals = papilo::ConstraintMatrix::aggregate(const papilo::Num&, int, papilo::SparseVectorView, double, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::::; CoeffChanged = papilo::ConstraintMatrix::aggregate(const papilo::Num&, int, papilo::SparseVectorView, double, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::::; REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:314:26: /usr/include/c++/14/bits/stl_vector.h:1488:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1488 | _M_range_insert(begin() + __offset, __first, __last, | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1489 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = double*; = void; _Tp = double; _Alloc = std::allocator]', inlined from 'int papilo::SparseStorage::changeRow(int, Iter, Iter, GetCol&&, GetVal&&, MergeVals&&, CoeffChanged&&, papilo::Vec&, papilo::Vec&) [with Iter = int; GetCol = papilo::ConstraintMatrix::sparsify(const papilo::Num&, int, const double&, int, papilo::Vec&, papilo::Vec&, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; GetVal = papilo::ConstraintMatrix::sparsify(const papilo::Num&, int, const double&, int, papilo::Vec&, papilo::Vec&, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; MergeVals = papilo::ConstraintMatrix::sparsify(const papilo::Num&, int, const double&, int, papilo::Vec&, papilo::Vec&, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; CoeffChanged = papilo::ConstraintMatrix::sparsify(const papilo::Num&, int, const double&, int, papilo::Vec&, papilo::Vec&, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:314:26: /usr/include/c++/14/bits/stl_vector.h:1488:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1488 | _M_range_insert(begin() + __offset, __first, __last, | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1489 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ [ 33%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/core/ProblemUpdate.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/core/ProblemUpdate.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/core/ProblemUpdate.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/core/ProblemUpdate.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ProblemUpdate.cpp In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = double*; = void; _Tp = double; _Alloc = std::allocator]', inlined from 'int papilo::SparseStorage::changeRow(int, Iter, Iter, GetCol&&, GetVal&&, MergeVals&&, CoeffChanged&&, papilo::Vec&, papilo::Vec&) [with Iter = int; GetCol = papilo::ConstraintMatrix::sparsify(const papilo::Num&, int, const double&, int, papilo::Vec&, papilo::Vec&, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; GetVal = papilo::ConstraintMatrix::sparsify(const papilo::Num&, int, const double&, int, papilo::Vec&, papilo::Vec&, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; MergeVals = papilo::ConstraintMatrix::sparsify(const papilo::Num&, int, const double&, int, papilo::Vec&, papilo::Vec&, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; CoeffChanged = papilo::ConstraintMatrix::sparsify(const papilo::Num&, int, const double&, int, papilo::Vec&, papilo::Vec&, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::&; REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:314:26: /usr/include/c++/14/bits/stl_vector.h:1488:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1488 | _M_range_insert(begin() + __offset, __first, __last, | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1489 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, _InputIterator, _InputIterator) [with _InputIterator = double*; = void; _Tp = double; _Alloc = std::allocator]', inlined from 'int papilo::SparseStorage::changeRow(int, Iter, Iter, GetCol&&, GetVal&&, MergeVals&&, CoeffChanged&&, papilo::Vec&, papilo::Vec&) [with Iter = int; GetCol = papilo::ConstraintMatrix::aggregate(const papilo::Num&, int, papilo::SparseVectorView, double, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; GetVal = papilo::ConstraintMatrix::aggregate(const papilo::Num&, int, papilo::SparseVectorView, double, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::; MergeVals = papilo::ConstraintMatrix::aggregate(const papilo::Num&, int, papilo::SparseVectorView, double, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::&; CoeffChanged = papilo::ConstraintMatrix::aggregate(const papilo::Num&, int, papilo::SparseVectorView, double, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int)::&; REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:314:26: /usr/include/c++/14/bits/stl_vector.h:1488:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1488 | _M_range_insert(begin() + __offset, __first, __last, | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1489 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void pdqsort(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort(Iter, Iter) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:525:12, inlined from 'void papilo::ConstraintMatrix::aggregate(const papilo::Num&, int, papilo::SparseVectorView, REAL, const papilo::VariableDomains&, papilo::Vec&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec >&, papilo::Vec&, papilo::Vec&, papilo::Vec&, int) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ConstraintMatrix.hpp:1442:14: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:514:84: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 512 | pdqsort_detail::pdqsort_loop::type>::value && | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 514 | std::is_arithmetic::value_type>::value>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 515 | begin, end, comp, pdqsort_detail::log2(end - begin)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:514:84: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /usr/include/c++/14/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]': /usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector::iterator' changed in GCC 7.1 700 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ [ 35%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/presolve/DualFixTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/presolve/DualFixTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/presolve/DualFixTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/presolve/DualFixTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/DualFixTest.cpp In file included from /usr/include/c++/14/bits/stl_algo.h:61, from /usr/include/c++/14/algorithm:61, from /usr/include/boost/random/additive_combine.hpp:21, from /usr/include/boost/random.hpp:36, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ProblemUpdate.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ProblemUpdate.cpp:23: /usr/include/c++/14/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = tuple; _Compare = __gnu_cxx::__ops::_Iter_comp_iter > >]': /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'Iter pdqsort_detail::partition_left(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::Probing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const papilo::ProbingSubstitution&)>]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:385:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 385 | inline Iter partition_left(Iter begin, Iter end, Compare comp) { | ^~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:385:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'std::pair pdqsort_detail::partition_right(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::Probing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const papilo::ProbingSubstitution&)>]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:341:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 341 | inline std::pair partition_right(Iter begin, Iter end, Compare comp) { | ^~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:341:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 [ 36%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/presolve/DominatedColsTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/presolve/DominatedColsTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/presolve/DominatedColsTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/presolve/DominatedColsTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/DominatedColsTest.cpp /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'Iter pdqsort_detail::partition_left(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::SingletonStuffing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const std::pair&)>]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:385:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 385 | inline Iter partition_left(Iter begin, Iter end, Compare comp) { | ^~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:385:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'std::pair pdqsort_detail::partition_right(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::SingletonStuffing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const std::pair&)>]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:341:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 341 | inline std::pair partition_right(Iter begin, Iter end, Compare comp) { | ^~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:341:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In function 'void pdqsort(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator >; Compare = std::less]', inlined from 'void pdqsort(Iter, Iter) [with Iter = __gnu_cxx::__normal_iterator >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:525:12, inlined from 'papilo::Sparsify::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&)>' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/Sparsify.hpp:367:27: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:514:84: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 512 | pdqsort_detail::pdqsort_loop::type>::value && | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 514 | std::is_arithmetic::value_type>::value>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 515 | begin, end, comp, pdqsort_detail::log2(end - begin)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/catch2/catch_approx.hpp:11, from /usr/include/catch2/catch_all.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/test/papilo/core/PresolveTest.cpp:43: /usr/include/catch2/catch_tostring.hpp: In function 'std::string Catch::Detail::rangeToString(InputIterator, Sentinel) [with InputIterator = __gnu_cxx::__normal_iterator >; Sentinel = __gnu_cxx::__normal_iterator >]': /usr/include/catch2/catch_tostring.hpp:343:21: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 343 | std::string rangeToString(InputIterator first, Sentinel last) { | ^~~~~~~~~~~~~ /usr/include/catch2/catch_tostring.hpp:343:21: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 In function 'std::string Catch::rangeToString(const Range&) [with Range = std::vector]', inlined from 'static std::string Catch::StringMaker::value && (! Catch::Detail::IsStreamInsertable::value)), void>::type>::convert(const R&) [with R = std::vector]' at /usr/include/catch2/catch_tostring.hpp:528:41, inlined from 'std::string Catch::Detail::stringify(const T&) [with T = std::vector]' at /usr/include/catch2/catch_tostring.hpp:150:97, inlined from 'void Catch::BinaryExpr::streamReconstructedExpression(std::ostream&) const [with LhsT = std::vector&; RhsT = const std::vector&]' at /usr/include/catch2/internal/catch_decomposer.hpp:193:51: /usr/include/catch2/catch_tostring.hpp:505:77: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 505 | return ::Catch::Detail::rangeToString( begin( range ), end( range ) ); | ^ In function 'std::string Catch::rangeToString(const Range&) [with Range = std::vector]', inlined from 'static std::string Catch::StringMaker::value && (! Catch::Detail::IsStreamInsertable::value)), void>::type>::convert(const R&) [with R = std::vector]' at /usr/include/catch2/catch_tostring.hpp:528:41, inlined from 'std::string Catch::Detail::stringify(const T&) [with T = std::vector]' at /usr/include/catch2/catch_tostring.hpp:150:97, inlined from 'void Catch::BinaryExpr::streamReconstructedExpression(std::ostream&) const [with LhsT = std::vector&; RhsT = const std::vector&]' at /usr/include/catch2/internal/catch_decomposer.hpp:193:92: /usr/include/catch2/catch_tostring.hpp:505:77: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 505 | return ::Catch::Detail::rangeToString( begin( range ), end( range ) ); | ^ In function 'std::string Catch::rangeToString(const Range&) [with Range = std::vector]', inlined from 'static std::string Catch::StringMaker::value && (! Catch::Detail::IsStreamInsertable::value)), void>::type>::convert(const R&) [with R = std::vector]' at /usr/include/catch2/catch_tostring.hpp:528:41, inlined from 'std::string Catch::Detail::stringify(const T&) [with T = std::vector]' at /usr/include/catch2/catch_tostring.hpp:150:97, inlined from 'void Catch::BinaryExpr::streamReconstructedExpression(std::ostream&) const [with LhsT = std::vector&; RhsT = std::vector&]' at /usr/include/catch2/internal/catch_decomposer.hpp:193:51: /usr/include/catch2/catch_tostring.hpp:505:77: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 505 | return ::Catch::Detail::rangeToString( begin( range ), end( range ) ); | ^ In function 'std::string Catch::rangeToString(const Range&) [with Range = std::vector]', inlined from 'static std::string Catch::StringMaker::value && (! Catch::Detail::IsStreamInsertable::value)), void>::type>::convert(const R&) [with R = std::vector]' at /usr/include/catch2/catch_tostring.hpp:528:41, inlined from 'std::string Catch::Detail::stringify(const T&) [with T = std::vector]' at /usr/include/catch2/catch_tostring.hpp:150:97, inlined from 'void Catch::BinaryExpr::streamReconstructedExpression(std::ostream&) const [with LhsT = std::vector&; RhsT = std::vector&]' at /usr/include/catch2/internal/catch_decomposer.hpp:193:92: /usr/include/catch2/catch_tostring.hpp:505:77: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 505 | return ::Catch::Detail::rangeToString( begin( range ), end( range ) ); | ^ /usr/include/c++/14/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = papilo::ProbingSubstitution; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const papilo::ProbingSubstitution&)> >]': /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::Probing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const papilo::ProbingSubstitution&)>; bool Branchless = false]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 412 | inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, bool leftmost = true) { | ^~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:449:45: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 449 | : partition_right(begin, end, comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:442:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 442 | begin = partition_left(begin, end, comp) + 1; | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 499 | pdqsort_loop(begin, pivot_pos, comp, bad_allowed, leftmost); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In function 'void pdqsort(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::Probing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const papilo::ProbingSubstitution&)>]', inlined from 'papilo::PresolveStatus papilo::Probing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/Probing.hpp:589:14: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:514:84: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 512 | pdqsort_detail::pdqsort_loop::type>::value && | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 514 | std::is_arithmetic::value_type>::value>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 515 | begin, end, comp, pdqsort_detail::log2(end - begin)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'papilo::PresolveStatus papilo::DualInfer::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/DualInfer.hpp:175:17: /usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1037 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'papilo::PresolveStatus papilo::DualInfer::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/DualInfer.hpp:176:17: /usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 1037 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const pair&)> >]': /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::SingletonStuffing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const std::pair&)>; bool Branchless = false]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 412 | inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, bool leftmost = true) { | ^~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:442:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 442 | begin = partition_left(begin, end, comp) + 1; | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:449:45: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 449 | : partition_right(begin, end, comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 499 | pdqsort_loop(begin, pivot_pos, comp, bad_allowed, leftmost); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In function 'void pdqsort(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::SingletonStuffing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const std::pair&)>]', inlined from 'papilo::PresolveStatus papilo::SingletonStuffing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/SingletonStuffing.hpp:629:14: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:514:84: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 512 | pdqsort_detail::pdqsort_loop::type>::value && | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 514 | std::is_arithmetic::value_type>::value>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 515 | begin, end, comp, pdqsort_detail::log2(end - begin)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14/string:51, from /usr/include/c++/14/bits/locale_classes.h:40, from /usr/include/c++/14/bits/ios_base.h:41, from /usr/include/c++/14/ios:44, from /usr/include/c++/14/istream:40, from /usr/include/boost/random/additive_combine.hpp:19: /usr/include/c++/14/bits/stl_algobase.h: In function 'void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _ForwardIterator2 = __gnu_cxx::__normal_iterator*, vector, allocator > > >]': /usr/include/c++/14/bits/stl_algobase.h:155:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 155 | iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) | ^~~~~~~~~ /usr/include/c++/14/bits/stl_algobase.h:155:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In file included from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/MatrixBuffer.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ProblemUpdate.hpp:28: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 412 | inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, bool leftmost = true) { | ^~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:429:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:429:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:429:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:430:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:430:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:430:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:431:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:431:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:431:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:432:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:432:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:432:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:434:25: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:434:25: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:434:25: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:468:35: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 468 | std::iter_swap(begin, begin + l_size / 4); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:469:35: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 469 | std::iter_swap(pivot_pos - 1, pivot_pos - l_size / 4); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:472:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 472 | std::iter_swap(begin + 1, begin + (l_size / 4 + 1)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:473:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 473 | std::iter_swap(begin + 2, begin + (l_size / 4 + 2)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:474:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 474 | std::iter_swap(pivot_pos - 2, pivot_pos - (l_size / 4 + 1)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:475:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 475 | std::iter_swap(pivot_pos - 3, pivot_pos - (l_size / 4 + 2)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:480:35: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 480 | std::iter_swap(pivot_pos + 1, pivot_pos + (1 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:481:35: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 481 | std::iter_swap(end - 1, end - r_size / 4); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:484:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 484 | std::iter_swap(pivot_pos + 2, pivot_pos + (2 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:485:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 485 | std::iter_swap(pivot_pos + 3, pivot_pos + (3 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:486:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 486 | std::iter_swap(end - 2, end - (1 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:487:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 487 | std::iter_swap(end - 3, end - (2 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 499 | pdqsort_loop(begin, pivot_pos, comp, bad_allowed, leftmost); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In function 'void pdqsort(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort(Iter, Iter) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:525:12, inlined from 'std::pair papilo::Problem::removeRedundantBounds(const papilo::Num&, papilo::Vec >&, papilo::Vec >&) const [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/Problem.hpp:653:14: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:514:84: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 512 | pdqsort_detail::pdqsort_loop::type>::value && | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 514 | std::is_arithmetic::value_type>::value>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 515 | begin, end, comp, pdqsort_detail::log2(end - begin)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ [ 38%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/presolve/FixContinuousTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/presolve/FixContinuousTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/presolve/FixContinuousTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/presolve/FixContinuousTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/FixContinuousTest.cpp [ 40%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/presolve/FreeVarSubstitutionTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/presolve/FreeVarSubstitutionTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/presolve/FreeVarSubstitutionTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/presolve/FreeVarSubstitutionTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/FreeVarSubstitutionTest.cpp [ 41%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/presolve/ImplIntDetectionTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/presolve/ImplIntDetectionTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/presolve/ImplIntDetectionTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/presolve/ImplIntDetectionTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/ImplIntDetectionTest.cpp [ 43%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/presolve/ParallelRowDetectionTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/presolve/ParallelRowDetectionTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/presolve/ParallelRowDetectionTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/presolve/ParallelRowDetectionTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/ParallelRowDetectionTest.cpp [ 45%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/core/Presolve.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/core/Presolve.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/core/Presolve.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/core/Presolve.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/Presolve.cpp [ 46%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/presolve/ParallelColDetectionTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/presolve/ParallelColDetectionTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/presolve/ParallelColDetectionTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/presolve/ParallelColDetectionTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/ParallelColDetectionTest.cpp [ 48%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/presolve/ProbingTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/presolve/ProbingTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/presolve/ProbingTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/presolve/ProbingTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/ProbingTest.cpp In file included from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/MatrixBuffer.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ConstraintMatrix.hpp:29, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/PresolveMethod.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/Probing.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/ProbingTest.cpp:23: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'Iter pdqsort_detail::partition_left(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::Probing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const papilo::ProbingSubstitution&)>]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:385:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 385 | inline Iter partition_left(Iter begin, Iter end, Compare comp) { | ^~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:385:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'std::pair pdqsort_detail::partition_right(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::Probing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const papilo::ProbingSubstitution&)>]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:341:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 341 | inline std::pair partition_right(Iter begin, Iter end, Compare comp) { | ^~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:341:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In file included from /usr/include/c++/14/bits/stl_algo.h:61, from /usr/include/c++/14/algorithm:61, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/MatrixBuffer.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ConstraintMatrix.hpp:29, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/PresolveMethod.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/Presolve.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/Presolve.cpp:23: /usr/include/c++/14/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = tuple; _Compare = __gnu_cxx::__ops::_Iter_comp_iter > >]': /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ In file included from /usr/include/c++/14/bits/stl_algo.h:61, from /usr/include/c++/14/algorithm:61, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:26: /usr/include/c++/14/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = papilo::ProbingSubstitution; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const papilo::ProbingSubstitution&)> >]': /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::Probing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const papilo::ProbingSubstitution&)>; bool Branchless = false]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 412 | inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, bool leftmost = true) { | ^~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:449:45: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 449 | : partition_right(begin, end, comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:442:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 442 | begin = partition_left(begin, end, comp) + 1; | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 499 | pdqsort_loop(begin, pivot_pos, comp, bad_allowed, leftmost); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In function 'void pdqsort(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::Probing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const papilo::ProbingSubstitution&)>]', inlined from 'papilo::PresolveStatus papilo::Probing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/Probing.hpp:589:14: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:514:84: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 512 | pdqsort_detail::pdqsort_loop::type>::value && | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 514 | std::is_arithmetic::value_type>::value>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 515 | begin, end, comp, pdqsort_detail::log2(end - begin)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ [ 50%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/presolve/SingletonColsTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/presolve/SingletonColsTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/presolve/SingletonColsTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/presolve/SingletonColsTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/SingletonColsTest.cpp [ 51%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/presolve/SingletonStuffingTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/presolve/SingletonStuffingTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/presolve/SingletonStuffingTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/presolve/SingletonStuffingTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/SingletonStuffingTest.cpp [ 53%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/presolve/SimpleProbingTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/presolve/SimpleProbingTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/presolve/SimpleProbingTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/presolve/SimpleProbingTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/SimpleProbingTest.cpp In file included from /usr/include/c++/14/algorithm:60: /usr/include/c++/14/bits/stl_algobase.h: In function 'void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _ForwardIterator2 = __gnu_cxx::__normal_iterator*, vector, allocator > > >]': /usr/include/c++/14/bits/stl_algobase.h:155:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 155 | iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) | ^~~~~~~~~ /usr/include/c++/14/bits/stl_algobase.h:155:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 412 | inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, bool leftmost = true) { | ^~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:429:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:429:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:429:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:430:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:430:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:430:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:431:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:431:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:431:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:432:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:432:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:432:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:434:25: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:434:25: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:434:25: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >; bool Branchless = false]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:468:35: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 468 | std::iter_swap(begin, begin + l_size / 4); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:469:35: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 469 | std::iter_swap(pivot_pos - 1, pivot_pos - l_size / 4); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:472:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 472 | std::iter_swap(begin + 1, begin + (l_size / 4 + 1)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:473:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 473 | std::iter_swap(begin + 2, begin + (l_size / 4 + 2)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:474:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 474 | std::iter_swap(pivot_pos - 2, pivot_pos - (l_size / 4 + 1)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:475:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 475 | std::iter_swap(pivot_pos - 3, pivot_pos - (l_size / 4 + 2)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:480:35: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 480 | std::iter_swap(pivot_pos + 1, pivot_pos + (1 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:481:35: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 481 | std::iter_swap(end - 1, end - r_size / 4); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:484:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 484 | std::iter_swap(pivot_pos + 2, pivot_pos + (2 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:485:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 485 | std::iter_swap(pivot_pos + 3, pivot_pos + (3 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:486:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 486 | std::iter_swap(end - 2, end - (1 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:487:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 487 | std::iter_swap(end - 3, end - (2 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 499 | pdqsort_loop(begin, pivot_pos, comp, bad_allowed, leftmost); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In function 'void pdqsort(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = std::less >]', inlined from 'void pdqsort(Iter, Iter) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:525:12, inlined from 'std::pair papilo::Problem::removeRedundantBounds(const papilo::Num&, papilo::Vec >&, papilo::Vec >&) const [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/Problem.hpp:653:14: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:514:84: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 512 | pdqsort_detail::pdqsort_loop::type>::value && | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 514 | std::is_arithmetic::value_type>::value>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 515 | begin, end, comp, pdqsort_detail::log2(end - begin)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ [ 55%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/presolve/SimpleSubstitutionTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/presolve/SimpleSubstitutionTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/presolve/SimpleSubstitutionTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/presolve/SimpleSubstitutionTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/SimpleSubstitutionTest.cpp [ 56%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/presolve/SimplifyInequalitiesTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/presolve/SimplifyInequalitiesTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/presolve/SimplifyInequalitiesTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/presolve/SimplifyInequalitiesTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/SimplifyInequalitiesTest.cpp [ 58%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/presolve/SparsifyTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/presolve/SparsifyTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/presolve/SparsifyTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/presolve/SparsifyTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/SparsifyTest.cpp In file included from /usr/include/c++/14/bits/stl_algo.h:61, from /usr/include/c++/14/algorithm:61, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/MatrixBuffer.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ConstraintMatrix.hpp:29, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/PresolveMethod.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/Sparsify.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/test/papilo/presolve/SparsifyTest.cpp:23: /usr/include/c++/14/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Distance = int; _Tp = double; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]': /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'std::pair pdqsort_detail::partition_right_branchless(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator >; Compare = std::less]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:202:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 202 | inline std::pair partition_right_branchless(Iter begin, Iter end, Compare comp) { | ^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:202:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator >; Compare = std::less; bool Branchless = true]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 412 | inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, bool leftmost = true) { | ^~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:448:56: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 448 | Branchless ? partition_right_branchless(begin, end, comp) | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 499 | pdqsort_loop(begin, pivot_pos, comp, bad_allowed, leftmost); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 [ 60%] Building CXX object test/CMakeFiles/unit_test.dir/papilo/io/MpsParserTest.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT test/CMakeFiles/unit_test.dir/papilo/io/MpsParserTest.cpp.o -MF CMakeFiles/unit_test.dir/papilo/io/MpsParserTest.cpp.o.d -o CMakeFiles/unit_test.dir/papilo/io/MpsParserTest.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/test/papilo/io/MpsParserTest.cpp [ 61%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/core/postsolve/PostsolveStorage.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/core/postsolve/PostsolveStorage.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/core/postsolve/PostsolveStorage.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/core/postsolve/PostsolveStorage.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/postsolve/PostsolveStorage.cpp In function 'void pdqsort(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator >; Compare = std::less]', inlined from 'void pdqsort(Iter, Iter) [with Iter = __gnu_cxx::__normal_iterator >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:525:12, inlined from 'papilo::Sparsify::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&)>' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/Sparsify.hpp:367:27: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:514:84: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator >' changed in GCC 7.1 512 | pdqsort_detail::pdqsort_loop::type>::value && | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 514 | std::is_arithmetic::value_type>::value>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 515 | begin, end, comp, pdqsort_detail::log2(end - begin)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ [ 63%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/core/postsolve/Postsolve.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/core/postsolve/Postsolve.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/core/postsolve/Postsolve.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/core/postsolve/Postsolve.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/postsolve/Postsolve.cpp [ 65%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/core/ProbingView.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/core/ProbingView.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/core/ProbingView.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/core/ProbingView.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ProbingView.cpp [ 66%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/presolvers/CoefficientStrengthening.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/presolvers/CoefficientStrengthening.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/presolvers/CoefficientStrengthening.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/presolvers/CoefficientStrengthening.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/CoefficientStrengthening.cpp In file included from /usr/include/c++/14/bits/stl_uninitialized.h:63, from /usr/include/c++/14/memory:69, from /build/reproducible-path/papilo-2.4.1+ds/test/papilo/io/MpsParserTest.cpp:23: /usr/include/c++/14/bits/stl_algobase.h: In function 'void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _ForwardIterator2 = __gnu_cxx::__normal_iterator*, vector, allocator > > >]': /usr/include/c++/14/bits/stl_algobase.h:155:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 155 | iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) | ^~~~~~~~~ /usr/include/c++/14/bits/stl_algobase.h:155:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 [ 68%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/presolvers/ConstraintPropagation.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/presolvers/ConstraintPropagation.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/presolvers/ConstraintPropagation.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/presolvers/ConstraintPropagation.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/ConstraintPropagation.cpp In file included from /usr/include/c++/14/bits/stl_algo.h:61, from /usr/include/c++/14/algorithm:61, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/MatrixBuffer.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ConstraintMatrix.hpp:29, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/io/MpsParser.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/test/papilo/io/MpsParserTest.cpp:24: /usr/include/c++/14/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = tuple; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)> >]': /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 412 | inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, bool leftmost = true) { | ^~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:472:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 472 | std::iter_swap(begin + 1, begin + (l_size / 4 + 1)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:473:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 473 | std::iter_swap(begin + 2, begin + (l_size / 4 + 2)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:474:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 474 | std::iter_swap(pivot_pos - 2, pivot_pos - (l_size / 4 + 1)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:475:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 475 | std::iter_swap(pivot_pos - 3, pivot_pos - (l_size / 4 + 2)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:484:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 484 | std::iter_swap(pivot_pos + 2, pivot_pos + (2 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:485:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 485 | std::iter_swap(pivot_pos + 3, pivot_pos + (3 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:486:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 486 | std::iter_swap(end - 2, end - (1 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:487:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 487 | std::iter_swap(end - 3, end - (2 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 499 | pdqsort_loop(begin, pivot_pos, comp, bad_allowed, leftmost); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = tuple; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)> >]': /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 412 | inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, bool leftmost = true) { | ^~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:472:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 472 | std::iter_swap(begin + 1, begin + (l_size / 4 + 1)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:473:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 473 | std::iter_swap(begin + 2, begin + (l_size / 4 + 2)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:474:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 474 | std::iter_swap(pivot_pos - 2, pivot_pos - (l_size / 4 + 1)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:475:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 475 | std::iter_swap(pivot_pos - 3, pivot_pos - (l_size / 4 + 2)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:484:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 484 | std::iter_swap(pivot_pos + 2, pivot_pos + (2 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:485:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 485 | std::iter_swap(pivot_pos + 3, pivot_pos + (3 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:486:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 486 | std::iter_swap(end - 2, end - (1 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:487:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 487 | std::iter_swap(end - 3, end - (2 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 499 | pdqsort_loop(begin, pivot_pos, comp, bad_allowed, leftmost); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void pdqsort(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'papilo::ParseKey papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/io/MpsParser.hpp:397:20: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:514:84: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 512 | pdqsort_detail::pdqsort_loop::type>::value && | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 514 | std::is_arithmetic::value_type>::value>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 515 | begin, end, comp, pdqsort_detail::log2(end - begin)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void pdqsort(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'papilo::ParseKey papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/io/MpsParser.hpp:466:20: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:514:84: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 512 | pdqsort_detail::pdqsort_loop::type>::value && | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 514 | std::is_arithmetic::value_type>::value>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 515 | begin, end, comp, pdqsort_detail::log2(end - begin)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ [ 70%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/presolvers/DominatedCols.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/presolvers/DominatedCols.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/presolvers/DominatedCols.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/presolvers/DominatedCols.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/DominatedCols.cpp [ 71%] Linking CXX executable unit_test cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test && /usr/bin/cmake -E cmake_link_script CMakeFiles/unit_test.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wl,-z,relro -Wl,-z,now -Wl,--dependency-file=CMakeFiles/unit_test.dir/link.d CMakeFiles/unit_test.dir/TestMain.cpp.o CMakeFiles/unit_test.dir/papilo/core/MatrixBufferTest.cpp.o CMakeFiles/unit_test.dir/papilo/core/SparseStorageTest.cpp.o CMakeFiles/unit_test.dir/papilo/core/PresolveTest.cpp.o CMakeFiles/unit_test.dir/papilo/core/ProblemUpdateTest.cpp.o CMakeFiles/unit_test.dir/papilo/misc/VectorUtilsTest.cpp.o CMakeFiles/unit_test.dir/papilo/presolve/CoefficientStrengtheningTest.cpp.o CMakeFiles/unit_test.dir/papilo/presolve/ConstraintPropagationTest.cpp.o CMakeFiles/unit_test.dir/papilo/presolve/DualFixTest.cpp.o CMakeFiles/unit_test.dir/papilo/presolve/DominatedColsTest.cpp.o CMakeFiles/unit_test.dir/papilo/presolve/FixContinuousTest.cpp.o CMakeFiles/unit_test.dir/papilo/presolve/FreeVarSubstitutionTest.cpp.o CMakeFiles/unit_test.dir/papilo/presolve/ImplIntDetectionTest.cpp.o CMakeFiles/unit_test.dir/papilo/presolve/ParallelRowDetectionTest.cpp.o CMakeFiles/unit_test.dir/papilo/presolve/ParallelColDetectionTest.cpp.o CMakeFiles/unit_test.dir/papilo/presolve/ProbingTest.cpp.o CMakeFiles/unit_test.dir/papilo/presolve/SingletonColsTest.cpp.o CMakeFiles/unit_test.dir/papilo/presolve/SingletonStuffingTest.cpp.o CMakeFiles/unit_test.dir/papilo/presolve/SimpleProbingTest.cpp.o CMakeFiles/unit_test.dir/papilo/presolve/SimpleSubstitutionTest.cpp.o CMakeFiles/unit_test.dir/papilo/presolve/SimplifyInequalitiesTest.cpp.o CMakeFiles/unit_test.dir/papilo/presolve/SparsifyTest.cpp.o CMakeFiles/unit_test.dir/papilo/io/MpsParserTest.cpp.o -o unit_test -Wl,-rpath,/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf /usr/lib/arm-linux-gnueabihf/libboost_serialization.so.1.83.0 /usr/lib/arm-linux-gnueabihf/libboost_program_options.so.1.83.0 /usr/lib/arm-linux-gnueabihf/libboost_iostreams.so.1.83.0 /usr/lib/libCatch2Main.a /usr/lib/arm-linux-gnueabihf/libtbb.so.12.14 -lrt /usr/lib/arm-linux-gnueabihf/libgmp.so /usr/lib/arm-linux-gnueabihf/libgmpxx.so ../libpapilo-clusol.so.0d /usr/lib/arm-linux-gnueabihf/libblas.so /usr/lib/libCatch2.a make[3]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' [ 71%] Built target unit_test [ 73%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/presolvers/DualFix.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/presolvers/DualFix.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/presolvers/DualFix.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/presolvers/DualFix.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/DualFix.cpp [ 75%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/presolvers/DualInfer.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/presolvers/DualInfer.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/presolvers/DualInfer.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/presolvers/DualInfer.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/DualInfer.cpp [ 76%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/presolvers/FixContinuous.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/presolvers/FixContinuous.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/presolvers/FixContinuous.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/presolvers/FixContinuous.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/FixContinuous.cpp [ 78%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/presolvers/FreeVarSubstitution.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/presolvers/FreeVarSubstitution.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/presolvers/FreeVarSubstitution.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/presolvers/FreeVarSubstitution.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/FreeVarSubstitution.cpp [ 80%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/presolvers/ImplIntDetection.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/presolvers/ImplIntDetection.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/presolvers/ImplIntDetection.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/presolvers/ImplIntDetection.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/ImplIntDetection.cpp In file included from /usr/include/c++/14/vector:72, from /usr/include/boost/math/special_functions/math_fwd.hpp:26, from /usr/include/boost/math/special_functions/fpclassify.hpp:18, from /usr/include/boost/multiprecision/detail/fpclassify.hpp:16, from /usr/include/boost/multiprecision/detail/default_ops.hpp:15, from /usr/include/boost/multiprecision/detail/generic_interconvert.hpp:12, from /usr/include/boost/multiprecision/number.hpp:12, from /usr/include/boost/multiprecision/gmp.hpp:11, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/misc/MultiPrecision.hpp:42, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/MatrixBuffer.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ConstraintMatrix.hpp:29, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/PresolveMethod.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/DualInfer.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/DualInfer.cpp:23: /usr/include/c++/14/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]': /usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector >::iterator' changed in GCC 7.1 700 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14/vector:66: In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'papilo::PresolveStatus papilo::DualInfer::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/DualInfer.hpp:175:17: /usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1037 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'papilo::PresolveStatus papilo::DualInfer::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/DualInfer.hpp:176:17: /usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1037 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ [ 81%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/presolvers/ParallelColDetection.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/presolvers/ParallelColDetection.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/presolvers/ParallelColDetection.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/presolvers/ParallelColDetection.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/ParallelColDetection.cpp [ 83%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/presolvers/ParallelRowDetection.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/presolvers/ParallelRowDetection.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/presolvers/ParallelRowDetection.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/presolvers/ParallelRowDetection.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/ParallelRowDetection.cpp [ 85%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/presolvers/Probing.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/presolvers/Probing.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/presolvers/Probing.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/presolvers/Probing.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/Probing.cpp [ 86%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimpleProbing.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimpleProbing.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimpleProbing.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimpleProbing.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/SimpleProbing.cpp [ 88%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimpleSubstitution.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimpleSubstitution.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimpleSubstitution.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimpleSubstitution.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/SimpleSubstitution.cpp In file included from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/MatrixBuffer.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ConstraintMatrix.hpp:29, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/PresolveMethod.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/Probing.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/Probing.cpp:23: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'Iter pdqsort_detail::partition_left(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::Probing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const papilo::ProbingSubstitution&)>]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:385:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 385 | inline Iter partition_left(Iter begin, Iter end, Compare comp) { | ^~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:385:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'std::pair pdqsort_detail::partition_right(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::Probing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const papilo::ProbingSubstitution&)>]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:341:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 341 | inline std::pair partition_right(Iter begin, Iter end, Compare comp) { | ^~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:341:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'bool pdqsort_detail::partial_insertion_sort(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::Probing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const papilo::ProbingSubstitution&)>]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:124:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 124 | inline bool partial_insertion_sort(Iter begin, Iter end, Compare comp) { | ^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:124:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 [ 90%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/presolvers/SingletonCols.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/presolvers/SingletonCols.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/presolvers/SingletonCols.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/presolvers/SingletonCols.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/SingletonCols.cpp In file included from /usr/include/c++/14/bits/stl_algo.h:61, from /usr/include/c++/14/algorithm:61, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:26: /usr/include/c++/14/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = papilo::ProbingSubstitution; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const papilo::ProbingSubstitution&)> >]': /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::Probing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const papilo::ProbingSubstitution&)>; bool Branchless = false]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 412 | inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, bool leftmost = true) { | ^~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:449:45: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 449 | : partition_right(begin, end, comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:442:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 442 | begin = partition_left(begin, end, comp) + 1; | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 499 | pdqsort_loop(begin, pivot_pos, comp, bad_allowed, leftmost); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:494:66: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 494 | && partial_insertion_sort(pivot_pos + 1, end, comp)) return; | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ [ 91%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/presolvers/SingletonStuffing.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/presolvers/SingletonStuffing.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/presolvers/SingletonStuffing.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/presolvers/SingletonStuffing.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/SingletonStuffing.cpp In function 'void pdqsort(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::Probing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&, const papilo::ProbingSubstitution&)>]', inlined from 'papilo::PresolveStatus papilo::Probing::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/Probing.hpp:589:14: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:514:84: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 512 | pdqsort_detail::pdqsort_loop::type>::value && | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 514 | std::is_arithmetic::value_type>::value>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 515 | begin, end, comp, pdqsort_detail::log2(end - begin)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ [ 93%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/presolvers/Sparsify.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/presolvers/Sparsify.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/presolvers/Sparsify.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/presolvers/Sparsify.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/Sparsify.cpp [ 95%] Building CXX object CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimplifyInequalities.cpp.o /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_USE_EXTERN_TEMPLATES -Dpapilo_core_EXPORTS -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIC -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimplifyInequalities.cpp.o -MF CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimplifyInequalities.cpp.o.d -o CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimplifyInequalities.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/SimplifyInequalities.cpp In file included from /usr/include/c++/14/bits/stl_algo.h:61, from /usr/include/c++/14/algorithm:61, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/MatrixBuffer.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ConstraintMatrix.hpp:29, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/PresolveMethod.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/Sparsify.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/Sparsify.cpp:23: /usr/include/c++/14/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator > >; _Distance = int; _Tp = double; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]': /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'std::pair pdqsort_detail::partition_right_branchless(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator > >; Compare = std::less]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:202:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 202 | inline std::pair partition_right_branchless(Iter begin, Iter end, Compare comp) { | ^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:202:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator > >; Compare = std::less; bool Branchless = true]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 412 | inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, bool leftmost = true) { | ^~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:448:56: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 448 | Branchless ? partition_right_branchless(begin, end, comp) | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 499 | pdqsort_loop(begin, pivot_pos, comp, bad_allowed, leftmost); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 In function 'void pdqsort(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator > >; Compare = std::less]', inlined from 'void pdqsort(Iter, Iter) [with Iter = __gnu_cxx::__normal_iterator > >]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:525:12, inlined from 'papilo::Sparsify::execute(const papilo::Problem&, const papilo::ProblemUpdate&, const papilo::Num&, papilo::Reductions&, const papilo::Timer&, int&)::&)>' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/presolvers/Sparsify.hpp:367:27: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:514:84: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 512 | pdqsort_detail::pdqsort_loop::type>::value && | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 514 | std::is_arithmetic::value_type>::value>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 515 | begin, end, comp, pdqsort_detail::log2(end - begin)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ [ 96%] Linking CXX shared library libpapilo-core.so /usr/bin/cmake -E cmake_link_script CMakeFiles/papilo-core.dir/link.txt --verbose=1 /usr/bin/c++ -fPIC -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wl,--dependency-file=CMakeFiles/papilo-core.dir/link.d -Wl,-z,relro -Wl,-z,now -shared -Wl,-soname,libpapilo-core.so.0d -o libpapilo-core.so.0d "CMakeFiles/papilo-core.dir/src/papilo/core/VariableDomains.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/core/SparseStorage.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/core/ConstraintMatrix.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/core/ProblemUpdate.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/core/Presolve.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/core/postsolve/PostsolveStorage.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/core/postsolve/Postsolve.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/core/ProbingView.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/presolvers/CoefficientStrengthening.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/presolvers/ConstraintPropagation.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/presolvers/DominatedCols.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/presolvers/DualFix.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/presolvers/DualInfer.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/presolvers/FixContinuous.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/presolvers/FreeVarSubstitution.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/presolvers/ImplIntDetection.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/presolvers/ParallelColDetection.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/presolvers/ParallelRowDetection.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/presolvers/Probing.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimpleProbing.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimpleSubstitution.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/presolvers/SingletonCols.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/presolvers/SingletonStuffing.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/presolvers/Sparsify.cpp.o" "CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimplifyInequalities.cpp.o" -Wl,-rpath,/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf: /usr/lib/arm-linux-gnueabihf/libboost_iostreams.so.1.83.0 /usr/lib/arm-linux-gnueabihf/libboost_program_options.so.1.83.0 /usr/lib/arm-linux-gnueabihf/libboost_serialization.so.1.83.0 /usr/lib/arm-linux-gnueabihf/libtbb.so.12.14 -lrt /usr/lib/arm-linux-gnueabihf/libgmp.so /usr/lib/arm-linux-gnueabihf/libgmpxx.so libpapilo-clusol.so.0d /usr/lib/arm-linux-gnueabihf/libblas.so /usr/bin/cmake -E cmake_symlink_library libpapilo-core.so.0d libpapilo-core.so.0d libpapilo-core.so make[3]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' [ 96%] Built target papilo-core make -f binaries/CMakeFiles/papilo-executable.dir/build.make binaries/CMakeFiles/papilo-executable.dir/depend make[3]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/papilo-2.4.1+ds /build/reproducible-path/papilo-2.4.1+ds/binaries /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/binaries /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/binaries/CMakeFiles/papilo-executable.dir/DependInfo.cmake "--color=" make[3]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' make -f binaries/CMakeFiles/papilo-executable.dir/build.make binaries/CMakeFiles/papilo-executable.dir/build make[3]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' [ 98%] Building CXX object binaries/CMakeFiles/papilo-executable.dir/__/src/papilo.cpp.o cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/binaries && /usr/bin/c++ -DBOOST_IOSTREAMS_DYN_LINK -DBOOST_IOSTREAMS_NO_LIB -DBOOST_PROGRAM_OPTIONS_DYN_LINK -DBOOST_PROGRAM_OPTIONS_NO_LIB -DBOOST_SERIALIZATION_DYN_LINK -DBOOST_SERIALIZATION_NO_LIB -DPAPILO_HAVE_SOPLEX -DPAPILO_MPS_WRITER -DPAPILO_USE_EXTERN_TEMPLATES -I/usr/lib/arm-linux-gnueabihf/cmake/soplex/../../../include -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/binaries -I/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf -I/build/reproducible-path/papilo-2.4.1+ds/src -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -std=gnu++14 -fPIE -fvisibility=default -fvisibility-inlines-hidden -ffp-contract=off -Wno-shadow -Wall -MD -MT binaries/CMakeFiles/papilo-executable.dir/__/src/papilo.cpp.o -MF CMakeFiles/papilo-executable.dir/__/src/papilo.cpp.o.d -o CMakeFiles/papilo-executable.dir/__/src/papilo.cpp.o -c /build/reproducible-path/papilo-2.4.1+ds/src/papilo.cpp In file included from /usr/include/c++/14/vector:72, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/misc/Vec.hpp:28, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/Objective.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo.cpp:24: /usr/include/c++/14/bits/vector.tcc: In member function 'void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]': /usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type 'std::vector >::iterator' changed in GCC 7.1 700 | vector<_Tp, _Alloc>:: | ^~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14/bits/stl_uninitialized.h:63, from /usr/include/c++/14/memory:69, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/misc/Alloc.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/misc/Vec.hpp:26: /usr/include/c++/14/bits/stl_algobase.h: In function 'void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _ForwardIterator2 = __gnu_cxx::__normal_iterator*, vector, allocator > > >]': /usr/include/c++/14/bits/stl_algobase.h:155:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 155 | iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) | ^~~~~~~~~ /usr/include/c++/14/bits/stl_algobase.h:155:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In file included from /usr/include/c++/14/bits/stl_algo.h:61, from /usr/include/c++/14/algorithm:61, from /usr/include/boost/iterator/iterator_concepts.hpp:26, from /usr/include/boost/range/concepts.hpp:20, from /usr/include/boost/range/size_type.hpp:20, from /usr/include/boost/range/size.hpp:21, from /usr/include/boost/range/functions.hpp:20, from /usr/include/boost/range/iterator_range_core.hpp:38, from /usr/include/boost/lexical_cast.hpp:48, from /usr/include/boost/multiprecision/detail/number_base.hpp:29, from /usr/include/boost/multiprecision/traits/is_variable_precision.hpp:9, from /usr/include/boost/multiprecision/detail/precision.hpp:9, from /usr/include/boost/multiprecision/number.hpp:11, from /usr/include/boost/multiprecision/gmp.hpp:11, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/misc/MultiPrecision.hpp:42, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo.cpp:25: /usr/include/c++/14/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = tuple; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)> >]': /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ In file included from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/SparseStorage.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/MatrixBuffer.hpp:26, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/ConstraintMatrix.hpp:29, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/PresolveMethod.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/core/Presolve.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo/misc/VersionLogger.hpp:27, from /build/reproducible-path/papilo-2.4.1+ds/src/papilo.cpp:27: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 412 | inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, bool leftmost = true) { | ^~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:429:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:429:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:429:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:430:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:430:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:430:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:431:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:431:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:431:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:432:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:432:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:432:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:434:25: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:434:25: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:434:25: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:468:35: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 468 | std::iter_swap(begin, begin + l_size / 4); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:469:35: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 469 | std::iter_swap(pivot_pos - 1, pivot_pos - l_size / 4); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:472:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 472 | std::iter_swap(begin + 1, begin + (l_size / 4 + 1)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:473:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 473 | std::iter_swap(begin + 2, begin + (l_size / 4 + 2)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:474:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 474 | std::iter_swap(pivot_pos - 2, pivot_pos - (l_size / 4 + 1)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:475:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 475 | std::iter_swap(pivot_pos - 3, pivot_pos - (l_size / 4 + 2)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:480:35: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 480 | std::iter_swap(pivot_pos + 1, pivot_pos + (1 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:481:35: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 481 | std::iter_swap(end - 1, end - r_size / 4); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:484:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 484 | std::iter_swap(pivot_pos + 2, pivot_pos + (2 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:485:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 485 | std::iter_swap(pivot_pos + 3, pivot_pos + (3 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:486:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 486 | std::iter_swap(end - 2, end - (1 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:487:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 487 | std::iter_swap(end - 3, end - (2 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 499 | pdqsort_loop(begin, pivot_pos, comp, bad_allowed, leftmost); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector, allocator > > >; _Distance = int; _Tp = tuple; _Compare = __gnu_cxx::__ops::_Iter_comp_iter::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)> >]': /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 412 | inline void pdqsort_loop(Iter begin, Iter end, Compare comp, int bad_allowed, bool leftmost = true) { | ^~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:412:17: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:429:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:429:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:429:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:430:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:430:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:430:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:431:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:431:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:431:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:432:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:432:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:432:22: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:158:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:434:25: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:159:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:434:25: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ In function 'void pdqsort_detail::sort2(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'void pdqsort_detail::sort3(Iter, Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:160:14, inlined from 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:434:25: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:152:41: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 152 | if (comp(*b, *a)) std::iter_swap(a, b); | ~~~~~~~~~~~~~~^~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h: In function 'void pdqsort_detail::pdqsort_loop(Iter, Iter, Compare, int, bool) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>; bool Branchless = false]': /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:468:35: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 468 | std::iter_swap(begin, begin + l_size / 4); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:469:35: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 469 | std::iter_swap(pivot_pos - 1, pivot_pos - l_size / 4); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:472:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 472 | std::iter_swap(begin + 1, begin + (l_size / 4 + 1)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:473:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 473 | std::iter_swap(begin + 2, begin + (l_size / 4 + 2)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:474:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 474 | std::iter_swap(pivot_pos - 2, pivot_pos - (l_size / 4 + 1)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:475:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 475 | std::iter_swap(pivot_pos - 3, pivot_pos - (l_size / 4 + 2)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:480:35: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 480 | std::iter_swap(pivot_pos + 1, pivot_pos + (1 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:481:35: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 481 | std::iter_swap(end - 1, end - r_size / 4); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:484:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 484 | std::iter_swap(pivot_pos + 2, pivot_pos + (2 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:485:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 485 | std::iter_swap(pivot_pos + 3, pivot_pos + (3 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:486:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 486 | std::iter_swap(end - 2, end - (1 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:487:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 487 | std::iter_swap(end - 3, end - (2 + r_size / 4)); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:499:52: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 499 | pdqsort_loop(begin, pivot_pos, comp, bad_allowed, leftmost); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void pdqsort(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'papilo::ParseKey papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/io/MpsParser.hpp:397:20: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:514:84: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 512 | pdqsort_detail::pdqsort_loop::type>::value && | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 514 | std::is_arithmetic::value_type>::value>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 515 | begin, end, comp, pdqsort_detail::log2(end - begin)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void pdqsort(Iter, Iter, Compare) [with Iter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; Compare = papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&)::, papilo::Triplet)>]', inlined from 'papilo::ParseKey papilo::MpsParser::parseCols(boost::iostreams::filtering_istream&, papilo::Vec&) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/io/MpsParser.hpp:466:20: /build/reproducible-path/papilo-2.4.1+ds/src/papilo/external/pdqsort/pdqsort.h:514:84: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >' changed in GCC 7.1 512 | pdqsort_detail::pdqsort_loop::type>::value && | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 514 | std::is_arithmetic::value_type>::value>( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 515 | begin, end, comp, pdqsort_detail::log2(end - begin)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14/vector:66: In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'void soplex::VectorBase::reDim(int, bool) [with R = double]' at /usr/include/soplex/vectorbase.h:549:20, inlined from 'void soplex::SPxSteepPR::addedVecs(int) [with R = double]' at /usr/include/soplex/spxsteeppr.hpp:1031:17: /usr/include/c++/14/bits/stl_vector.h:1442:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1442 | _M_fill_insert(begin() + __offset, __n, __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'void soplex::VectorBase::reDim(int, bool) [with R = double]' at /usr/include/soplex/vectorbase.h:549:20, inlined from 'void soplex::SPxDevexPR::addedCoVecs(int) [with R = double]' at /usr/include/soplex/spxdevexpr.hpp:974:19: /usr/include/c++/14/bits/stl_vector.h:1442:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1442 | _M_fill_insert(begin() + __offset, __n, __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'void soplex::VectorBase::reDim(int, bool) [with R = double]' at /usr/include/soplex/vectorbase.h:549:20, inlined from 'void soplex::SPxDevexPR::addedVecs(int) [with R = double]' at /usr/include/soplex/spxdevexpr.hpp:962:17: /usr/include/c++/14/bits/stl_vector.h:1442:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1442 | _M_fill_insert(begin() + __offset, __n, __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'void soplex::VectorBase::reDim(int, bool) [with R = double]' at /usr/include/soplex/vectorbase.h:549:20, inlined from 'void soplex::SPxPricer::setType(typename soplex::SPxSolverBase::Type) [with R = double]' at /usr/include/soplex/spxpricer.h:172:37: /usr/include/c++/14/bits/stl_vector.h:1442:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1442 | _M_fill_insert(begin() + __offset, __n, __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'void soplex::VectorBase::reDim(int, bool) [with R = double]' at /usr/include/soplex/vectorbase.h:549:20, inlined from 'void soplex::SPxPricer::setType(typename soplex::SPxSolverBase::Type) [with R = double]' at /usr/include/soplex/spxpricer.h:173:39: /usr/include/c++/14/bits/stl_vector.h:1442:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1442 | _M_fill_insert(begin() + __offset, __n, __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'void soplex::VectorBase::reDim(int, bool) [with R = double]' at /usr/include/soplex/vectorbase.h:549:20: /usr/include/c++/14/bits/stl_vector.h:1442:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1442 | _M_fill_insert(begin() + __offset, __n, __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'void soplex::VectorBase::reDim(int, bool) [with R = double]' at /usr/include/soplex/vectorbase.h:549:20, inlined from 'void soplex::SPxParMultPR::setType(typename soplex::SPxSolverBase::Type) [with R = double]' at /usr/include/soplex/spxparmultpr.hpp:46:34: /usr/include/c++/14/bits/stl_vector.h:1442:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1442 | _M_fill_insert(begin() + __offset, __n, __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'void soplex::VectorBase::reDim(int, bool) [with R = double]' at /usr/include/soplex/vectorbase.h:549:20, inlined from 'void soplex::SPxSteepPR::addedCoVecs(int) [with R = double]' at /usr/include/soplex/spxsteeppr.hpp:1046:19: /usr/include/c++/14/bits/stl_vector.h:1442:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1442 | _M_fill_insert(begin() + __offset, __n, __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'void soplex::CLUFactor::setupRowVals() [with R = double]' at /usr/include/soplex/clufactor.hpp:2744:17: /usr/include/c++/14/bits/stl_vector.h:1442:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1442 | _M_fill_insert(begin() + __offset, __n, __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'int soplex::CLUFactor::setupColVals() [with R = double]' at /usr/include/soplex/clufactor.hpp:2654:20: /usr/include/c++/14/bits/stl_vector.h:1442:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1442 | _M_fill_insert(begin() + __offset, __n, __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'void soplex::VectorBase::reDim(int, bool) [with R = double]' at /usr/include/soplex/vectorbase.h:549:20, inlined from 'void soplex::LPRowSetBase::add(soplex::DataKey&, const R&, const soplex::SVectorBase&, const R&, const R&, const int&) [with R = double]' at /usr/include/soplex/lprowsetbase.h:409:20, inlined from 'void soplex::LPRowSetBase::add(soplex::DataKey&, const soplex::LPRowBase&) [with R = double]' at /usr/include/soplex/lprowsetbase.h:346:10, inlined from 'void soplex::LPRowSetBase::add(const soplex::LPRowBase&) [with R = double]' at /usr/include/soplex/lprowsetbase.h:340:10, inlined from 'void soplex::SPxLPBase::doAddCols(const soplex::LPColSetBase&, bool) [with R = double]' at /usr/include/soplex/spxlpbase.h:2736:39: /usr/include/c++/14/bits/stl_vector.h:1442:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1442 | _M_fill_insert(begin() + __offset, __n, __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'void soplex::VectorBase::reDim(int, bool) [with R = double]' at /usr/include/soplex/vectorbase.h:549:20, inlined from 'void soplex::LPRowSetBase::add(soplex::DataKey&, const R&, const soplex::SVectorBase&, const R&, const R&, const int&) [with R = double]' at /usr/include/soplex/lprowsetbase.h:410:21, inlined from 'void soplex::LPRowSetBase::add(soplex::DataKey&, const soplex::LPRowBase&) [with R = double]' at /usr/include/soplex/lprowsetbase.h:346:10, inlined from 'void soplex::LPRowSetBase::add(const soplex::LPRowBase&) [with R = double]' at /usr/include/soplex/lprowsetbase.h:340:10, inlined from 'void soplex::SPxLPBase::doAddCols(const soplex::LPColSetBase&, bool) [with R = double]' at /usr/include/soplex/spxlpbase.h:2736:39: /usr/include/c++/14/bits/stl_vector.h:1442:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1442 | _M_fill_insert(begin() + __offset, __n, __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'void soplex::VectorBase::reDim(int, bool) [with R = double]' at /usr/include/soplex/vectorbase.h:549:20, inlined from 'void soplex::LPRowSetBase::add(soplex::DataKey&, const R&, const soplex::SVectorBase&, const R&, const R&, const int&) [with R = double]' at /usr/include/soplex/lprowsetbase.h:411:22, inlined from 'void soplex::LPRowSetBase::add(soplex::DataKey&, const soplex::LPRowBase&) [with R = double]' at /usr/include/soplex/lprowsetbase.h:346:10, inlined from 'void soplex::LPRowSetBase::add(const soplex::LPRowBase&) [with R = double]' at /usr/include/soplex/lprowsetbase.h:340:10, inlined from 'void soplex::SPxLPBase::doAddCols(const soplex::LPColSetBase&, bool) [with R = double]' at /usr/include/soplex/spxlpbase.h:2736:39: /usr/include/c++/14/bits/stl_vector.h:1442:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1442 | _M_fill_insert(begin() + __offset, __n, __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'void soplex::VectorBase::reDim(int, bool) [with R = double]' at /usr/include/soplex/vectorbase.h:549:20, inlined from 'void soplex::LPColSetBase::add(soplex::DataKey&, const R&, const R&, const soplex::SVectorBase&, const R&, const int&) [with R = double]' at /usr/include/soplex/lpcolsetbase.h:292:19, inlined from 'void soplex::LPColSetBase::add(soplex::DataKey&, const soplex::LPColBase&) [with R = double]' at /usr/include/soplex/lpcolsetbase.h:273:10, inlined from 'void soplex::LPColSetBase::add(const soplex::LPColBase&) [with R = double]' at /usr/include/soplex/lpcolsetbase.h:267:10, inlined from 'void soplex::SPxLPBase::doAddRows(const soplex::LPRowSetBase&, bool) [with R = double]' at /usr/include/soplex/spxlpbase.h:2502:39: /usr/include/c++/14/bits/stl_vector.h:1442:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1442 | _M_fill_insert(begin() + __offset, __n, __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'void soplex::VectorBase::reDim(int, bool) [with R = double]' at /usr/include/soplex/vectorbase.h:549:20, inlined from 'void soplex::LPColSetBase::add(soplex::DataKey&, const R&, const R&, const soplex::SVectorBase&, const R&, const int&) [with R = double]' at /usr/include/soplex/lpcolsetbase.h:293:18, inlined from 'void soplex::LPColSetBase::add(soplex::DataKey&, const soplex::LPColBase&) [with R = double]' at /usr/include/soplex/lpcolsetbase.h:273:10, inlined from 'void soplex::LPColSetBase::add(const soplex::LPColBase&) [with R = double]' at /usr/include/soplex/lpcolsetbase.h:267:10, inlined from 'void soplex::SPxLPBase::doAddRows(const soplex::LPRowSetBase&, bool) [with R = double]' at /usr/include/soplex/spxlpbase.h:2502:39: /usr/include/c++/14/bits/stl_vector.h:1442:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1442 | _M_fill_insert(begin() + __offset, __n, __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(const_iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'void soplex::VectorBase::reDim(int, bool) [with R = double]' at /usr/include/soplex/vectorbase.h:549:20, inlined from 'void soplex::LPColSetBase::add(soplex::DataKey&, const R&, const R&, const soplex::SVectorBase&, const R&, const int&) [with R = double]' at /usr/include/soplex/lpcolsetbase.h:294:22, inlined from 'void soplex::LPColSetBase::add(soplex::DataKey&, const soplex::LPColBase&) [with R = double]' at /usr/include/soplex/lpcolsetbase.h:273:10, inlined from 'void soplex::LPColSetBase::add(const soplex::LPColBase&) [with R = double]' at /usr/include/soplex/lpcolsetbase.h:267:10, inlined from 'void soplex::SPxLPBase::doAddRows(const soplex::LPRowSetBase&, bool) [with R = double]' at /usr/include/soplex/spxlpbase.h:2502:39: /usr/include/c++/14/bits/stl_vector.h:1442:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1442 | _M_fill_insert(begin() + __offset, __n, __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In member function 'void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]', inlined from 'static bool papilo::SolParser::read(const std::string&, papilo::Vec&, papilo::Vec >&, papilo::Vec&) [with REAL = double]' at /build/reproducible-path/papilo-2.4.1+ds/src/papilo/io/SolParser.hpp:75:29: /usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator > >' changed in GCC 7.1 1037 | _M_fill_insert(end(), __new_size - size(), __x); | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ [100%] Linking CXX executable ../bin/papilo cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/binaries && /usr/bin/cmake -E cmake_link_script CMakeFiles/papilo-executable.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -ffile-prefix-map=/build/reproducible-path/papilo-2.4.1+ds=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -D_LARGEFILE_SOURCE -D_FILE_OFFSET_BITS=64 -D_TIME_BITS=64 -Wdate-time -D_FORTIFY_SOURCE=2 -Wl,-z,relro -Wl,-z,now -Wl,--dependency-file=CMakeFiles/papilo-executable.dir/link.d "CMakeFiles/papilo-executable.dir/__/src/papilo.cpp.o" -o ../bin/papilo -Wl,-rpath,/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf: ../libpapilo-core.so.0d /usr/lib/arm-linux-gnueabihf/libsoplexshared.so.7.1.3.0 /usr/lib/arm-linux-gnueabihf/libboost_iostreams.so.1.83.0 /usr/lib/arm-linux-gnueabihf/libboost_program_options.so.1.83.0 /usr/lib/arm-linux-gnueabihf/libboost_serialization.so.1.83.0 /usr/lib/arm-linux-gnueabihf/libtbb.so.12.14 -lrt ../libpapilo-clusol.so.0d /usr/lib/arm-linux-gnueabihf/libblas.so /usr/lib/arm-linux-gnueabihf/libsoplex-pic.a /usr/lib/arm-linux-gnueabihf/libz.so /usr/lib/arm-linux-gnueabihf/libgmp.so /usr/lib/arm-linux-gnueabihf/libgmpxx.so make[3]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' [100%] Built target papilo-executable make[2]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' /usr/bin/cmake -E cmake_progress_start /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles 0 make[1]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' debian/rules override_dh_auto_test make[1]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds' dh_auto_test --buildsystem=cmake cd obj-arm-linux-gnueabihf && make -j4 test ARGS\+=--verbose ARGS\+=-j4 make[2]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' Running tests... /usr/bin/ctest --force-new-ctest-process --verbose -j4 UpdateCTestConfiguration from :/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/DartConfiguration.tcl UpdateCTestConfiguration from :/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/DartConfiguration.tcl Test project /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf Constructing a list of tests Done constructing a list of tests Updating test list for fixtures Added 0 tests to meet fixture requirements Checking test dependency graph... Checking test dependency graph end Connected to MAKE jobserver test 1 Start 1: unit-test-build 1: Test command: /usr/bin/cmake "--build" "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf" "--target" "unit_test" 1: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 1: Test timeout computed to be: 10000000 test 98 Start 98: papilo-build 98: Test command: /usr/bin/cmake "--build" "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf" "--target" "papilo-executable" 98: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 98: Test timeout computed to be: 10000000 98: Change Dir: '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 98: 98: Run Build Command(s): /usr/bin/cmake -E env VERBOSE=1 /usr/bin/gmake -f Makefile papilo-executable 1: Change Dir: '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 1: 1: Run Build Command(s): /usr/bin/cmake -E env VERBOSE=1 /usr/bin/gmake -f Makefile unit_test 98: gmake[3]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 98: /usr/bin/cmake -S/build/reproducible-path/papilo-2.4.1+ds -B/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf --check-build-system CMakeFiles/Makefile.cmake 0 1: gmake[3]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 1: /usr/bin/cmake -S/build/reproducible-path/papilo-2.4.1+ds -B/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf --check-build-system CMakeFiles/Makefile.cmake 0 98: /usr/bin/gmake -f CMakeFiles/Makefile2 papilo-executable 1: /usr/bin/gmake -f CMakeFiles/Makefile2 unit_test 98: gmake[4]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 1: gmake[4]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 1: /usr/bin/cmake -S/build/reproducible-path/papilo-2.4.1+ds -B/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf --check-build-system CMakeFiles/Makefile.cmake 0 98: /usr/bin/cmake -S/build/reproducible-path/papilo-2.4.1+ds -B/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf --check-build-system CMakeFiles/Makefile.cmake 0 98: /usr/bin/cmake -E cmake_progress_start /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles 36 1: /usr/bin/cmake -E cmake_progress_start /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles 32 98: /usr/bin/gmake -f CMakeFiles/Makefile2 binaries/CMakeFiles/papilo-executable.dir/all 98: gmake[5]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 98: /usr/bin/gmake -f CMakeFiles/papilo-clusol.dir/build.make CMakeFiles/papilo-clusol.dir/depend 98: gmake[6]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 98: cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/papilo-2.4.1+ds /build/reproducible-path/papilo-2.4.1+ds /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-clusol.dir/DependInfo.cmake "--color=" 1: /usr/bin/gmake -f CMakeFiles/Makefile2 test/CMakeFiles/unit_test.dir/all 1: gmake[5]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 1: /usr/bin/gmake -f CMakeFiles/papilo-clusol.dir/build.make CMakeFiles/papilo-clusol.dir/depend 1: gmake[6]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 1: cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/papilo-2.4.1+ds /build/reproducible-path/papilo-2.4.1+ds /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-clusol.dir/DependInfo.cmake "--color=" 98: Dependencies file "CMakeFiles/papilo-clusol.dir/src/papilo/external/lusol/src/clusol.c.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-clusol.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-clusol.dir/link.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-clusol.dir/compiler_depend.internal". 98: Consolidate compiler generated dependencies of target papilo-clusol 98: gmake[6]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 98: /usr/bin/gmake -f CMakeFiles/papilo-clusol.dir/build.make CMakeFiles/papilo-clusol.dir/build 98: gmake[6]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 98: gmake[6]: Nothing to be done for 'CMakeFiles/papilo-clusol.dir/build'. 98: gmake[6]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 1: gmake[6]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 1: /usr/bin/gmake -f CMakeFiles/papilo-clusol.dir/build.make CMakeFiles/papilo-clusol.dir/build 1: gmake[6]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 1: gmake[6]: Nothing to be done for 'CMakeFiles/papilo-clusol.dir/build'. 1: gmake[6]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 98: [ 25%] Built target papilo-clusol 98: /usr/bin/gmake -f CMakeFiles/papilo-core.dir/build.make CMakeFiles/papilo-core.dir/depend 98: gmake[6]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 98: cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/papilo-2.4.1+ds /build/reproducible-path/papilo-2.4.1+ds /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/DependInfo.cmake "--color=" 1: [ 25%] Built target papilo-clusol 1: /usr/bin/gmake -f test/CMakeFiles/unit_test.dir/build.make test/CMakeFiles/unit_test.dir/depend 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/core/ConstraintMatrix.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/core/Presolve.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 1: gmake[6]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 1: cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/papilo-2.4.1+ds /build/reproducible-path/papilo-2.4.1+ds/test /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/DependInfo.cmake "--color=" 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/core/ProbingView.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/core/ProblemUpdate.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/core/SparseStorage.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/core/VariableDomains.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/core/postsolve/Postsolve.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/core/postsolve/PostsolveStorage.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/presolvers/CoefficientStrengthening.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/TestMain.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/core/MatrixBufferTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/presolvers/ConstraintPropagation.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/core/PresolveTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/presolvers/DominatedCols.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/presolvers/DualFix.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/core/ProblemUpdateTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/presolvers/DualInfer.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/presolvers/FixContinuous.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/core/SparseStorageTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/presolvers/FreeVarSubstitution.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/io/MpsParserTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/presolvers/ImplIntDetection.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/misc/VectorUtilsTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/presolvers/ParallelColDetection.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/presolvers/ParallelRowDetection.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/presolve/CoefficientStrengtheningTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/presolvers/Probing.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/presolve/ConstraintPropagationTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimpleProbing.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimpleSubstitution.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/presolve/DominatedColsTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/presolvers/SimplifyInequalities.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/presolve/DualFixTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/presolvers/SingletonCols.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/presolvers/SingletonStuffing.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/presolve/FixContinuousTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/src/papilo/presolvers/Sparsify.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/presolve/FreeVarSubstitutionTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 98: Dependencies file "CMakeFiles/papilo-core.dir/link.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles/papilo-core.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/presolve/ImplIntDetectionTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/presolve/ParallelColDetectionTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/presolve/ParallelRowDetectionTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/presolve/ProbingTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/presolve/SimpleProbingTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/presolve/SimpleSubstitutionTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/presolve/SimplifyInequalitiesTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/presolve/SingletonColsTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/presolve/SingletonStuffingTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/papilo/presolve/SparsifyTest.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 1: Dependencies file "test/CMakeFiles/unit_test.dir/link.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/CMakeFiles/unit_test.dir/compiler_depend.internal". 98: Consolidate compiler generated dependencies of target papilo-core 98: gmake[6]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 98: /usr/bin/gmake -f CMakeFiles/papilo-core.dir/build.make CMakeFiles/papilo-core.dir/build 1: Consolidate compiler generated dependencies of target unit_test 1: gmake[6]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 1: /usr/bin/gmake -f test/CMakeFiles/unit_test.dir/build.make test/CMakeFiles/unit_test.dir/build 98: gmake[6]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 98: gmake[6]: Nothing to be done for 'CMakeFiles/papilo-core.dir/build'. 98: gmake[6]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 98: [106%] Built target papilo-core 98: /usr/bin/gmake -f binaries/CMakeFiles/papilo-executable.dir/build.make binaries/CMakeFiles/papilo-executable.dir/depend 98: gmake[6]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 98: cd /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/papilo-2.4.1+ds /build/reproducible-path/papilo-2.4.1+ds/binaries /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/binaries /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/binaries/CMakeFiles/papilo-executable.dir/DependInfo.cmake "--color=" 98: Dependencies file "binaries/CMakeFiles/papilo-executable.dir/__/src/papilo.cpp.o.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/binaries/CMakeFiles/papilo-executable.dir/compiler_depend.internal". 98: Dependencies file "binaries/CMakeFiles/papilo-executable.dir/link.d" is newer than depends file "/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/binaries/CMakeFiles/papilo-executable.dir/compiler_depend.internal". 98: Consolidate compiler generated dependencies of target papilo-executable 1: gmake[6]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 1: gmake[6]: Nothing to be done for 'test/CMakeFiles/unit_test.dir/build'. 1: gmake[6]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 98: gmake[6]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 98: /usr/bin/gmake -f binaries/CMakeFiles/papilo-executable.dir/build.make binaries/CMakeFiles/papilo-executable.dir/build 1: [181%] Built target unit_test 1: gmake[5]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 1: /usr/bin/cmake -E cmake_progress_start /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles 0 98: gmake[6]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 98: gmake[6]: Nothing to be done for 'binaries/CMakeFiles/papilo-executable.dir/build'. 98: gmake[6]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 1: gmake[4]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 1: gmake[3]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 1: 1/287 Test #1: unit-test-build ............................................................................ Passed 2.38 sec test 2 Start 2: unit-test-matrix-buffer 2: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "matrix-buffer" 2: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 2: Test timeout computed to be: 10000000 test 3 Start 3: unit-test-vector-comparisons 3: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "vector-comparisons" 3: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 3: Test timeout computed to be: 10000000 test 4 Start 4: unit-test-matrix-comparisons 4: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "matrix-comparisons" 4: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 4: Test timeout computed to be: 10000000 98: Built target papilo-executable 98: gmake[5]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 98: /usr/bin/cmake -E cmake_progress_start /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/CMakeFiles 0 2: Filters: "matrix-buffer" 2: Randomness seeded to: 850776465 2: check row major heap property 2: heap property violated: node 5 (prio 1353598054), left 0 (prio 1640531526), right 1 (prio 4008033823) 2: heap property violated: node 7 (prio 966321094), left 0 (prio 1640531526), right 5 (prio 1353598054) 2: heap property violated: node 8 (prio 2522864820), left 0 (prio 1640531526), right 4 (prio 2630644195) 2: check col major heap property 2: heap property violated: node 3 (prio 2630644195), left 0 (prio 1640531526), right 5 (prio 4092021624) 2: 1 at depth: 5 2: 2 at depth: 4 2: 3 at depth: 4 2: 4 at depth: 3 2: 5 at depth: 3 2: 6 at depth: 2 2: 7 at depth: 2 2: 8 at depth: 2 2: 9 at depth: 1 2: 10 at depth: 1 2: 11 at depth: 1 2: 12 at depth: 1 2: 13 at depth: 1 2: 1 at depth: 5 2: 9 at depth: 4 2: 2 at depth: 3 2: 3 at depth: 3 2: 8 at depth: 2 2: 10 at depth: 1 2: 4 at depth: 1 2: 11 at depth: 3 2: 5 at depth: 3 2: 6 at depth: 2 2: 7 at depth: 2 2: 12 at depth: 1 2: 13 at depth: 1 2: =============================================================================== 2: All tests passed (56 assertions in 1 test case) 2: 3: Filters: "vector-comparisons" 3: Randomness seeded to: 4278812647 3: =============================================================================== 3: All tests passed (2 assertions in 1 test case) 3: 2/287 Test #2: unit-test-matrix-buffer .................................................................... Passed 0.05 sec 3/287 Test #3: unit-test-vector-comparisons ............................................................... Passed 0.03 sec test 5 Start 5: unit-test-replacing-variables-is-postponed-by-flag 5: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "replacing-variables-is-postponed-by-flag" 5: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 5: Test timeout computed to be: 10000000 test 6 Start 6: unit-test-happy-path-replace-variable 6: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-replace-variable" 6: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 6: Test timeout computed to be: 10000000 4: Filters: "matrix-comparisons" 4: Randomness seeded to: 1530470446 4: =============================================================================== 4: All tests passed (4 assertions in 1 test case) 4: 5: Filters: "replacing-variables-is-postponed-by-flag" 5: Randomness seeded to: 629101650 5: =============================================================================== 5: All tests passed (2 assertions in 1 test case) 5: 4/287 Test #4: unit-test-matrix-comparisons ............................................................... Passed 0.05 sec test 7 Start 7: unit-test-happy-path-substitute-matrix-coefficient-into-objective 7: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-substitute-matrix-coefficient-into-objective" 7: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 7: Test timeout computed to be: 10000000 98: gmake[4]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 98: gmake[3]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' 6: Filters: "happy-path-replace-variable" 6: Randomness seeded to: 59521418 6: =============================================================================== 6: All tests passed (21 assertions in 1 test case) 6: 5/287 Test #5: unit-test-replacing-variables-is-postponed-by-flag ......................................... Passed 0.05 sec 98: 6/287 Test #98: papilo-build ............................................................................... Passed 2.47 sec 7/287 Test #6: unit-test-happy-path-replace-variable ...................................................... Passed 0.04 sec test 8 Start 8: unit-test-happy-path-aggregate-free-column 8: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-aggregate-free-column" 8: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 8: Test timeout computed to be: 10000000 test 9 Start 9: unit-test-presolve-activity-is-updated-correctly-huge-values 9: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "presolve-activity-is-updated-correctly-huge-values" 9: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 9: Test timeout computed to be: 10000000 test 10 Start 10: unit-test-trivial-presolve-singleton-row 10: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "trivial-presolve-singleton-row" 10: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 10: Test timeout computed to be: 10000000 7: Filters: "happy-path-substitute-matrix-coefficient-into-objective" 7: Randomness seeded to: 1434214152 7: =============================================================================== 7: All tests passed (10 assertions in 1 test case) 7: 8/287 Test #7: unit-test-happy-path-substitute-matrix-coefficient-into-objective .......................... Passed 0.07 sec test 11 Start 11: unit-test-trivial-presolve-singleton-row-pt-2 11: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "trivial-presolve-singleton-row-pt-2" 11: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 11: Test timeout computed to be: 10000000 8: Filters: "happy-path-aggregate-free-column" 8: Randomness seeded to: 3873536816 8: =============================================================================== 8: All tests passed (8 assertions in 1 test case) 8: 9/287 Test #8: unit-test-happy-path-aggregate-free-column ................................................. Passed 0.06 sec 9: Filters: "presolve-activity-is-updated-correctly-huge-values" 9: Randomness seeded to: 1545838631 9: =============================================================================== 9: All tests passed (1 assertion in 1 test case) 9: 10/287 Test #9: unit-test-presolve-activity-is-updated-correctly-huge-values ............................... Passed 0.05 sec test 12 Start 12: unit-test-problem-comparisons 12: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "problem-comparisons" 12: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 12: Test timeout computed to be: 10000000 test 13 Start 13: unit-test-happy-path-coefficient-strengthening 13: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-coefficient-strengthening" 13: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 13: Test timeout computed to be: 10000000 10: Filters: "trivial-presolve-singleton-row" 10: Randomness seeded to: 3722572978 10: =============================================================================== 10: All tests passed (2 assertions in 1 test case) 10: 11: Filters: "trivial-presolve-singleton-row-pt-2" 11: Randomness seeded to: 4202782228 11: =============================================================================== 11: All tests passed (4 assertions in 1 test case) 11: 12: Filters: "problem-comparisons" 12: Randomness seeded to: 3662559421 12: =============================================================================== 12: All tests passed (2 assertions in 1 test case) 12: 11/287 Test #10: unit-test-trivial-presolve-singleton-row ................................................... Passed 0.06 sec 12/287 Test #11: unit-test-trivial-presolve-singleton-row-pt-2 .............................................. Passed 0.05 sec 13/287 Test #12: unit-test-problem-comparisons .............................................................. Passed 0.03 sec test 14 Start 14: unit-test-constraint-propagation-happy-path 14: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "constraint-propagation-happy-path" 14: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 14: Test timeout computed to be: 10000000 test 15 Start 15: unit-test-constraint-propagation-no-tightening-for-lp 15: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "constraint-propagation-no-tightening-for-lp" 15: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 15: Test timeout computed to be: 10000000 test 16 Start 16: unit-test-domcol-happy-path 16: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "domcol-happy-path" 16: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 16: Test timeout computed to be: 10000000 13: Filters: "happy-path-coefficient-strengthening" 13: Randomness seeded to: 3962108551 13: =============================================================================== 13: All tests passed (11 assertions in 1 test case) 13: 14/287 Test #13: unit-test-happy-path-coefficient-strengthening ............................................. Passed 0.06 sec test 17 Start 17: unit-test-domcol-parallel-columns 17: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "domcol-parallel-columns" 17: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 17: Test timeout computed to be: 10000000 14: Filters: "constraint-propagation-happy-path" 14: Randomness seeded to: 1200151836 14: =============================================================================== 14: All tests passed (22 assertions in 1 test case) 14: 15/287 Test #14: unit-test-constraint-propagation-happy-path ................................................ Passed 0.05 sec 15: Filters: "constraint-propagation-no-tightening-for-lp" 15: Randomness seeded to: 4171975566 15: =============================================================================== 15: All tests passed (1 assertion in 1 test case) 15: test 18 Start 18: unit-test-domcol-multiple-parallel-cols-generate_redundant-reductions 18: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "domcol-multiple-parallel-cols-generate_redundant-reductions" 18: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 18: Test timeout computed to be: 10000000 16/287 Test #15: unit-test-constraint-propagation-no-tightening-for-lp ...................................... Passed 0.06 sec test 19 Start 19: unit-test-domcol-multiple-columns 19: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "domcol-multiple-columns" 19: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 19: Test timeout computed to be: 10000000 16: Filters: "domcol-happy-path" 16: Randomness seeded to: 2773286964 16: =============================================================================== 16: All tests passed (20 assertions in 1 test case) 16: 17/287 Test #16: unit-test-domcol-happy-path ................................................................ Passed 0.07 sec 17: Filters: "domcol-parallel-columns" 17: Randomness seeded to: 3895063733 17: =============================================================================== 17: All tests passed (20 assertions in 1 test case) 17: 18/287 Test #17: unit-test-domcol-parallel-columns .......................................................... Passed 0.05 sec test 20 Start 20: unit-test-dual-fix-happy-path 20: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "dual-fix-happy-path" 20: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 20: Test timeout computed to be: 10000000 test 21 Start 21: unit-test-dual-fix-trivial-column-presolve-finds-reduction 21: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "dual-fix-trivial-column-presolve-finds-reduction" 21: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 21: Test timeout computed to be: 10000000 18: Filters: "domcol-multiple-parallel-cols-generate_redundant-reductions" 18: Randomness seeded to: 530709959 18: =============================================================================== 18: All tests passed (2 assertions in 1 test case) 18: 19/287 Test #18: unit-test-domcol-multiple-parallel-cols-generate_redundant-reductions ...................... Passed 0.08 sec test 22 Start 22: unit-test-dual-fix-no-dual-substitution-for-lp 22: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "dual-fix-no-dual-substitution-for-lp" 22: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 22: Test timeout computed to be: 10000000 19: Filters: "domcol-multiple-columns" 19: Randomness seeded to: 1477781438 19: =============================================================================== 19: All tests passed (38 assertions in 1 test case) 19: 20: Filters: "dual-fix-happy-path" 20: Randomness seeded to: 2313245648 20: =============================================================================== 20: All tests passed (7 assertions in 1 test case) 20: 20/287 Test #19: unit-test-domcol-multiple-columns .......................................................... Passed 0.08 sec test 23 Start 23: unit-test-dual-fix-dual-substitution 23: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "dual-fix-dual-substitution" 23: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 23: Test timeout computed to be: 10000000 21/287 Test #20: unit-test-dual-fix-happy-path .............................................................. Passed 0.07 sec 21: Filters: "dual-fix-trivial-column-presolve-finds-reduction" 21: Randomness seeded to: 2744439595 21: =============================================================================== 21: All tests passed (3 assertions in 1 test case) 21: test 24 Start 24: unit-test-dual-fix-dual-substitution-rounding 24: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "dual-fix-dual-substitution-rounding" 24: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 24: Test timeout computed to be: 10000000 22: Filters: "dual-fix-no-dual-substitution-for-lp" 22: Randomness seeded to: 2079630672 22: =============================================================================== 22: All tests passed (1 assertion in 1 test case) 22: 22/287 Test #21: unit-test-dual-fix-trivial-column-presolve-finds-reduction ................................. Passed 0.07 sec test 25 Start 25: unit-test-dual-fix-dual-substitution-unbounded-variables 25: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "dual-fix-dual-substitution-unbounded-variables" 25: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 25: Test timeout computed to be: 10000000 23/287 Test #22: unit-test-dual-fix-no-dual-substitution-for-lp ............................................. Passed 0.06 sec 23: Filters: "dual-fix-dual-substitution" 23: Randomness seeded to: 1950589684 23: =============================================================================== 23: All tests passed (12 assertions in 1 test case) 23: test 26 Start 26: unit-test-dual-fix-dual-substitution-equation 26: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "dual-fix-dual-substitution-equation" 26: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 26: Test timeout computed to be: 10000000 24: Filters: "dual-fix-dual-substitution-rounding" 24: Randomness seeded to: 3551800280 24: =============================================================================== 24: All tests passed (24 assertions in 1 test case) 24: 24/287 Test #23: unit-test-dual-fix-dual-substitution ....................................................... Passed 0.06 sec test 27 Start 27: unit-test-dual-fix-infinity 27: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "dual-fix-infinity" 27: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 27: Test timeout computed to be: 10000000 25/287 Test #24: unit-test-dual-fix-dual-substitution-rounding .............................................. Passed 0.05 sec test 28 Start 28: unit-test-happy-path-presolve-fix-continuous 28: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-presolve-fix-continuous" 28: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 28: Test timeout computed to be: 10000000 25: Filters: "dual-fix-dual-substitution-unbounded-variables" 25: Randomness seeded to: 3514350169 25: =============================================================================== 25: All tests passed (1 assertion in 1 test case) 25: 26: Filters: "dual-fix-dual-substitution-equation" 26: Randomness seeded to: 3360969638 26: =============================================================================== 26: All tests passed (13 assertions in 1 test case) 26: 27: Filters: "dual-fix-infinity" 27: Randomness seeded to: 2246260153 27: =============================================================================== 27: All tests passed (28 assertions in 1 test case) 27: 26/287 Test #25: unit-test-dual-fix-dual-substitution-unbounded-variables ................................... Passed 0.05 sec 27/287 Test #26: unit-test-dual-fix-dual-substitution-equation .............................................. Passed 0.04 sec test 29 Start 29: unit-test-happy-path-no-presolve-fix-continuous 29: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-no-presolve-fix-continuous" 29: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 29: Test timeout computed to be: 10000000 test 30 Start 30: unit-test-happy-path-test-free-variable-detection 30: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-test-free-variable-detection" 30: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 30: Test timeout computed to be: 10000000 28: Filters: "happy-path-presolve-fix-continuous" 28: Randomness seeded to: 2452863251 28: =============================================================================== 28: All tests passed (8 assertions in 1 test case) 28: 29: Filters: "happy-path-no-presolve-fix-continuous" 29: Randomness seeded to: 3891771916 29: =============================================================================== 29: All tests passed (2 assertions in 1 test case) 29: 28/287 Test #27: unit-test-dual-fix-infinity ................................................................ Passed 0.06 sec 29/287 Test #28: unit-test-happy-path-presolve-fix-continuous ............................................... Passed 0.05 sec test 31 Start 31: unit-test-happy-path-implied-integer-detection 31: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-implied-integer-detection" 31: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 31: Test timeout computed to be: 10000000 test 32 Start 32: unit-test-parallel-row-unchanged 32: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-unchanged" 32: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 32: Test timeout computed to be: 10000000 30: Filters: "happy-path-test-free-variable-detection" 30: Randomness seeded to: 3553166802 30: =============================================================================== 30: All tests passed (11 assertions in 1 test case) 30: 30/287 Test #29: unit-test-happy-path-no-presolve-fix-continuous ............................................ Passed 0.06 sec 31/287 Test #30: unit-test-happy-path-test-free-variable-detection .......................................... Passed 0.05 sec 31: Filters: "happy-path-implied-integer-detection" 31: Randomness seeded to: 2317858127 31: =============================================================================== 31: All tests passed (5 assertions in 1 test case) 31: test 33 Start 33: unit-test-parallel-row-two-equations-infeasible-second-row-dominant 33: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-two-equations-infeasible-second-row-dominant" 33: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 33: Test timeout computed to be: 10000000 test 34 Start 34: unit-test-parallel-row-two-equations-infeasible-first-row-dominant 34: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-two-equations-infeasible-first-row-dominant" 34: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 34: Test timeout computed to be: 10000000 32: Filters: "parallel-row-unchanged" 32: Randomness seeded to: 1147147108 32: =============================================================================== 32: All tests passed (1 assertion in 1 test case) 32: 32/287 Test #31: unit-test-happy-path-implied-integer-detection ............................................. Passed 0.05 sec 33/287 Test #32: unit-test-parallel-row-unchanged ........................................................... Passed 0.04 sec 33: Filters: "parallel-row-two-equations-infeasible-second-row-dominant" 33: Randomness seeded to: 2797450056 33: =============================================================================== 33: All tests passed (1 assertion in 1 test case) 33: test 35 Start 35: unit-test-parallel-row-two-equations-feasible-second-row-dominant 35: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-two-equations-feasible-second-row-dominant" 35: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 35: Test timeout computed to be: 10000000 test 36 Start 36: unit-test-parallel-row-two-equations-feasible-first-row-dominant 36: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-two-equations-feasible-first-row-dominant" 36: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 36: Test timeout computed to be: 10000000 34: Filters: "parallel-row-two-equations-infeasible-first-row-dominant" 34: Randomness seeded to: 2217256180 34: =============================================================================== 34: All tests passed (1 assertion in 1 test case) 34: 34/287 Test #33: unit-test-parallel-row-two-equations-infeasible-second-row-dominant ........................ Passed 0.06 sec 35/287 Test #34: unit-test-parallel-row-two-equations-infeasible-first-row-dominant ......................... Passed 0.04 sec test 37 Start 37: unit-test-parallel-row-two-inequalities-redundant-row-second-row-dominant 37: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-two-inequalities-redundant-row-second-row-dominant" 37: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 37: Test timeout computed to be: 10000000 test 38 Start 38: unit-test-parallel-row-two-inequalities-redundant-row-first-row-dominant 38: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-two-inequalities-redundant-row-first-row-dominant" 38: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 38: Test timeout computed to be: 10000000 35: Filters: "parallel-row-two-equations-feasible-second-row-dominant" 35: Randomness seeded to: 721600012 35: =============================================================================== 35: All tests passed (11 assertions in 1 test case) 35: 36: Filters: "parallel-row-two-equations-feasible-first-row-dominant" 36: Randomness seeded to: 1160029692 36: =============================================================================== 36: All tests passed (11 assertions in 1 test case) 36: 36/287 Test #35: unit-test-parallel-row-two-equations-feasible-second-row-dominant .......................... Passed 0.06 sec 37/287 Test #36: unit-test-parallel-row-two-equations-feasible-first-row-dominant ........................... Passed 0.04 sec 37: Filters: "parallel-row-two-inequalities-redundant-row-second-row-dominant" 37: Randomness seeded to: 1287088494 37: =============================================================================== 37: All tests passed (11 assertions in 1 test case) 37: test 39 Start 39: unit-test-parallel-row-two-inequalities-tighten-lower-bound-second-row-dominant 39: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-two-inequalities-tighten-lower-bound-second-row-dominant" 39: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 39: Test timeout computed to be: 10000000 test 40 Start 40: unit-test-parallel-row-two-inequalities-tighten-lower-bound-first-row-dominant 40: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-two-inequalities-tighten-lower-bound-first-row-dominant" 40: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 40: Test timeout computed to be: 10000000 38: Filters: "parallel-row-two-inequalities-redundant-row-first-row-dominant" 38: Randomness seeded to: 3284712785 38: =============================================================================== 38: All tests passed (11 assertions in 1 test case) 38: 39: Filters: "parallel-row-two-inequalities-tighten-lower-bound-second-row-dominant" 39: Randomness seeded to: 1263294034 39: =============================================================================== 39: All tests passed (17 assertions in 1 test case) 39: 38/287 Test #37: unit-test-parallel-row-two-inequalities-redundant-row-second-row-dominant .................. Passed 0.06 sec 39/287 Test #38: unit-test-parallel-row-two-inequalities-redundant-row-first-row-dominant ................... Passed 0.05 sec test 41 Start 41: unit-test-parallel-row-two-inequalities-tighten-upper-bound-second-row-dominant 41: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-two-inequalities-tighten-upper-bound-second-row-dominant" 41: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 41: Test timeout computed to be: 10000000 test 42 Start 42: unit-test-parallel-row-two-inequalities-tighten-upper-bound-first-row-dominant 42: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-two-inequalities-tighten-upper-bound-first-row-dominant" 42: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 42: Test timeout computed to be: 10000000 40: Filters: "parallel-row-two-inequalities-tighten-lower-bound-first-row-dominant" 40: Randomness seeded to: 1708668446 40: =============================================================================== 40: All tests passed (17 assertions in 1 test case) 40: 41: Filters: "parallel-row-two-inequalities-tighten-upper-bound-second-row-dominant" 41: Randomness seeded to: 3787626927 41: =============================================================================== 41: All tests passed (17 assertions in 1 test case) 41: 40/287 Test #39: unit-test-parallel-row-two-inequalities-tighten-lower-bound-second-row-dominant ............ Passed 0.06 sec 41/287 Test #40: unit-test-parallel-row-two-inequalities-tighten-lower-bound-first-row-dominant ............. Passed 0.05 sec test 43 Start 43: unit-test-parallel-row-two-inequalities-infeasible-first-row-dominant 43: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-two-inequalities-infeasible-first-row-dominant" 43: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 43: Test timeout computed to be: 10000000 test 44 Start 44: unit-test-parallel-row-two-inequalities-infeasible-second-row-dominant 44: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-two-inequalities-infeasible-second-row-dominant" 44: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 44: Test timeout computed to be: 10000000 42: Filters: "parallel-row-two-inequalities-tighten-upper-bound-first-row-dominant" 42: Randomness seeded to: 1192278522 42: =============================================================================== 42: All tests passed (17 assertions in 1 test case) 42: 42/287 Test #41: unit-test-parallel-row-two-inequalities-tighten-upper-bound-second-row-dominant ............ Passed 0.06 sec 43/287 Test #42: unit-test-parallel-row-two-inequalities-tighten-upper-bound-first-row-dominant ............. Passed 0.04 sec 43: Filters: "parallel-row-two-inequalities-infeasible-first-row-dominant" 43: Randomness seeded to: 1514400670 43: =============================================================================== 43: All tests passed (1 assertion in 1 test case) 43: test 45 Start 45: unit-test-parallel-row-two-inequalities-tighten-upper-bound-first-row-negfactor-dominant 45: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-two-inequalities-tighten-upper-bound-first-row-negfactor-dominant" 45: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 45: Test timeout computed to be: 10000000 test 46 Start 46: unit-test-parallel-row-overwrite-inf-first-row-rhs-inf 46: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-overwrite-inf-first-row-rhs-inf" 46: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 46: Test timeout computed to be: 10000000 44: Filters: "parallel-row-two-inequalities-infeasible-second-row-dominant" 44: Randomness seeded to: 2602366346 44: =============================================================================== 44: All tests passed (1 assertion in 1 test case) 44: 44/287 Test #43: unit-test-parallel-row-two-inequalities-infeasible-first-row-dominant ...................... Passed 0.06 sec 45/287 Test #44: unit-test-parallel-row-two-inequalities-infeasible-second-row-dominant ..................... Passed 0.04 sec test 47 Start 47: unit-test-parallel-row-overwrite-inf-first-row-lhs-inf 47: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-overwrite-inf-first-row-lhs-inf" 47: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 47: Test timeout computed to be: 10000000 test 48 Start 48: unit-test-parallel-row-overwrite-inf-first-row-lhs-inf-neg-factor 48: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-overwrite-inf-first-row-lhs-inf-neg-factor" 48: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 48: Test timeout computed to be: 10000000 45: Filters: "parallel-row-two-inequalities-tighten-upper-bound-first-row-negfactor-dominant" 45: Randomness seeded to: 1855141487 45: =============================================================================== 45: All tests passed (17 assertions in 1 test case) 45: 46: Filters: "parallel-row-overwrite-inf-first-row-rhs-inf" 46: Randomness seeded to: 583165075 46: =============================================================================== 46: All tests passed (17 assertions in 1 test case) 46: 46/287 Test #45: unit-test-parallel-row-two-inequalities-tighten-upper-bound-first-row-negfactor-dominant ... Passed 0.05 sec 47/287 Test #46: unit-test-parallel-row-overwrite-inf-first-row-rhs-inf ..................................... Passed 0.04 sec test 49 Start 49: unit-test-parallel-row-mixed-infeasible-first-row-equation 49: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-mixed-infeasible-first-row-equation" 49: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 49: Test timeout computed to be: 10000000 test 50 Start 50: unit-test-parallel-row-best-bound-is-used-for-rhs-coeff-not-1 50: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-best-bound-is-used-for-rhs-coeff-not-1" 50: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 50: Test timeout computed to be: 10000000 47: Filters: "parallel-row-overwrite-inf-first-row-lhs-inf" 47: Randomness seeded to: 3021696798 47: =============================================================================== 47: All tests passed (17 assertions in 1 test case) 47: 48: Filters: "parallel-row-overwrite-inf-first-row-lhs-inf-neg-factor" 48: Randomness seeded to: 3728925088 48: =============================================================================== 48: All tests passed (17 assertions in 1 test case) 48: 49: Filters: "parallel-row-mixed-infeasible-first-row-equation" 49: Randomness seeded to: 1928202562 49: =============================================================================== 49: All tests passed (1 assertion in 1 test case) 49: 48/287 Test #47: unit-test-parallel-row-overwrite-inf-first-row-lhs-inf ..................................... Passed 0.06 sec 49/287 Test #48: unit-test-parallel-row-overwrite-inf-first-row-lhs-inf-neg-factor .......................... Passed 0.05 sec test 51 Start 51: unit-test-parallel-row-best-bound-is-used-for-rhs-coeff 51: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-best-bound-is-used-for-rhs-coeff" 51: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 51: Test timeout computed to be: 10000000 test 52 Start 52: unit-test-parallel-row-mixed-second-row-equation 52: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-mixed-second-row-equation" 52: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 52: Test timeout computed to be: 10000000 50: Filters: "parallel-row-best-bound-is-used-for-rhs-coeff-not-1" 50: Randomness seeded to: 3196086871 50: =============================================================================== 50: All tests passed (21 assertions in 1 test case) 50: 50/287 Test #49: unit-test-parallel-row-mixed-infeasible-first-row-equation ................................. Passed 0.06 sec 51/287 Test #50: unit-test-parallel-row-best-bound-is-used-for-rhs-coeff-not-1 .............................. Passed 0.04 sec test 53 Start 53: unit-test-parallel-row-mixed-infeasible-second-row-equation 53: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-mixed-infeasible-second-row-equation" 53: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 53: Test timeout computed to be: 10000000 test 54 Start 54: unit-test-parallel-row-multiple-parallel-rows 54: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-multiple-parallel-rows" 54: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 54: Test timeout computed to be: 10000000 51: Filters: "parallel-row-best-bound-is-used-for-rhs-coeff" 51: Randomness seeded to: 4112702459 51: =============================================================================== 51: All tests passed (21 assertions in 1 test case) 51: 52: Filters: "parallel-row-mixed-second-row-equation" 52: Randomness seeded to: 2051577005 52: =============================================================================== 52: All tests passed (11 assertions in 1 test case) 52: 52/287 Test #51: unit-test-parallel-row-best-bound-is-used-for-rhs-coeff .................................... Passed 0.05 sec 53/287 Test #52: unit-test-parallel-row-mixed-second-row-equation ........................................... Passed 0.04 sec 53: Filters: "parallel-row-mixed-infeasible-second-row-equation" 53: Randomness seeded to: 828751242 53: =============================================================================== 53: All tests passed (1 assertion in 1 test case) 53: test 55 Start 55: unit-test-parallel-row-two-identical-equations 55: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel-row-two-identical-equations" 55: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 55: Test timeout computed to be: 10000000 test 56 Start 56: unit-test-parallel_col_detection_2_integer_columns 56: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel_col_detection_2_integer_columns" 56: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 56: Test timeout computed to be: 10000000 54: Filters: "parallel-row-multiple-parallel-rows" 54: Randomness seeded to: 3064992464 54: =============================================================================== 54: All tests passed (23 assertions in 1 test case) 54: 55: Filters: "parallel-row-two-identical-equations" 55: Randomness seeded to: 1130438893 55: =============================================================================== 55: All tests passed (11 assertions in 1 test case) 55: 54/287 Test #53: unit-test-parallel-row-mixed-infeasible-second-row-equation ................................ Passed 0.06 sec 55/287 Test #54: unit-test-parallel-row-multiple-parallel-rows .............................................. Passed 0.04 sec test 57 Start 57: unit-test-parallel_col_detection_2_continuous_columns 57: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel_col_detection_2_continuous_columns" 57: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 57: Test timeout computed to be: 10000000 test 58 Start 58: unit-test-parallel_col_detection_int_cont_merge_possible 58: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel_col_detection_int_cont_merge_possible" 58: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 58: Test timeout computed to be: 10000000 56: Filters: "parallel_col_detection_2_integer_columns" 56: Randomness seeded to: 3371242350 56: =============================================================================== 56: All tests passed (11 assertions in 1 test case) 56: 56/287 Test #55: unit-test-parallel-row-two-identical-equations ............................................. Passed 0.06 sec 57/287 Test #56: unit-test-parallel_col_detection_2_integer_columns ......................................... Passed 0.04 sec 57: Filters: "parallel_col_detection_2_continuous_columns" 57: Randomness seeded to: 3757988441 57: =============================================================================== 57: All tests passed (11 assertions in 1 test case) 57: test 59 Start 59: unit-test-parallel_col_detection_cont_int_merge_possible 59: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel_col_detection_cont_int_merge_possible" 59: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 59: Test timeout computed to be: 10000000 test 60 Start 60: unit-test-parallel_col_detection_cont_int_merge_failed 60: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel_col_detection_cont_int_merge_failed" 60: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 60: Test timeout computed to be: 10000000 58: Filters: "parallel_col_detection_int_cont_merge_possible" 58: Randomness seeded to: 2539541218 58: =============================================================================== 58: All tests passed (14 assertions in 1 test case) 58: 58/287 Test #57: unit-test-parallel_col_detection_2_continuous_columns ...................................... Passed 0.05 sec 59/287 Test #58: unit-test-parallel_col_detection_int_cont_merge_possible ................................... Passed 0.04 sec 59: Filters: "parallel_col_detection_cont_int_merge_possible" 59: Randomness seeded to: 1516996314 59: =============================================================================== 59: All tests passed (14 assertions in 1 test case) 59: test 61 Start 61: unit-test-parallel_col_detection_int_cont_merge_failed 61: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel_col_detection_int_cont_merge_failed" 61: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 61: Test timeout computed to be: 10000000 test 62 Start 62: unit-test-parallel_col_detection_int_merge_failed_hole 62: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel_col_detection_int_merge_failed_hole" 62: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 62: Test timeout computed to be: 10000000 60: Filters: "parallel_col_detection_cont_int_merge_failed" 60: Randomness seeded to: 472707076 60: =============================================================================== 60: All tests passed (1 assertion in 1 test case) 60: 61: Filters: "parallel_col_detection_int_cont_merge_failed" 61: Randomness seeded to: 911107281 61: =============================================================================== 61: All tests passed (1 assertion in 1 test case) 61: 60/287 Test #59: unit-test-parallel_col_detection_cont_int_merge_possible ................................... Passed 0.06 sec 61/287 Test #60: unit-test-parallel_col_detection_cont_int_merge_failed ..................................... Passed 0.04 sec test 63 Start 63: unit-test-parallel_col_detection_obj_not_parallel 63: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel_col_detection_obj_not_parallel" 63: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 63: Test timeout computed to be: 10000000 test 64 Start 64: unit-test-parallel_col_detection_multiple_parallel_columns 64: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel_col_detection_multiple_parallel_columns" 64: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 64: Test timeout computed to be: 10000000 62: Filters: "parallel_col_detection_int_merge_failed_hole" 62: Randomness seeded to: 121028202 62: =============================================================================== 62: All tests passed (1 assertion in 1 test case) 62: 63: Filters: "parallel_col_detection_obj_not_parallel" 63: Randomness seeded to: 3025588951 63: =============================================================================== 63: All tests passed (1 assertion in 1 test case) 63: 62/287 Test #61: unit-test-parallel_col_detection_int_cont_merge_failed ..................................... Passed 0.07 sec 63/287 Test #62: unit-test-parallel_col_detection_int_merge_failed_hole ..................................... Passed 0.05 sec test 65 Start 65: unit-test-parallel_col_detection_objective_zero 65: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "parallel_col_detection_objective_zero" 65: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 65: Test timeout computed to be: 10000000 test 66 Start 66: unit-test-happy-path-probing 66: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-probing" 66: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 66: Test timeout computed to be: 10000000 64: Filters: "parallel_col_detection_multiple_parallel_columns" 64: Randomness seeded to: 4060418625 64: =============================================================================== 64: All tests passed (43 assertions in 1 test case) 64: 65: Filters: "parallel_col_detection_objective_zero" 65: Randomness seeded to: 2377606662 65: =============================================================================== 65: All tests passed (11 assertions in 1 test case) 65: 64/287 Test #63: unit-test-parallel_col_detection_obj_not_parallel .......................................... Passed 0.06 sec 65/287 Test #64: unit-test-parallel_col_detection_multiple_parallel_columns ................................. Passed 0.05 sec test 67 Start 67: unit-test-failed-path-probing-on-not-binary-variables 67: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "failed-path-probing-on-not-binary-variables" 67: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 67: Test timeout computed to be: 10000000 test 68 Start 68: unit-test-happy-path-singleton-column 68: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-singleton-column" 68: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 68: Test timeout computed to be: 10000000 66: Filters: "happy-path-probing" 66: Randomness seeded to: 3462766488 66: =============================================================================== 66: All tests passed (5 assertions in 1 test case) 66: 66/287 Test #65: unit-test-parallel_col_detection_objective_zero ............................................ Passed 0.05 sec 67/287 Test #66: unit-test-happy-path-probing ............................................................... Passed 0.04 sec 67: Filters: "failed-path-probing-on-not-binary-variables" 67: Randomness seeded to: 493144380 67: =============================================================================== 67: All tests passed (1 assertion in 1 test case) 67: test 69 Start 69: unit-test-happy-path-singleton-column-equation 69: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-singleton-column-equation" 69: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 69: Test timeout computed to be: 10000000 test 70 Start 70: unit-test-happy-path-singleton-column-implied-bounds-negative-coeff-pos-bounds 70: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-singleton-column-implied-bounds-negative-coeff-pos-bounds" 70: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 70: Test timeout computed to be: 10000000 68: Filters: "happy-path-singleton-column" 68: Randomness seeded to: 2216319713 68: =============================================================================== 68: All tests passed (17 assertions in 1 test case) 68: 69: Filters: "happy-path-singleton-column-equation" 69: Randomness seeded to: 212241634 69: =============================================================================== 69: All tests passed (26 assertions in 1 test case) 69: 68/287 Test #67: unit-test-failed-path-probing-on-not-binary-variables ...................................... Passed 0.06 sec 69/287 Test #68: unit-test-happy-path-singleton-column ...................................................... Passed 0.04 sec 70/287 Test #69: unit-test-happy-path-singleton-column-equation ............................................. Passed 0.03 sec test 71 Start 71: unit-test-happy-path-singleton-column-implied-bounds-negative-coeff-neg-bounds 71: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-singleton-column-implied-bounds-negative-coeff-neg-bounds" 71: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 71: Test timeout computed to be: 10000000 test 72 Start 72: unit-test-happy-path-singleton-column-implied-bounds-positive-coeff-pos-bounds 72: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-singleton-column-implied-bounds-positive-coeff-pos-bounds" 72: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 72: Test timeout computed to be: 10000000 test 73 Start 73: unit-test-happy-path-singleton-column-implied-bounds-positive-coeff-neg-bounds 73: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-singleton-column-implied-bounds-positive-coeff-neg-bounds" 73: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 73: Test timeout computed to be: 10000000 70: Filters: "happy-path-singleton-column-implied-bounds-negative-coeff-pos-bounds" 70: Randomness seeded to: 357121760 70: =============================================================================== 70: All tests passed (20 assertions in 1 test case) 70: 71/287 Test #70: unit-test-happy-path-singleton-column-implied-bounds-negative-coeff-pos-bounds ............. Passed 0.07 sec 71: Filters: "happy-path-singleton-column-implied-bounds-negative-coeff-neg-bounds" 71: Randomness seeded to: 1224040525 71: =============================================================================== 71: All tests passed (20 assertions in 1 test case) 71: test 74 Start 74: unit-test-singleton-stuffing-make-sure-to-first-set-bounds-to-infinity 74: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "singleton-stuffing-make-sure-to-first-set-bounds-to-infinity" 74: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 74: Test timeout computed to be: 10000000 72: Filters: "happy-path-singleton-column-implied-bounds-positive-coeff-pos-bounds" 72: Randomness seeded to: 1564183267 72: =============================================================================== 72: All tests passed (20 assertions in 1 test case) 72: 72/287 Test #71: unit-test-happy-path-singleton-column-implied-bounds-negative-coeff-neg-bounds ............. Passed 0.06 sec test 75 Start 75: unit-test-simple-probing-trivial-example 75: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simple-probing-trivial-example" 75: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 75: Test timeout computed to be: 10000000 73/287 Test #72: unit-test-happy-path-singleton-column-implied-bounds-positive-coeff-pos-bounds ............. Passed 0.06 sec 73: Filters: "happy-path-singleton-column-implied-bounds-positive-coeff-neg-bounds" 73: Randomness seeded to: 1750343591 73: =============================================================================== 73: All tests passed (20 assertions in 1 test case) 73: test 76 Start 76: unit-test-simple-probing-negative-binary-coeff 76: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simple-probing-negative-binary-coeff" 76: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 76: Test timeout computed to be: 10000000 74: Filters: "singleton-stuffing-make-sure-to-first-set-bounds-to-infinity" 74: Randomness seeded to: 2415278988 74: =============================================================================== 74: All tests passed (23 assertions in 1 test case) 74: 74/287 Test #73: unit-test-happy-path-singleton-column-implied-bounds-positive-coeff-neg-bounds ............. Passed 0.06 sec test 77 Start 77: unit-test-simple-probing-positive-binary-coeff 77: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simple-probing-positive-binary-coeff" 77: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 77: Test timeout computed to be: 10000000 75/287 Test #74: unit-test-singleton-stuffing-make-sure-to-first-set-bounds-to-infinity ..................... Passed 0.07 sec 75: Filters: "simple-probing-trivial-example" 75: Randomness seeded to: 1866331293 75: =============================================================================== 75: All tests passed (14 assertions in 1 test case) 75: test 78 Start 78: unit-test-simple-different-int-coeff 78: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simple-different-int-coeff" 78: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 78: Test timeout computed to be: 10000000 76: Filters: "simple-probing-negative-binary-coeff" 76: Randomness seeded to: 2314992000 76: =============================================================================== 76: All tests passed (20 assertions in 1 test case) 76: 76/287 Test #75: unit-test-simple-probing-trivial-example ................................................... Passed 0.06 sec test 79 Start 79: unit-test-simple-different-int-coeff-pt2 79: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simple-different-int-coeff-pt2" 79: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 79: Test timeout computed to be: 10000000 77/287 Test #76: unit-test-simple-probing-negative-binary-coeff ............................................. Passed 0.07 sec 77: Filters: "simple-probing-positive-binary-coeff" 77: Randomness seeded to: 328967115 77: =============================================================================== 77: All tests passed (20 assertions in 1 test case) 77: test 80 Start 80: unit-test-simple-substitution-happy-path-for-2-int 80: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simple-substitution-happy-path-for-2-int" 80: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 80: Test timeout computed to be: 10000000 78: Filters: "simple-different-int-coeff" 78: Randomness seeded to: 3616634958 78: =============================================================================== 78: All tests passed (20 assertions in 1 test case) 78: 78/287 Test #77: unit-test-simple-probing-positive-binary-coeff ............................................. Passed 0.07 sec 79/287 Test #78: unit-test-simple-different-int-coeff ....................................................... Passed 0.05 sec test 81 Start 81: unit-test-simple-substitution-happy-path-for-2-continuous 81: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simple-substitution-happy-path-for-2-continuous" 81: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 81: Test timeout computed to be: 10000000 test 82 Start 82: unit-test-simple-substitution-happy-path-for-continuous-and-integer 82: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simple-substitution-happy-path-for-continuous-and-integer" 82: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 82: Test timeout computed to be: 10000000 79: Filters: "simple-different-int-coeff-pt2" 79: Randomness seeded to: 1165829764 79: =============================================================================== 79: All tests passed (20 assertions in 1 test case) 79: 80/287 Test #79: unit-test-simple-different-int-coeff-pt2 ................................................... Passed 0.08 sec test 83 Start 83: unit-test-simple-substitution-happy-path-for-int-continuous-coeff 83: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simple-substitution-happy-path-for-int-continuous-coeff" 83: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 83: Test timeout computed to be: 10000000 80: Filters: "simple-substitution-happy-path-for-2-int" 80: Randomness seeded to: 1361822409 80: =============================================================================== 80: All tests passed (17 assertions in 1 test case) 80: 81/287 Test #80: unit-test-simple-substitution-happy-path-for-2-int ......................................... Passed 0.08 sec 81: Filters: "simple-substitution-happy-path-for-2-continuous" 81: Randomness seeded to: 272992549 81: =============================================================================== 81: All tests passed (11 assertions in 1 test case) 81: test 84 Start 84: unit-test-simple-substitution-should_return_feasible_if_gcd_of_coeff_is_in_rhs 84: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simple-substitution-should_return_feasible_if_gcd_of_coeff_is_in_rhs" 84: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 84: Test timeout computed to be: 10000000 82: Filters: "simple-substitution-happy-path-for-continuous-and-integer" 82: Randomness seeded to: 576173802 82: =============================================================================== 82: All tests passed (11 assertions in 1 test case) 82: 82/287 Test #81: unit-test-simple-substitution-happy-path-for-2-continuous .................................. Passed 0.08 sec test 85 Start 85: unit-test-simple-substitution-should_return_infeasible_if_gcd_of_coeff_is_in_rhs 85: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simple-substitution-should_return_infeasible_if_gcd_of_coeff_is_in_rhs" 85: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 85: Test timeout computed to be: 10000000 83/287 Test #82: unit-test-simple-substitution-happy-path-for-continuous-and-integer ........................ Passed 0.07 sec 83: Filters: "simple-substitution-happy-path-for-int-continuous-coeff" 83: Randomness seeded to: 1174194573 83: =============================================================================== 83: All tests passed (1 assertion in 1 test case) 83: 84/287 Test #83: unit-test-simple-substitution-happy-path-for-int-continuous-coeff .......................... Passed 0.05 sec test 86 Start 86: unit-test-simple-substitution-simple-substitution-for-2-int 86: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simple-substitution-simple-substitution-for-2-int" 86: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 86: Test timeout computed to be: 10000000 test 87 Start 87: unit-test-simple-substitution-2-negative-integer 87: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simple-substitution-2-negative-integer" 87: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 87: Test timeout computed to be: 10000000 84: Filters: "simple-substitution-should_return_feasible_if_gcd_of_coeff_is_in_rhs" 84: Randomness seeded to: 3993522573 84: =============================================================================== 84: All tests passed (1 assertion in 1 test case) 84: 85: Filters: "simple-substitution-should_return_infeasible_if_gcd_of_coeff_is_in_rhs" 85: Randomness seeded to: 3518764633 85: =============================================================================== 85: All tests passed (1 assertion in 1 test case) 85: 85/287 Test #84: unit-test-simple-substitution-should_return_feasible_if_gcd_of_coeff_is_in_rhs ............. Passed 0.06 sec 86/287 Test #85: unit-test-simple-substitution-should_return_infeasible_if_gcd_of_coeff_is_in_rhs ........... Passed 0.05 sec 86: Filters: "simple-substitution-simple-substitution-for-2-int" 86: Randomness seeded to: 3174024646 86: =============================================================================== 86: All tests passed (1 assertion in 1 test case) 86: test 88 Start 88: unit-test-simple-substitution-feasible-gcd 88: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simple-substitution-feasible-gcd" 88: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 88: Test timeout computed to be: 10000000 test 89 Start 89: unit-test-simple-substitution-non-coprime 89: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simple-substitution-non-coprime" 89: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 89: Test timeout computed to be: 10000000 87: Filters: "simple-substitution-2-negative-integer" 87: Randomness seeded to: 503076255 87: =============================================================================== 87: All tests passed (1 assertion in 1 test case) 87: 88: Filters: "simple-substitution-feasible-gcd" 88: Randomness seeded to: 2524692557 88: =============================================================================== 88: All tests passed (5 assertions in 1 test case) 88: 87/287 Test #86: unit-test-simple-substitution-simple-substitution-for-2-int ................................ Passed 0.07 sec 88/287 Test #87: unit-test-simple-substitution-2-negative-integer ........................................... Passed 0.05 sec test 90 Start 90: unit-test-simple-substitution-violated-gcd 90: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simple-substitution-violated-gcd" 90: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 90: Test timeout computed to be: 10000000 test 91 Start 91: unit-test-happy-path-simplify-inequalities 91: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-simplify-inequalities" 91: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 91: Test timeout computed to be: 10000000 89: Filters: "simple-substitution-non-coprime" 89: Randomness seeded to: 2200105647 89: =============================================================================== 89: All tests passed (2 assertions in 1 test case) 89: 90: Filters: "simple-substitution-violated-gcd" 90: Randomness seeded to: 924407983 90: =============================================================================== 90: All tests passed (2 assertions in 1 test case) 90: 89/287 Test #88: unit-test-simple-substitution-feasible-gcd ................................................. Passed 0.07 sec 90/287 Test #89: unit-test-simple-substitution-non-coprime .................................................. Passed 0.05 sec 91: Filters: "happy-path-simplify-inequalities" 91: Randomness seeded to: 571750047 91: =============================================================================== 91: All tests passed (20 assertions in 1 test case) 91: test 92 Start 92: unit-test-simplify_inequ_doesnt_lock_more_rows 92: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simplify_inequ_doesnt_lock_more_rows" 92: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 92: Test timeout computed to be: 10000000 test 93 Start 93: unit-test-simplify_inequ_doesnt_apply_lb_and_ub_on_one_row 93: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "simplify_inequ_doesnt_apply_lb_and_ub_on_one_row" 93: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 93: Test timeout computed to be: 10000000 92: Filters: "simplify_inequ_doesnt_lock_more_rows" 92: Randomness seeded to: 2882077961 92: =============================================================================== 92: All tests passed (3 assertions in 1 test case) 92: 91/287 Test #90: unit-test-simple-substitution-violated-gcd ................................................. Passed 0.06 sec 92/287 Test #91: unit-test-happy-path-simplify-inequalities ................................................. Passed 0.04 sec 93/287 Test #92: unit-test-simplify_inequ_doesnt_lock_more_rows ............................................. Passed 0.03 sec test 94 Start 94: unit-test-happy-path-sparsify 94: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-sparsify" 94: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 94: Test timeout computed to be: 10000000 test 95 Start 95: unit-test-happy-path-sparsify-two-equalities 95: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "happy-path-sparsify-two-equalities" 95: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 95: Test timeout computed to be: 10000000 test 96 Start 96: unit-test-failed-path-sparsify-if-misses-one-for-integer 96: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "failed-path-sparsify-if-misses-one-for-integer" 96: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 96: Test timeout computed to be: 10000000 93: Filters: "simplify_inequ_doesnt_apply_lb_and_ub_on_one_row" 93: Randomness seeded to: 2987071567 93: =============================================================================== 93: All tests passed (1 assertion in 1 test case) 93: 94: Filters: "happy-path-sparsify" 94: Randomness seeded to: 905406144 94: =============================================================================== 94: All tests passed (11 assertions in 1 test case) 94: 95: Filters: "happy-path-sparsify-two-equalities" 95: Randomness seeded to: 3147942374 95: =============================================================================== 95: All tests passed (20 assertions in 1 test case) 95: 94/287 Test #93: unit-test-simplify_inequ_doesnt_apply_lb_and_ub_on_one_row ................................. Passed 0.07 sec 95/287 Test #94: unit-test-happy-path-sparsify .............................................................. Passed 0.05 sec 96/287 Test #95: unit-test-happy-path-sparsify-two-equalities ............................................... Passed 0.04 sec test 97 Start 97: unit-test-mps-parser-loading-simple-problem 97: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test/unit_test "mps-parser-loading-simple-problem" 97: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 97: Test timeout computed to be: 10000000 test 99 Start 99: d-solve-adlittle.mps-lp_presolvers_with_basis.set 99: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/adlittle.mps" "-o" "0.22549496316238038228101176621492e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 99: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 99: Test timeout computed to be: 10000000 test 100 Start 100: q-solve-adlittle.mps-lp_presolvers_with_basis.set 100: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/adlittle.mps" "-o" "0.22549496316238038228101176621492e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 100: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 100: Test timeout computed to be: 10000000 96: Filters: "failed-path-sparsify-if-misses-one-for-integer" 96: Randomness seeded to: 3836888186 96: =============================================================================== 96: All tests passed (1 assertion in 1 test case) 96: 97: Filters: "mps-parser-loading-simple-problem" 97: Randomness seeded to: 2490625924 97: =============================================================================== 97: All tests passed (3 assertions in 1 test case) 97: 97/287 Test #96: unit-test-failed-path-sparsify-if-misses-one-for-integer ................................... Passed 0.05 sec test 101 Start 101: r-solve-adlittle.mps-lp_presolvers_with_basis.set 101: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/adlittle.mps" "-o" "0.22549496316238038228101176621492e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 101: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 101: Test timeout computed to be: 10000000 98/287 Test #97: unit-test-mps-parser-loading-simple-problem ................................................ Passed 0.05 sec test 102 Start 102: d-solve-afiro.mps-lp_presolvers_with_basis.set 102: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/afiro.mps" "-o" "-0.46475314285714285714285714285714e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 102: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 102: Test timeout computed to be: 10000000 99: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 99: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 99: 99: External libraries: 99: Boost 1.83.0 (https://www.boost.org/) 99: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 99: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 99: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 99: 99: reading took 0.00478 seconds 99: Numerical Statistics: 99: Matrix range [1e-02,6e+01] 99: Objective range [2e+00,3e+03] 99: Bounds range [0e+00,0e+00] 99: RHS range [2e+00,2e+03] 99: Dynamism Variables: 2e+03 99: Dynamism Rows : 8e+02 99: set presolve.componentsmaxint = -1 99: set presolve.detectlindep = 0 99: set doubletoneq.enabled = 0 99: set dualinfer.enabled = 0 99: set substitution.enabled = 0 99: set sparsify.enabled = 0 99: 99: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/adlittle.mps with dual-postsolve activated 99: rows: 56 99: columns: 97 99: int. columns: 0 99: cont. columns: 97 99: nonzeros: 383 99: 99: round 0 ( Trivial ): 2 del cols, 3 del rows, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 99: round 1 ( Fast ): 2 del cols, 3 del rows, 90 chg bounds, 0 chg sides, 0 chg coeffs, 194 tsx applied, 0 tsx conflicts 99: round 2 ( Fast ): 2 del cols, 3 del rows, 106 chg bounds, 0 chg sides, 0 chg coeffs, 232 tsx applied, 0 tsx conflicts 99: round 3 ( Medium ): 3 del cols, 3 del rows, 110 chg bounds, 1 chg sides, 1 chg coeffs, 242 tsx applied, 2 tsx conflicts 99: round 4 (Exhaustive): 3 del cols, 3 del rows, 110 chg bounds, 1 chg sides, 1 chg coeffs, 242 tsx applied, 2 tsx conflicts 99: round 5 ( Final ): Unchanged 99: presolved 5 rounds: 3 del cols, 3 del rows, 110 chg bounds, 1 chg sides, 1 chg coeffs, 242 tsx applied, 2 tsx conflicts 99: 99: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 99: colsingleton 5 0.0 0 0.0 0.000 99: coefftightening 0 0.0 0 0.0 0.000 99: propagation 5 60.0 240 100.0 0.000 99: fixcontinuous 2 0.0 0 0.0 0.000 99: simpleprobing 0 0.0 0 0.0 0.000 99: parallelrows 1 0.0 0 0.0 0.000 99: parallelcols 1 0.0 0 0.0 0.000 99: stuffing 2 50.0 3 33.3 0.000 99: dualfix 2 50.0 1 100.0 0.000 99: simplifyineq 0 0.0 0 0.0 0.000 99: doubletoneq 0 0.0 0 0.0 0.000 99: implint 0 0.0 0 0.0 0.000 99: domcol 1 0.0 0 0.0 0.000 99: dualinfer 0 0.0 0 0.0 0.000 99: probing 0 0.0 0 0.0 0.000 99: substitution 0 0.0 0 0.0 0.000 99: sparsify 0 0.0 0 0.0 0.000 99: 99: reduced problem: 99: reduced rows: 53 99: reduced columns: 94 99: reduced int. columns: 0 99: reduced cont. columns: 94 99: reduced nonzeros: 372 99: 99: presolving finished after 0.002 seconds 99: 99: Equilibrium scaling LP (persistent) 99: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 99: Reduced LP has 53 rows 94 columns 372 nonzeros 99: Equilibrium scaling LP 99: type | time | iters | facts | shift | viol sum | viol num | obj value 99: L | 0.0 | 0 | 3 | 0.00e+00 | 1.35e+03 | 26 | -5.17875028e+05 99: L | 0.0 | 121 | 5 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 99: --- unscaling internal solution 99: --- unsimplifying solution and basis 99: --- unscaling external solution 99: --- verifying computed solution 99: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 99: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 99: --- unscaling external solution 99: --- verifying computed solution 99: 99: SoPlex status : problem is solved [optimal] 99: Solving time (sec) : 0.00 99: Iterations : 121 99: Objective value : 2.25494963e+05 99: 99: Solution passed validation 99: 99: postsolve finished after 0.002 seconds 99: feasible: true 99: objective value: 225494.96316238 99: 99: violations: 99: bounds: 0 99: constraints: 0 99: integrality: 0 99: 99: validation: SUCCESS 99: Solving time 0.021 seconds 99: 99: solving finished after 0.021 seconds 100: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 100: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 100: 100: External libraries: 100: Boost 1.83.0 (https://www.boost.org/) 100: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 100: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 100: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 100: 100: reading took 0.00788 seconds 100: Numerical Statistics: 100: Matrix range [1e-02,6e+01] 100: Objective range [2e+00,3e+03] 100: Bounds range [0e+00,0e+00] 100: RHS range [2e+00,2e+03] 100: Dynamism Variables: 2e+03 100: Dynamism Rows : 8e+02 100: set presolve.componentsmaxint = -1 100: set presolve.detectlindep = 0 100: set doubletoneq.enabled = 0 100: set dualinfer.enabled = 0 100: set substitution.enabled = 0 100: set sparsify.enabled = 0 100: 100: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/adlittle.mps with dual-postsolve activated 100: rows: 56 100: columns: 97 100: int. columns: 0 100: cont. columns: 97 100: nonzeros: 383 100: 100: round 0 ( Trivial ): 2 del cols, 3 del rows, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 100: round 1 ( Fast ): 2 del cols, 3 del rows, 90 chg bounds, 0 chg sides, 0 chg coeffs, 194 tsx applied, 0 tsx conflicts 100: round 2 ( Fast ): 2 del cols, 3 del rows, 106 chg bounds, 0 chg sides, 0 chg coeffs, 232 tsx applied, 0 tsx conflicts 100: round 3 ( Medium ): 3 del cols, 3 del rows, 110 chg bounds, 1 chg sides, 1 chg coeffs, 242 tsx applied, 2 tsx conflicts 100: round 4 (Exhaustive): 3 del cols, 3 del rows, 110 chg bounds, 1 chg sides, 1 chg coeffs, 242 tsx applied, 2 tsx conflicts 100: round 5 ( Final ): Unchanged 100: presolved 5 rounds: 3 del cols, 3 del rows, 110 chg bounds, 1 chg sides, 1 chg coeffs, 242 tsx applied, 2 tsx conflicts 100: 100: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 100: colsingleton 5 0.0 0 0.0 0.000 100: coefftightening 0 0.0 0 0.0 0.000 100: propagation 5 60.0 240 100.0 0.002 100: fixcontinuous 2 0.0 0 0.0 0.000 100: simpleprobing 0 0.0 0 0.0 0.000 100: parallelrows 1 0.0 0 0.0 0.000 100: parallelcols 1 0.0 0 0.0 0.000 100: stuffing 2 50.0 3 33.3 0.000 100: dualfix 2 50.0 1 100.0 0.000 100: simplifyineq 0 0.0 0 0.0 0.000 100: doubletoneq 0 0.0 0 0.0 0.000 100: implint 0 0.0 0 0.0 0.000 100: domcol 1 0.0 0 0.0 0.002 100: dualinfer 0 0.0 0 0.0 0.000 100: probing 0 0.0 0 0.0 0.000 100: substitution 0 0.0 0 0.0 0.000 100: sparsify 0 0.0 0 0.0 0.000 100: 100: reduced problem: 100: reduced rows: 53 100: reduced columns: 94 100: reduced int. columns: 0 100: reduced cont. columns: 94 100: reduced nonzeros: 372 100: 100: presolving finished after 0.025 seconds 100: 100: Equilibrium scaling LP (persistent) 99/287 Test #99: d-solve-adlittle.mps-lp_presolvers_with_basis.set .......................................... Passed 0.09 sec test 103 Start 103: q-solve-afiro.mps-lp_presolvers_with_basis.set 103: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/afiro.mps" "-o" "-0.46475314285714285714285714285714e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 103: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 103: Test timeout computed to be: 10000000 100: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 100: Reduced LP has 53 rows 94 columns 372 nonzeros 100: Equilibrium scaling LP 100: type | time | iters | facts | shift | viol sum | viol num | obj value 100: L | 0.0 | 0 | 3 | 0.00e+00 | 1.35e+03 | 26 | -5.17875028e+05 100: L | 0.0 | 119 | 5 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 100: --- unscaling internal solution 100: --- unsimplifying solution and basis 100: --- unscaling external solution 100: --- verifying computed solution 100: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 100: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 100: --- unscaling external solution 100: --- verifying computed solution 100: 100: SoPlex status : problem is solved [optimal] 100: Solving time (sec) : 0.00 100: Iterations : 119 100: Objective value : 2.25494963e+05 100: 100: Solution passed validation 100: 100: postsolve finished after 0.004 seconds 100: feasible: true 100: objective value: 225494.96316238 100: 100: violations: 100: bounds: 0 100: constraints: 0 100: integrality: 0 100: 100: validation: SUCCESS 100: Solving time 0.044 seconds 100: 100: solving finished after 0.044 seconds 102: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 102: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 102: 102: External libraries: 102: Boost 1.83.0 (https://www.boost.org/) 102: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 102: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 102: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 102: 102: reading took 0.00973 seconds 102: Numerical Statistics: 102: Matrix range [1e-01,2e+00] 102: Objective range [3e-01,1e+01] 102: Bounds range [0e+00,0e+00] 102: RHS range [4e+01,5e+02] 102: Dynamism Variables: 9e+00 102: Dynamism Rows : 9e+00 102: set presolve.componentsmaxint = -1 102: set presolve.detectlindep = 0 102: set doubletoneq.enabled = 0 102: set dualinfer.enabled = 0 102: set substitution.enabled = 0 102: set sparsify.enabled = 0 102: 102: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/afiro.mps with dual-postsolve activated 102: rows: 27 102: columns: 32 102: int. columns: 0 102: cont. columns: 32 102: nonzeros: 83 102: 102: round 0 ( Trivial ): 0 del cols, 2 del rows, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 102: round 1 ( Fast ): 0 del cols, 3 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 22 tsx applied, 0 tsx conflicts 102: round 2 ( Fast ): 0 del cols, 3 del rows, 29 chg bounds, 0 chg sides, 0 chg coeffs, 58 tsx applied, 0 tsx conflicts 102: round 3 ( Medium ): 3 del cols, 5 del rows, 32 chg bounds, 1 chg sides, 1 chg coeffs, 67 tsx applied, 6 tsx conflicts 102: round 4 (Exhaustive): 3 del cols, 5 del rows, 32 chg bounds, 1 chg sides, 1 chg coeffs, 67 tsx applied, 6 tsx conflicts 102: round 5 ( Final ): Unchanged 102: presolved 5 rounds: 3 del cols, 5 del rows, 32 chg bounds, 1 chg sides, 1 chg coeffs, 67 tsx applied, 6 tsx conflicts 102: 102: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 102: colsingleton 5 0.0 0 0.0 0.000 102: coefftightening 0 0.0 0 0.0 0.000 102: propagation 5 60.0 64 100.0 0.000 102: fixcontinuous 2 0.0 0 0.0 0.000 102: simpleprobing 0 0.0 0 0.0 0.000 102: parallelrows 1 0.0 0 0.0 0.004 102: parallelcols 1 0.0 0 0.0 0.000 102: stuffing 2 50.0 9 33.3 0.000 102: dualfix 2 0.0 0 0.0 0.000 102: simplifyineq 0 0.0 0 0.0 0.000 102: doubletoneq 0 0.0 0 0.0 0.000 102: implint 0 0.0 0 0.0 0.000 102: domcol 1 0.0 0 0.0 0.000 102: dualinfer 0 0.0 0 0.0 0.000 102: probing 0 0.0 0 0.0 0.000 102: substitution 0 0.0 0 0.0 0.000 102: sparsify 0 0.0 0 0.0 0.000 102: 102: reduced problem: 102: reduced rows: 22 102: reduced columns: 29 102: reduced int. columns: 0 102: reduced cont. columns: 29 102: reduced nonzeros: 74 102: 102: presolving finished after 0.005 seconds 102: 102: Equilibrium scaling LP (persistent) 102: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 102: Reduced LP has 22 rows 29 columns 74 nonzeros 102: Equilibrium scaling LP 102: type | time | iters | facts | shift | viol sum | viol num | obj value 102: L | 0.0 | 0 | 3 | 0.00e+00 | 7.97e+03 | 11 | -3.36827219e+04 102: L | 0.0 | 9 | 4 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 102: --- unscaling internal solution 102: --- unsimplifying solution and basis 102: --- unscaling external solution 102: --- verifying computed solution 102: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 102: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 102: --- unscaling external solution 102: --- verifying computed solution 102: 102: SoPlex status : problem is solved [optimal] 102: Solving time (sec) : 0.00 102: Iterations : 9 102: Objective value : -4.64753143e+02 102: 102: Solution passed validation 102: 102: postsolve finished after 0.000 seconds 102: feasible: true 102: objective value: -464.753142857143 102: 102: violations: 102: bounds: 0 102: constraints: 0 102: integrality: 0 102: 102: validation: SUCCESS 102: Solving time 0.007 seconds 102: 102: solving finished after 0.007 seconds 100/287 Test #100: q-solve-adlittle.mps-lp_presolvers_with_basis.set .......................................... Passed 0.11 sec 101/287 Test #102: d-solve-afiro.mps-lp_presolvers_with_basis.set ............................................. Passed 0.07 sec test 104 Start 104: r-solve-afiro.mps-lp_presolvers_with_basis.set 104: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/afiro.mps" "-o" "-0.46475314285714285714285714285714e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 104: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 104: Test timeout computed to be: 10000000 test 105 Start 105: d-solve-agg.mps-lp_presolvers_with_basis.set 105: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/agg.mps" "-o" "-0.35991767286576506712640824319636e8" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 105: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 105: Test timeout computed to be: 10000000 101: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 101: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 101: 101: External libraries: 101: Boost 1.83.0 (https://www.boost.org/) 101: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 101: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 101: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 101: 101: reading took 0.00546 seconds 101: Numerical Statistics: 101: Matrix range [1e-02,6e+01] 101: Objective range [2e+00,3e+03] 101: Bounds range [0e+00,0e+00] 101: RHS range [2e+00,2e+03] 101: Dynamism Variables: 2e+03 101: Dynamism Rows : 8e+02 101: set presolve.componentsmaxint = -1 101: set presolve.detectlindep = 0 101: set doubletoneq.enabled = 0 101: set dualinfer.enabled = 0 101: set substitution.enabled = 0 101: set sparsify.enabled = 0 101: 101: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/adlittle.mps with dual-postsolve activated 101: rows: 56 101: columns: 97 101: int. columns: 0 101: cont. columns: 97 101: nonzeros: 383 101: 101: round 0 ( Trivial ): 2 del cols, 3 del rows, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 101: round 1 ( Fast ): 2 del cols, 3 del rows, 90 chg bounds, 0 chg sides, 0 chg coeffs, 194 tsx applied, 0 tsx conflicts 101: round 2 ( Fast ): 2 del cols, 3 del rows, 106 chg bounds, 0 chg sides, 0 chg coeffs, 232 tsx applied, 0 tsx conflicts 101: round 3 ( Medium ): 3 del cols, 3 del rows, 110 chg bounds, 1 chg sides, 1 chg coeffs, 242 tsx applied, 2 tsx conflicts 101: round 4 (Exhaustive): 3 del cols, 3 del rows, 110 chg bounds, 1 chg sides, 1 chg coeffs, 242 tsx applied, 2 tsx conflicts 101: round 5 ( Final ): Unchanged 101: presolved 5 rounds: 3 del cols, 3 del rows, 110 chg bounds, 1 chg sides, 1 chg coeffs, 242 tsx applied, 2 tsx conflicts 101: 101: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 101: colsingleton 5 0.0 0 0.0 0.000 101: coefftightening 0 0.0 0 0.0 0.000 101: propagation 5 60.0 240 100.0 0.010 101: fixcontinuous 2 0.0 0 0.0 0.000 101: simpleprobing 0 0.0 0 0.0 0.000 101: parallelrows 1 0.0 0 0.0 0.001 101: parallelcols 1 0.0 0 0.0 0.001 101: stuffing 2 50.0 3 33.3 0.000 101: dualfix 2 50.0 1 100.0 0.000 101: simplifyineq 0 0.0 0 0.0 0.000 101: doubletoneq 0 0.0 0 0.0 0.000 101: implint 0 0.0 0 0.0 0.000 101: domcol 1 0.0 0 0.0 0.003 101: dualinfer 0 0.0 0 0.0 0.000 101: probing 0 0.0 0 0.0 0.000 101: substitution 0 0.0 0 0.0 0.000 101: sparsify 0 0.0 0 0.0 0.000 101: 101: reduced problem: 101: reduced rows: 53 101: reduced columns: 94 101: reduced int. columns: 0 101: reduced cont. columns: 94 103: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 103: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 103: 103: External libraries: 103: Boost 1.83.0 (https://www.boost.org/) 103: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 103: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 103: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 103: 103: reading took 0.00866 seconds 103: Numerical Statistics: 103: Matrix range [1e-01,2e+00] 103: Objective range [3e-01,1e+01] 103: Bounds range [0e+00,0e+00] 103: RHS range [4e+01,5e+02] 103: Dynamism Variables: 9e+00 103: Dynamism Rows : 9e+00 103: set presolve.componentsmaxint = -1 103: set presolve.detectlindep = 0 103: set doubletoneq.enabled = 0 103: set dualinfer.enabled = 0 103: set substitution.enabled = 0 103: set sparsify.enabled = 0 103: 103: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/afiro.mps with dual-postsolve activated 103: rows: 27 103: columns: 32 103: int. columns: 0 103: cont. columns: 32 103: nonzeros: 83 103: 103: round 0 ( Trivial ): 0 del cols, 2 del rows, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 103: round 1 ( Fast ): 0 del cols, 3 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 22 tsx applied, 0 tsx conflicts 103: round 2 ( Fast ): 0 del cols, 3 del rows, 29 chg bounds, 0 chg sides, 0 chg coeffs, 58 tsx applied, 0 tsx conflicts 103: round 3 ( Medium ): 3 del cols, 5 del rows, 32 chg bounds, 1 chg sides, 1 chg coeffs, 67 tsx applied, 6 tsx conflicts 103: round 4 (Exhaustive): 3 del cols, 5 del rows, 32 chg bounds, 1 chg sides, 1 chg coeffs, 67 tsx applied, 6 tsx conflicts 103: round 5 ( Final ): Unchanged 103: presolved 5 rounds: 3 del cols, 5 del rows, 32 chg bounds, 1 chg sides, 1 chg coeffs, 67 tsx applied, 6 tsx conflicts 103: 103: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 103: colsingleton 5 0.0 0 0.0 0.000 103: coefftightening 0 0.0 0 0.0 0.000 103: propagation 5 60.0 64 100.0 0.002 103: fixcontinuous 2 0.0 0 0.0 0.000 103: simpleprobing 0 0.0 0 0.0 0.000 103: parallelrows 1 0.0 0 0.0 0.000 103: parallelcols 1 0.0 0 0.0 0.000 103: stuffing 2 50.0 9 33.3 0.000 103: dualfix 2 0.0 0 0.0 0.000 103: simplifyineq 0 0.0 0 0.0 0.000 103: doubletoneq 0 0.0 0 0.0 0.000 103: implint 0 0.0 0 0.0 0.000 103: domcol 1 0.0 0 0.0 0.001 103: dualinfer 0 0.0 0 0.0 0.000 103: probing 0 0.0 0 0.0 0.000 103: substitution 0 0.0 0 0.0 0.000 103: sparsify 0 0.0 0 0.0 0.000 103: 103: reduced problem: 103: reduced rows: 22 103: reduced columns: 29 103: reduced int. columns: 0 103: reduced cont. columns: 29 103: reduced nonzeros: 74 103: 103: presolving finished after 0.018 seconds 103: 103: Equilibrium scaling LP (persistent) 103: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 103: Reduced LP has 22 rows 29 columns 74 nonzeros 103: Equilibrium scaling LP 103: type | time | iters | facts | shift | viol sum | viol num | obj value 103: L | 0.0 | 0 | 3 | 0.00e+00 | 7.97e+03 | 11 | -3.36827219e+04 103: L | 0.0 | 9 | 4 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 103: --- unscaling internal solution 103: --- unsimplifying solution and basis 103: --- unscaling external solution 103: --- verifying computed solution 103: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 103: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 103: --- unscaling external solution 103: --- verifying computed solution 103: 103: SoPlex status : problem is solved [optimal] 103: Solving time (sec) : 0.00 103: Iterations : 9 103: Objective value : -4.64753143e+02 103: 103: Solution passed validation 103: 103: postsolve finished after 0.001 seconds 103: feasible: true 103: objective value: -464.753142857143 103: 103: violations: 103: bounds: 0 103: constraints: 0 103: integrality: 0 103: 103: validation: SUCCESS 103: Solving time 0.025 seconds 103: 103: solving finished after 0.025 seconds 101: reduced nonzeros: 372 101: 101: presolving finished after 0.057 seconds 101: 101: Equilibrium scaling LP (persistent) 101: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 101: Reduced LP has 53 rows 94 columns 372 nonzeros 101: Equilibrium scaling LP 101: type | time | iters | facts | shift | viol sum | viol num | obj value 101: L | 0.0 | 0 | 3 | 0.00e+00 | 1.35e+03 | 26 | -5.17875028e+05 102/287 Test #103: q-solve-afiro.mps-lp_presolvers_with_basis.set ............................................. Passed 0.09 sec test 106 Start 106: q-solve-agg.mps-lp_presolvers_with_basis.set 106: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/agg.mps" "-o" "-0.35991767286576506712640824319636e8" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 106: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 106: Test timeout computed to be: 10000000 101: L | 0.0 | 121 | 5 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 101: --- unscaling internal solution 101: --- unsimplifying solution and basis 101: --- unscaling external solution 101: --- verifying computed solution 101: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 101: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 101: --- unscaling external solution 101: --- verifying computed solution 101: 101: SoPlex status : problem is solved [optimal] 101: Solving time (sec) : 0.02 101: Iterations : 121 101: Objective value : 2.25494963e+05 101: 101: Solution passed validation 101: 101: postsolve finished after 0.006 seconds 101: feasible: true 101: objective value: 225494.96316238 101: 101: violations: 101: bounds: 0 101: constraints: 0 101: integrality: 0 101: 101: validation: SUCCESS 101: Solving time 0.086 seconds 101: 101: solving finished after 0.086 seconds 103/287 Test #101: r-solve-adlittle.mps-lp_presolvers_with_basis.set .......................................... Passed 0.18 sec test 107 Start 107: r-solve-agg.mps-lp_presolvers_with_basis.set 107: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/agg.mps" "-o" "-0.35991767286576506712640824319636e8" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 107: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 107: Test timeout computed to be: 10000000 104: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 104: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 104: 104: External libraries: 104: Boost 1.83.0 (https://www.boost.org/) 104: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 104: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 104: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 104: 104: reading took 0.00134 seconds 104: Numerical Statistics: 104: Matrix range [1e-01,2e+00] 104: Objective range [3e-01,1e+01] 104: Bounds range [0e+00,0e+00] 104: RHS range [4e+01,5e+02] 104: Dynamism Variables: 9e+00 104: Dynamism Rows : 9e+00 104: set presolve.componentsmaxint = -1 104: set presolve.detectlindep = 0 104: set doubletoneq.enabled = 0 104: set dualinfer.enabled = 0 104: set substitution.enabled = 0 104: set sparsify.enabled = 0 104: 104: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/afiro.mps with dual-postsolve activated 104: rows: 27 104: columns: 32 104: int. columns: 0 104: cont. columns: 32 104: nonzeros: 83 104: 104: round 0 ( Trivial ): 0 del cols, 2 del rows, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 104: round 1 ( Fast ): 0 del cols, 3 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 22 tsx applied, 0 tsx conflicts 104: round 2 ( Fast ): 0 del cols, 3 del rows, 29 chg bounds, 0 chg sides, 0 chg coeffs, 58 tsx applied, 0 tsx conflicts 104: round 3 ( Medium ): 3 del cols, 5 del rows, 32 chg bounds, 1 chg sides, 1 chg coeffs, 67 tsx applied, 6 tsx conflicts 104: round 4 (Exhaustive): 3 del cols, 5 del rows, 32 chg bounds, 1 chg sides, 1 chg coeffs, 67 tsx applied, 6 tsx conflicts 104: round 5 ( Final ): Unchanged 104: presolved 5 rounds: 3 del cols, 5 del rows, 32 chg bounds, 1 chg sides, 1 chg coeffs, 67 tsx applied, 6 tsx conflicts 104: 104: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 104: colsingleton 5 0.0 0 0.0 0.000 104: coefftightening 0 0.0 0 0.0 0.000 104: propagation 5 60.0 64 100.0 0.006 104: fixcontinuous 2 0.0 0 0.0 0.000 104: simpleprobing 0 0.0 0 0.0 0.000 104: parallelrows 1 0.0 0 0.0 0.000 104: parallelcols 1 0.0 0 0.0 0.000 104: stuffing 2 50.0 9 33.3 0.000 104: dualfix 2 0.0 0 0.0 0.000 104: simplifyineq 0 0.0 0 0.0 0.000 104: doubletoneq 0 0.0 0 0.0 0.000 104: implint 0 0.0 0 0.0 0.000 104: domcol 1 0.0 0 0.0 0.001 104: dualinfer 0 0.0 0 0.0 0.000 104: probing 0 0.0 0 0.0 0.000 104: substitution 0 0.0 0 0.0 0.000 104: sparsify 0 0.0 0 0.0 0.000 104: 104: reduced problem: 104: reduced rows: 22 104: reduced columns: 29 104: reduced int. columns: 0 104: reduced cont. columns: 29 104: reduced nonzeros: 74 104: 104: presolving finished after 0.020 seconds 104: 104: Equilibrium scaling LP (persistent) 104: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 104: Reduced LP has 22 rows 29 columns 74 nonzeros 104: Equilibrium scaling LP 104: type | time | iters | facts | shift | viol sum | viol num | obj value 104: L | 0.0 | 0 | 3 | 0.00e+00 | 7.97e+03 | 11 | -3.36827219e+04 104: L | 0.0 | 9 | 4 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 104: --- unscaling internal solution 104: --- unsimplifying solution and basis 104: --- unscaling external solution 104: --- verifying computed solution 104: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 104: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 104: --- unscaling external solution 104: --- verifying computed solution 104: 104: SoPlex status : problem is solved [optimal] 104: Solving time (sec) : 0.00 104: Iterations : 9 104: Objective value : -4.64753143e+02 104: 104: Solution passed validation 104: 104: postsolve finished after 0.008 seconds 104: feasible: true 104: objective value: -464.753142857143 104: 104: violations: 104: bounds: 0 104: constraints: 0 104: integrality: 0 104: 104: validation: SUCCESS 104: Solving time 0.031 seconds 104: 104: solving finished after 0.031 seconds 104/287 Test #104: r-solve-afiro.mps-lp_presolvers_with_basis.set ............................................. Passed 0.10 sec test 108 Start 108: d-solve-beaconfd.mps-lp_presolvers_with_basis.set 108: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/beaconfd.mps" "-o" "0.335924858072e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 108: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 108: Test timeout computed to be: 10000000 105: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 105: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 105: 105: External libraries: 105: Boost 1.83.0 (https://www.boost.org/) 105: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 105: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 105: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 105: 105: reading took 0.0308 seconds 105: Numerical Statistics: 105: Matrix range [2e-05,4e+02] 105: Objective range [3e+00,1e+02] 105: Bounds range [0e+00,0e+00] 105: RHS range [1e+02,6e+06] 105: Dynamism Variables: 4e+06 105: Dynamism Rows : 3e+03 105: set presolve.componentsmaxint = -1 105: set presolve.detectlindep = 0 105: set doubletoneq.enabled = 0 105: set dualinfer.enabled = 0 105: set substitution.enabled = 0 105: set sparsify.enabled = 0 105: 105: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/agg.mps with dual-postsolve activated 105: rows: 488 105: columns: 163 105: int. columns: 0 105: cont. columns: 163 105: nonzeros: 2410 105: 105: round 0 ( Trivial ): 3 del cols, 80 del rows, 26 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 105: round 1 ( Fast ): 29 del cols, 266 del rows, 481 chg bounds, 0 chg sides, 0 chg coeffs, 2878 tsx applied, 0 tsx conflicts 105: round 2 ( Fast ): 54 del cols, 296 del rows, 508 chg bounds, 0 chg sides, 0 chg coeffs, 2928 tsx applied, 0 tsx conflicts 105: round 3 ( Fast ): 54 del cols, 301 del rows, 518 chg bounds, 0 chg sides, 0 chg coeffs, 2944 tsx applied, 0 tsx conflicts 105: round 4 ( Medium ): 60 del cols, 317 del rows, 524 chg bounds, 22 chg sides, 6 chg coeffs, 2978 tsx applied, 18 tsx conflicts 105: round 5 (Exhaustive): 63 del cols, 318 del rows, 533 chg bounds, 22 chg sides, 6 chg coeffs, 2993 tsx applied, 18 tsx conflicts 105: round 6 (Exhaustive): 63 del cols, 318 del rows, 533 chg bounds, 22 chg sides, 6 chg coeffs, 2993 tsx applied, 18 tsx conflicts 105: round 7 ( Final ): Unchanged 105: presolved 7 rounds: 63 del cols, 318 del rows, 533 chg bounds, 22 chg sides, 6 chg coeffs, 2993 tsx applied, 18 tsx conflicts 105: 105: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 105: colsingleton 7 0.0 0 0.0 0.000 105: coefftightening 0 0.0 0 0.0 0.000 105: propagation 7 71.4 2968 100.0 0.001 105: fixcontinuous 2 0.0 0 0.0 0.000 105: simpleprobing 0 0.0 0 0.0 0.000 105: parallelrows 2 50.0 16 100.0 0.000 105: parallelcols 2 0.0 0 0.0 0.000 105: stuffing 3 33.3 24 25.0 0.000 105: dualfix 2 0.0 0 0.0 0.000 105: simplifyineq 0 0.0 0 0.0 0.000 105: doubletoneq 0 0.0 0 0.0 0.000 105: implint 0 0.0 0 0.0 0.000 105: domcol 2 50.0 3 100.0 0.000 105: dualinfer 0 0.0 0 0.0 0.000 105: probing 0 0.0 0 0.0 0.000 105: substitution 0 0.0 0 0.0 0.000 105: sparsify 0 0.0 0 0.0 0.000 105: 105: reduced problem: 105: reduced rows: 170 105: reduced columns: 100 105: reduced int. columns: 0 105: reduced cont. columns: 100 105: reduced nonzeros: 856 105: 105: presolving finished after 0.007 seconds 105: 105: Equilibrium scaling LP (persistent) 105: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 76 col bounds, 0 row bounds 105: Reduced LP has 170 rows 100 columns 856 nonzeros 105: Equilibrium scaling LP 105: type | time | iters | facts | shift | viol sum | viol num | obj value 105: E | 0.0 | 0 | 2 | 2.24e+03 | 6.80e+06 | 34 | -3.31172719e+08 105: L | 0.0 | 73 | 3 | 0.00e+00 | 8.84e+02 | 28 | -3.23319404e+07 105: L | 0.0 | 95 | 4 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 105: --- unscaling internal solution 105: --- unsimplifying solution and basis 105: --- unscaling external solution 105: --- verifying computed solution 105: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 105: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 105: --- unscaling external solution 105: --- verifying computed solution 105: 105: SoPlex status : problem is solved [optimal] 105: Solving time (sec) : 0.00 105: Iterations : 95 105: Objective value : -3.59917673e+07 105: 105: Solution passed validation 105: 105: postsolve finished after 0.001 seconds 105: feasible: true 105: objective value: -35991767.2865765 105: 105: violations: 105: bounds: 0 105: constraints: 0 105: integrality: 0 105: 105: validation: SUCCESS 105: Solving time 0.015 seconds 105: 105: solving finished after 0.015 seconds 105/287 Test #105: d-solve-agg.mps-lp_presolvers_with_basis.set ............................................... Passed 0.12 sec test 109 Start 109: q-solve-beaconfd.mps-lp_presolvers_with_basis.set 109: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/beaconfd.mps" "-o" "0.335924858072e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 109: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 109: Test timeout computed to be: 10000000 108: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 108: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 108: 108: External libraries: 108: Boost 1.83.0 (https://www.boost.org/) 108: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 108: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 108: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 108: 108: reading took 0.0271 seconds 108: Numerical Statistics: 108: Matrix range [1e-03,5e+02] 108: Objective range [3e-02,1e+02] 108: Bounds range [0e+00,0e+00] 108: RHS range [1e+00,2e+03] 108: Dynamism Variables: 7e+04 108: Dynamism Rows : 2e+03 108: set presolve.componentsmaxint = -1 108: set presolve.detectlindep = 0 108: set doubletoneq.enabled = 0 108: set dualinfer.enabled = 0 108: set substitution.enabled = 0 108: set sparsify.enabled = 0 108: 108: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/beaconfd.mps with dual-postsolve activated 108: rows: 173 108: columns: 262 108: int. columns: 0 108: cont. columns: 262 108: nonzeros: 3375 108: 108: round 0 ( Trivial ): 37 del cols, 37 del rows, 41 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 108: round 1 ( Fast ): 87 del cols, 59 del rows, 180 chg bounds, 0 chg sides, 0 chg coeffs, 278 tsx applied, 0 tsx conflicts 108: round 2 ( Fast ): 114 del cols, 86 del rows, 237 chg bounds, 0 chg sides, 0 chg coeffs, 386 tsx applied, 0 tsx conflicts 108: round 3 ( Medium ): 167 del cols, 135 del rows, 242 chg bounds, 0 chg sides, 0 chg coeffs, 444 tsx applied, 74 tsx conflicts 108: round 4 ( Medium ): 170 del cols, 136 del rows, 243 chg bounds, 2 chg sides, 2 chg coeffs, 446 tsx applied, 82 tsx conflicts 108: round 5 ( Medium ): 172 del cols, 137 del rows, 244 chg bounds, 4 chg sides, 3 chg coeffs, 447 tsx applied, 87 tsx conflicts 108: round 6 (Exhaustive): 184 del cols, 137 del rows, 256 chg bounds, 4 chg sides, 3 chg coeffs, 459 tsx applied, 87 tsx conflicts 108: round 7 (Exhaustive): 184 del cols, 137 del rows, 256 chg bounds, 4 chg sides, 3 chg coeffs, 459 tsx applied, 87 tsx conflicts 108: round 8 ( Final ): Unchanged 108: presolved 8 rounds: 184 del cols, 137 del rows, 256 chg bounds, 4 chg sides, 3 chg coeffs, 459 tsx applied, 87 tsx conflicts 108: 108: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 108: colsingleton 8 0.0 0 0.0 0.000 108: coefftightening 0 0.0 0 0.0 0.000 108: propagation 8 25.0 386 100.0 0.000 108: fixcontinuous 3 0.0 0 0.0 0.000 108: simpleprobing 0 0.0 0 0.0 0.000 108: parallelrows 2 0.0 0 0.0 0.000 108: parallelcols 2 50.0 4 100.0 0.000 108: stuffing 5 60.0 139 37.4 0.000 108: dualfix 3 33.3 5 100.0 0.000 108: simplifyineq 0 0.0 0 0.0 0.000 108: doubletoneq 0 0.0 0 0.0 0.000 108: implint 0 0.0 0 0.0 0.000 108: domcol 2 50.0 12 100.0 0.000 108: dualinfer 0 0.0 0 0.0 0.000 108: probing 0 0.0 0 0.0 0.000 108: substitution 0 0.0 0 0.0 0.000 108: sparsify 0 0.0 0 0.0 0.000 108: 108: reduced problem: 108: reduced rows: 36 108: reduced columns: 78 108: reduced int. columns: 0 108: reduced cont. columns: 78 108: reduced nonzeros: 253 108: 108: presolving finished after 0.012 seconds 108: 108: Equilibrium scaling LP (persistent) 108: Simplifier removed 10 rows, 10 columns, 44 nonzeros, 20 col bounds, 48 row bounds 108: Reduced LP has 26 rows 68 columns 205 nonzeros 108: Equilibrium scaling LP 108: type | time | iters | facts | shift | viol sum | viol num | obj value 108: L | 0.0 | 0 | 3 | 3.30e+01 | 7.87e+03 | 21 | 1.02483912e+04 108: E | 0.0 | 24 | 4 | 0.00e+00 | 2.15e+01 | 20 | 3.37582826e+04 108: E | 0.0 | 32 | 5 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 108: --- unscaling internal solution 108: --- unsimplifying solution and basis 108: --- unscaling external solution 108: --- verifying computed solution 108: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 108: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 108: --- unscaling external solution 108: --- verifying computed solution 108: 108: SoPlex status : problem is solved [optimal] 108: Solving time (sec) : 0.00 108: Iterations : 32 108: Objective value : 3.35924858e+04 108: 108: Solution passed validation 108: 108: postsolve finished after 0.000 seconds 108: feasible: true 108: objective value: 33592.4858072 108: 108: violations: 108: bounds: 0 108: constraints: 0 108: integrality: 0 108: 108: validation: SUCCESS 108: Solving time 0.020 seconds 108: 108: solving finished after 0.020 seconds 106/287 Test #108: d-solve-beaconfd.mps-lp_presolvers_with_basis.set .......................................... Passed 0.12 sec test 110 Start 110: r-solve-beaconfd.mps-lp_presolvers_with_basis.set 110: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/beaconfd.mps" "-o" "0.335924858072e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 110: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 110: Test timeout computed to be: 10000000 106: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 106: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 106: 106: External libraries: 106: Boost 1.83.0 (https://www.boost.org/) 106: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 106: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 106: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 106: 106: reading took 0.0539 seconds 106: Numerical Statistics: 106: Matrix range [2e-05,4e+02] 106: Objective range [3e+00,1e+02] 106: Bounds range [0e+00,0e+00] 106: RHS range [1e+02,6e+06] 106: Dynamism Variables: 4e+06 106: Dynamism Rows : 3e+03 106: set presolve.componentsmaxint = -1 106: set presolve.detectlindep = 0 106: set doubletoneq.enabled = 0 106: set dualinfer.enabled = 0 106: set substitution.enabled = 0 106: set sparsify.enabled = 0 106: 106: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/agg.mps with dual-postsolve activated 106: rows: 488 106: columns: 163 106: int. columns: 0 106: cont. columns: 163 106: nonzeros: 2410 106: 106: round 0 ( Trivial ): 3 del cols, 80 del rows, 26 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 106: round 1 ( Fast ): 29 del cols, 266 del rows, 481 chg bounds, 0 chg sides, 0 chg coeffs, 2878 tsx applied, 0 tsx conflicts 106: round 2 ( Fast ): 54 del cols, 296 del rows, 508 chg bounds, 0 chg sides, 0 chg coeffs, 2928 tsx applied, 0 tsx conflicts 106: round 3 ( Fast ): 54 del cols, 301 del rows, 518 chg bounds, 0 chg sides, 0 chg coeffs, 2944 tsx applied, 0 tsx conflicts 106: round 4 ( Medium ): 60 del cols, 317 del rows, 524 chg bounds, 22 chg sides, 6 chg coeffs, 2978 tsx applied, 18 tsx conflicts 106: round 5 (Exhaustive): 63 del cols, 318 del rows, 533 chg bounds, 22 chg sides, 6 chg coeffs, 2993 tsx applied, 18 tsx conflicts 106: round 6 (Exhaustive): 63 del cols, 318 del rows, 533 chg bounds, 22 chg sides, 6 chg coeffs, 2993 tsx applied, 18 tsx conflicts 106: round 7 ( Final ): Unchanged 106: presolved 7 rounds: 63 del cols, 318 del rows, 533 chg bounds, 22 chg sides, 6 chg coeffs, 2993 tsx applied, 18 tsx conflicts 106: 106: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 106: colsingleton 7 0.0 0 0.0 0.000 106: coefftightening 0 0.0 0 0.0 0.000 106: propagation 7 71.4 2968 100.0 0.034 106: fixcontinuous 2 0.0 0 0.0 0.000 106: simpleprobing 0 0.0 0 0.0 0.000 106: parallelrows 2 50.0 16 100.0 0.001 106: parallelcols 2 0.0 0 0.0 0.005 106: stuffing 3 33.3 24 25.0 0.000 106: dualfix 2 0.0 0 0.0 0.000 106: simplifyineq 0 0.0 0 0.0 0.000 106: doubletoneq 0 0.0 0 0.0 0.000 106: implint 0 0.0 0 0.0 0.000 106: domcol 2 50.0 3 100.0 0.005 106: dualinfer 0 0.0 0 0.0 0.000 106: probing 0 0.0 0 0.0 0.000 106: substitution 0 0.0 0 0.0 0.000 106: sparsify 0 0.0 0 0.0 0.000 106: 106: reduced problem: 106: reduced rows: 170 106: reduced columns: 100 106: reduced int. columns: 0 106: reduced cont. columns: 100 106: reduced nonzeros: 856 106: 106: presolving finished after 0.124 seconds 106: 106: Equilibrium scaling LP (persistent) 106: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 76 col bounds, 0 row bounds 106: Reduced LP has 170 rows 100 columns 856 nonzeros 106: Equilibrium scaling LP 106: type | time | iters | facts | shift | viol sum | viol num | obj value 106: E | 0.0 | 0 | 2 | 2.24e+03 | 6.80e+06 | 34 | -3.31172719e+08 109: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 109: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 109: 109: External libraries: 109: Boost 1.83.0 (https://www.boost.org/) 109: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 109: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 109: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 109: 109: reading took 0.0645 seconds 109: Numerical Statistics: 109: Matrix range [1e-03,5e+02] 109: Objective range [3e-02,1e+02] 109: Bounds range [0e+00,0e+00] 109: RHS range [1e+00,2e+03] 109: Dynamism Variables: 7e+04 109: Dynamism Rows : 2e+03 109: set presolve.componentsmaxint = -1 109: set presolve.detectlindep = 0 109: set doubletoneq.enabled = 0 109: set dualinfer.enabled = 0 109: set substitution.enabled = 0 109: set sparsify.enabled = 0 109: 109: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/beaconfd.mps with dual-postsolve activated 109: rows: 173 109: columns: 262 109: int. columns: 0 109: cont. columns: 262 109: nonzeros: 3375 109: 109: round 0 ( Trivial ): 37 del cols, 37 del rows, 41 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 109: round 1 ( Fast ): 87 del cols, 59 del rows, 180 chg bounds, 0 chg sides, 0 chg coeffs, 278 tsx applied, 0 tsx conflicts 109: round 2 ( Fast ): 114 del cols, 86 del rows, 237 chg bounds, 0 chg sides, 0 chg coeffs, 386 tsx applied, 0 tsx conflicts 109: round 3 ( Medium ): 167 del cols, 135 del rows, 242 chg bounds, 0 chg sides, 0 chg coeffs, 444 tsx applied, 74 tsx conflicts 109: round 4 ( Medium ): 170 del cols, 136 del rows, 243 chg bounds, 2 chg sides, 2 chg coeffs, 446 tsx applied, 82 tsx conflicts 109: round 5 ( Medium ): 172 del cols, 137 del rows, 244 chg bounds, 4 chg sides, 3 chg coeffs, 447 tsx applied, 87 tsx conflicts 109: round 6 (Exhaustive): 184 del cols, 137 del rows, 256 chg bounds, 4 chg sides, 3 chg coeffs, 459 tsx applied, 87 tsx conflicts 109: round 7 (Exhaustive): 184 del cols, 137 del rows, 256 chg bounds, 4 chg sides, 3 chg coeffs, 459 tsx applied, 87 tsx conflicts 109: round 8 ( Final ): Unchanged 109: presolved 8 rounds: 184 del cols, 137 del rows, 256 chg bounds, 4 chg sides, 3 chg coeffs, 459 tsx applied, 87 tsx conflicts 109: 109: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 109: colsingleton 8 0.0 0 0.0 0.000 109: coefftightening 0 0.0 0 0.0 0.000 109: propagation 8 25.0 386 100.0 0.013 109: fixcontinuous 3 0.0 0 0.0 0.000 109: simpleprobing 0 0.0 0 0.0 0.000 109: parallelrows 2 0.0 0 0.0 0.001 109: parallelcols 2 50.0 4 100.0 0.001 109: stuffing 5 60.0 139 37.4 0.002 109: dualfix 3 33.3 5 100.0 0.000 109: simplifyineq 0 0.0 0 0.0 0.000 109: doubletoneq 0 0.0 0 0.0 0.000 109: implint 0 0.0 0 0.0 0.000 109: domcol 2 50.0 12 100.0 0.004 109: dualinfer 0 0.0 0 0.0 0.000 109: probing 0 0.0 0 0.0 0.000 109: substitution 0 0.0 0 0.0 0.000 109: sparsify 0 0.0 0 0.0 0.000 109: 109: reduced problem: 109: reduced rows: 36 109: reduced columns: 78 109: reduced int. columns: 0 109: reduced cont. columns: 78 109: reduced nonzeros: 253 109: 109: presolving finished after 0.070 seconds 109: 109: Equilibrium scaling LP (persistent) 106: L | 0.0 | 73 | 3 | 0.00e+00 | 8.84e+02 | 28 | -3.23319404e+07 106: L | 0.0 | 95 | 4 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 106: --- unscaling internal solution 106: --- unsimplifying solution and basis 106: --- unscaling external solution 106: --- verifying computed solution 106: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 106: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 106: --- unscaling external solution 106: --- verifying computed solution 109: Simplifier removed 10 rows, 10 columns, 44 nonzeros, 20 col bounds, 48 row bounds 109: Reduced LP has 26 rows 68 columns 205 nonzeros 109: Equilibrium scaling LP 109: type | time | iters | facts | shift | viol sum | viol num | obj value 109: L | 0.0 | 0 | 3 | 3.30e+01 | 7.87e+03 | 21 | 1.02483912e+04 109: E | 0.0 | 24 | 4 | 0.00e+00 | 2.15e+01 | 20 | 3.37582826e+04 109: E | 0.0 | 32 | 5 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 109: --- unscaling internal solution 109: --- unsimplifying solution and basis 109: --- unscaling external solution 109: --- verifying computed solution 109: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 109: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 109: --- unscaling external solution 109: --- verifying computed solution 109: 109: SoPlex status : problem is solved [optimal] 109: Solving time (sec) : 0.00 109: Iterations : 32 109: Objective value : 3.35924858e+04 109: 109: Solution passed validation 109: 109: postsolve finished after 0.025 seconds 109: feasible: true 109: objective value: 33592.4858072 109: 109: violations: 109: bounds: 0 109: constraints: 0 109: integrality: 0 109: 109: validation: SUCCESS 109: Solving time 0.119 seconds 109: 109: solving finished after 0.119 seconds 107/287 Test #109: q-solve-beaconfd.mps-lp_presolvers_with_basis.set .......................................... Passed 0.25 sec test 111 Start 111: d-solve-bore3d.mps-lp_presolvers_with_basis.set 111: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bore3d.mps" "-o" "0.13730803942084927215581987251301e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 111: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 111: Test timeout computed to be: 10000000 106: 106: SoPlex status : problem is solved [optimal] 106: Solving time (sec) : 0.02 106: Iterations : 95 106: Objective value : -3.59917673e+07 106: 106: Solution passed validation 106: 106: postsolve finished after 0.071 seconds 106: feasible: true 106: objective value: -35991767.2865765 106: 106: violations: 106: bounds: 0 106: constraints: 0 106: integrality: 0 106: 106: validation: SUCCESS 106: Solving time 0.232 seconds 106: 106: solving finished after 0.232 seconds 108/287 Test #106: q-solve-agg.mps-lp_presolvers_with_basis.set ............................................... Passed 0.37 sec test 112 Start 112: q-solve-bore3d.mps-lp_presolvers_with_basis.set 112: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bore3d.mps" "-o" "0.13730803942084927215581987251301e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 112: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 112: Test timeout computed to be: 10000000 107: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 107: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 107: 107: External libraries: 107: Boost 1.83.0 (https://www.boost.org/) 107: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 107: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 107: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 107: 107: reading took 0.066 seconds 107: Numerical Statistics: 107: Matrix range [2e-05,4e+02] 107: Objective range [3e+00,1e+02] 107: Bounds range [0e+00,0e+00] 107: RHS range [1e+02,6e+06] 107: Dynamism Variables: 4e+06 107: Dynamism Rows : 3e+03 107: set presolve.componentsmaxint = -1 107: set presolve.detectlindep = 0 107: set doubletoneq.enabled = 0 107: set dualinfer.enabled = 0 107: set substitution.enabled = 0 107: set sparsify.enabled = 0 107: 107: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/agg.mps with dual-postsolve activated 107: rows: 488 107: columns: 163 107: int. columns: 0 107: cont. columns: 163 107: nonzeros: 2410 107: 107: round 0 ( Trivial ): 3 del cols, 80 del rows, 26 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 107: round 1 ( Fast ): 29 del cols, 266 del rows, 481 chg bounds, 0 chg sides, 0 chg coeffs, 2878 tsx applied, 0 tsx conflicts 107: round 2 ( Fast ): 54 del cols, 296 del rows, 508 chg bounds, 0 chg sides, 0 chg coeffs, 2928 tsx applied, 0 tsx conflicts 107: round 3 ( Fast ): 54 del cols, 301 del rows, 518 chg bounds, 0 chg sides, 0 chg coeffs, 2944 tsx applied, 0 tsx conflicts 107: round 4 ( Medium ): 60 del cols, 317 del rows, 524 chg bounds, 22 chg sides, 6 chg coeffs, 2978 tsx applied, 18 tsx conflicts 107: round 5 (Exhaustive): 63 del cols, 318 del rows, 533 chg bounds, 22 chg sides, 6 chg coeffs, 2993 tsx applied, 18 tsx conflicts 107: round 6 (Exhaustive): 63 del cols, 318 del rows, 533 chg bounds, 22 chg sides, 6 chg coeffs, 2993 tsx applied, 18 tsx conflicts 107: round 7 ( Final ): Unchanged 107: presolved 7 rounds: 63 del cols, 318 del rows, 533 chg bounds, 22 chg sides, 6 chg coeffs, 2993 tsx applied, 18 tsx conflicts 107: 107: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 107: colsingleton 7 0.0 0 0.0 0.000 107: coefftightening 0 0.0 0 0.0 0.000 107: propagation 7 71.4 2968 100.0 0.036 107: fixcontinuous 2 0.0 0 0.0 0.000 107: simpleprobing 0 0.0 0 0.0 0.000 107: parallelrows 2 50.0 16 100.0 0.005 107: parallelcols 2 0.0 0 0.0 0.021 107: stuffing 3 33.3 24 25.0 0.000 107: dualfix 2 0.0 0 0.0 0.001 107: simplifyineq 0 0.0 0 0.0 0.000 107: doubletoneq 0 0.0 0 0.0 0.000 107: implint 0 0.0 0 0.0 0.000 107: domcol 2 50.0 3 100.0 0.027 107: dualinfer 0 0.0 0 0.0 0.000 107: probing 0 0.0 0 0.0 0.000 107: substitution 0 0.0 0 0.0 0.000 107: sparsify 0 0.0 0 0.0 0.000 107: 107: reduced problem: 107: reduced rows: 170 107: reduced columns: 100 107: reduced int. columns: 0 107: reduced cont. columns: 100 107: reduced nonzeros: 856 107: 107: presolving finished after 0.303 seconds 107: 107: Equilibrium scaling LP (persistent) 107: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 76 col bounds, 0 row bounds 107: Reduced LP has 170 rows 100 columns 856 nonzeros 107: Equilibrium scaling LP 107: type | time | iters | facts | shift | viol sum | viol num | obj value 107: E | 0.0 | 0 | 2 | 2.24e+03 | 6.80e+06 | 34 | -3.31172719e+08 107: L | 0.0 | 73 | 3 | 0.00e+00 | 8.84e+02 | 28 | -3.23319404e+07 107: L | 0.0 | 95 | 4 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 111: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 111: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 111: 111: External libraries: 111: Boost 1.83.0 (https://www.boost.org/) 111: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 111: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 111: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 111: 111: reading took 0.0265 seconds 111: Numerical Statistics: 111: Matrix range [1e-04,1e+03] 111: Objective range [3e-04,3e+02] 111: Bounds range [1e+01,1e+02] 111: RHS range [0e+00,0e+00] 111: Dynamism Variables: 2e+05 111: Dynamism Rows : 2e+06 111: set presolve.componentsmaxint = -1 111: set presolve.detectlindep = 0 111: set doubletoneq.enabled = 0 111: set dualinfer.enabled = 0 111: set substitution.enabled = 0 111: set sparsify.enabled = 0 111: 111: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bore3d.mps with dual-postsolve activated 111: rows: 233 111: columns: 315 111: int. columns: 0 111: cont. columns: 315 111: nonzeros: 1429 111: 111: round 0 ( Trivial ): 39 del cols, 41 del rows, 40 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 111: round 1 ( Fast ): 91 del cols, 58 del rows, 131 chg bounds, 0 chg sides, 0 chg coeffs, 184 tsx applied, 0 tsx conflicts 111: round 2 ( Fast ): 122 del cols, 90 del rows, 201 chg bounds, 0 chg sides, 0 chg coeffs, 296 tsx applied, 0 tsx conflicts 111: round 3 ( Fast ): 126 del cols, 94 del rows, 230 chg bounds, 0 chg sides, 0 chg coeffs, 348 tsx applied, 0 tsx conflicts 111: round 4 ( Medium ): 193 del cols, 155 del rows, 245 chg bounds, 18 chg sides, 12 chg coeffs, 441 tsx applied, 303 tsx conflicts 111: round 5 ( Medium ): 221 del cols, 156 del rows, 273 chg bounds, 23 chg sides, 15 chg coeffs, 597 tsx applied, 307 tsx conflicts 111: round 6 ( Fast ): 221 del cols, 156 del rows, 283 chg bounds, 23 chg sides, 15 chg coeffs, 617 tsx applied, 307 tsx conflicts 111: round 7 (Exhaustive): 221 del cols, 156 del rows, 289 chg bounds, 23 chg sides, 15 chg coeffs, 624 tsx applied, 307 tsx conflicts 111: round 8 ( Final ): 221 del cols, 156 del rows, 292 chg bounds, 23 chg sides, 15 chg coeffs, 628 tsx applied, 307 tsx conflicts 111: presolved 8 rounds: 221 del cols, 156 del rows, 292 chg bounds, 23 chg sides, 15 chg coeffs, 628 tsx applied, 307 tsx conflicts 111: 111: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 111: colsingleton 8 0.0 0 0.0 0.000 111: coefftightening 0 0.0 0 0.0 0.000 111: propagation 8 100.0 404 100.0 0.000 111: fixcontinuous 2 0.0 0 0.0 0.000 111: simpleprobing 0 0.0 0 0.0 0.000 111: parallelrows 2 50.0 2 100.0 0.000 111: parallelcols 2 0.0 0 0.0 0.000 111: stuffing 3 66.7 492 38.8 0.000 111: dualfix 4 100.0 37 83.8 0.000 111: simplifyineq 0 0.0 0 0.0 0.000 111: doubletoneq 0 0.0 0 0.0 0.000 111: implint 0 0.0 0 0.0 0.000 111: domcol 1 0.0 0 0.0 0.000 111: dualinfer 0 0.0 0 0.0 0.000 111: probing 0 0.0 0 0.0 0.000 111: substitution 0 0.0 0 0.0 0.000 111: sparsify 0 0.0 0 0.0 0.000 111: 111: reduced problem: 111: reduced rows: 77 111: reduced columns: 94 111: reduced int. columns: 0 111: reduced cont. columns: 94 111: reduced nonzeros: 501 111: 111: presolving finished after 0.034 seconds 111: 111: Equilibrium scaling LP (persistent) 107: --- unscaling internal solution 107: --- unsimplifying solution and basis 107: --- unscaling external solution 107: --- verifying computed solution 107: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 107: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 107: --- unscaling external solution 107: --- verifying computed solution 111: Simplifier removed 14 rows, 12 columns, 77 nonzeros, 11 col bounds, 179 row bounds 111: Reduced LP has 63 rows 82 columns 424 nonzeros 111: Equilibrium scaling LP 111: type | time | iters | facts | shift | viol sum | viol num | obj value 111: L | 0.0 | 0 | 3 | 1.75e+01 | 3.38e+06 | 41 | -2.03611201e+06 111: E | 0.0 | 55 | 5 | 0.00e+00 | 3.44e-03 | 2 | 1.37467410e+03 111: E | 0.0 | 58 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 111: --- unscaling internal solution 111: --- unsimplifying solution and basis 111: --- unscaling external solution 111: --- verifying computed solution 111: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 111: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 111: --- unscaling external solution 111: --- verifying computed solution 111: 111: SoPlex status : problem is solved [optimal] 111: Solving time (sec) : 0.00 111: Iterations : 58 111: Objective value : 1.37308039e+03 111: 111: Solution passed validation 111: 111: postsolve finished after 0.000 seconds 111: feasible: true 111: objective value: 1373.08039420849 111: 111: violations: 111: bounds: 1.16226472890446e-16 111: constraints: 0 111: integrality: 0 111: 111: validation: SUCCESS 111: Solving time 0.044 seconds 111: 111: solving finished after 0.044 seconds 109/287 Test #111: d-solve-bore3d.mps-lp_presolvers_with_basis.set ............................................ Passed 0.14 sec test 113 Start 113: r-solve-bore3d.mps-lp_presolvers_with_basis.set 113: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bore3d.mps" "-o" "0.13730803942084927215581987251301e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 113: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 113: Test timeout computed to be: 10000000 110: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 110: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 110: 110: External libraries: 110: Boost 1.83.0 (https://www.boost.org/) 110: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 110: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 110: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 110: 110: reading took 0.0999 seconds 110: Numerical Statistics: 110: Matrix range [1e-03,5e+02] 110: Objective range [3e-02,1e+02] 110: Bounds range [0e+00,0e+00] 110: RHS range [1e+00,2e+03] 110: Dynamism Variables: 7e+04 110: Dynamism Rows : 2e+03 110: set presolve.componentsmaxint = -1 110: set presolve.detectlindep = 0 110: set doubletoneq.enabled = 0 110: set dualinfer.enabled = 0 110: set substitution.enabled = 0 110: set sparsify.enabled = 0 110: 110: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/beaconfd.mps with dual-postsolve activated 110: rows: 173 110: columns: 262 110: int. columns: 0 110: cont. columns: 262 110: nonzeros: 3375 110: 110: round 0 ( Trivial ): 37 del cols, 37 del rows, 41 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 110: round 1 ( Fast ): 87 del cols, 59 del rows, 180 chg bounds, 0 chg sides, 0 chg coeffs, 278 tsx applied, 0 tsx conflicts 110: round 2 ( Fast ): 114 del cols, 86 del rows, 237 chg bounds, 0 chg sides, 0 chg coeffs, 386 tsx applied, 0 tsx conflicts 110: round 3 ( Medium ): 167 del cols, 135 del rows, 242 chg bounds, 0 chg sides, 0 chg coeffs, 444 tsx applied, 74 tsx conflicts 110: round 4 ( Medium ): 170 del cols, 136 del rows, 243 chg bounds, 2 chg sides, 2 chg coeffs, 446 tsx applied, 82 tsx conflicts 110: round 5 ( Medium ): 172 del cols, 137 del rows, 244 chg bounds, 4 chg sides, 3 chg coeffs, 447 tsx applied, 87 tsx conflicts 110: round 6 (Exhaustive): 184 del cols, 137 del rows, 256 chg bounds, 4 chg sides, 3 chg coeffs, 459 tsx applied, 87 tsx conflicts 110: round 7 (Exhaustive): 184 del cols, 137 del rows, 256 chg bounds, 4 chg sides, 3 chg coeffs, 459 tsx applied, 87 tsx conflicts 110: round 8 ( Final ): Unchanged 110: presolved 8 rounds: 184 del cols, 137 del rows, 256 chg bounds, 4 chg sides, 3 chg coeffs, 459 tsx applied, 87 tsx conflicts 110: 110: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 110: colsingleton 8 0.0 0 0.0 0.000 110: coefftightening 0 0.0 0 0.0 0.000 110: propagation 8 25.0 386 100.0 0.057 110: fixcontinuous 3 0.0 0 0.0 0.000 110: simpleprobing 0 0.0 0 0.0 0.000 110: parallelrows 2 0.0 0 0.0 0.011 110: parallelcols 2 50.0 4 100.0 0.004 110: stuffing 5 60.0 139 37.4 0.004 110: dualfix 3 33.3 5 100.0 0.001 110: simplifyineq 0 0.0 0 0.0 0.000 110: doubletoneq 0 0.0 0 0.0 0.000 110: implint 0 0.0 0 0.0 0.000 110: domcol 2 50.0 12 100.0 0.015 110: dualinfer 0 0.0 0 0.0 0.000 110: probing 0 0.0 0 0.0 0.000 110: substitution 0 0.0 0 0.0 0.000 110: sparsify 0 0.0 0 0.0 0.000 110: 110: reduced problem: 110: reduced rows: 36 110: reduced columns: 78 110: reduced int. columns: 0 110: reduced cont. columns: 78 110: reduced nonzeros: 253 110: 110: presolving finished after 0.226 seconds 110: 110: Equilibrium scaling LP (persistent) 112: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 112: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 112: 112: External libraries: 112: Boost 1.83.0 (https://www.boost.org/) 112: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 112: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 112: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 112: 112: reading took 0.058 seconds 112: Numerical Statistics: 112: Matrix range [1e-04,1e+03] 112: Objective range [3e-04,3e+02] 112: Bounds range [1e+01,1e+02] 112: RHS range [0e+00,0e+00] 112: Dynamism Variables: 2e+05 112: Dynamism Rows : 2e+06 112: set presolve.componentsmaxint = -1 112: set presolve.detectlindep = 0 112: set doubletoneq.enabled = 0 112: set dualinfer.enabled = 0 112: set substitution.enabled = 0 112: set sparsify.enabled = 0 112: 112: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bore3d.mps with dual-postsolve activated 112: rows: 233 112: columns: 315 112: int. columns: 0 112: cont. columns: 315 112: nonzeros: 1429 112: 112: round 0 ( Trivial ): 39 del cols, 41 del rows, 40 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 112: round 1 ( Fast ): 91 del cols, 58 del rows, 131 chg bounds, 0 chg sides, 0 chg coeffs, 184 tsx applied, 0 tsx conflicts 112: round 2 ( Fast ): 122 del cols, 90 del rows, 201 chg bounds, 0 chg sides, 0 chg coeffs, 296 tsx applied, 0 tsx conflicts 112: round 3 ( Fast ): 126 del cols, 94 del rows, 230 chg bounds, 0 chg sides, 0 chg coeffs, 348 tsx applied, 0 tsx conflicts 112: round 4 ( Medium ): 193 del cols, 155 del rows, 245 chg bounds, 18 chg sides, 12 chg coeffs, 441 tsx applied, 303 tsx conflicts 112: round 5 ( Medium ): 221 del cols, 156 del rows, 273 chg bounds, 23 chg sides, 15 chg coeffs, 597 tsx applied, 307 tsx conflicts 112: round 6 ( Fast ): 221 del cols, 156 del rows, 283 chg bounds, 23 chg sides, 15 chg coeffs, 617 tsx applied, 307 tsx conflicts 112: round 7 (Exhaustive): 221 del cols, 156 del rows, 289 chg bounds, 23 chg sides, 15 chg coeffs, 624 tsx applied, 307 tsx conflicts 112: round 8 ( Final ): 221 del cols, 156 del rows, 292 chg bounds, 23 chg sides, 15 chg coeffs, 628 tsx applied, 307 tsx conflicts 112: presolved 8 rounds: 221 del cols, 156 del rows, 292 chg bounds, 23 chg sides, 15 chg coeffs, 628 tsx applied, 307 tsx conflicts 112: 112: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 112: colsingleton 8 0.0 0 0.0 0.000 112: coefftightening 0 0.0 0 0.0 0.000 112: propagation 8 100.0 404 100.0 0.011 112: fixcontinuous 2 0.0 0 0.0 0.000 112: simpleprobing 0 0.0 0 0.0 0.000 112: parallelrows 2 50.0 2 100.0 0.001 112: parallelcols 2 0.0 0 0.0 0.001 112: stuffing 3 66.7 492 38.8 0.003 112: dualfix 4 100.0 37 83.8 0.001 112: simplifyineq 0 0.0 0 0.0 0.000 112: doubletoneq 0 0.0 0 0.0 0.000 112: implint 0 0.0 0 0.0 0.000 112: domcol 1 0.0 0 0.0 0.002 110: Simplifier removed 10 rows, 10 columns, 44 nonzeros, 20 col bounds, 48 row bounds 110: Reduced LP has 26 rows 68 columns 205 nonzeros 110: Equilibrium scaling LP 110: type | time | iters | facts | shift | viol sum | viol num | obj value 110: L | 0.0 | 0 | 3 | 3.30e+01 | 7.87e+03 | 21 | 1.02483912e+04 110: E | 0.0 | 24 | 4 | 0.00e+00 | 2.15e+01 | 20 | 3.37582826e+04 110: E | 0.0 | 32 | 5 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 110: --- unscaling internal solution 110: --- unsimplifying solution and basis 110: --- unscaling external solution 110: --- verifying computed solution 110: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 110: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 110: --- unscaling external solution 110: --- verifying computed solution 107: 107: SoPlex status : problem is solved [optimal] 107: Solving time (sec) : 0.00 107: Iterations : 95 107: Objective value : -3.59917673e+07 107: 107: Solution passed validation 107: 107: postsolve finished after 0.074 seconds 107: feasible: true 107: objective value: -35991767.2865765 107: 107: violations: 107: bounds: 0 107: constraints: 0 107: integrality: 0 107: 107: validation: SUCCESS 107: Solving time 0.410 seconds 107: 107: solving finished after 0.410 seconds 110/287 Test #107: r-solve-agg.mps-lp_presolvers_with_basis.set ............................................... Passed 0.56 sec test 114 Start 114: d-solve-brandy.mps-lp_presolvers_with_basis.set 114: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/brandy.mps" "-o" "0.15185098964881283835426751550618e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 114: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 114: Test timeout computed to be: 10000000 112: dualinfer 0 0.0 0 0.0 0.000 112: probing 0 0.0 0 0.0 0.000 112: substitution 0 0.0 0 0.0 0.000 112: sparsify 0 0.0 0 0.0 0.000 112: 112: reduced problem: 112: reduced rows: 77 112: reduced columns: 94 112: reduced int. columns: 0 112: reduced cont. columns: 94 112: reduced nonzeros: 501 112: 112: presolving finished after 0.088 seconds 112: 112: Equilibrium scaling LP (persistent) 112: Simplifier removed 14 rows, 12 columns, 77 nonzeros, 11 col bounds, 179 row bounds 112: Reduced LP has 63 rows 82 columns 424 nonzeros 112: Equilibrium scaling LP 112: type | time | iters | facts | shift | viol sum | viol num | obj value 112: L | 0.0 | 0 | 3 | 1.75e+01 | 3.38e+06 | 41 | -2.03611201e+06 112: E | 0.0 | 55 | 5 | 0.00e+00 | 3.44e-03 | 2 | 1.37467410e+03 112: E | 0.0 | 58 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 112: --- unscaling internal solution 112: --- unsimplifying solution and basis 112: --- unscaling external solution 112: --- verifying computed solution 112: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 112: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 112: --- unscaling external solution 112: --- verifying computed solution 110: 110: SoPlex status : problem is solved [optimal] 110: Solving time (sec) : 0.00 110: Iterations : 32 110: Objective value : 3.35924858e+04 110: 110: Solution passed validation 110: 110: postsolve finished after 0.054 seconds 110: feasible: true 110: objective value: 33592.4858072 110: 110: violations: 110: bounds: 0 110: constraints: 0 110: integrality: 0 110: 110: validation: SUCCESS 110: Solving time 0.288 seconds 110: 110: solving finished after 0.288 seconds 111/287 Test #110: r-solve-beaconfd.mps-lp_presolvers_with_basis.set .......................................... Passed 0.47 sec test 115 Start 115: q-solve-brandy.mps-lp_presolvers_with_basis.set 115: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/brandy.mps" "-o" "0.15185098964881283835426751550618e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 115: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 115: Test timeout computed to be: 10000000 114: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 114: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 114: 114: External libraries: 114: Boost 1.83.0 (https://www.boost.org/) 114: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 114: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 114: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 114: 114: reading took 0.0251 seconds 114: Numerical Statistics: 114: Matrix range [0e+00,2e+02] 114: Objective range [1e+00,1e+00] 114: Bounds range [0e+00,0e+00] 114: RHS range [2e-01,1e+02] 114: Dynamism Variables: 4e+04 114: Dynamism Rows : 2e+04 114: set presolve.componentsmaxint = -1 114: set presolve.detectlindep = 0 114: set doubletoneq.enabled = 0 114: set dualinfer.enabled = 0 114: set substitution.enabled = 0 114: set sparsify.enabled = 0 114: 114: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/brandy.mps with dual-postsolve activated 114: rows: 220 114: columns: 249 114: int. columns: 0 114: cont. columns: 249 114: nonzeros: 2148 114: 114: round 0 ( Trivial ): 41 del cols, 58 del rows, 73 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 114: round 1 ( Fast ): 44 del cols, 59 del rows, 155 chg bounds, 0 chg sides, 0 chg coeffs, 170 tsx applied, 0 tsx conflicts 114: round 2 ( Fast ): 44 del cols, 59 del rows, 222 chg bounds, 0 chg sides, 0 chg coeffs, 344 tsx applied, 0 tsx conflicts 114: round 3 ( Medium ): 61 del cols, 61 del rows, 222 chg bounds, 11 chg sides, 11 chg coeffs, 361 tsx applied, 29 tsx conflicts 114: round 4 ( Medium ): 64 del cols, 63 del rows, 222 chg bounds, 12 chg sides, 12 chg coeffs, 364 tsx applied, 32 tsx conflicts 114: round 5 (Exhaustive): 66 del cols, 64 del rows, 226 chg bounds, 12 chg sides, 12 chg coeffs, 369 tsx applied, 32 tsx conflicts 114: round 6 ( Final ): 66 del cols, 64 del rows, 226 chg bounds, 12 chg sides, 12 chg coeffs, 369 tsx applied, 32 tsx conflicts 114: presolved 6 rounds: 66 del cols, 64 del rows, 226 chg bounds, 12 chg sides, 12 chg coeffs, 369 tsx applied, 32 tsx conflicts 114: 114: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 114: colsingleton 6 0.0 0 0.0 0.000 114: coefftightening 0 0.0 0 0.0 0.000 114: propagation 6 33.3 344 100.0 0.000 114: fixcontinuous 2 0.0 0 0.0 0.000 114: simpleprobing 0 0.0 0 0.0 0.000 114: parallelrows 2 0.0 0 0.0 0.000 114: parallelcols 2 50.0 4 100.0 0.001 114: stuffing 3 66.7 48 33.3 0.000 114: dualfix 3 33.3 4 100.0 0.000 114: simplifyineq 0 0.0 0 0.0 0.000 114: doubletoneq 0 0.0 0 0.0 0.000 114: implint 0 0.0 0 0.0 0.000 114: domcol 1 100.0 1 100.0 0.000 114: dualinfer 0 0.0 0 0.0 0.000 114: probing 0 0.0 0 0.0 0.000 114: substitution 0 0.0 0 0.0 0.000 114: sparsify 0 0.0 0 0.0 0.000 114: 114: reduced problem: 114: reduced rows: 118 114: reduced columns: 183 114: reduced int. columns: 0 114: reduced cont. columns: 183 114: reduced nonzeros: 1657 114: 114: presolving finished after 0.007 seconds 114: 114: Equilibrium scaling LP (persistent) 114: Simplifier removed 5 rows, 4 columns, 16 nonzeros, 16 col bounds, 32 row bounds 114: Reduced LP has 113 rows 179 columns 1636 nonzeros 114: Equilibrium scaling LP 114: type | time | iters | facts | shift | viol sum | viol num | obj value 114: L | 0.0 | 0 | 3 | 9.10e-01 | 5.76e+02 | 66 | -6.59687745e+02 112: 112: SoPlex status : problem is solved [optimal] 112: Solving time (sec) : 0.00 112: Iterations : 58 112: Objective value : 1.37308039e+03 112: 112: Solution passed validation 112: 112: postsolve finished after 0.047 seconds 112: feasible: true 112: objective value: 1373.08039420849 112: 112: violations: 112: bounds: 0 112: constraints: 0 112: integrality: 0 112: 112: validation: SUCCESS 112: Solving time 0.168 seconds 112: 112: solving finished after 0.168 seconds 112/287 Test #112: q-solve-bore3d.mps-lp_presolvers_with_basis.set ............................................ Passed 0.31 sec test 116 Start 116: r-solve-brandy.mps-lp_presolvers_with_basis.set 116: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/brandy.mps" "-o" "0.15185098964881283835426751550618e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 116: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 116: Test timeout computed to be: 10000000 114: L | 0.0 | 199 | 6 | 9.10e-01 | 1.45e+03 | 19 | 1.08628350e+03 113: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 113: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 113: 113: External libraries: 113: Boost 1.83.0 (https://www.boost.org/) 113: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 113: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 113: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 113: 113: reading took 0.0586 seconds 113: Numerical Statistics: 113: Matrix range [1e-04,1e+03] 113: Objective range [3e-04,3e+02] 113: Bounds range [1e+01,1e+02] 113: RHS range [0e+00,0e+00] 113: Dynamism Variables: 2e+05 113: Dynamism Rows : 2e+06 113: set presolve.componentsmaxint = -1 113: set presolve.detectlindep = 0 113: set doubletoneq.enabled = 0 113: set dualinfer.enabled = 0 113: set substitution.enabled = 0 113: set sparsify.enabled = 0 113: 113: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bore3d.mps with dual-postsolve activated 113: rows: 233 113: columns: 315 113: int. columns: 0 113: cont. columns: 315 113: nonzeros: 1429 113: 113: round 0 ( Trivial ): 39 del cols, 41 del rows, 40 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 113: round 1 ( Fast ): 91 del cols, 58 del rows, 131 chg bounds, 0 chg sides, 0 chg coeffs, 184 tsx applied, 0 tsx conflicts 113: round 2 ( Fast ): 122 del cols, 90 del rows, 201 chg bounds, 0 chg sides, 0 chg coeffs, 296 tsx applied, 0 tsx conflicts 113: round 3 ( Fast ): 126 del cols, 94 del rows, 230 chg bounds, 0 chg sides, 0 chg coeffs, 348 tsx applied, 0 tsx conflicts 113: round 4 ( Medium ): 193 del cols, 155 del rows, 245 chg bounds, 18 chg sides, 12 chg coeffs, 441 tsx applied, 303 tsx conflicts 113: round 5 ( Medium ): 221 del cols, 156 del rows, 273 chg bounds, 23 chg sides, 15 chg coeffs, 597 tsx applied, 307 tsx conflicts 113: round 6 ( Fast ): 221 del cols, 156 del rows, 283 chg bounds, 23 chg sides, 15 chg coeffs, 617 tsx applied, 307 tsx conflicts 113: round 7 (Exhaustive): 221 del cols, 156 del rows, 289 chg bounds, 23 chg sides, 15 chg coeffs, 624 tsx applied, 307 tsx conflicts 113: round 8 ( Final ): 221 del cols, 156 del rows, 292 chg bounds, 23 chg sides, 15 chg coeffs, 628 tsx applied, 307 tsx conflicts 113: presolved 8 rounds: 221 del cols, 156 del rows, 292 chg bounds, 23 chg sides, 15 chg coeffs, 628 tsx applied, 307 tsx conflicts 113: 113: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 113: colsingleton 8 0.0 0 0.0 0.000 113: coefftightening 0 0.0 0 0.0 0.000 113: propagation 8 100.0 404 100.0 0.021 113: fixcontinuous 2 0.0 0 0.0 0.000 113: simpleprobing 0 0.0 0 0.0 0.000 113: parallelrows 2 50.0 2 100.0 0.014 113: parallelcols 2 0.0 0 0.0 0.004 113: stuffing 3 66.7 492 38.8 0.004 113: dualfix 4 100.0 37 83.8 0.001 113: simplifyineq 0 0.0 0 0.0 0.000 113: doubletoneq 0 0.0 0 0.0 0.000 113: implint 0 0.0 0 0.0 0.000 113: domcol 1 0.0 0 0.0 0.006 113: dualinfer 0 0.0 0 0.0 0.000 113: probing 0 0.0 0 0.0 0.000 113: substitution 0 0.0 0 0.0 0.000 113: sparsify 0 0.0 0 0.0 0.000 113: 113: reduced problem: 113: reduced rows: 77 113: reduced columns: 94 113: reduced int. columns: 0 113: reduced cont. columns: 94 113: reduced nonzeros: 501 113: 113: presolving finished after 0.150 seconds 113: 113: Equilibrium scaling LP (persistent) 113: Simplifier removed 14 rows, 12 columns, 77 nonzeros, 11 col bounds, 179 row bounds 113: Reduced LP has 63 rows 82 columns 424 nonzeros 113: Equilibrium scaling LP 113: type | time | iters | facts | shift | viol sum | viol num | obj value 113: L | 0.0 | 0 | 3 | 1.75e+01 | 3.38e+06 | 41 | -2.03611201e+06 113: E | 0.0 | 55 | 5 | 0.00e+00 | 3.44e-03 | 2 | 1.37467410e+03 113: E | 0.0 | 58 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 113: --- unscaling internal solution 113: --- unsimplifying solution and basis 113: --- unscaling external solution 113: --- verifying computed solution 113: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 113: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 113: --- unscaling external solution 113: --- verifying computed solution 114: L | 0.0 | 399 | 7 | 9.10e-01 | 2.21e+01 | 28 | 1.51066228e+03 114: E | 0.0 | 412 | 9 | 0.00e+00 | 1.47e-02 | 2 | 1.51851652e+03 114: E | 0.0 | 413 | 11 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 114: --- unscaling internal solution 114: --- unsimplifying solution and basis 114: --- unscaling external solution 114: --- verifying computed solution 114: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 114: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 114: --- unscaling external solution 114: --- verifying computed solution 114: 114: SoPlex status : problem is solved [optimal] 114: Solving time (sec) : 0.04 114: Iterations : 413 114: Objective value : 1.51850990e+03 114: 114: Solution passed validation 114: 114: postsolve finished after 0.000 seconds 114: feasible: true 114: objective value: 1518.50989648813 114: 114: violations: 114: bounds: 0 114: constraints: 0 114: integrality: 0 114: 114: validation: SUCCESS 114: Solving time 0.123 seconds 114: 114: solving finished after 0.123 seconds 115: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 115: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 115: 115: External libraries: 115: Boost 1.83.0 (https://www.boost.org/) 115: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 115: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 115: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 115: 115: reading took 0.0175 seconds 115: Numerical Statistics: 115: Matrix range [0e+00,2e+02] 115: Objective range [1e+00,1e+00] 115: Bounds range [0e+00,0e+00] 115: RHS range [2e-01,1e+02] 115: Dynamism Variables: 4e+04 115: Dynamism Rows : 2e+04 115: set presolve.componentsmaxint = -1 115: set presolve.detectlindep = 0 115: set doubletoneq.enabled = 0 115: set dualinfer.enabled = 0 115: set substitution.enabled = 0 115: set sparsify.enabled = 0 115: 115: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/brandy.mps with dual-postsolve activated 115: rows: 220 115: columns: 249 115: int. columns: 0 115: cont. columns: 249 115: nonzeros: 2148 115: 115: round 0 ( Trivial ): 41 del cols, 58 del rows, 73 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 115: round 1 ( Fast ): 44 del cols, 59 del rows, 155 chg bounds, 0 chg sides, 0 chg coeffs, 170 tsx applied, 0 tsx conflicts 115: round 2 ( Fast ): 44 del cols, 59 del rows, 222 chg bounds, 0 chg sides, 0 chg coeffs, 344 tsx applied, 0 tsx conflicts 115: round 3 ( Medium ): 61 del cols, 61 del rows, 222 chg bounds, 11 chg sides, 11 chg coeffs, 361 tsx applied, 29 tsx conflicts 115: round 4 ( Medium ): 64 del cols, 63 del rows, 222 chg bounds, 12 chg sides, 12 chg coeffs, 364 tsx applied, 32 tsx conflicts 115: round 5 (Exhaustive): 66 del cols, 64 del rows, 226 chg bounds, 12 chg sides, 12 chg coeffs, 369 tsx applied, 32 tsx conflicts 115: round 6 ( Final ): 66 del cols, 64 del rows, 226 chg bounds, 12 chg sides, 12 chg coeffs, 369 tsx applied, 32 tsx conflicts 115: presolved 6 rounds: 66 del cols, 64 del rows, 226 chg bounds, 12 chg sides, 12 chg coeffs, 369 tsx applied, 32 tsx conflicts 115: 115: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 115: colsingleton 6 0.0 0 0.0 0.000 115: coefftightening 0 0.0 0 0.0 0.000 115: propagation 6 33.3 344 100.0 0.005 115: fixcontinuous 2 0.0 0 0.0 0.000 115: simpleprobing 0 0.0 0 0.0 0.000 115: parallelrows 2 0.0 0 0.0 0.001 115: parallelcols 2 50.0 4 100.0 0.002 115: stuffing 3 66.7 48 33.3 0.001 115: dualfix 3 33.3 4 100.0 0.000 115: simplifyineq 0 0.0 0 0.0 0.000 115: doubletoneq 0 0.0 0 0.0 0.000 115: implint 0 0.0 0 0.0 0.000 115: domcol 1 100.0 1 100.0 0.003 115: dualinfer 0 0.0 0 0.0 0.000 115: probing 0 0.0 0 0.0 0.000 115: substitution 0 0.0 0 0.0 0.000 115: sparsify 0 0.0 0 0.0 0.000 115: 115: reduced problem: 115: reduced rows: 118 115: reduced columns: 183 115: reduced int. columns: 0 115: reduced cont. columns: 183 115: reduced nonzeros: 1657 115: 115: presolving finished after 0.040 seconds 115: 115: Equilibrium scaling LP (persistent) 115: Simplifier removed 5 rows, 4 columns, 16 nonzeros, 16 col bounds, 32 row bounds 115: Reduced LP has 113 rows 179 columns 1636 nonzeros 115: Equilibrium scaling LP 115: type | time | iters | facts | shift | viol sum | viol num | obj value 115: L | 0.0 | 0 | 3 | 9.10e-01 | 5.76e+02 | 66 | -6.59687745e+02 113/287 Test #114: d-solve-brandy.mps-lp_presolvers_with_basis.set ............................................ Passed 0.21 sec test 117 Start 117: d-solve-capri.mps-lp_presolvers_with_basis.set 117: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/capri.mps" "-o" "0.26900129137681610087717280693754e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 117: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 117: Test timeout computed to be: 10000000 115: L | 0.0 | 199 | 6 | 9.10e-01 | 6.37e+02 | 22 | 1.08578868e+03 113: 113: SoPlex status : problem is solved [optimal] 113: Solving time (sec) : 0.00 113: Iterations : 58 113: Objective value : 1.37308039e+03 113: 113: Solution passed validation 113: 113: postsolve finished after 0.049 seconds 113: feasible: true 113: objective value: 1373.08039420849 113: 113: violations: 113: bounds: 1.16226472890446e-16 113: constraints: 0 113: integrality: 0 113: 113: validation: SUCCESS 113: Solving time 0.218 seconds 113: 113: solving finished after 0.218 seconds 114/287 Test #113: r-solve-bore3d.mps-lp_presolvers_with_basis.set ............................................ Passed 0.36 sec 115: L | 0.0 | 399 | 7 | 9.10e-01 | 2.21e+01 | 36 | 1.51066228e+03 115: E | 0.0 | 412 | 9 | 0.00e+00 | 1.47e-02 | 2 | 1.51851652e+03 115: E | 0.0 | 413 | 11 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 115: --- unscaling internal solution 115: --- unsimplifying solution and basis 115: --- unscaling external solution 115: --- verifying computed solution 115: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 115: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 115: --- unscaling external solution 115: --- verifying computed solution test 118 Start 118: q-solve-capri.mps-lp_presolvers_with_basis.set 118: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/capri.mps" "-o" "0.26900129137681610087717280693754e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 118: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 118: Test timeout computed to be: 10000000 117: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 117: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 117: 117: External libraries: 117: Boost 1.83.0 (https://www.boost.org/) 117: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 117: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 117: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 117: 117: reading took 0.0251 seconds 117: Numerical Statistics: 117: Matrix range [4e-03,2e+02] 117: Objective range [2e-01,1e+00] 117: Bounds range [1e+00,3e+02] 117: RHS range [3e-02,3e+03] 117: Dynamism Variables: 1e+04 117: Dynamism Rows : 2e+06 117: set presolve.componentsmaxint = -1 117: set presolve.detectlindep = 0 117: set doubletoneq.enabled = 0 117: set dualinfer.enabled = 0 117: set substitution.enabled = 0 117: set sparsify.enabled = 0 117: 117: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/capri.mps with dual-postsolve activated 117: rows: 271 117: columns: 353 117: int. columns: 0 117: cont. columns: 353 117: nonzeros: 1767 117: 117: round 0 ( Trivial ): 24 del cols, 8 del rows, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 117: round 1 ( Fast ): 27 del cols, 11 del rows, 89 chg bounds, 0 chg sides, 0 chg coeffs, 214 tsx applied, 0 tsx conflicts 117: round 2 ( Fast ): 32 del cols, 16 del rows, 135 chg bounds, 0 chg sides, 0 chg coeffs, 348 tsx applied, 0 tsx conflicts 117: round 3 ( Medium ): 43 del cols, 26 del rows, 159 chg bounds, 1 chg sides, 1 chg coeffs, 406 tsx applied, 25 tsx conflicts 117: round 4 ( Medium ): 50 del cols, 30 del rows, 179 chg bounds, 7 chg sides, 4 chg coeffs, 452 tsx applied, 32 tsx conflicts 117: round 5 (Exhaustive): 50 del cols, 30 del rows, 188 chg bounds, 7 chg sides, 4 chg coeffs, 469 tsx applied, 32 tsx conflicts 117: round 6 ( Final ): 50 del cols, 30 del rows, 189 chg bounds, 7 chg sides, 4 chg coeffs, 471 tsx applied, 32 tsx conflicts 117: presolved 6 rounds: 50 del cols, 30 del rows, 189 chg bounds, 7 chg sides, 4 chg coeffs, 471 tsx applied, 32 tsx conflicts 117: 117: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 117: colsingleton 6 0.0 0 0.0 0.000 117: coefftightening 0 0.0 0 0.0 0.000 117: propagation 6 100.0 448 100.0 0.009 117: fixcontinuous 2 0.0 0 0.0 0.000 117: simpleprobing 0 0.0 0 0.0 0.000 117: parallelrows 2 0.0 0 0.0 0.001 117: parallelcols 2 0.0 0 0.0 0.001 117: stuffing 3 66.7 50 36.0 0.000 117: dualfix 4 75.0 5 100.0 0.000 117: simplifyineq 0 0.0 0 0.0 0.000 117: doubletoneq 0 0.0 0 0.0 0.000 117: implint 0 0.0 0 0.0 0.000 117: domcol 1 0.0 0 0.0 0.000 117: dualinfer 0 0.0 0 0.0 0.000 117: probing 0 0.0 0 0.0 0.000 117: substitution 0 0.0 0 0.0 0.000 117: sparsify 0 0.0 0 0.0 0.000 117: 117: reduced problem: 117: reduced rows: 241 117: reduced columns: 303 117: reduced int. columns: 0 117: reduced cont. columns: 303 117: reduced nonzeros: 1395 117: 117: presolving finished after 0.022 seconds 117: 117: Equilibrium scaling LP (persistent) 115: 115: SoPlex status : problem is solved [optimal] 115: Solving time (sec) : 0.04 115: Iterations : 413 115: Objective value : 1.51850990e+03 115: 115: Solution passed validation 115: 115: postsolve finished after 0.039 seconds 115: feasible: true 115: objective value: 1518.50989648813 115: 115: violations: 115: bounds: 0 115: constraints: 0 115: integrality: 0 115: 115: validation: SUCCESS 115: Solving time 0.145 seconds 115: 115: solving finished after 0.145 seconds 115/287 Test #115: q-solve-brandy.mps-lp_presolvers_with_basis.set ............................................ Passed 0.26 sec 117: Simplifier removed 23 rows, 23 columns, 94 nonzeros, 130 col bounds, 108 row bounds 117: Reduced LP has 218 rows 280 columns 1301 nonzeros 117: Equilibrium scaling LP test 119 Start 119: r-solve-capri.mps-lp_presolvers_with_basis.set 119: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/capri.mps" "-o" "0.26900129137681610087717280693754e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 119: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 119: Test timeout computed to be: 10000000 117: type | time | iters | facts | shift | viol sum | viol num | obj value 117: L | 0.0 | 0 | 3 | 8.81e+00 | 3.35e+04 | 121 | -1.68096560e+03 117: L | 0.0 | 199 | 3 | 8.81e+00 | 7.95e+01 | 121 | -1.45463771e+03 117: E | 0.0 | 265 | 5 | 0.00e+00 | 3.42e+01 | 20 | 3.02930214e+03 116: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 116: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 116: 116: External libraries: 116: Boost 1.83.0 (https://www.boost.org/) 116: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 116: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 116: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 116: 116: reading took 0.0482 seconds 116: Numerical Statistics: 116: Matrix range [0e+00,2e+02] 116: Objective range [1e+00,1e+00] 116: Bounds range [0e+00,0e+00] 116: RHS range [2e-01,1e+02] 116: Dynamism Variables: 4e+04 116: Dynamism Rows : 2e+04 116: set presolve.componentsmaxint = -1 116: set presolve.detectlindep = 0 116: set doubletoneq.enabled = 0 116: set dualinfer.enabled = 0 116: set substitution.enabled = 0 116: set sparsify.enabled = 0 116: 116: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/brandy.mps with dual-postsolve activated 116: rows: 220 116: columns: 249 116: int. columns: 0 116: cont. columns: 249 116: nonzeros: 2148 116: 116: round 0 ( Trivial ): 41 del cols, 58 del rows, 73 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 116: round 1 ( Fast ): 44 del cols, 59 del rows, 155 chg bounds, 0 chg sides, 0 chg coeffs, 170 tsx applied, 0 tsx conflicts 116: round 2 ( Fast ): 44 del cols, 59 del rows, 222 chg bounds, 0 chg sides, 0 chg coeffs, 344 tsx applied, 0 tsx conflicts 116: round 3 ( Medium ): 61 del cols, 61 del rows, 222 chg bounds, 11 chg sides, 11 chg coeffs, 361 tsx applied, 29 tsx conflicts 116: round 4 ( Medium ): 64 del cols, 63 del rows, 222 chg bounds, 12 chg sides, 12 chg coeffs, 364 tsx applied, 32 tsx conflicts 116: round 5 (Exhaustive): 66 del cols, 64 del rows, 226 chg bounds, 12 chg sides, 12 chg coeffs, 369 tsx applied, 32 tsx conflicts 116: round 6 ( Final ): 66 del cols, 64 del rows, 226 chg bounds, 12 chg sides, 12 chg coeffs, 369 tsx applied, 32 tsx conflicts 116: presolved 6 rounds: 66 del cols, 64 del rows, 226 chg bounds, 12 chg sides, 12 chg coeffs, 369 tsx applied, 32 tsx conflicts 116: 116: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 116: colsingleton 6 0.0 0 0.0 0.000 116: coefftightening 0 0.0 0 0.0 0.000 116: propagation 6 33.3 344 100.0 0.019 116: fixcontinuous 2 0.0 0 0.0 0.000 116: simpleprobing 0 0.0 0 0.0 0.000 116: parallelrows 2 0.0 0 0.0 0.023 116: parallelcols 2 50.0 4 100.0 0.010 116: stuffing 3 66.7 48 33.3 0.005 116: dualfix 3 33.3 4 100.0 0.001 116: simplifyineq 0 0.0 0 0.0 0.000 116: doubletoneq 0 0.0 0 0.0 0.000 116: implint 0 0.0 0 0.0 0.000 116: domcol 1 100.0 1 100.0 0.013 116: dualinfer 0 0.0 0 0.0 0.000 116: probing 0 0.0 0 0.0 0.000 116: substitution 0 0.0 0 0.0 0.000 116: sparsify 0 0.0 0 0.0 0.000 116: 116: reduced problem: 116: reduced rows: 118 116: reduced columns: 183 116: reduced int. columns: 0 116: reduced cont. columns: 183 116: reduced nonzeros: 1657 116: 116: presolving finished after 0.159 seconds 116: 116: Equilibrium scaling LP (persistent) 117: E | 0.0 | 325 | 6 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 117: --- unscaling internal solution 117: --- unsimplifying solution and basis 117: --- unscaling external solution 117: --- verifying computed solution 117: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 117: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 117: --- unscaling external solution 117: --- verifying computed solution 116: Simplifier removed 5 rows, 4 columns, 16 nonzeros, 16 col bounds, 32 row bounds 116: Reduced LP has 113 rows 179 columns 1636 nonzeros 116: Equilibrium scaling LP 116: type | time | iters | facts | shift | viol sum | viol num | obj value 116: L | 0.0 | 0 | 3 | 9.10e-01 | 5.76e+02 | 66 | -6.59687745e+02 117: 117: SoPlex status : problem is solved [optimal] 117: Solving time (sec) : 0.04 117: Iterations : 325 117: Objective value : 2.69001291e+03 117: 117: Solution passed validation 117: 117: postsolve finished after 0.000 seconds 117: feasible: true 117: objective value: 2690.01291376816 117: 117: violations: 117: bounds: 4.44089209850063e-16 117: constraints: 0 117: integrality: 0 117: 117: validation: SUCCESS 117: Solving time 0.116 seconds 117: 117: solving finished after 0.116 seconds 116/287 Test #117: d-solve-capri.mps-lp_presolvers_with_basis.set ............................................. Passed 0.21 sec test 120 Start 120: d-solve-finnis.mps-lp_presolvers_with_basis.set 120: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/finnis.mps" "-o" "0.17279106559561159432297900375543e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 120: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 120: Test timeout computed to be: 10000000 116: L | 0.0 | 199 | 6 | 9.10e-01 | 1.45e+03 | 19 | 1.08628350e+03 118: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 118: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 118: 118: External libraries: 118: Boost 1.83.0 (https://www.boost.org/) 118: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 118: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 118: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 118: 118: reading took 0.0605 seconds 118: Numerical Statistics: 118: Matrix range [4e-03,2e+02] 118: Objective range [2e-01,1e+00] 118: Bounds range [1e+00,3e+02] 118: RHS range [3e-02,3e+03] 118: Dynamism Variables: 1e+04 118: Dynamism Rows : 2e+06 118: set presolve.componentsmaxint = -1 118: set presolve.detectlindep = 0 118: set doubletoneq.enabled = 0 118: set dualinfer.enabled = 0 118: set substitution.enabled = 0 118: set sparsify.enabled = 0 118: 118: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/capri.mps with dual-postsolve activated 118: rows: 271 118: columns: 353 118: int. columns: 0 118: cont. columns: 353 118: nonzeros: 1767 118: 118: round 0 ( Trivial ): 24 del cols, 8 del rows, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 118: round 1 ( Fast ): 27 del cols, 11 del rows, 101 chg bounds, 0 chg sides, 0 chg coeffs, 214 tsx applied, 0 tsx conflicts 118: round 2 ( Fast ): 32 del cols, 16 del rows, 147 chg bounds, 0 chg sides, 0 chg coeffs, 348 tsx applied, 0 tsx conflicts 118: round 3 ( Medium ): 43 del cols, 26 del rows, 171 chg bounds, 1 chg sides, 1 chg coeffs, 406 tsx applied, 25 tsx conflicts 118: round 4 ( Medium ): 50 del cols, 30 del rows, 191 chg bounds, 7 chg sides, 4 chg coeffs, 452 tsx applied, 32 tsx conflicts 118: round 5 (Exhaustive): 50 del cols, 30 del rows, 200 chg bounds, 7 chg sides, 4 chg coeffs, 469 tsx applied, 32 tsx conflicts 118: round 6 ( Final ): 50 del cols, 30 del rows, 201 chg bounds, 7 chg sides, 4 chg coeffs, 471 tsx applied, 32 tsx conflicts 118: presolved 6 rounds: 50 del cols, 30 del rows, 201 chg bounds, 7 chg sides, 4 chg coeffs, 471 tsx applied, 32 tsx conflicts 118: 118: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 118: colsingleton 6 0.0 0 0.0 0.000 118: coefftightening 0 0.0 0 0.0 0.000 118: propagation 6 100.0 448 100.0 0.009 118: fixcontinuous 2 0.0 0 0.0 0.000 118: simpleprobing 0 0.0 0 0.0 0.000 118: parallelrows 2 0.0 0 0.0 0.009 118: parallelcols 2 0.0 0 0.0 0.002 118: stuffing 3 66.7 50 36.0 0.001 118: dualfix 4 75.0 5 100.0 0.001 118: simplifyineq 0 0.0 0 0.0 0.000 118: doubletoneq 0 0.0 0 0.0 0.000 118: implint 0 0.0 0 0.0 0.000 118: domcol 1 0.0 0 0.0 0.009 118: dualinfer 0 0.0 0 0.0 0.000 118: probing 0 0.0 0 0.0 0.000 118: substitution 0 0.0 0 0.0 0.000 118: sparsify 0 0.0 0 0.0 0.000 118: 118: reduced problem: 118: reduced rows: 241 118: reduced columns: 303 118: reduced int. columns: 0 118: reduced cont. columns: 303 118: reduced nonzeros: 1395 118: 118: presolving finished after 0.069 seconds 118: 118: Equilibrium scaling LP (persistent) 116: L | 0.0 | 399 | 7 | 9.10e-01 | 2.21e+01 | 28 | 1.51066228e+03 118: Simplifier removed 23 rows, 23 columns, 94 nonzeros, 130 col bounds, 108 row bounds 118: Reduced LP has 218 rows 280 columns 1301 nonzeros 118: Equilibrium scaling LP 118: type | time | iters | facts | shift | viol sum | viol num | obj value 118: L | 0.0 | 0 | 3 | 8.81e+00 | 3.35e+04 | 121 | -1.68096560e+03 116: E | 0.0 | 412 | 9 | 0.00e+00 | 1.47e-02 | 2 | 1.51851652e+03 116: E | 0.0 | 413 | 11 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 116: --- unscaling internal solution 116: --- unsimplifying solution and basis 116: --- unscaling external solution 116: --- verifying computed solution 116: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 116: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 116: --- unscaling external solution 116: --- verifying computed solution 118: L | 0.0 | 199 | 3 | 8.81e+00 | 1.02e+02 | 121 | -1.31935977e+03 118: E | 0.0 | 254 | 5 | 0.00e+00 | 3.43e+01 | 20 | 3.02930214e+03 118: E | 0.0 | 307 | 6 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 118: --- unscaling internal solution 118: --- unsimplifying solution and basis 118: --- unscaling external solution 118: --- verifying computed solution 118: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 118: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 118: --- unscaling external solution 118: --- verifying computed solution 120: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 120: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 120: 120: External libraries: 120: Boost 1.83.0 (https://www.boost.org/) 120: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 120: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 120: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 120: 120: reading took 0.0422 seconds 120: Numerical Statistics: 120: Matrix range [5e-04,3e+01] 120: Objective range [1e-05,4e+03] 120: Bounds range [1e-04,3e+04] 120: RHS range [1e-02,4e+03] 120: Dynamism Variables: 2e+03 120: Dynamism Rows : 4e+03 120: set presolve.componentsmaxint = -1 120: set presolve.detectlindep = 0 120: set doubletoneq.enabled = 0 120: set dualinfer.enabled = 0 120: set substitution.enabled = 0 120: set sparsify.enabled = 0 120: 120: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/finnis.mps with dual-postsolve activated 120: rows: 497 120: columns: 614 120: int. columns: 0 120: cont. columns: 614 120: nonzeros: 2310 120: 120: round 0 ( Trivial ): 74 del cols, 73 del rows, 57 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 120: round 1 ( Fast ): 86 del cols, 82 del rows, 250 chg bounds, 0 chg sides, 0 chg coeffs, 424 tsx applied, 0 tsx conflicts 120: round 2 ( Fast ): 87 del cols, 101 del rows, 282 chg bounds, 0 chg sides, 0 chg coeffs, 448 tsx applied, 0 tsx conflicts 120: round 3 ( Medium ): 147 del cols, 119 del rows, 383 chg bounds, 28 chg sides, 18 chg coeffs, 595 tsx applied, 62 tsx conflicts 120: round 4 ( Medium ): 171 del cols, 135 del rows, 469 chg bounds, 34 chg sides, 19 chg coeffs, 691 tsx applied, 67 tsx conflicts 120: round 5 ( Medium ): 174 del cols, 138 del rows, 548 chg bounds, 37 chg sides, 19 chg coeffs, 773 tsx applied, 77 tsx conflicts 120: round 6 (Exhaustive): 175 del cols, 138 del rows, 558 chg bounds, 37 chg sides, 19 chg coeffs, 784 tsx applied, 77 tsx conflicts 120: round 7 ( Final ): 175 del cols, 138 del rows, 562 chg bounds, 37 chg sides, 19 chg coeffs, 788 tsx applied, 77 tsx conflicts 120: presolved 7 rounds: 175 del cols, 138 del rows, 562 chg bounds, 37 chg sides, 19 chg coeffs, 788 tsx applied, 77 tsx conflicts 120: 120: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 120: colsingleton 7 0.0 0 0.0 0.000 120: coefftightening 0 0.0 0 0.0 0.000 120: propagation 7 57.1 464 100.0 0.001 120: fixcontinuous 2 0.0 0 0.0 0.000 120: simpleprobing 0 0.0 0 0.0 0.000 120: parallelrows 2 0.0 0 0.0 0.001 120: parallelcols 2 50.0 1 100.0 0.009 120: stuffing 4 75.0 111 48.6 0.000 120: dualfix 5 100.0 289 93.1 0.000 120: simplifyineq 0 0.0 0 0.0 0.000 120: doubletoneq 0 0.0 0 0.0 0.000 120: implint 0 0.0 0 0.0 0.000 120: domcol 1 0.0 0 0.0 0.000 120: dualinfer 0 0.0 0 0.0 0.000 120: probing 0 0.0 0 0.0 0.000 120: substitution 0 0.0 0 0.0 0.000 120: sparsify 0 0.0 0 0.0 0.000 120: 120: reduced problem: 120: reduced rows: 359 120: reduced columns: 439 120: reduced int. columns: 0 120: reduced cont. columns: 439 120: reduced nonzeros: 1506 120: 120: presolving finished after 0.025 seconds 120: 120: Equilibrium scaling LP (persistent) 120: Simplifier removed 17 rows, 17 columns, 42 nonzeros, 14 col bounds, 22 row bounds 120: Reduced LP has 342 rows 422 columns 1470 nonzeros 120: Equilibrium scaling LP 120: type | time | iters | facts | shift | viol sum | viol num | obj value 120: L | 0.0 | 0 | 3 | 1.80e+01 | 2.22e+04 | 71 | -2.16055972e+05 118: 118: SoPlex status : problem is solved [optimal] 118: Solving time (sec) : 0.02 118: Iterations : 307 118: Objective value : 2.69001291e+03 118: 118: Solution passed validation 118: 118: postsolve finished after 0.042 seconds 118: feasible: true 118: objective value: 2690.01291376816 118: 118: violations: 118: bounds: 3.59186458354088e-15 118: constraints: 0 118: integrality: 0 118: 118: validation: SUCCESS 118: Solving time 0.183 seconds 118: 118: solving finished after 0.183 seconds 117/287 Test #118: q-solve-capri.mps-lp_presolvers_with_basis.set ............................................. Passed 0.34 sec test 121 Start 121: q-solve-finnis.mps-lp_presolvers_with_basis.set 121: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/finnis.mps" "-o" "0.17279106559561159432297900375543e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 121: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 121: Test timeout computed to be: 10000000 116: 116: SoPlex status : problem is solved [optimal] 116: Solving time (sec) : 0.04 116: Iterations : 413 116: Objective value : 1.51850990e+03 116: 116: Solution passed validation 116: 116: postsolve finished after 0.064 seconds 116: feasible: true 116: objective value: 1518.50989648813 116: 116: violations: 116: bounds: 0 116: constraints: 0 116: integrality: 0 116: 116: validation: SUCCESS 116: Solving time 0.365 seconds 116: 116: solving finished after 0.365 seconds 118/287 Test #116: r-solve-brandy.mps-lp_presolvers_with_basis.set ............................................ Passed 0.51 sec test 122 Start 122: r-solve-finnis.mps-lp_presolvers_with_basis.set 122: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/finnis.mps" "-o" "0.17279106559561159432297900375543e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 122: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 122: Test timeout computed to be: 10000000 120: L | 0.0 | 199 | 3 | 1.80e+01 | 1.78e+04 | 71 | 1.29773130e+05 120: E | 0.0 | 385 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 120: E | 0.0 | 385 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 120: --- unscaling internal solution 120: --- unsimplifying solution and basis 119: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 119: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 119: 119: External libraries: 119: Boost 1.83.0 (https://www.boost.org/) 119: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 119: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 119: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 119: 119: reading took 0.0525 seconds 119: Numerical Statistics: 119: Matrix range [4e-03,2e+02] 119: Objective range [2e-01,1e+00] 119: Bounds range [1e+00,3e+02] 119: RHS range [3e-02,3e+03] 119: Dynamism Variables: 1e+04 119: Dynamism Rows : 2e+06 119: set presolve.componentsmaxint = -1 119: set presolve.detectlindep = 0 119: set doubletoneq.enabled = 0 119: set dualinfer.enabled = 0 119: set substitution.enabled = 0 119: set sparsify.enabled = 0 119: 119: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/capri.mps with dual-postsolve activated 119: rows: 271 119: columns: 353 119: int. columns: 0 119: cont. columns: 353 119: nonzeros: 1767 119: 119: round 0 ( Trivial ): 24 del cols, 8 del rows, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 119: round 1 ( Fast ): 27 del cols, 11 del rows, 89 chg bounds, 0 chg sides, 0 chg coeffs, 214 tsx applied, 0 tsx conflicts 119: round 2 ( Fast ): 32 del cols, 16 del rows, 135 chg bounds, 0 chg sides, 0 chg coeffs, 348 tsx applied, 0 tsx conflicts 119: round 3 ( Medium ): 43 del cols, 26 del rows, 159 chg bounds, 1 chg sides, 1 chg coeffs, 406 tsx applied, 25 tsx conflicts 119: round 4 ( Medium ): 50 del cols, 30 del rows, 179 chg bounds, 7 chg sides, 4 chg coeffs, 452 tsx applied, 32 tsx conflicts 119: round 5 (Exhaustive): 50 del cols, 30 del rows, 188 chg bounds, 7 chg sides, 4 chg coeffs, 469 tsx applied, 32 tsx conflicts 119: round 6 ( Final ): 50 del cols, 30 del rows, 189 chg bounds, 7 chg sides, 4 chg coeffs, 471 tsx applied, 32 tsx conflicts 119: presolved 6 rounds: 50 del cols, 30 del rows, 189 chg bounds, 7 chg sides, 4 chg coeffs, 471 tsx applied, 32 tsx conflicts 119: 119: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 119: colsingleton 6 0.0 0 0.0 0.000 119: coefftightening 0 0.0 0 0.0 0.000 119: propagation 6 100.0 448 100.0 0.039 119: fixcontinuous 2 0.0 0 0.0 0.001 119: simpleprobing 0 0.0 0 0.0 0.000 119: parallelrows 2 0.0 0 0.0 0.040 119: parallelcols 2 0.0 0 0.0 0.009 119: stuffing 3 66.7 50 36.0 0.001 119: dualfix 4 75.0 5 100.0 0.003 119: simplifyineq 0 0.0 0 0.0 0.000 119: doubletoneq 0 0.0 0 0.0 0.000 119: implint 0 0.0 0 0.0 0.000 119: domcol 1 0.0 0 0.0 0.011 119: dualinfer 0 0.0 0 0.0 0.000 119: probing 0 0.0 0 0.0 0.000 120: --- unscaling external solution 120: --- verifying computed solution 120: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 120: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 120: --- unscaling external solution 120: --- verifying computed solution 120: 120: SoPlex status : problem is solved [optimal] 120: Solving time (sec) : 0.04 120: Iterations : 385 120: Objective value : 1.72791066e+05 120: 120: Solution passed validation 120: 120: postsolve finished after 0.001 seconds 120: feasible: true 120: objective value: 172791.065595612 120: 120: violations: 120: bounds: 0 120: constraints: 0 120: integrality: 0 120: 120: validation: SUCCESS 120: Solving time 0.145 seconds 120: 120: solving finished after 0.145 seconds 119/287 Test #120: d-solve-finnis.mps-lp_presolvers_with_basis.set ............................................ Passed 0.26 sec test 123 Start 123: d-solve-israel.mps-lp_presolvers_with_basis.set 123: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/israel.mps" "-o" "-0.89664482186304572966200464196045e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 123: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 123: Test timeout computed to be: 10000000 119: substitution 0 0.0 0 0.0 0.000 119: sparsify 0 0.0 0 0.0 0.000 119: 119: reduced problem: 119: reduced rows: 241 119: reduced columns: 303 119: reduced int. columns: 0 119: reduced cont. columns: 303 119: reduced nonzeros: 1395 119: 119: presolving finished after 0.184 seconds 119: 119: Equilibrium scaling LP (persistent) 119: Simplifier removed 23 rows, 23 columns, 94 nonzeros, 130 col bounds, 108 row bounds 119: Reduced LP has 218 rows 280 columns 1301 nonzeros 119: Equilibrium scaling LP 119: type | time | iters | facts | shift | viol sum | viol num | obj value 119: L | 0.0 | 0 | 3 | 8.81e+00 | 3.35e+04 | 121 | -1.68096560e+03 119: L | 0.0 | 199 | 3 | 8.81e+00 | 1.42e+02 | 121 | -1.45532489e+03 119: E | 0.0 | 268 | 5 | 0.00e+00 | 3.43e+01 | 20 | 3.02930214e+03 119: E | 0.0 | 321 | 6 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 119: --- unscaling internal solution 119: --- unsimplifying solution and basis 119: --- unscaling external solution 119: --- verifying computed solution 119: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 119: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 119: --- unscaling external solution 119: --- verifying computed solution 123: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 123: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 123: 123: External libraries: 123: Boost 1.83.0 (https://www.boost.org/) 123: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 123: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 123: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 123: 123: reading took 0.023 seconds 123: Numerical Statistics: 123: Matrix range [1e-03,2e+03] 123: Objective range [2e-01,3e+03] 123: Bounds range [0e+00,0e+00] 123: RHS range [5e-01,9e+05] 123: Dynamism Variables: 5e+05 123: Dynamism Rows : 1e+04 123: set presolve.componentsmaxint = -1 123: set presolve.detectlindep = 0 123: set doubletoneq.enabled = 0 123: set dualinfer.enabled = 0 123: set substitution.enabled = 0 123: set sparsify.enabled = 0 123: 123: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/israel.mps with dual-postsolve activated 123: rows: 174 123: columns: 142 123: int. columns: 0 123: cont. columns: 142 123: nonzeros: 2269 123: 123: round 0 ( Trivial ): 1 del cols, 11 del rows, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 123: round 1 ( Fast ): 1 del cols, 11 del rows, 298 chg bounds, 0 chg sides, 0 chg coeffs, 1506 tsx applied, 0 tsx conflicts 123: round 2 ( Fast ): 1 del cols, 11 del rows, 326 chg bounds, 0 chg sides, 0 chg coeffs, 1594 tsx applied, 0 tsx conflicts 123: round 3 (Exhaustive): 3 del cols, 11 del rows, 329 chg bounds, 0 chg sides, 0 chg coeffs, 1597 tsx applied, 0 tsx conflicts 123: round 4 (Exhaustive): 3 del cols, 11 del rows, 329 chg bounds, 0 chg sides, 0 chg coeffs, 1597 tsx applied, 0 tsx conflicts 123: round 5 ( Final ): Unchanged 123: presolved 5 rounds: 3 del cols, 11 del rows, 329 chg bounds, 0 chg sides, 0 chg coeffs, 1597 tsx applied, 0 tsx conflicts 123: 123: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 123: colsingleton 5 0.0 0 0.0 0.000 123: coefftightening 0 0.0 0 0.0 0.000 123: propagation 5 40.0 1594 100.0 0.001 123: fixcontinuous 2 0.0 0 0.0 0.000 123: simpleprobing 0 0.0 0 0.0 0.000 123: parallelrows 1 0.0 0 0.0 0.000 123: parallelcols 1 0.0 0 0.0 0.006 123: stuffing 2 0.0 0 0.0 0.000 123: dualfix 2 50.0 1 100.0 0.000 123: simplifyineq 0 0.0 0 0.0 0.000 123: doubletoneq 0 0.0 0 0.0 0.000 123: implint 0 0.0 0 0.0 0.000 123: domcol 2 50.0 2 100.0 0.001 123: dualinfer 0 0.0 0 0.0 0.000 123: probing 0 0.0 0 0.0 0.000 123: substitution 0 0.0 0 0.0 0.000 123: sparsify 0 0.0 0 0.0 0.000 123: 123: reduced problem: 123: reduced rows: 163 123: reduced columns: 139 123: reduced int. columns: 0 123: reduced cont. columns: 139 123: reduced nonzeros: 2200 123: 123: presolving finished after 0.016 seconds 123: 123: Equilibrium scaling LP (persistent) 121: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 121: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 121: 121: External libraries: 121: Boost 1.83.0 (https://www.boost.org/) 121: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 121: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 121: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 121: 121: reading took 0.0472 seconds 121: Numerical Statistics: 121: Matrix range [5e-04,3e+01] 121: Objective range [1e-05,4e+03] 121: Bounds range [1e-04,3e+04] 121: RHS range [1e-02,4e+03] 121: Dynamism Variables: 2e+03 121: Dynamism Rows : 4e+03 121: set presolve.componentsmaxint = -1 121: set presolve.detectlindep = 0 121: set doubletoneq.enabled = 0 121: set dualinfer.enabled = 0 121: set substitution.enabled = 0 121: set sparsify.enabled = 0 121: 121: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/finnis.mps with dual-postsolve activated 121: rows: 497 121: columns: 614 121: int. columns: 0 121: cont. columns: 614 121: nonzeros: 2310 121: 121: round 0 ( Trivial ): 74 del cols, 73 del rows, 57 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 121: round 1 ( Fast ): 86 del cols, 82 del rows, 250 chg bounds, 0 chg sides, 0 chg coeffs, 424 tsx applied, 0 tsx conflicts 121: round 2 ( Fast ): 87 del cols, 101 del rows, 282 chg bounds, 0 chg sides, 0 chg coeffs, 448 tsx applied, 0 tsx conflicts 121: round 3 ( Medium ): 147 del cols, 119 del rows, 383 chg bounds, 28 chg sides, 18 chg coeffs, 595 tsx applied, 62 tsx conflicts 121: round 4 ( Medium ): 171 del cols, 135 del rows, 469 chg bounds, 34 chg sides, 19 chg coeffs, 691 tsx applied, 67 tsx conflicts 121: round 5 ( Medium ): 174 del cols, 138 del rows, 548 chg bounds, 37 chg sides, 19 chg coeffs, 773 tsx applied, 77 tsx conflicts 121: round 6 (Exhaustive): 175 del cols, 138 del rows, 558 chg bounds, 37 chg sides, 19 chg coeffs, 784 tsx applied, 77 tsx conflicts 121: round 7 ( Final ): 175 del cols, 138 del rows, 562 chg bounds, 37 chg sides, 19 chg coeffs, 788 tsx applied, 77 tsx conflicts 121: presolved 7 rounds: 175 del cols, 138 del rows, 562 chg bounds, 37 chg sides, 19 chg coeffs, 788 tsx applied, 77 tsx conflicts 121: 121: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 121: colsingleton 7 0.0 0 0.0 0.000 121: coefftightening 0 0.0 0 0.0 0.000 121: propagation 7 57.1 464 100.0 0.014 121: fixcontinuous 2 0.0 0 0.0 0.000 121: simpleprobing 0 0.0 0 0.0 0.000 121: parallelrows 2 0.0 0 0.0 0.006 121: parallelcols 2 50.0 1 100.0 0.003 121: stuffing 4 75.0 111 48.6 0.004 121: dualfix 5 100.0 289 93.1 0.003 121: simplifyineq 0 0.0 0 0.0 0.000 121: doubletoneq 0 0.0 0 0.0 0.000 121: implint 0 0.0 0 0.0 0.000 121: domcol 1 0.0 0 0.0 0.009 121: dualinfer 0 0.0 0 0.0 0.000 123: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 123: Reduced LP has 163 rows 139 columns 2200 nonzeros 123: Equilibrium scaling LP 123: type | time | iters | facts | shift | viol sum | viol num | obj value 123: L | 0.0 | 0 | 3 | 0.00e+00 | 1.15e+05 | 87 | -4.53451364e+06 121: probing 0 0.0 0 0.0 0.000 121: substitution 0 0.0 0 0.0 0.000 121: sparsify 0 0.0 0 0.0 0.000 121: 121: reduced problem: 121: reduced rows: 359 121: reduced columns: 439 121: reduced int. columns: 0 121: reduced cont. columns: 439 121: reduced nonzeros: 1506 121: 121: presolving finished after 0.100 seconds 121: 121: Equilibrium scaling LP (persistent) 123: L | 0.0 | 151 | 5 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 123: --- unscaling internal solution 123: --- unsimplifying solution and basis 123: --- unscaling external solution 123: --- verifying computed solution 123: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 123: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 123: --- unscaling external solution 123: --- verifying computed solution 121: Simplifier removed 17 rows, 17 columns, 42 nonzeros, 14 col bounds, 22 row bounds 121: Reduced LP has 342 rows 422 columns 1470 nonzeros 121: Equilibrium scaling LP 121: type | time | iters | facts | shift | viol sum | viol num | obj value 121: L | 0.0 | 0 | 3 | 1.80e+01 | 2.22e+04 | 71 | -2.16055972e+05 123: 123: SoPlex status : problem is solved [optimal] 123: Solving time (sec) : 0.02 123: Iterations : 151 123: Objective value : -8.96644822e+05 123: 123: Solution passed validation 123: 123: postsolve finished after 0.009 seconds 123: feasible: true 123: objective value: -896644.821863046 123: 123: violations: 123: bounds: 0 123: constraints: 0 123: integrality: 0 123: 123: validation: SUCCESS 123: Solving time 0.073 seconds 123: 123: solving finished after 0.073 seconds 120/287 Test #123: d-solve-israel.mps-lp_presolvers_with_basis.set ............................................ Passed 0.16 sec test 124 Start 124: q-solve-israel.mps-lp_presolvers_with_basis.set 124: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/israel.mps" "-o" "-0.89664482186304572966200464196045e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 124: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 124: Test timeout computed to be: 10000000 121: L | 0.0 | 199 | 3 | 1.80e+01 | 1.77e+04 | 71 | 1.29773130e+05 119: 119: SoPlex status : problem is solved [optimal] 119: Solving time (sec) : 0.02 119: Iterations : 321 119: Objective value : 2.69001291e+03 119: 119: Solution passed validation 119: 119: postsolve finished after 0.077 seconds 119: feasible: true 119: objective value: 2690.01291376816 119: 119: violations: 119: bounds: 1.42063072416931e-14 119: constraints: 0 119: integrality: 0 119: 119: validation: SUCCESS 119: Solving time 0.378 seconds 119: 119: solving finished after 0.378 seconds 121/287 Test #119: r-solve-capri.mps-lp_presolvers_with_basis.set ............................................. Passed 0.55 sec 121: E | 0.0 | 384 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 121: E | 0.0 | 384 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 121: --- unscaling internal solution 121: --- unsimplifying solution and basis 121: --- unscaling external solution 121: --- verifying computed solution 121: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 121: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 121: --- unscaling external solution 121: --- verifying computed solution test 125 Start 125: r-solve-israel.mps-lp_presolvers_with_basis.set 125: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/israel.mps" "-o" "-0.89664482186304572966200464196045e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 125: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 125: Test timeout computed to be: 10000000 121: 121: SoPlex status : problem is solved [optimal] 121: Solving time (sec) : 0.04 121: Iterations : 384 121: Objective value : 1.72791066e+05 121: 121: Solution passed validation 121: 121: postsolve finished after 0.083 seconds 121: feasible: true 121: objective value: 172791.065595612 121: 121: violations: 121: bounds: 1.4210854715202e-17 121: constraints: 0 121: integrality: 0 121: 121: validation: SUCCESS 121: Solving time 0.285 seconds 121: 121: solving finished after 0.285 seconds 122/287 Test #121: q-solve-finnis.mps-lp_presolvers_with_basis.set ............................................ Passed 0.43 sec test 126 Start 126: d-solve-kb2.mps-lp_presolvers_with_basis.set 126: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/kb2.mps" "-o" "-0.17499001299062057129526866493726e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 126: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 126: Test timeout computed to be: 10000000 122: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 122: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 122: 122: External libraries: 122: Boost 1.83.0 (https://www.boost.org/) 122: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 122: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 122: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 122: 122: reading took 0.0702 seconds 122: Numerical Statistics: 122: Matrix range [5e-04,3e+01] 122: Objective range [1e-05,4e+03] 122: Bounds range [1e-04,3e+04] 122: RHS range [1e-02,4e+03] 122: Dynamism Variables: 2e+03 122: Dynamism Rows : 4e+03 122: set presolve.componentsmaxint = -1 122: set presolve.detectlindep = 0 122: set doubletoneq.enabled = 0 122: set dualinfer.enabled = 0 122: set substitution.enabled = 0 122: set sparsify.enabled = 0 122: 122: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/finnis.mps with dual-postsolve activated 122: rows: 497 122: columns: 614 122: int. columns: 0 122: cont. columns: 614 122: nonzeros: 2310 122: 122: round 0 ( Trivial ): 74 del cols, 73 del rows, 57 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 122: round 1 ( Fast ): 86 del cols, 82 del rows, 250 chg bounds, 0 chg sides, 0 chg coeffs, 424 tsx applied, 0 tsx conflicts 122: round 2 ( Fast ): 87 del cols, 101 del rows, 282 chg bounds, 0 chg sides, 0 chg coeffs, 448 tsx applied, 0 tsx conflicts 122: round 3 ( Medium ): 147 del cols, 119 del rows, 383 chg bounds, 28 chg sides, 18 chg coeffs, 595 tsx applied, 62 tsx conflicts 122: round 4 ( Medium ): 171 del cols, 135 del rows, 469 chg bounds, 34 chg sides, 19 chg coeffs, 691 tsx applied, 67 tsx conflicts 122: round 5 ( Medium ): 174 del cols, 138 del rows, 548 chg bounds, 37 chg sides, 19 chg coeffs, 773 tsx applied, 77 tsx conflicts 122: round 6 (Exhaustive): 175 del cols, 138 del rows, 558 chg bounds, 37 chg sides, 19 chg coeffs, 784 tsx applied, 77 tsx conflicts 122: round 7 ( Final ): 175 del cols, 138 del rows, 562 chg bounds, 37 chg sides, 19 chg coeffs, 788 tsx applied, 77 tsx conflicts 122: presolved 7 rounds: 175 del cols, 138 del rows, 562 chg bounds, 37 chg sides, 19 chg coeffs, 788 tsx applied, 77 tsx conflicts 122: 122: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 122: colsingleton 7 0.0 0 0.0 0.000 122: coefftightening 0 0.0 0 0.0 0.000 122: propagation 7 57.1 464 100.0 0.046 122: fixcontinuous 2 0.0 0 0.0 0.001 122: simpleprobing 0 0.0 0 0.0 0.000 122: parallelrows 2 0.0 0 0.0 0.025 122: parallelcols 2 50.0 1 100.0 0.018 122: stuffing 4 75.0 111 48.6 0.009 122: dualfix 5 100.0 289 93.1 0.016 122: simplifyineq 0 0.0 0 0.0 0.000 122: doubletoneq 0 0.0 0 0.0 0.000 122: implint 0 0.0 0 0.0 0.000 122: domcol 1 0.0 0 0.0 0.017 122: dualinfer 0 0.0 0 0.0 0.000 122: probing 0 0.0 0 0.0 0.000 122: substitution 0 0.0 0 0.0 0.000 122: sparsify 0 0.0 0 0.0 0.000 122: 122: reduced problem: 122: reduced rows: 359 122: reduced columns: 439 122: reduced int. columns: 0 122: reduced cont. columns: 439 122: reduced nonzeros: 1506 122: 122: presolving finished after 0.281 seconds 122: 122: Equilibrium scaling LP (persistent) 122: Simplifier removed 17 rows, 17 columns, 42 nonzeros, 14 col bounds, 22 row bounds 122: Reduced LP has 342 rows 422 columns 1470 nonzeros 122: Equilibrium scaling LP 124: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 124: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 124: 124: External libraries: 124: Boost 1.83.0 (https://www.boost.org/) 124: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 124: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 124: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 124: 124: reading took 0.0377 seconds 124: Numerical Statistics: 124: Matrix range [1e-03,2e+03] 124: Objective range [2e-01,3e+03] 124: Bounds range [0e+00,0e+00] 124: RHS range [5e-01,9e+05] 124: Dynamism Variables: 5e+05 124: Dynamism Rows : 1e+04 124: set presolve.componentsmaxint = -1 124: set presolve.detectlindep = 0 124: set doubletoneq.enabled = 0 124: set dualinfer.enabled = 0 124: set substitution.enabled = 0 124: set sparsify.enabled = 0 124: 124: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/israel.mps with dual-postsolve activated 124: rows: 174 124: columns: 142 124: int. columns: 0 124: cont. columns: 142 124: nonzeros: 2269 124: 124: round 0 ( Trivial ): 1 del cols, 11 del rows, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 124: round 1 ( Fast ): 1 del cols, 11 del rows, 298 chg bounds, 0 chg sides, 0 chg coeffs, 1506 tsx applied, 0 tsx conflicts 124: round 2 ( Fast ): 1 del cols, 11 del rows, 326 chg bounds, 0 chg sides, 0 chg coeffs, 1594 tsx applied, 0 tsx conflicts 124: round 3 (Exhaustive): 3 del cols, 11 del rows, 329 chg bounds, 0 chg sides, 0 chg coeffs, 1597 tsx applied, 0 tsx conflicts 124: round 4 (Exhaustive): 3 del cols, 11 del rows, 329 chg bounds, 0 chg sides, 0 chg coeffs, 1597 tsx applied, 0 tsx conflicts 124: round 5 ( Final ): Unchanged 124: presolved 5 rounds: 3 del cols, 11 del rows, 329 chg bounds, 0 chg sides, 0 chg coeffs, 1597 tsx applied, 0 tsx conflicts 124: 124: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 124: colsingleton 5 0.0 0 0.0 0.000 124: coefftightening 0 0.0 0 0.0 0.000 124: propagation 5 40.0 1594 100.0 0.017 124: fixcontinuous 2 0.0 0 0.0 0.000 124: simpleprobing 0 0.0 0 0.0 0.000 124: parallelrows 1 0.0 0 0.0 0.001 124: parallelcols 1 0.0 0 0.0 0.001 124: stuffing 2 0.0 0 0.0 0.000 124: dualfix 2 50.0 1 100.0 0.000 124: simplifyineq 0 0.0 0 0.0 0.000 124: doubletoneq 0 0.0 0 0.0 0.000 124: implint 0 0.0 0 0.0 0.000 124: domcol 2 50.0 2 100.0 0.028 124: dualinfer 0 0.0 0 0.0 0.000 124: probing 0 0.0 0 0.0 0.000 124: substitution 0 0.0 0 0.0 0.000 124: sparsify 0 0.0 0 0.0 0.000 124: 124: reduced problem: 124: reduced rows: 163 124: reduced columns: 139 124: reduced int. columns: 0 124: reduced cont. columns: 139 124: reduced nonzeros: 2200 124: 124: presolving finished after 0.140 seconds 124: 124: Equilibrium scaling LP (persistent) 122: type | time | iters | facts | shift | viol sum | viol num | obj value 122: L | 0.0 | 0 | 3 | 1.80e+01 | 2.22e+04 | 71 | -2.16055972e+05 124: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 124: Reduced LP has 163 rows 139 columns 2200 nonzeros 124: Equilibrium scaling LP 124: type | time | iters | facts | shift | viol sum | viol num | obj value 124: L | 0.0 | 0 | 3 | 0.00e+00 | 1.15e+05 | 87 | -4.53451364e+06 126: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 126: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 126: 126: External libraries: 126: Boost 1.83.0 (https://www.boost.org/) 126: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 126: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 126: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 126: 126: reading took 0.0104 seconds 126: Numerical Statistics: 126: Matrix range [2e-01,1e+02] 126: Objective range [9e-02,2e+01] 126: Bounds range [5e+00,2e+02] 126: RHS range [0e+00,0e+00] 126: Dynamism Variables: 2e+02 126: Dynamism Rows : 4e+02 126: set presolve.componentsmaxint = -1 126: set presolve.detectlindep = 0 126: set doubletoneq.enabled = 0 126: set dualinfer.enabled = 0 126: set substitution.enabled = 0 126: set sparsify.enabled = 0 126: 126: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/kb2.mps with dual-postsolve activated 126: rows: 43 126: columns: 41 126: int. columns: 0 126: cont. columns: 41 126: nonzeros: 286 126: 126: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 126: round 1 ( Fast ): 0 del cols, 0 del rows, 21 chg bounds, 0 chg sides, 0 chg coeffs, 42 tsx applied, 0 tsx conflicts 126: round 2 ( Fast ): 0 del cols, 0 del rows, 29 chg bounds, 0 chg sides, 0 chg coeffs, 58 tsx applied, 0 tsx conflicts 126: round 3 ( Medium ): 8 del cols, 1 del rows, 37 chg bounds, 16 chg sides, 8 chg coeffs, 78 tsx applied, 16 tsx conflicts 126: round 4 (Exhaustive): 8 del cols, 1 del rows, 37 chg bounds, 16 chg sides, 8 chg coeffs, 78 tsx applied, 16 tsx conflicts 126: round 5 ( Final ): Unchanged 126: presolved 5 rounds: 8 del cols, 1 del rows, 37 chg bounds, 16 chg sides, 8 chg coeffs, 78 tsx applied, 16 tsx conflicts 126: 126: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 126: colsingleton 5 0.0 0 0.0 0.000 126: coefftightening 0 0.0 0 0.0 0.000 126: propagation 5 60.0 66 100.0 0.000 126: fixcontinuous 2 0.0 0 0.0 0.000 126: simpleprobing 0 0.0 0 0.0 0.000 126: parallelrows 1 0.0 0 0.0 0.000 126: parallelcols 1 0.0 0 0.0 0.000 126: stuffing 2 50.0 24 33.3 0.000 126: dualfix 2 50.0 4 100.0 0.000 126: simplifyineq 0 0.0 0 0.0 0.000 126: doubletoneq 0 0.0 0 0.0 0.000 126: implint 0 0.0 0 0.0 0.000 126: domcol 1 0.0 0 0.0 0.000 126: dualinfer 0 0.0 0 0.0 0.000 126: probing 0 0.0 0 0.0 0.000 126: substitution 0 0.0 0 0.0 0.000 126: sparsify 0 0.0 0 0.0 0.000 126: 126: reduced problem: 126: reduced rows: 42 126: reduced columns: 33 126: reduced int. columns: 0 126: reduced cont. columns: 33 126: reduced nonzeros: 277 126: 126: presolving finished after 0.007 seconds 126: 126: Equilibrium scaling LP (persistent) 126: Simplifier removed 3 rows, 3 columns, 8 nonzeros, 21 col bounds, 25 row bounds 126: Reduced LP has 39 rows 30 columns 269 nonzeros 126: Equilibrium scaling LP 126: type | time | iters | facts | shift | viol sum | viol num | obj value 126: E | 0.0 | 0 | 2 | 0.00e+00 | 4.81e+04 | 18 | -3.30000000e+03 122: L | 0.0 | 199 | 3 | 1.80e+01 | 1.77e+04 | 71 | 1.29773130e+05 126: E | 0.0 | 43 | 3 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 126: --- unscaling internal solution 126: --- unsimplifying solution and basis 126: --- unscaling external solution 126: --- verifying computed solution 126: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 126: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 126: --- unscaling external solution 126: --- verifying computed solution 126: 126: SoPlex status : problem is solved [optimal] 126: Solving time (sec) : 0.00 126: Iterations : 43 126: Objective value : -1.74990013e+03 126: 126: Solution passed validation 126: 126: postsolve finished after 0.000 seconds 126: feasible: true 126: objective value: -1749.90012990621 126: 126: violations: 126: bounds: 0 126: constraints: 0 126: integrality: 0 126: 126: validation: SUCCESS 126: Solving time 0.014 seconds 126: 126: solving finished after 0.014 seconds 123/287 Test #126: d-solve-kb2.mps-lp_presolvers_with_basis.set ............................................... Passed 0.08 sec test 127 Start 127: q-solve-kb2.mps-lp_presolvers_with_basis.set 127: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/kb2.mps" "-o" "-0.17499001299062057129526866493726e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 127: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 127: Test timeout computed to be: 10000000 124: L | 0.0 | 142 | 5 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 124: --- unscaling internal solution 124: --- unsimplifying solution and basis 124: --- unscaling external solution 124: --- verifying computed solution 124: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 124: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 124: --- unscaling external solution 124: --- verifying computed solution 122: E | 0.0 | 383 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 122: E | 0.0 | 383 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 122: --- unscaling internal solution 122: --- unsimplifying solution and basis 122: --- unscaling external solution 122: --- verifying computed solution 122: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 122: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 122: --- unscaling external solution 122: --- verifying computed solution 127: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 127: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 127: 127: External libraries: 127: Boost 1.83.0 (https://www.boost.org/) 127: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 127: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 127: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 127: 127: reading took 0.00256 seconds 127: Numerical Statistics: 127: Matrix range [2e-01,1e+02] 127: Objective range [9e-02,2e+01] 127: Bounds range [5e+00,2e+02] 127: RHS range [0e+00,0e+00] 127: Dynamism Variables: 2e+02 127: Dynamism Rows : 4e+02 127: set presolve.componentsmaxint = -1 127: set presolve.detectlindep = 0 127: set doubletoneq.enabled = 0 127: set dualinfer.enabled = 0 127: set substitution.enabled = 0 127: set sparsify.enabled = 0 127: 127: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/kb2.mps with dual-postsolve activated 127: rows: 43 127: columns: 41 127: int. columns: 0 127: cont. columns: 41 127: nonzeros: 286 127: 127: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 127: round 1 ( Fast ): 0 del cols, 0 del rows, 21 chg bounds, 0 chg sides, 0 chg coeffs, 42 tsx applied, 0 tsx conflicts 127: round 2 ( Fast ): 0 del cols, 0 del rows, 29 chg bounds, 0 chg sides, 0 chg coeffs, 58 tsx applied, 0 tsx conflicts 127: round 3 ( Medium ): 8 del cols, 1 del rows, 37 chg bounds, 16 chg sides, 8 chg coeffs, 78 tsx applied, 16 tsx conflicts 127: round 4 (Exhaustive): 8 del cols, 1 del rows, 37 chg bounds, 16 chg sides, 8 chg coeffs, 78 tsx applied, 16 tsx conflicts 127: round 5 ( Final ): Unchanged 127: presolved 5 rounds: 8 del cols, 1 del rows, 37 chg bounds, 16 chg sides, 8 chg coeffs, 78 tsx applied, 16 tsx conflicts 127: 127: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 127: colsingleton 5 0.0 0 0.0 0.000 127: coefftightening 0 0.0 0 0.0 0.000 127: propagation 5 60.0 66 100.0 0.009 127: fixcontinuous 2 0.0 0 0.0 0.000 127: simpleprobing 0 0.0 0 0.0 0.000 127: parallelrows 1 0.0 0 0.0 0.000 127: parallelcols 1 0.0 0 0.0 0.000 127: stuffing 2 50.0 24 33.3 0.000 127: dualfix 2 50.0 4 100.0 0.000 127: simplifyineq 0 0.0 0 0.0 0.000 127: doubletoneq 0 0.0 0 0.0 0.000 127: implint 0 0.0 0 0.0 0.000 127: domcol 1 0.0 0 0.0 0.001 127: dualinfer 0 0.0 0 0.0 0.000 127: probing 0 0.0 0 0.0 0.000 127: substitution 0 0.0 0 0.0 0.000 127: sparsify 0 0.0 0 0.0 0.000 127: 127: reduced problem: 127: reduced rows: 42 127: reduced columns: 33 127: reduced int. columns: 0 127: reduced cont. columns: 33 127: reduced nonzeros: 277 127: 127: presolving finished after 0.026 seconds 127: 127: Equilibrium scaling LP (persistent) 127: Simplifier removed 3 rows, 3 columns, 8 nonzeros, 21 col bounds, 25 row bounds 127: Reduced LP has 39 rows 30 columns 269 nonzeros 127: Equilibrium scaling LP 127: type | time | iters | facts | shift | viol sum | viol num | obj value 127: E | 0.0 | 0 | 2 | 0.00e+00 | 4.81e+04 | 18 | -3.30000000e+03 127: E | 0.0 | 43 | 3 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 127: --- unscaling internal solution 127: --- unsimplifying solution and basis 127: --- unscaling external solution 127: --- verifying computed solution 127: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 127: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 127: --- unscaling external solution 127: --- verifying computed solution 124: 124: SoPlex status : problem is solved [optimal] 124: Solving time (sec) : 0.02 124: Iterations : 142 124: Objective value : -8.96644822e+05 124: 124: Solution passed validation 124: 124: postsolve finished after 0.066 seconds 124: feasible: true 124: objective value: -896644.821863046 124: 124: violations: 124: bounds: 0 124: constraints: 0 124: integrality: 0 124: 124: validation: SUCCESS 124: Solving time 0.246 seconds 124: 124: solving finished after 0.246 seconds 124/287 Test #124: q-solve-israel.mps-lp_presolvers_with_basis.set ............................................ Passed 0.38 sec 127: 127: SoPlex status : problem is solved [optimal] 127: Solving time (sec) : 0.00 127: Iterations : 43 127: Objective value : -1.74990013e+03 127: 127: Solution passed validation 127: 127: postsolve finished after 0.008 seconds 127: feasible: true 127: objective value: -1749.90012990621 127: 127: violations: 127: bounds: 0 127: constraints: 0 127: integrality: 0 127: 127: validation: SUCCESS 127: Solving time 0.039 seconds 127: 127: solving finished after 0.039 seconds test 128 Start 128: r-solve-kb2.mps-lp_presolvers_with_basis.set 128: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/kb2.mps" "-o" "-0.17499001299062057129526866493726e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 128: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 128: Test timeout computed to be: 10000000 125/287 Test #127: q-solve-kb2.mps-lp_presolvers_with_basis.set ............................................... Passed 0.11 sec test 129 Start 129: d-solve-lotfi.mps-lp_presolvers_with_basis.set 129: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/lotfi.mps" "-o" "-0.2526470606188e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 129: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 129: Test timeout computed to be: 10000000 122: 122: SoPlex status : problem is solved [optimal] 122: Solving time (sec) : 0.04 122: Iterations : 383 122: Objective value : 1.72791066e+05 122: 122: Solution passed validation 122: 122: postsolve finished after 0.084 seconds 122: feasible: true 122: objective value: 172791.065595612 122: 122: violations: 122: bounds: 5.02914190292358e-14 122: constraints: 0 122: integrality: 0 122: 122: validation: SUCCESS 122: Solving time 0.475 seconds 122: 122: solving finished after 0.475 seconds 126/287 Test #122: r-solve-finnis.mps-lp_presolvers_with_basis.set ............................................ Passed 0.65 sec test 130 Start 130: q-solve-lotfi.mps-lp_presolvers_with_basis.set 130: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/lotfi.mps" "-o" "-0.2526470606188e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 130: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 130: Test timeout computed to be: 10000000 129: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 129: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 129: 129: External libraries: 129: Boost 1.83.0 (https://www.boost.org/) 129: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 129: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 129: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 129: 129: reading took 0.0131 seconds 129: Numerical Statistics: 129: Matrix range [2e-02,1e+03] 129: Objective range [1e+00,1e+00] 129: Bounds range [0e+00,0e+00] 129: RHS range [1e+00,2e+04] 129: Dynamism Variables: 2e+04 129: Dynamism Rows : 1e+03 129: set presolve.componentsmaxint = -1 129: set presolve.detectlindep = 0 129: set doubletoneq.enabled = 0 129: set dualinfer.enabled = 0 129: set substitution.enabled = 0 129: set sparsify.enabled = 0 129: 129: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/lotfi.mps with dual-postsolve activated 129: rows: 153 129: columns: 308 129: int. columns: 0 129: cont. columns: 308 129: nonzeros: 1078 129: 129: round 0 ( Trivial ): 4 del cols, 9 del rows, 13 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 129: round 1 ( Fast ): 6 del cols, 13 del rows, 218 chg bounds, 0 chg sides, 0 chg coeffs, 404 tsx applied, 0 tsx conflicts 129: round 2 ( Fast ): 8 del cols, 19 del rows, 261 chg bounds, 0 chg sides, 0 chg coeffs, 482 tsx applied, 0 tsx conflicts 129: round 3 ( Fast ): 8 del cols, 19 del rows, 308 chg bounds, 0 chg sides, 0 chg coeffs, 576 tsx applied, 0 tsx conflicts 129: round 4 ( Medium ): 23 del cols, 25 del rows, 318 chg bounds, 9 chg sides, 9 chg coeffs, 611 tsx applied, 46 tsx conflicts 129: round 5 ( Medium ): 30 del cols, 32 del rows, 319 chg bounds, 9 chg sides, 9 chg coeffs, 620 tsx applied, 52 tsx conflicts 129: round 6 ( Medium ): 80 del cols, 36 del rows, 319 chg bounds, 55 chg sides, 55 chg coeffs, 670 tsx applied, 102 tsx conflicts 129: round 7 ( Medium ): 96 del cols, 36 del rows, 319 chg bounds, 71 chg sides, 71 chg coeffs, 686 tsx applied, 150 tsx conflicts 129: round 8 (Exhaustive): 96 del cols, 36 del rows, 335 chg bounds, 71 chg sides, 71 chg coeffs, 702 tsx applied, 150 tsx conflicts 129: round 9 ( Final ): 96 del cols, 36 del rows, 335 chg bounds, 71 chg sides, 71 chg coeffs, 702 tsx applied, 150 tsx conflicts 129: presolved 9 rounds: 96 del cols, 36 del rows, 335 chg bounds, 71 chg sides, 71 chg coeffs, 702 tsx applied, 150 tsx conflicts 129: 129: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 129: colsingleton 9 0.0 0 0.0 0.000 129: coefftightening 0 0.0 0 0.0 0.000 129: propagation 9 55.6 598 100.0 0.000 129: fixcontinuous 3 0.0 0 0.0 0.000 129: simpleprobing 0 0.0 0 0.0 0.000 129: parallelrows 2 0.0 0 0.0 0.000 129: parallelcols 2 0.0 0 0.0 0.005 129: stuffing 5 80.0 236 36.9 0.000 129: dualfix 5 60.0 18 94.4 0.000 129: simplifyineq 0 0.0 0 0.0 0.000 129: doubletoneq 0 0.0 0 0.0 0.000 129: implint 0 0.0 0 0.0 0.000 129: domcol 1 0.0 0 0.0 0.000 129: dualinfer 0 0.0 0 0.0 0.000 129: probing 0 0.0 0 0.0 0.000 129: substitution 0 0.0 0 0.0 0.000 129: sparsify 0 0.0 0 0.0 0.000 129: 129: reduced problem: 129: reduced rows: 117 129: reduced columns: 212 129: reduced int. columns: 0 129: reduced cont. columns: 212 129: reduced nonzeros: 526 129: 129: presolving finished after 0.015 seconds 129: 129: Equilibrium scaling LP (persistent) 129: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 129: Reduced LP has 117 rows 212 columns 526 nonzeros 129: Equilibrium scaling LP 129: type | time | iters | facts | shift | viol sum | viol num | obj value 129: L | 0.0 | 0 | 3 | 0.00e+00 | 6.08e+05 | 73 | -3.18967215e+03 125: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 125: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 125: 125: External libraries: 125: Boost 1.83.0 (https://www.boost.org/) 125: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 125: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 125: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 125: 125: reading took 0.0781 seconds 125: Numerical Statistics: 125: Matrix range [1e-03,2e+03] 125: Objective range [2e-01,3e+03] 125: Bounds range [0e+00,0e+00] 125: RHS range [5e-01,9e+05] 125: Dynamism Variables: 5e+05 125: Dynamism Rows : 1e+04 125: set presolve.componentsmaxint = -1 125: set presolve.detectlindep = 0 125: set doubletoneq.enabled = 0 125: set dualinfer.enabled = 0 125: set substitution.enabled = 0 125: set sparsify.enabled = 0 125: 125: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/israel.mps with dual-postsolve activated 125: rows: 174 125: columns: 142 125: int. columns: 0 125: cont. columns: 142 125: nonzeros: 2269 125: 125: round 0 ( Trivial ): 1 del cols, 11 del rows, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 125: round 1 ( Fast ): 1 del cols, 11 del rows, 298 chg bounds, 0 chg sides, 0 chg coeffs, 1506 tsx applied, 0 tsx conflicts 125: round 2 ( Fast ): 1 del cols, 11 del rows, 326 chg bounds, 0 chg sides, 0 chg coeffs, 1594 tsx applied, 0 tsx conflicts 125: round 3 (Exhaustive): 3 del cols, 11 del rows, 329 chg bounds, 0 chg sides, 0 chg coeffs, 1597 tsx applied, 0 tsx conflicts 125: round 4 (Exhaustive): 3 del cols, 11 del rows, 329 chg bounds, 0 chg sides, 0 chg coeffs, 1597 tsx applied, 0 tsx conflicts 125: round 5 ( Final ): Unchanged 125: presolved 5 rounds: 3 del cols, 11 del rows, 329 chg bounds, 0 chg sides, 0 chg coeffs, 1597 tsx applied, 0 tsx conflicts 125: 125: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 125: colsingleton 5 0.0 0 0.0 0.000 125: coefftightening 0 0.0 0 0.0 0.000 125: propagation 5 40.0 1594 100.0 0.042 125: fixcontinuous 2 0.0 0 0.0 0.000 125: simpleprobing 0 0.0 0 0.0 0.000 125: parallelrows 1 0.0 0 0.0 0.008 125: parallelcols 1 0.0 0 0.0 0.010 125: stuffing 2 0.0 0 0.0 0.000 125: dualfix 2 50.0 1 100.0 0.001 125: simplifyineq 0 0.0 0 0.0 0.000 125: doubletoneq 0 0.0 0 0.0 0.000 125: implint 0 0.0 0 0.0 0.000 125: domcol 2 50.0 2 100.0 0.042 125: dualinfer 0 0.0 0 0.0 0.000 125: probing 0 0.0 0 0.0 0.000 125: substitution 0 0.0 0 0.0 0.000 125: sparsify 0 0.0 0 0.0 0.000 125: 125: reduced problem: 125: reduced rows: 163 125: reduced columns: 139 125: reduced int. columns: 0 125: reduced cont. columns: 139 128: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 128: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 128: 128: External libraries: 128: Boost 1.83.0 (https://www.boost.org/) 128: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 128: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 128: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 128: 128: reading took 0.0034 seconds 128: Numerical Statistics: 128: Matrix range [2e-01,1e+02] 128: Objective range [9e-02,2e+01] 128: Bounds range [5e+00,2e+02] 128: RHS range [0e+00,0e+00] 128: Dynamism Variables: 2e+02 128: Dynamism Rows : 4e+02 128: set presolve.componentsmaxint = -1 128: set presolve.detectlindep = 0 128: set doubletoneq.enabled = 0 128: set dualinfer.enabled = 0 128: set substitution.enabled = 0 128: set sparsify.enabled = 0 128: 128: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/kb2.mps with dual-postsolve activated 128: rows: 43 128: columns: 41 128: int. columns: 0 128: cont. columns: 41 128: nonzeros: 286 128: 128: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 128: round 1 ( Fast ): 0 del cols, 0 del rows, 21 chg bounds, 0 chg sides, 0 chg coeffs, 42 tsx applied, 0 tsx conflicts 128: round 2 ( Fast ): 0 del cols, 0 del rows, 29 chg bounds, 0 chg sides, 0 chg coeffs, 58 tsx applied, 0 tsx conflicts 128: round 3 ( Medium ): 8 del cols, 1 del rows, 37 chg bounds, 16 chg sides, 8 chg coeffs, 78 tsx applied, 16 tsx conflicts 128: round 4 (Exhaustive): 8 del cols, 1 del rows, 37 chg bounds, 16 chg sides, 8 chg coeffs, 78 tsx applied, 16 tsx conflicts 128: round 5 ( Final ): Unchanged 128: presolved 5 rounds: 8 del cols, 1 del rows, 37 chg bounds, 16 chg sides, 8 chg coeffs, 78 tsx applied, 16 tsx conflicts 128: 128: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 128: colsingleton 5 0.0 0 0.0 0.000 128: coefftightening 0 0.0 0 0.0 0.000 128: propagation 5 60.0 66 100.0 0.015 128: fixcontinuous 2 0.0 0 0.0 0.000 128: simpleprobing 0 0.0 0 0.0 0.000 128: parallelrows 1 0.0 0 0.0 0.008 128: parallelcols 1 0.0 0 0.0 0.001 128: stuffing 2 50.0 24 33.3 0.000 128: dualfix 2 50.0 4 100.0 0.000 128: simplifyineq 0 0.0 0 0.0 0.000 128: doubletoneq 0 0.0 0 0.0 0.000 128: implint 0 0.0 0 0.0 0.000 128: domcol 1 0.0 0 0.0 0.003 128: dualinfer 0 0.0 0 0.0 0.000 128: probing 0 0.0 0 0.0 0.000 128: substitution 0 0.0 0 0.0 0.000 128: sparsify 0 0.0 0 0.0 0.000 128: 128: reduced problem: 128: reduced rows: 42 128: reduced columns: 33 128: reduced int. columns: 0 128: reduced cont. columns: 33 128: reduced nonzeros: 277 128: 128: presolving finished after 0.041 seconds 128: 128: Equilibrium scaling LP (persistent) 128: Simplifier removed 3 rows, 3 columns, 8 nonzeros, 21 col bounds, 25 row bounds 128: Reduced LP has 39 rows 30 columns 269 nonzeros 128: Equilibrium scaling LP 128: type | time | iters | facts | shift | viol sum | viol num | obj value 128: E | 0.0 | 0 | 2 | 0.00e+00 | 4.81e+04 | 18 | -3.30000000e+03 129: L | 0.0 | 199 | 4 | 0.00e+00 | 8.38e+00 | 19 | -2.52671729e+01 129: L | 0.0 | 209 | 5 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 129: --- unscaling internal solution 129: --- unsimplifying solution and basis 129: --- unscaling external solution 129: --- verifying computed solution 129: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 129: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 129: --- unscaling external solution 129: --- verifying computed solution 125: reduced nonzeros: 2200 125: 125: presolving finished after 0.275 seconds 125: 125: Equilibrium scaling LP (persistent) 125: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 125: Reduced LP has 163 rows 139 columns 2200 nonzeros 125: Equilibrium scaling LP 128: E | 0.0 | 43 | 3 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 128: --- unscaling internal solution 128: --- unsimplifying solution and basis 128: --- unscaling external solution 128: --- verifying computed solution 128: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 128: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 128: --- unscaling external solution 128: --- verifying computed solution 125: type | time | iters | facts | shift | viol sum | viol num | obj value 125: L | 0.0 | 0 | 3 | 0.00e+00 | 1.15e+05 | 87 | -4.53451364e+06 129: 129: SoPlex status : problem is solved [optimal] 129: Solving time (sec) : 0.00 129: Iterations : 209 129: Objective value : -2.52647061e+01 129: 129: Solution passed validation 129: 129: postsolve finished after 0.001 seconds 129: feasible: true 129: objective value: -25.26470606188 129: 129: violations: 129: bounds: 0 129: constraints: 0 129: integrality: 0 129: 129: validation: SUCCESS 129: Solving time 0.052 seconds 129: 129: solving finished after 0.052 seconds 128: 128: SoPlex status : problem is solved [optimal] 128: Solving time (sec) : 0.00 128: Iterations : 43 128: Objective value : -1.74990013e+03 128: 128: Solution passed validation 128: 128: postsolve finished after 0.008 seconds 128: feasible: true 128: objective value: -1749.90012990621 128: 128: violations: 128: bounds: 0 128: constraints: 0 128: integrality: 0 128: 128: validation: SUCCESS 128: Solving time 0.061 seconds 128: 128: solving finished after 0.061 seconds 127/287 Test #129: d-solve-lotfi.mps-lp_presolvers_with_basis.set ............................................. Passed 0.12 sec 128/287 Test #128: r-solve-kb2.mps-lp_presolvers_with_basis.set ............................................... Passed 0.13 sec test 131 Start 131: r-solve-lotfi.mps-lp_presolvers_with_basis.set 131: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/lotfi.mps" "-o" "-0.2526470606188e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 131: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 131: Test timeout computed to be: 10000000 test 132 Start 132: d-solve-recipe.mps-lp_presolvers_with_basis.set 132: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/recipe.mps" "-o" "-0.266616e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 132: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 132: Test timeout computed to be: 10000000 125: L | 0.0 | 151 | 5 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 125: --- unscaling internal solution 125: --- unsimplifying solution and basis 125: --- unscaling external solution 125: --- verifying computed solution 125: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 125: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 125: --- unscaling external solution 125: --- verifying computed solution 130: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 130: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 130: 130: External libraries: 130: Boost 1.83.0 (https://www.boost.org/) 130: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 130: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 130: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 130: 130: reading took 0.0178 seconds 130: Numerical Statistics: 130: Matrix range [2e-02,1e+03] 130: Objective range [1e+00,1e+00] 130: Bounds range [0e+00,0e+00] 130: RHS range [1e+00,2e+04] 130: Dynamism Variables: 2e+04 130: Dynamism Rows : 1e+03 130: set presolve.componentsmaxint = -1 130: set presolve.detectlindep = 0 130: set doubletoneq.enabled = 0 130: set dualinfer.enabled = 0 130: set substitution.enabled = 0 130: set sparsify.enabled = 0 130: 130: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/lotfi.mps with dual-postsolve activated 130: rows: 153 130: columns: 308 130: int. columns: 0 130: cont. columns: 308 130: nonzeros: 1078 130: 130: round 0 ( Trivial ): 4 del cols, 9 del rows, 13 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 130: round 1 ( Fast ): 6 del cols, 13 del rows, 218 chg bounds, 0 chg sides, 0 chg coeffs, 404 tsx applied, 0 tsx conflicts 130: round 2 ( Fast ): 8 del cols, 19 del rows, 261 chg bounds, 0 chg sides, 0 chg coeffs, 482 tsx applied, 0 tsx conflicts 130: round 3 ( Fast ): 8 del cols, 19 del rows, 308 chg bounds, 0 chg sides, 0 chg coeffs, 576 tsx applied, 0 tsx conflicts 130: round 4 ( Medium ): 23 del cols, 25 del rows, 318 chg bounds, 9 chg sides, 9 chg coeffs, 611 tsx applied, 46 tsx conflicts 130: round 5 ( Medium ): 30 del cols, 32 del rows, 319 chg bounds, 9 chg sides, 9 chg coeffs, 620 tsx applied, 52 tsx conflicts 130: round 6 ( Medium ): 80 del cols, 36 del rows, 319 chg bounds, 55 chg sides, 55 chg coeffs, 670 tsx applied, 102 tsx conflicts 130: round 7 ( Medium ): 96 del cols, 36 del rows, 319 chg bounds, 71 chg sides, 71 chg coeffs, 686 tsx applied, 150 tsx conflicts 130: round 8 (Exhaustive): 96 del cols, 36 del rows, 335 chg bounds, 71 chg sides, 71 chg coeffs, 702 tsx applied, 150 tsx conflicts 130: round 9 ( Final ): 96 del cols, 36 del rows, 335 chg bounds, 71 chg sides, 71 chg coeffs, 702 tsx applied, 150 tsx conflicts 130: presolved 9 rounds: 96 del cols, 36 del rows, 335 chg bounds, 71 chg sides, 71 chg coeffs, 702 tsx applied, 150 tsx conflicts 130: 130: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 130: colsingleton 9 0.0 0 0.0 0.000 130: coefftightening 0 0.0 0 0.0 0.000 130: propagation 9 55.6 598 100.0 0.009 130: fixcontinuous 3 0.0 0 0.0 0.000 130: simpleprobing 0 0.0 0 0.0 0.000 130: parallelrows 2 0.0 0 0.0 0.001 130: parallelcols 2 0.0 0 0.0 0.001 130: stuffing 5 80.0 236 36.9 0.004 130: dualfix 5 60.0 18 94.4 0.002 130: simplifyineq 0 0.0 0 0.0 0.000 130: doubletoneq 0 0.0 0 0.0 0.000 130: implint 0 0.0 0 0.0 0.000 130: domcol 1 0.0 0 0.0 0.002 130: dualinfer 0 0.0 0 0.0 0.000 130: probing 0 0.0 0 0.0 0.000 130: substitution 0 0.0 0 0.0 0.000 130: sparsify 0 0.0 0 0.0 0.000 130: 130: reduced problem: 130: reduced rows: 117 130: reduced columns: 212 130: reduced int. columns: 0 130: reduced cont. columns: 212 130: reduced nonzeros: 526 130: 130: presolving finished after 0.074 seconds 130: 130: Equilibrium scaling LP (persistent) 130: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 130: Reduced LP has 117 rows 212 columns 526 nonzeros 130: Equilibrium scaling LP 130: type | time | iters | facts | shift | viol sum | viol num | obj value 130: L | 0.0 | 0 | 3 | 0.00e+00 | 6.08e+05 | 73 | -3.18967215e+03 130: L | 0.0 | 199 | 4 | 0.00e+00 | 6.27e+03 | 27 | -2.78217436e+01 130: L | 0.0 | 238 | 5 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 130: --- unscaling internal solution 130: --- unsimplifying solution and basis 130: --- unscaling external solution 130: --- verifying computed solution 130: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 130: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 130: --- unscaling external solution 130: --- verifying computed solution 132: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 132: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 132: 132: External libraries: 132: Boost 1.83.0 (https://www.boost.org/) 132: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 132: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 132: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 132: 132: reading took 0.012 seconds 132: Numerical Statistics: 132: Matrix range [1e-01,1e+02] 132: Objective range [1e-03,2e+00] 132: Bounds range [2e+00,5e+03] 132: RHS range [0e+00,0e+00] 132: Dynamism Variables: 1e+02 132: Dynamism Rows : 2e+02 132: set presolve.componentsmaxint = -1 132: set presolve.detectlindep = 0 132: set doubletoneq.enabled = 0 132: set dualinfer.enabled = 0 132: set substitution.enabled = 0 132: set sparsify.enabled = 0 132: 132: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/recipe.mps with dual-postsolve activated 132: rows: 91 132: columns: 180 132: int. columns: 0 132: cont. columns: 180 132: nonzeros: 663 132: 132: round 0 ( Trivial ): 28 del cols, 6 del rows, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 132: round 1 ( Fast ): 33 del cols, 10 del rows, 7 chg bounds, 0 chg sides, 0 chg coeffs, 8 tsx applied, 0 tsx conflicts 132: round 2 ( Fast ): 37 del cols, 12 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 16 tsx applied, 0 tsx conflicts 132: round 3 ( Fast ): 41 del cols, 14 del rows, 15 chg bounds, 0 chg sides, 0 chg coeffs, 24 tsx applied, 0 tsx conflicts 132: round 4 ( Medium ): 98 del cols, 27 del rows, 17 chg bounds, 31 chg sides, 17 chg coeffs, 79 tsx applied, 84 tsx conflicts 132: round 5 (Exhaustive): 104 del cols, 29 del rows, 23 chg bounds, 31 chg sides, 17 chg coeffs, 85 tsx applied, 84 tsx conflicts 132: round 6 ( Medium ): 105 del cols, 36 del rows, 28 chg bounds, 31 chg sides, 17 chg coeffs, 86 tsx applied, 84 tsx conflicts 132: round 7 ( Medium ): 111 del cols, 36 del rows, 28 chg bounds, 43 chg sides, 23 chg coeffs, 92 tsx applied, 92 tsx conflicts 132: round 8 (Exhaustive): 111 del cols, 36 del rows, 28 chg bounds, 43 chg sides, 23 chg coeffs, 92 tsx applied, 92 tsx conflicts 132: round 9 (Exhaustive): 115 del cols, 38 del rows, 32 chg bounds, 43 chg sides, 23 chg coeffs, 96 tsx applied, 92 tsx conflicts 132: round 10 ( Medium ): 119 del cols, 41 del rows, 35 chg bounds, 49 chg sides, 26 chg coeffs, 99 tsx applied, 93 tsx conflicts 132: round 11 (Exhaustive): 119 del cols, 41 del rows, 35 chg bounds, 49 chg sides, 26 chg coeffs, 99 tsx applied, 93 tsx conflicts 132: round 12 ( Medium ): 119 del cols, 44 del rows, 35 chg bounds, 50 chg sides, 26 chg coeffs, 102 tsx applied, 93 tsx conflicts 132: round 13 ( Medium ): 125 del cols, 47 del rows, 38 chg bounds, 56 chg sides, 29 chg coeffs, 105 tsx applied, 102 tsx conflicts 132: round 14 (Exhaustive): 125 del cols, 47 del rows, 38 chg bounds, 56 chg sides, 29 chg coeffs, 105 tsx applied, 102 tsx conflicts 132: round 15 ( Final ): Unchanged 132: presolved 15 rounds: 125 del cols, 47 del rows, 38 chg bounds, 56 chg sides, 29 chg coeffs, 105 tsx applied, 102 tsx conflicts 132: 132: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 132: colsingleton 15 0.0 0 0.0 0.000 132: coefftightening 0 0.0 0 0.0 0.000 132: propagation 15 20.0 24 100.0 0.000 132: fixcontinuous 4 0.0 0 0.0 0.000 132: simpleprobing 0 0.0 0 0.0 0.000 132: parallelrows 3 33.3 3 100.0 0.000 132: parallelcols 3 33.3 27 100.0 0.008 132: stuffing 8 50.0 142 28.2 0.000 132: dualfix 5 20.0 1 100.0 0.000 132: simplifyineq 0 0.0 0 0.0 0.000 132: doubletoneq 0 0.0 0 0.0 0.000 132: implint 0 0.0 0 0.0 0.000 132: domcol 3 66.7 10 100.0 0.000 132: dualinfer 0 0.0 0 0.0 0.000 132: probing 0 0.0 0 0.0 0.000 132: substitution 0 0.0 0 0.0 0.000 132: sparsify 0 0.0 0 0.0 0.000 132: 132: reduced problem: 132: reduced rows: 44 132: reduced columns: 55 132: reduced int. columns: 0 132: reduced cont. columns: 55 132: reduced nonzeros: 344 132: 132: presolving finished after 0.012 seconds 132: 132: Equilibrium scaling LP (persistent) 132: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 132: Reduced LP has 44 rows 55 columns 344 nonzeros 132: Equilibrium scaling LP 132: type | time | iters | facts | shift | viol sum | viol num | obj value 132: L | 0.0 | 0 | 3 | 0.00e+00 | 4.69e+02 | 8 | -7.16192000e+02 132: L | 0.0 | 9 | 4 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 132: --- unscaling internal solution 132: --- unsimplifying solution and basis 132: --- unscaling external solution 132: --- verifying computed solution 132: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 132: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 132: --- unscaling external solution 132: --- verifying computed solution 132: 132: SoPlex status : problem is solved [optimal] 132: Solving time (sec) : 0.00 132: Iterations : 9 132: Objective value : -2.66616000e+02 132: 132: Solution passed validation 132: 132: postsolve finished after 0.000 seconds 132: feasible: true 132: objective value: -266.616 132: 132: violations: 132: bounds: 0 132: constraints: 0 132: integrality: 0 132: 132: validation: SUCCESS 132: Solving time 0.015 seconds 132: 132: solving finished after 0.015 seconds 129/287 Test #132: d-solve-recipe.mps-lp_presolvers_with_basis.set ............................................ Passed 0.11 sec test 133 Start 133: q-solve-recipe.mps-lp_presolvers_with_basis.set 133: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/recipe.mps" "-o" "-0.266616e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 133: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 133: Test timeout computed to be: 10000000 130: 130: SoPlex status : problem is solved [optimal] 130: Solving time (sec) : 0.02 130: Iterations : 238 130: Objective value : -2.52647061e+01 130: 130: Solution passed validation 130: 130: postsolve finished after 0.031 seconds 130: feasible: true 130: objective value: -25.26470606188 130: 130: violations: 130: bounds: 0 130: constraints: 0 130: integrality: 0 130: 130: validation: SUCCESS 130: Solving time 0.136 seconds 130: 130: solving finished after 0.136 seconds 130/287 Test #130: q-solve-lotfi.mps-lp_presolvers_with_basis.set ............................................. Passed 0.23 sec test 134 Start 134: r-solve-recipe.mps-lp_presolvers_with_basis.set 134: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/recipe.mps" "-o" "-0.266616e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 134: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 134: Test timeout computed to be: 10000000 125: 125: SoPlex status : problem is solved [optimal] 125: Solving time (sec) : 0.02 125: Iterations : 151 125: Objective value : -8.96644822e+05 125: 125: Solution passed validation 125: 125: postsolve finished after 0.126 seconds 125: feasible: true 125: objective value: -896644.821863046 125: 125: violations: 125: bounds: 0 125: constraints: 0 125: integrality: 0 125: 125: validation: SUCCESS 125: Solving time 0.456 seconds 125: 125: solving finished after 0.456 seconds 131/287 Test #125: r-solve-israel.mps-lp_presolvers_with_basis.set ............................................ Passed 0.67 sec test 135 Start 135: d-solve-sc105.mps-lp_presolvers_with_basis.set 135: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc105.mps" "-o" "-0.52202061211707248062628010857689e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 135: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 135: Test timeout computed to be: 10000000 133: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 133: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 133: 133: External libraries: 133: Boost 1.83.0 (https://www.boost.org/) 133: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 133: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 133: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 133: 133: reading took 0.0153 seconds 133: Numerical Statistics: 133: Matrix range [1e-01,1e+02] 133: Objective range [1e-03,2e+00] 133: Bounds range [2e+00,5e+03] 133: RHS range [0e+00,0e+00] 133: Dynamism Variables: 1e+02 133: Dynamism Rows : 2e+02 133: set presolve.componentsmaxint = -1 133: set presolve.detectlindep = 0 133: set doubletoneq.enabled = 0 133: set dualinfer.enabled = 0 133: set substitution.enabled = 0 133: set sparsify.enabled = 0 133: 133: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/recipe.mps with dual-postsolve activated 133: rows: 91 133: columns: 180 133: int. columns: 0 133: cont. columns: 180 133: nonzeros: 663 133: 133: round 0 ( Trivial ): 28 del cols, 6 del rows, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 133: round 1 ( Fast ): 33 del cols, 10 del rows, 7 chg bounds, 0 chg sides, 0 chg coeffs, 8 tsx applied, 0 tsx conflicts 133: round 2 ( Fast ): 37 del cols, 12 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 16 tsx applied, 0 tsx conflicts 133: round 3 ( Fast ): 41 del cols, 14 del rows, 15 chg bounds, 0 chg sides, 0 chg coeffs, 24 tsx applied, 0 tsx conflicts 133: round 4 ( Medium ): 98 del cols, 27 del rows, 17 chg bounds, 31 chg sides, 17 chg coeffs, 79 tsx applied, 84 tsx conflicts 133: round 5 (Exhaustive): 104 del cols, 29 del rows, 23 chg bounds, 31 chg sides, 17 chg coeffs, 85 tsx applied, 84 tsx conflicts 133: round 6 ( Medium ): 105 del cols, 36 del rows, 28 chg bounds, 31 chg sides, 17 chg coeffs, 86 tsx applied, 84 tsx conflicts 133: round 7 ( Medium ): 111 del cols, 36 del rows, 28 chg bounds, 43 chg sides, 23 chg coeffs, 92 tsx applied, 92 tsx conflicts 133: round 8 (Exhaustive): 111 del cols, 36 del rows, 28 chg bounds, 43 chg sides, 23 chg coeffs, 92 tsx applied, 92 tsx conflicts 133: round 9 (Exhaustive): 115 del cols, 38 del rows, 32 chg bounds, 43 chg sides, 23 chg coeffs, 96 tsx applied, 92 tsx conflicts 133: round 10 ( Medium ): 119 del cols, 41 del rows, 35 chg bounds, 49 chg sides, 26 chg coeffs, 99 tsx applied, 93 tsx conflicts 133: round 11 (Exhaustive): 119 del cols, 41 del rows, 35 chg bounds, 49 chg sides, 26 chg coeffs, 99 tsx applied, 93 tsx conflicts 133: round 12 ( Medium ): 119 del cols, 44 del rows, 35 chg bounds, 50 chg sides, 26 chg coeffs, 102 tsx applied, 93 tsx conflicts 133: round 13 ( Medium ): 125 del cols, 47 del rows, 38 chg bounds, 56 chg sides, 29 chg coeffs, 105 tsx applied, 102 tsx conflicts 133: round 14 (Exhaustive): 125 del cols, 47 del rows, 38 chg bounds, 56 chg sides, 29 chg coeffs, 105 tsx applied, 102 tsx conflicts 133: round 15 ( Final ): Unchanged 133: presolved 15 rounds: 125 del cols, 47 del rows, 38 chg bounds, 56 chg sides, 29 chg coeffs, 105 tsx applied, 102 tsx conflicts 133: 133: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 133: colsingleton 15 0.0 0 0.0 0.000 133: coefftightening 0 0.0 0 0.0 0.000 133: propagation 15 20.0 24 100.0 0.001 133: fixcontinuous 4 0.0 0 0.0 0.000 133: simpleprobing 0 0.0 0 0.0 0.000 133: parallelrows 3 33.3 3 100.0 0.001 133: parallelcols 3 33.3 27 100.0 0.001 133: stuffing 8 50.0 142 28.2 0.001 133: dualfix 5 20.0 1 100.0 0.000 133: simplifyineq 0 0.0 0 0.0 0.000 133: doubletoneq 0 0.0 0 0.0 0.000 133: implint 0 0.0 0 0.0 0.000 133: domcol 3 66.7 10 100.0 0.020 133: dualinfer 0 0.0 0 0.0 0.000 133: probing 0 0.0 0 0.0 0.000 133: substitution 0 0.0 0 0.0 0.000 133: sparsify 0 0.0 0 0.0 0.000 133: 133: reduced problem: 133: reduced rows: 44 133: reduced columns: 55 133: reduced int. columns: 0 133: reduced cont. columns: 55 133: reduced nonzeros: 344 133: 133: presolving finished after 0.046 seconds 133: 133: Equilibrium scaling LP (persistent) 133: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 133: Reduced LP has 44 rows 55 columns 344 nonzeros 133: Equilibrium scaling LP 133: type | time | iters | facts | shift | viol sum | viol num | obj value 133: L | 0.0 | 0 | 3 | 0.00e+00 | 4.69e+02 | 8 | -7.16192000e+02 133: L | 0.0 | 9 | 4 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 133: --- unscaling internal solution 133: --- unsimplifying solution and basis 133: --- unscaling external solution 133: --- verifying computed solution 133: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 133: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 133: --- unscaling external solution 133: --- verifying computed solution 133: 133: SoPlex status : problem is solved [optimal] 133: Solving time (sec) : 0.00 133: Iterations : 9 133: Objective value : -2.66616000e+02 133: 133: Solution passed validation 133: 133: postsolve finished after 0.018 seconds 133: feasible: true 133: objective value: -266.616 133: 133: violations: 133: bounds: 0 133: constraints: 0 133: integrality: 0 133: 133: validation: SUCCESS 133: Solving time 0.068 seconds 133: 133: solving finished after 0.068 seconds 132/287 Test #133: q-solve-recipe.mps-lp_presolvers_with_basis.set ............................................ Passed 0.16 sec test 136 Start 136: q-solve-sc105.mps-lp_presolvers_with_basis.set 136: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc105.mps" "-o" "-0.52202061211707248062628010857689e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 136: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 136: Test timeout computed to be: 10000000 135: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 135: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 135: 135: External libraries: 135: Boost 1.83.0 (https://www.boost.org/) 135: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 135: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 135: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 135: 135: reading took 0.00497 seconds 135: Numerical Statistics: 135: Matrix range [0e+00,2e+00] 135: Objective range [1e+00,1e+00] 135: Bounds range [0e+00,0e+00] 135: RHS range [1e+02,2e+02] 135: Dynamism Variables: 2e+01 135: Dynamism Rows : 8e+00 135: set presolve.componentsmaxint = -1 135: set presolve.detectlindep = 0 135: set doubletoneq.enabled = 0 135: set dualinfer.enabled = 0 135: set substitution.enabled = 0 135: set sparsify.enabled = 0 135: 135: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc105.mps with dual-postsolve activated 135: rows: 105 135: columns: 103 135: int. columns: 0 135: cont. columns: 103 135: nonzeros: 280 135: 135: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 135: round 1 ( Final ): Unchanged 135: presolved 1 rounds: 0 del cols, 0 del rows, 5 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 135: 135: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 135: colsingleton 1 0.0 0 0.0 0.000 135: coefftightening 0 0.0 0 0.0 0.000 135: propagation 1 100.0 12 100.0 0.000 135: fixcontinuous 1 0.0 0 0.0 0.000 135: simpleprobing 0 0.0 0 0.0 0.000 135: parallelrows 1 0.0 0 0.0 0.000 135: parallelcols 1 0.0 0 0.0 0.000 135: stuffing 1 0.0 0 0.0 0.000 135: dualfix 1 0.0 0 0.0 0.000 135: simplifyineq 0 0.0 0 0.0 0.000 135: doubletoneq 0 0.0 0 0.0 0.000 135: implint 0 0.0 0 0.0 0.000 135: domcol 1 0.0 0 0.0 0.000 135: dualinfer 0 0.0 0 0.0 0.000 135: probing 0 0.0 0 0.0 0.000 135: substitution 0 0.0 0 0.0 0.000 135: sparsify 0 0.0 0 0.0 0.000 135: 135: reduced problem: 135: reduced rows: 104 135: reduced columns: 103 135: reduced int. columns: 0 135: reduced cont. columns: 103 135: reduced nonzeros: 280 135: 135: presolving finished after 0.017 seconds 135: 135: Equilibrium scaling LP (persistent) 131: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 131: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 131: 131: External libraries: 131: Boost 1.83.0 (https://www.boost.org/) 131: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 131: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 131: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 131: 131: reading took 0.019 seconds 131: Numerical Statistics: 131: Matrix range [2e-02,1e+03] 131: Objective range [1e+00,1e+00] 131: Bounds range [0e+00,0e+00] 131: RHS range [1e+00,2e+04] 131: Dynamism Variables: 2e+04 131: Dynamism Rows : 1e+03 131: set presolve.componentsmaxint = -1 131: set presolve.detectlindep = 0 131: set doubletoneq.enabled = 0 131: set dualinfer.enabled = 0 131: set substitution.enabled = 0 131: set sparsify.enabled = 0 131: 131: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/lotfi.mps with dual-postsolve activated 131: rows: 153 131: columns: 308 131: int. columns: 0 131: cont. columns: 308 131: nonzeros: 1078 131: 131: round 0 ( Trivial ): 4 del cols, 9 del rows, 13 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 131: round 1 ( Fast ): 6 del cols, 13 del rows, 218 chg bounds, 0 chg sides, 0 chg coeffs, 404 tsx applied, 0 tsx conflicts 131: round 2 ( Fast ): 8 del cols, 19 del rows, 261 chg bounds, 0 chg sides, 0 chg coeffs, 482 tsx applied, 0 tsx conflicts 131: round 3 ( Fast ): 8 del cols, 19 del rows, 308 chg bounds, 0 chg sides, 0 chg coeffs, 576 tsx applied, 0 tsx conflicts 131: round 4 ( Medium ): 23 del cols, 25 del rows, 318 chg bounds, 9 chg sides, 9 chg coeffs, 611 tsx applied, 46 tsx conflicts 131: round 5 ( Medium ): 30 del cols, 32 del rows, 319 chg bounds, 9 chg sides, 9 chg coeffs, 620 tsx applied, 52 tsx conflicts 131: round 6 ( Medium ): 80 del cols, 36 del rows, 319 chg bounds, 55 chg sides, 55 chg coeffs, 670 tsx applied, 102 tsx conflicts 131: round 7 ( Medium ): 96 del cols, 36 del rows, 319 chg bounds, 71 chg sides, 71 chg coeffs, 686 tsx applied, 150 tsx conflicts 131: round 8 (Exhaustive): 96 del cols, 36 del rows, 335 chg bounds, 71 chg sides, 71 chg coeffs, 702 tsx applied, 150 tsx conflicts 131: round 9 ( Final ): 96 del cols, 36 del rows, 335 chg bounds, 71 chg sides, 71 chg coeffs, 702 tsx applied, 150 tsx conflicts 131: presolved 9 rounds: 96 del cols, 36 del rows, 335 chg bounds, 71 chg sides, 71 chg coeffs, 702 tsx applied, 150 tsx conflicts 131: 131: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 131: colsingleton 9 0.0 0 0.0 0.000 131: coefftightening 0 0.0 0 0.0 0.000 131: propagation 9 55.6 598 100.0 0.050 131: fixcontinuous 3 0.0 0 0.0 0.001 131: simpleprobing 0 0.0 0 0.0 0.000 131: parallelrows 2 0.0 0 0.0 0.004 131: parallelcols 2 0.0 0 0.0 0.014 131: stuffing 5 80.0 236 36.9 0.006 131: dualfix 5 60.0 18 94.4 0.002 131: simplifyineq 0 0.0 0 0.0 0.000 131: doubletoneq 0 0.0 0 0.0 0.000 131: implint 0 0.0 0 0.0 0.000 131: domcol 1 0.0 0 0.0 0.014 131: dualinfer 0 0.0 0 0.0 0.000 131: probing 0 0.0 0 0.0 0.000 131: substitution 0 0.0 0 0.0 0.000 131: sparsify 0 0.0 0 0.0 0.000 131: 131: reduced problem: 131: reduced rows: 117 131: reduced columns: 212 131: reduced int. columns: 0 131: reduced cont. columns: 212 131: reduced nonzeros: 526 131: 131: presolving finished after 0.213 seconds 131: 131: Equilibrium scaling LP (persistent) 131: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 131: Reduced LP has 117 rows 212 columns 526 nonzeros 131: Equilibrium scaling LP 131: type | time | iters | facts | shift | viol sum | viol num | obj value 131: L | 0.0 | 0 | 3 | 0.00e+00 | 6.08e+05 | 73 | -3.18967215e+03 135: Simplifier removed 13 rows, 13 columns, 27 nonzeros, 0 col bounds, 46 row bounds 135: Reduced LP has 91 rows 90 columns 253 nonzeros 135: Equilibrium scaling LP 135: type | time | iters | facts | shift | viol sum | viol num | obj value 135: L | 0.0 | 0 | 3 | 4.24e-01 | 0.00e+00 | 0 | 0.00000000e+00 135: E | 0.0 | 0 | 3 | 0.00e+00 | 4.24e-01 | 1 | 0.00000000e+00 135: E | 0.0 | 92 | 6 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 135: --- unscaling internal solution 135: --- unsimplifying solution and basis 135: --- unscaling external solution 135: --- verifying computed solution 135: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 135: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 135: --- unscaling external solution 135: --- verifying computed solution 135: 135: SoPlex status : problem is solved [optimal] 135: Solving time (sec) : 0.02 135: Iterations : 92 135: Objective value : -5.22020612e+01 135: 135: Solution passed validation 135: 135: postsolve finished after 0.000 seconds 135: feasible: true 135: objective value: -52.2020612117072 135: 135: violations: 135: bounds: 0 135: constraints: 0 135: integrality: 0 135: 135: validation: SUCCESS 135: Solving time 0.036 seconds 135: 135: solving finished after 0.036 seconds 133/287 Test #135: d-solve-sc105.mps-lp_presolvers_with_basis.set ............................................. Passed 0.13 sec 131: L | 0.0 | 199 | 4 | 0.00e+00 | 1.93e+03 | 21 | -2.67640989e+01 131: L | 0.0 | 218 | 5 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 131: --- unscaling internal solution 131: --- unsimplifying solution and basis 131: --- unscaling external solution 131: --- verifying computed solution 131: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 131: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 131: --- unscaling external solution 131: --- verifying computed solution test 137 Start 137: r-solve-sc105.mps-lp_presolvers_with_basis.set 137: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc105.mps" "-o" "-0.52202061211707248062628010857689e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 137: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 137: Test timeout computed to be: 10000000 134: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 134: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 134: 134: External libraries: 134: Boost 1.83.0 (https://www.boost.org/) 134: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 134: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 134: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 134: 134: reading took 0.0291 seconds 134: Numerical Statistics: 134: Matrix range [1e-01,1e+02] 134: Objective range [1e-03,2e+00] 134: Bounds range [2e+00,5e+03] 134: RHS range [0e+00,0e+00] 134: Dynamism Variables: 1e+02 134: Dynamism Rows : 2e+02 134: set presolve.componentsmaxint = -1 134: set presolve.detectlindep = 0 134: set doubletoneq.enabled = 0 134: set dualinfer.enabled = 0 134: set substitution.enabled = 0 134: set sparsify.enabled = 0 134: 134: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/recipe.mps with dual-postsolve activated 134: rows: 91 134: columns: 180 134: int. columns: 0 134: cont. columns: 180 134: nonzeros: 663 134: 134: round 0 ( Trivial ): 28 del cols, 6 del rows, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 134: round 1 ( Fast ): 33 del cols, 10 del rows, 7 chg bounds, 0 chg sides, 0 chg coeffs, 8 tsx applied, 0 tsx conflicts 134: round 2 ( Fast ): 37 del cols, 12 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 16 tsx applied, 0 tsx conflicts 134: round 3 ( Fast ): 41 del cols, 14 del rows, 15 chg bounds, 0 chg sides, 0 chg coeffs, 24 tsx applied, 0 tsx conflicts 134: round 4 ( Medium ): 98 del cols, 27 del rows, 17 chg bounds, 31 chg sides, 17 chg coeffs, 79 tsx applied, 84 tsx conflicts 134: round 5 (Exhaustive): 104 del cols, 29 del rows, 23 chg bounds, 31 chg sides, 17 chg coeffs, 85 tsx applied, 84 tsx conflicts 134: round 6 ( Medium ): 105 del cols, 36 del rows, 28 chg bounds, 31 chg sides, 17 chg coeffs, 86 tsx applied, 84 tsx conflicts 134: round 7 ( Medium ): 111 del cols, 36 del rows, 28 chg bounds, 43 chg sides, 23 chg coeffs, 92 tsx applied, 92 tsx conflicts 134: round 8 (Exhaustive): 111 del cols, 36 del rows, 28 chg bounds, 43 chg sides, 23 chg coeffs, 92 tsx applied, 92 tsx conflicts 134: round 9 (Exhaustive): 115 del cols, 38 del rows, 32 chg bounds, 43 chg sides, 23 chg coeffs, 96 tsx applied, 92 tsx conflicts 134: round 10 ( Medium ): 119 del cols, 41 del rows, 35 chg bounds, 49 chg sides, 26 chg coeffs, 99 tsx applied, 93 tsx conflicts 134: round 11 (Exhaustive): 119 del cols, 41 del rows, 35 chg bounds, 49 chg sides, 26 chg coeffs, 99 tsx applied, 93 tsx conflicts 134: round 12 ( Medium ): 119 del cols, 44 del rows, 35 chg bounds, 50 chg sides, 26 chg coeffs, 102 tsx applied, 93 tsx conflicts 134: round 13 ( Medium ): 125 del cols, 47 del rows, 38 chg bounds, 56 chg sides, 29 chg coeffs, 105 tsx applied, 102 tsx conflicts 134: round 14 (Exhaustive): 125 del cols, 47 del rows, 38 chg bounds, 56 chg sides, 29 chg coeffs, 105 tsx applied, 102 tsx conflicts 134: round 15 ( Final ): Unchanged 134: presolved 15 rounds: 125 del cols, 47 del rows, 38 chg bounds, 56 chg sides, 29 chg coeffs, 105 tsx applied, 102 tsx conflicts 134: 134: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 134: colsingleton 15 0.0 0 0.0 0.000 134: coefftightening 0 0.0 0 0.0 0.000 134: propagation 15 20.0 24 100.0 0.021 134: fixcontinuous 4 0.0 0 0.0 0.000 134: simpleprobing 0 0.0 0 0.0 0.000 134: parallelrows 3 33.3 3 100.0 0.004 134: parallelcols 3 33.3 27 100.0 0.012 134: stuffing 8 50.0 142 28.2 0.007 134: dualfix 5 20.0 1 100.0 0.001 134: simplifyineq 0 0.0 0 0.0 0.000 134: doubletoneq 0 0.0 0 0.0 0.000 134: implint 0 0.0 0 0.0 0.000 134: domcol 3 66.7 10 100.0 0.014 134: dualinfer 0 0.0 0 0.0 0.000 134: probing 0 0.0 0 0.0 0.000 134: substitution 0 0.0 0 0.0 0.000 134: sparsify 0 0.0 0 0.0 0.000 134: 134: reduced problem: 134: reduced rows: 44 134: reduced columns: 55 134: reduced int. columns: 0 134: reduced cont. columns: 55 134: reduced nonzeros: 344 134: 134: presolving finished after 0.109 seconds 134: 134: Equilibrium scaling LP (persistent) 134: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 134: Reduced LP has 44 rows 55 columns 344 nonzeros 134: Equilibrium scaling LP 134: type | time | iters | facts | shift | viol sum | viol num | obj value 134: L | 0.0 | 0 | 3 | 0.00e+00 | 4.69e+02 | 8 | -7.16192000e+02 134: L | 0.0 | 9 | 4 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 134: --- unscaling internal solution 134: --- unsimplifying solution and basis 134: --- unscaling external solution 134: --- verifying computed solution 134: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 134: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 134: --- unscaling external solution 134: --- verifying computed solution 136: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 136: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 136: 136: External libraries: 136: Boost 1.83.0 (https://www.boost.org/) 136: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 136: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 136: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 136: 136: reading took 0.00759 seconds 136: Numerical Statistics: 136: Matrix range [0e+00,2e+00] 136: Objective range [1e+00,1e+00] 136: Bounds range [0e+00,0e+00] 136: RHS range [1e+02,2e+02] 136: Dynamism Variables: 2e+01 136: Dynamism Rows : 8e+00 136: set presolve.componentsmaxint = -1 136: set presolve.detectlindep = 0 136: set doubletoneq.enabled = 0 136: set dualinfer.enabled = 0 136: set substitution.enabled = 0 136: set sparsify.enabled = 0 136: 136: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc105.mps with dual-postsolve activated 136: rows: 105 136: columns: 103 136: int. columns: 0 136: cont. columns: 103 136: nonzeros: 280 136: 136: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 136: round 1 ( Final ): Unchanged 136: presolved 1 rounds: 0 del cols, 0 del rows, 5 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 136: 136: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 136: colsingleton 1 0.0 0 0.0 0.000 136: coefftightening 0 0.0 0 0.0 0.000 136: propagation 1 100.0 12 100.0 0.000 136: fixcontinuous 1 0.0 0 0.0 0.000 136: simpleprobing 0 0.0 0 0.0 0.000 136: parallelrows 1 0.0 0 0.0 0.000 136: parallelcols 1 0.0 0 0.0 0.000 136: stuffing 1 0.0 0 0.0 0.000 136: dualfix 1 0.0 0 0.0 0.004 136: simplifyineq 0 0.0 0 0.0 0.000 136: doubletoneq 0 0.0 0 0.0 0.000 136: implint 0 0.0 0 0.0 0.000 136: domcol 1 0.0 0 0.0 0.001 136: dualinfer 0 0.0 0 0.0 0.000 136: probing 0 0.0 0 0.0 0.000 136: substitution 0 0.0 0 0.0 0.000 136: sparsify 0 0.0 0 0.0 0.000 136: 136: reduced problem: 136: reduced rows: 104 136: reduced columns: 103 136: reduced int. columns: 0 136: reduced cont. columns: 103 136: reduced nonzeros: 280 136: 136: presolving finished after 0.008 seconds 136: 136: Equilibrium scaling LP (persistent) 136: Simplifier removed 13 rows, 13 columns, 27 nonzeros, 0 col bounds, 46 row bounds 136: Reduced LP has 91 rows 90 columns 253 nonzeros 136: Equilibrium scaling LP 136: type | time | iters | facts | shift | viol sum | viol num | obj value 136: L | 0.0 | 0 | 3 | 4.24e-01 | 0.00e+00 | 0 | 0.00000000e+00 136: E | 0.0 | 0 | 3 | 0.00e+00 | 4.24e-01 | 1 | 0.00000000e+00 131: 131: SoPlex status : problem is solved [optimal] 131: Solving time (sec) : 0.02 131: Iterations : 218 131: Objective value : -2.52647061e+01 131: 131: Solution passed validation 131: 131: postsolve finished after 0.039 seconds 131: feasible: true 131: objective value: -25.26470606188 131: 131: violations: 131: bounds: 0 131: constraints: 0 131: integrality: 0 131: 131: validation: SUCCESS 131: Solving time 0.286 seconds 131: 131: solving finished after 0.286 seconds 134/287 Test #131: r-solve-lotfi.mps-lp_presolvers_with_basis.set ............................................. Passed 0.39 sec test 138 Start 138: d-solve-sc205.mps-lp_presolvers_with_basis.set 138: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc205.mps" "-o" "-0.52202061211707248062628010857689e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 138: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 138: Test timeout computed to be: 10000000 136: E | 0.0 | 92 | 6 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 136: --- unscaling internal solution 136: --- unsimplifying solution and basis 136: --- unscaling external solution 136: --- verifying computed solution 136: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 136: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 136: --- unscaling external solution 136: --- verifying computed solution 134: 134: SoPlex status : problem is solved [optimal] 134: Solving time (sec) : 0.00 134: Iterations : 9 134: Objective value : -2.66616000e+02 134: 134: Solution passed validation 134: 134: postsolve finished after 0.028 seconds 134: feasible: true 134: objective value: -266.616 134: 134: violations: 134: bounds: 0 134: constraints: 0 134: integrality: 0 134: 134: validation: SUCCESS 134: Solving time 0.149 seconds 134: 134: solving finished after 0.149 seconds 135/287 Test #134: r-solve-recipe.mps-lp_presolvers_with_basis.set ............................................ Passed 0.27 sec 136: 136: SoPlex status : problem is solved [optimal] 136: Solving time (sec) : 0.02 136: Iterations : 92 136: Objective value : -5.22020612e+01 136: 136: Solution passed validation 136: 136: postsolve finished after 0.003 seconds 136: feasible: true 136: objective value: -52.2020612117073 136: 136: violations: 136: bounds: 0 136: constraints: 0 136: integrality: 0 136: 136: validation: SUCCESS 136: Solving time 0.046 seconds 136: 136: solving finished after 0.046 seconds test 139 Start 139: q-solve-sc205.mps-lp_presolvers_with_basis.set 139: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc205.mps" "-o" "-0.52202061211707248062628010857689e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 139: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 139: Test timeout computed to be: 10000000 137: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 137: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 137: 137: External libraries: 137: Boost 1.83.0 (https://www.boost.org/) 137: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 137: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 137: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 137: 137: reading took 0.00765 seconds 137: Numerical Statistics: 137: Matrix range [0e+00,2e+00] 137: Objective range [1e+00,1e+00] 137: Bounds range [0e+00,0e+00] 137: RHS range [1e+02,2e+02] 137: Dynamism Variables: 2e+01 137: Dynamism Rows : 8e+00 137: set presolve.componentsmaxint = -1 137: set presolve.detectlindep = 0 137: set doubletoneq.enabled = 0 137: set dualinfer.enabled = 0 137: set substitution.enabled = 0 137: set sparsify.enabled = 0 137: 137: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc105.mps with dual-postsolve activated 137: rows: 105 137: columns: 103 137: int. columns: 0 137: cont. columns: 103 137: nonzeros: 280 137: 137: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 137: round 1 ( Final ): Unchanged 137: presolved 1 rounds: 0 del cols, 0 del rows, 5 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 137: 137: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 137: colsingleton 1 0.0 0 0.0 0.000 137: coefftightening 0 0.0 0 0.0 0.000 137: propagation 1 100.0 12 100.0 0.001 137: fixcontinuous 1 0.0 0 0.0 0.000 137: simpleprobing 0 0.0 0 0.0 0.000 137: parallelrows 1 0.0 0 0.0 0.005 137: parallelcols 1 0.0 0 0.0 0.001 137: stuffing 1 0.0 0 0.0 0.000 137: dualfix 1 0.0 0 0.0 0.000 137: simplifyineq 0 0.0 0 0.0 0.000 137: doubletoneq 0 0.0 0 0.0 0.000 137: implint 0 0.0 0 0.0 0.000 137: domcol 1 0.0 0 0.0 0.001 137: dualinfer 0 0.0 0 0.0 0.000 137: probing 0 0.0 0 0.0 0.000 137: substitution 0 0.0 0 0.0 0.000 137: sparsify 0 0.0 0 0.0 0.000 137: 137: reduced problem: 137: reduced rows: 104 137: reduced columns: 103 137: reduced int. columns: 0 137: reduced cont. columns: 103 137: reduced nonzeros: 280 137: 137: presolving finished after 0.010 seconds 137: 137: Equilibrium scaling LP (persistent) 136/287 Test #136: q-solve-sc105.mps-lp_presolvers_with_basis.set ............................................. Passed 0.15 sec 137: Simplifier removed 13 rows, 13 columns, 27 nonzeros, 0 col bounds, 46 row bounds 137: Reduced LP has 91 rows 90 columns 253 nonzeros 137: Equilibrium scaling LP 137: type | time | iters | facts | shift | viol sum | viol num | obj value 137: L | 0.0 | 0 | 3 | 4.24e-01 | 0.00e+00 | 0 | 0.00000000e+00 137: E | 0.0 | 0 | 3 | 0.00e+00 | 4.24e-01 | 1 | 0.00000000e+00 test 140 Start 140: r-solve-sc205.mps-lp_presolvers_with_basis.set 140: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc205.mps" "-o" "-0.52202061211707248062628010857689e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 140: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 140: Test timeout computed to be: 10000000 137: E | 0.0 | 92 | 6 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 137: --- unscaling internal solution 137: --- unsimplifying solution and basis 137: --- unscaling external solution 137: --- verifying computed solution 137: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 137: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 137: --- unscaling external solution 137: --- verifying computed solution 137: 137: SoPlex status : problem is solved [optimal] 137: Solving time (sec) : 0.02 137: Iterations : 92 137: Objective value : -5.22020612e+01 137: 137: Solution passed validation 137: 137: postsolve finished after 0.008 seconds 137: feasible: true 137: objective value: -52.2020612117072 137: 137: violations: 137: bounds: 0 137: constraints: 0 137: integrality: 0 137: 137: validation: SUCCESS 137: Solving time 0.039 seconds 137: 137: solving finished after 0.039 seconds 138: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 138: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 138: 138: External libraries: 138: Boost 1.83.0 (https://www.boost.org/) 138: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 138: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 138: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 138: 138: reading took 0.00906 seconds 138: Numerical Statistics: 138: Matrix range [0e+00,2e+00] 138: Objective range [1e+00,1e+00] 138: Bounds range [0e+00,0e+00] 138: RHS range [1e+02,2e+02] 138: Dynamism Variables: 2e+01 138: Dynamism Rows : 8e+00 138: set presolve.componentsmaxint = -1 138: set presolve.detectlindep = 0 138: set doubletoneq.enabled = 0 138: set dualinfer.enabled = 0 138: set substitution.enabled = 0 138: set sparsify.enabled = 0 138: 138: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc205.mps with dual-postsolve activated 138: rows: 205 138: columns: 203 138: int. columns: 0 138: cont. columns: 203 138: nonzeros: 551 138: 138: round 0 ( Trivial ): 1 del cols, 1 del rows, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 138: round 1 ( Final ): Unchanged 138: presolved 1 rounds: 1 del cols, 1 del rows, 6 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 138: 138: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 138: colsingleton 1 0.0 0 0.0 0.000 138: coefftightening 0 0.0 0 0.0 0.000 138: propagation 1 100.0 12 100.0 0.000 138: fixcontinuous 1 0.0 0 0.0 0.000 138: simpleprobing 0 0.0 0 0.0 0.000 138: parallelrows 1 0.0 0 0.0 0.000 138: parallelcols 1 0.0 0 0.0 0.000 138: stuffing 1 0.0 0 0.0 0.000 138: dualfix 1 0.0 0 0.0 0.000 138: simplifyineq 0 0.0 0 0.0 0.000 138: doubletoneq 0 0.0 0 0.0 0.000 138: implint 0 0.0 0 0.0 0.000 138: domcol 1 0.0 0 0.0 0.000 138: dualinfer 0 0.0 0 0.0 0.000 138: probing 0 0.0 0 0.0 0.000 138: substitution 0 0.0 0 0.0 0.000 138: sparsify 0 0.0 0 0.0 0.000 138: 138: reduced problem: 138: reduced rows: 203 138: reduced columns: 202 138: reduced int. columns: 0 138: reduced cont. columns: 202 138: reduced nonzeros: 550 138: 138: presolving finished after 0.002 seconds 138: 138: Equilibrium scaling LP (persistent) 137/287 Test #137: r-solve-sc105.mps-lp_presolvers_with_basis.set ............................................. Passed 0.13 sec 138: Simplifier removed 22 rows, 22 columns, 45 nonzeros, 0 col bounds, 82 row bounds 138: Reduced LP has 181 rows 180 columns 505 nonzeros 138: Equilibrium scaling LP 138: type | time | iters | facts | shift | viol sum | viol num | obj value 138: L | 0.0 | 0 | 3 | 1.80e-01 | 0.00e+00 | 0 | 0.00000000e+00 138: E | 0.0 | 0 | 3 | 0.00e+00 | 1.80e-01 | 1 | 0.00000000e+00 test 141 Start 141: d-solve-sc50a.mps-lp_presolvers_with_basis.set 141: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50a.mps" "-o" "-0.64575077058564509026860413914575e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 141: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 141: Test timeout computed to be: 10000000 138: E | 0.0 | 197 | 7 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 138: E | 0.0 | 197 | 7 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 138: --- unscaling internal solution 138: --- unsimplifying solution and basis 138: --- unscaling external solution 138: --- verifying computed solution 138: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 138: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 138: --- unscaling external solution 138: --- verifying computed solution 139: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 139: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 139: 139: External libraries: 139: Boost 1.83.0 (https://www.boost.org/) 139: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 139: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 139: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 139: 139: reading took 0.0123 seconds 139: Numerical Statistics: 139: Matrix range [0e+00,2e+00] 139: Objective range [1e+00,1e+00] 139: Bounds range [0e+00,0e+00] 139: RHS range [1e+02,2e+02] 139: Dynamism Variables: 2e+01 139: Dynamism Rows : 8e+00 139: set presolve.componentsmaxint = -1 139: set presolve.detectlindep = 0 139: set doubletoneq.enabled = 0 139: set dualinfer.enabled = 0 139: set substitution.enabled = 0 139: set sparsify.enabled = 0 139: 139: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc205.mps with dual-postsolve activated 139: rows: 205 139: columns: 203 139: int. columns: 0 139: cont. columns: 203 139: nonzeros: 551 139: 139: round 0 ( Trivial ): 1 del cols, 1 del rows, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 139: round 1 ( Final ): Unchanged 139: presolved 1 rounds: 1 del cols, 1 del rows, 6 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 139: 139: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 139: colsingleton 1 0.0 0 0.0 0.000 139: coefftightening 0 0.0 0 0.0 0.000 139: propagation 1 100.0 12 100.0 0.001 139: fixcontinuous 1 0.0 0 0.0 0.000 139: simpleprobing 0 0.0 0 0.0 0.000 139: parallelrows 1 0.0 0 0.0 0.008 139: parallelcols 1 0.0 0 0.0 0.000 139: stuffing 1 0.0 0 0.0 0.000 139: dualfix 1 0.0 0 0.0 0.000 139: simplifyineq 0 0.0 0 0.0 0.000 139: doubletoneq 0 0.0 0 0.0 0.000 139: implint 0 0.0 0 0.0 0.000 139: domcol 1 0.0 0 0.0 0.001 139: dualinfer 0 0.0 0 0.0 0.000 139: probing 0 0.0 0 0.0 0.000 139: substitution 0 0.0 0 0.0 0.000 139: sparsify 0 0.0 0 0.0 0.000 139: 139: reduced problem: 139: reduced rows: 203 139: reduced columns: 202 139: reduced int. columns: 0 139: reduced cont. columns: 202 139: reduced nonzeros: 550 139: 139: presolving finished after 0.014 seconds 139: 139: Equilibrium scaling LP (persistent) 138: 138: SoPlex status : problem is solved [optimal] 138: Solving time (sec) : 0.02 138: Iterations : 197 138: Objective value : -5.22020612e+01 138: 138: Solution passed validation 138: 138: postsolve finished after 0.000 seconds 138: feasible: true 138: objective value: -52.2020612117072 138: 138: violations: 138: bounds: 0 138: constraints: 0 138: integrality: 0 138: 138: validation: SUCCESS 138: Solving time 0.042 seconds 138: 138: solving finished after 0.042 seconds 138/287 Test #138: d-solve-sc205.mps-lp_presolvers_with_basis.set ............................................. Passed 0.11 sec 139: Simplifier removed 22 rows, 22 columns, 45 nonzeros, 0 col bounds, 82 row bounds 139: Reduced LP has 181 rows 180 columns 505 nonzeros 139: Equilibrium scaling LP 139: type | time | iters | facts | shift | viol sum | viol num | obj value 139: L | 0.0 | 0 | 3 | 1.80e-01 | 0.00e+00 | 0 | 0.00000000e+00 139: E | 0.0 | 0 | 3 | 0.00e+00 | 1.80e-01 | 1 | 0.00000000e+00 test 142 Start 142: q-solve-sc50a.mps-lp_presolvers_with_basis.set 142: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50a.mps" "-o" "-0.64575077058564509026860413914575e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 142: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 142: Test timeout computed to be: 10000000 140: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 140: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 140: 140: External libraries: 140: Boost 1.83.0 (https://www.boost.org/) 140: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 140: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 140: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 140: 140: reading took 0.0101 seconds 140: Numerical Statistics: 140: Matrix range [0e+00,2e+00] 140: Objective range [1e+00,1e+00] 140: Bounds range [0e+00,0e+00] 140: RHS range [1e+02,2e+02] 140: Dynamism Variables: 2e+01 140: Dynamism Rows : 8e+00 140: set presolve.componentsmaxint = -1 140: set presolve.detectlindep = 0 140: set doubletoneq.enabled = 0 140: set dualinfer.enabled = 0 140: set substitution.enabled = 0 140: set sparsify.enabled = 0 140: 140: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc205.mps with dual-postsolve activated 140: rows: 205 140: columns: 203 140: int. columns: 0 140: cont. columns: 203 140: nonzeros: 551 140: 140: round 0 ( Trivial ): 1 del cols, 1 del rows, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 140: round 1 ( Final ): Unchanged 140: presolved 1 rounds: 1 del cols, 1 del rows, 6 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 140: 140: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 140: colsingleton 1 0.0 0 0.0 0.000 140: coefftightening 0 0.0 0 0.0 0.000 140: propagation 1 100.0 12 100.0 0.001 140: fixcontinuous 1 0.0 0 0.0 0.000 140: simpleprobing 0 0.0 0 0.0 0.000 140: parallelrows 1 0.0 0 0.0 0.009 140: parallelcols 1 0.0 0 0.0 0.001 140: stuffing 1 0.0 0 0.0 0.000 140: dualfix 1 0.0 0 0.0 0.001 140: simplifyineq 0 0.0 0 0.0 0.000 140: doubletoneq 0 0.0 0 0.0 0.000 140: implint 0 0.0 0 0.0 0.000 140: domcol 1 0.0 0 0.0 0.002 140: dualinfer 0 0.0 0 0.0 0.000 140: probing 0 0.0 0 0.0 0.000 140: substitution 0 0.0 0 0.0 0.000 140: sparsify 0 0.0 0 0.0 0.000 140: 140: reduced problem: 140: reduced rows: 203 140: reduced columns: 202 140: reduced int. columns: 0 140: reduced cont. columns: 202 140: reduced nonzeros: 550 140: 140: presolving finished after 0.020 seconds 140: 140: Equilibrium scaling LP (persistent) 140: Simplifier removed 22 rows, 22 columns, 45 nonzeros, 0 col bounds, 82 row bounds 140: Reduced LP has 181 rows 180 columns 505 nonzeros 140: Equilibrium scaling LP 139: E | 0.0 | 197 | 6 | 0.00e+00 | 3.08e+00 | 21 | -5.06907334e+01 141: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 141: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 141: 141: External libraries: 141: Boost 1.83.0 (https://www.boost.org/) 141: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 141: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 141: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 141: 141: reading took 0.0104 seconds 141: Numerical Statistics: 141: Matrix range [0e+00,2e+00] 141: Objective range [1e+00,1e+00] 141: Bounds range [0e+00,0e+00] 141: RHS range [1e+02,2e+02] 141: Dynamism Variables: 2e+01 141: Dynamism Rows : 8e+00 141: set presolve.componentsmaxint = -1 141: set presolve.detectlindep = 0 141: set doubletoneq.enabled = 0 141: set dualinfer.enabled = 0 141: set substitution.enabled = 0 141: set sparsify.enabled = 0 141: 141: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50a.mps with dual-postsolve activated 141: rows: 50 141: columns: 48 141: int. columns: 0 141: cont. columns: 48 141: nonzeros: 130 141: 141: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 141: round 1 ( Fast ): 0 del cols, 0 del rows, 5 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 141: round 2 (Exhaustive): 0 del cols, 0 del rows, 8 chg bounds, 0 chg sides, 0 chg coeffs, 18 tsx applied, 0 tsx conflicts 141: round 3 ( Final ): 0 del cols, 0 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 24 tsx applied, 0 tsx conflicts 141: presolved 3 rounds: 0 del cols, 0 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 24 tsx applied, 0 tsx conflicts 141: 141: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 141: colsingleton 3 0.0 0 0.0 0.000 141: coefftightening 0 0.0 0 0.0 0.000 141: propagation 3 100.0 24 100.0 0.000 141: fixcontinuous 1 0.0 0 0.0 0.000 141: simpleprobing 0 0.0 0 0.0 0.000 141: parallelrows 1 0.0 0 0.0 0.000 141: parallelcols 1 0.0 0 0.0 0.000 141: stuffing 1 0.0 0 0.0 0.000 141: dualfix 1 0.0 0 0.0 0.000 141: simplifyineq 0 0.0 0 0.0 0.000 141: doubletoneq 0 0.0 0 0.0 0.000 141: implint 0 0.0 0 0.0 0.000 141: domcol 1 0.0 0 0.0 0.000 141: dualinfer 0 0.0 0 0.0 0.000 141: probing 0 0.0 0 0.0 0.000 141: substitution 0 0.0 0 0.0 0.000 141: sparsify 0 0.0 0 0.0 0.000 141: 141: reduced problem: 141: reduced rows: 49 141: reduced columns: 48 141: reduced int. columns: 0 141: reduced cont. columns: 48 141: reduced nonzeros: 130 141: 141: presolving finished after 0.001 seconds 141: 141: Equilibrium scaling LP (persistent) 141: Simplifier removed 8 rows, 8 columns, 17 nonzeros, 0 col bounds, 26 row bounds 141: Reduced LP has 41 rows 40 columns 113 nonzeros 141: Equilibrium scaling LP 141: type | time | iters | facts | shift | viol sum | viol num | obj value 141: L | 0.0 | 0 | 3 | 6.83e-01 | 0.00e+00 | 0 | 0.00000000e+00 141: E | 0.0 | 0 | 3 | 0.00e+00 | 6.83e-01 | 1 | 0.00000000e+00 141: E | 0.0 | 38 | 4 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 141: --- unscaling internal solution 141: --- unsimplifying solution and basis 141: --- unscaling external solution 141: --- verifying computed solution 141: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 141: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 141: --- unscaling external solution 141: --- verifying computed solution 141: 141: SoPlex status : problem is solved [optimal] 141: Solving time (sec) : 0.00 141: Iterations : 38 141: Objective value : -6.45750771e+01 141: 141: Solution passed validation 141: 141: postsolve finished after 0.000 seconds 141: feasible: true 141: objective value: -64.5750770585645 141: 141: violations: 141: bounds: 0 141: constraints: 0 141: integrality: 0 141: 141: validation: SUCCESS 141: Solving time 0.011 seconds 141: 141: solving finished after 0.011 seconds 140: type | time | iters | facts | shift | viol sum | viol num | obj value 140: L | 0.0 | 0 | 3 | 1.80e-01 | 0.00e+00 | 0 | 0.00000000e+00 140: E | 0.0 | 0 | 3 | 0.00e+00 | 1.80e-01 | 1 | 0.00000000e+00 139: E | 0.0 | 208 | 8 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 139: --- unscaling internal solution 139: --- unsimplifying solution and basis 139: --- unscaling external solution 139: --- verifying computed solution 139: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 139: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 139: --- unscaling external solution 139: --- verifying computed solution 139/287 Test #141: d-solve-sc50a.mps-lp_presolvers_with_basis.set ............................................. Passed 0.09 sec test 143 Start 143: r-solve-sc50a.mps-lp_presolvers_with_basis.set 143: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50a.mps" "-o" "-0.64575077058564509026860413914575e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 143: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 143: Test timeout computed to be: 10000000 139: 139: SoPlex status : problem is solved [optimal] 139: Solving time (sec) : 0.00 139: Iterations : 208 139: Objective value : -5.22020612e+01 139: 139: Solution passed validation 139: 139: postsolve finished after 0.014 seconds 139: feasible: true 139: objective value: -52.2020612117073 139: 139: violations: 139: bounds: 0 139: constraints: 0 139: integrality: 0 139: 139: validation: SUCCESS 139: Solving time 0.093 seconds 139: 139: solving finished after 0.093 seconds 140/287 Test #139: q-solve-sc205.mps-lp_presolvers_with_basis.set ............................................. Passed 0.17 sec test 144 Start 144: d-solve-sc50b.mps-lp_presolvers_with_basis.set 144: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50b.mps" "-o" "-0.7e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 144: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 144: Test timeout computed to be: 10000000 140: E | 0.0 | 197 | 7 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 140: E | 0.0 | 197 | 7 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 140: --- unscaling internal solution 140: --- unsimplifying solution and basis 140: --- unscaling external solution 140: --- verifying computed solution 140: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 140: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 140: --- unscaling external solution 140: --- verifying computed solution 142: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 142: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 142: 142: External libraries: 142: Boost 1.83.0 (https://www.boost.org/) 142: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 142: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 142: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 142: 142: reading took 0.00139 seconds 142: Numerical Statistics: 142: Matrix range [0e+00,2e+00] 142: Objective range [1e+00,1e+00] 142: Bounds range [0e+00,0e+00] 142: RHS range [1e+02,2e+02] 142: Dynamism Variables: 2e+01 142: Dynamism Rows : 8e+00 142: set presolve.componentsmaxint = -1 142: set presolve.detectlindep = 0 142: set doubletoneq.enabled = 0 142: set dualinfer.enabled = 0 142: set substitution.enabled = 0 142: set sparsify.enabled = 0 142: 142: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50a.mps with dual-postsolve activated 142: rows: 50 142: columns: 48 142: int. columns: 0 142: cont. columns: 48 142: nonzeros: 130 142: 142: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 142: round 1 ( Fast ): 0 del cols, 0 del rows, 5 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 142: round 2 (Exhaustive): 0 del cols, 0 del rows, 8 chg bounds, 0 chg sides, 0 chg coeffs, 18 tsx applied, 0 tsx conflicts 142: round 3 ( Final ): 0 del cols, 0 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 24 tsx applied, 0 tsx conflicts 142: presolved 3 rounds: 0 del cols, 0 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 24 tsx applied, 0 tsx conflicts 142: 142: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 142: colsingleton 3 0.0 0 0.0 0.000 142: coefftightening 0 0.0 0 0.0 0.000 142: propagation 3 100.0 24 100.0 0.000 142: fixcontinuous 1 0.0 0 0.0 0.000 142: simpleprobing 0 0.0 0 0.0 0.000 142: parallelrows 1 0.0 0 0.0 0.000 142: parallelcols 1 0.0 0 0.0 0.000 142: stuffing 1 0.0 0 0.0 0.000 142: dualfix 1 0.0 0 0.0 0.000 142: simplifyineq 0 0.0 0 0.0 0.000 142: doubletoneq 0 0.0 0 0.0 0.000 142: implint 0 0.0 0 0.0 0.000 142: domcol 1 0.0 0 0.0 0.009 142: dualinfer 0 0.0 0 0.0 0.000 142: probing 0 0.0 0 0.0 0.000 142: substitution 0 0.0 0 0.0 0.000 142: sparsify 0 0.0 0 0.0 0.000 142: 142: reduced problem: 142: reduced rows: 49 142: reduced columns: 48 142: reduced int. columns: 0 142: reduced cont. columns: 48 142: reduced nonzeros: 130 142: 142: presolving finished after 0.011 seconds 142: 142: Equilibrium scaling LP (persistent) 142: Simplifier removed 8 rows, 8 columns, 17 nonzeros, 0 col bounds, 26 row bounds 142: Reduced LP has 41 rows 40 columns 113 nonzeros 142: Equilibrium scaling LP 142: type | time | iters | facts | shift | viol sum | viol num | obj value 142: L | 0.0 | 0 | 3 | 6.83e-01 | 0.00e+00 | 0 | 0.00000000e+00 142: E | 0.0 | 0 | 3 | 0.00e+00 | 6.83e-01 | 1 | 0.00000000e+00 142: E | 0.0 | 38 | 4 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 142: --- unscaling internal solution 142: --- unsimplifying solution and basis 142: --- unscaling external solution 142: --- verifying computed solution 142: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 142: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 142: --- unscaling external solution 142: --- verifying computed solution 142: 142: SoPlex status : problem is solved [optimal] 142: Solving time (sec) : 0.00 142: Iterations : 38 142: Objective value : -6.45750771e+01 142: 142: Solution passed validation 142: 142: postsolve finished after 0.001 seconds 142: feasible: true 142: objective value: -64.5750770585645 142: 142: violations: 142: bounds: 0 142: constraints: 0 142: integrality: 0 142: 142: validation: SUCCESS 142: Solving time 0.025 seconds 142: 142: solving finished after 0.025 seconds 141/287 Test #142: q-solve-sc50a.mps-lp_presolvers_with_basis.set ............................................. Passed 0.12 sec test 145 Start 145: q-solve-sc50b.mps-lp_presolvers_with_basis.set 145: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50b.mps" "-o" "-0.7e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 145: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 145: Test timeout computed to be: 10000000 140: 140: SoPlex status : problem is solved [optimal] 140: Solving time (sec) : 0.02 140: Iterations : 197 140: Objective value : -5.22020612e+01 140: 140: Solution passed validation 140: 140: postsolve finished after 0.024 seconds 140: feasible: true 140: objective value: -52.2020612117072 140: 140: violations: 140: bounds: 0 140: constraints: 0 140: integrality: 0 140: 140: validation: SUCCESS 140: Solving time 0.115 seconds 140: 140: solving finished after 0.115 seconds 143: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 143: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 143: 143: External libraries: 143: Boost 1.83.0 (https://www.boost.org/) 143: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 143: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 143: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 143: 143: reading took 0.00995 seconds 143: Numerical Statistics: 143: Matrix range [0e+00,2e+00] 143: Objective range [1e+00,1e+00] 143: Bounds range [0e+00,0e+00] 143: RHS range [1e+02,2e+02] 143: Dynamism Variables: 2e+01 143: Dynamism Rows : 8e+00 143: set presolve.componentsmaxint = -1 143: set presolve.detectlindep = 0 143: set doubletoneq.enabled = 0 143: set dualinfer.enabled = 0 143: set substitution.enabled = 0 143: set sparsify.enabled = 0 143: 143: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50a.mps with dual-postsolve activated 143: rows: 50 143: columns: 48 143: int. columns: 0 143: cont. columns: 48 143: nonzeros: 130 143: 143: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 143: round 1 ( Fast ): 0 del cols, 0 del rows, 5 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 143: round 2 (Exhaustive): 0 del cols, 0 del rows, 8 chg bounds, 0 chg sides, 0 chg coeffs, 18 tsx applied, 0 tsx conflicts 143: round 3 ( Final ): 0 del cols, 0 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 24 tsx applied, 0 tsx conflicts 143: presolved 3 rounds: 0 del cols, 0 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 24 tsx applied, 0 tsx conflicts 143: 143: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 143: colsingleton 3 0.0 0 0.0 0.000 143: coefftightening 0 0.0 0 0.0 0.000 143: propagation 3 100.0 24 100.0 0.005 143: fixcontinuous 1 0.0 0 0.0 0.000 143: simpleprobing 0 0.0 0 0.0 0.000 143: parallelrows 1 0.0 0 0.0 0.000 143: parallelcols 1 0.0 0 0.0 0.002 143: stuffing 1 0.0 0 0.0 0.000 143: dualfix 1 0.0 0 0.0 0.001 143: simplifyineq 0 0.0 0 0.0 0.000 143: doubletoneq 0 0.0 0 0.0 0.000 143: implint 0 0.0 0 0.0 0.000 143: domcol 1 0.0 0 0.0 0.001 143: dualinfer 0 0.0 0 0.0 0.000 143: probing 0 0.0 0 0.0 0.000 143: substitution 0 0.0 0 0.0 0.000 143: sparsify 0 0.0 0 0.0 0.000 143: 143: reduced problem: 143: reduced rows: 49 143: reduced columns: 48 143: reduced int. columns: 0 143: reduced cont. columns: 48 143: reduced nonzeros: 130 143: 143: presolving finished after 0.011 seconds 143: 143: Equilibrium scaling LP (persistent) 143: Simplifier removed 8 rows, 8 columns, 17 nonzeros, 0 col bounds, 26 row bounds 143: Reduced LP has 41 rows 40 columns 113 nonzeros 143: Equilibrium scaling LP 143: type | time | iters | facts | shift | viol sum | viol num | obj value 143: L | 0.0 | 0 | 3 | 6.83e-01 | 0.00e+00 | 0 | 0.00000000e+00 143: E | 0.0 | 0 | 3 | 0.00e+00 | 6.83e-01 | 1 | 0.00000000e+00 143: E | 0.0 | 38 | 4 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 143: --- unscaling internal solution 143: --- unsimplifying solution and basis 143: --- unscaling external solution 143: --- verifying computed solution 143: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 143: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 143: --- unscaling external solution 143: --- verifying computed solution 144: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 144: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 144: 144: External libraries: 144: Boost 1.83.0 (https://www.boost.org/) 144: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 144: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 144: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 144: 144: reading took 0.00624 seconds 144: Numerical Statistics: 144: Matrix range [0e+00,3e+00] 144: Objective range [1e+00,1e+00] 144: Bounds range [0e+00,0e+00] 144: RHS range [3e+02,3e+02] 144: Dynamism Variables: 1e+01 144: Dynamism Rows : 3e+00 144: set presolve.componentsmaxint = -1 144: set presolve.detectlindep = 0 144: set doubletoneq.enabled = 0 144: set dualinfer.enabled = 0 144: set substitution.enabled = 0 144: set sparsify.enabled = 0 144: 144: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50b.mps with dual-postsolve activated 144: rows: 50 144: columns: 48 144: int. columns: 0 144: cont. columns: 48 144: nonzeros: 118 144: 144: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 144: round 1 ( Final ): Unchanged 144: presolved 1 rounds: 0 del cols, 0 del rows, 3 chg bounds, 0 chg sides, 0 chg coeffs, 6 tsx applied, 0 tsx conflicts 144: 144: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 144: colsingleton 1 0.0 0 0.0 0.000 144: coefftightening 0 0.0 0 0.0 0.000 144: propagation 1 100.0 6 100.0 0.000 144: fixcontinuous 1 0.0 0 0.0 0.000 144: simpleprobing 0 0.0 0 0.0 0.000 144: parallelrows 1 0.0 0 0.0 0.000 144: parallelcols 1 0.0 0 0.0 0.000 144: stuffing 1 0.0 0 0.0 0.000 144: dualfix 1 0.0 0 0.0 0.000 144: simplifyineq 0 0.0 0 0.0 0.000 144: doubletoneq 0 0.0 0 0.0 0.000 144: implint 0 0.0 0 0.0 0.000 144: domcol 1 0.0 0 0.0 0.000 144: dualinfer 0 0.0 0 0.0 0.000 144: probing 0 0.0 0 0.0 0.000 144: substitution 0 0.0 0 0.0 0.000 144: sparsify 0 0.0 0 0.0 0.000 144: 144: reduced problem: 144: reduced rows: 48 144: reduced columns: 48 144: reduced int. columns: 0 144: reduced cont. columns: 48 144: reduced nonzeros: 118 144: 144: presolving finished after 0.001 seconds 144: 144: Equilibrium scaling LP (persistent) 142/287 Test #140: r-solve-sc205.mps-lp_presolvers_with_basis.set ............................................. Passed 0.22 sec 144: Simplifier removed 8 rows, 8 columns, 17 nonzeros, 0 col bounds, 27 row bounds 144: Reduced LP has 40 rows 40 columns 101 nonzeros 144: Equilibrium scaling LP 144: type | time | iters | facts | shift | viol sum | viol num | obj value 144: L | 0.0 | 0 | 3 | 6.83e-01 | 0.00e+00 | 0 | 0.00000000e+00 144: E | 0.0 | 0 | 3 | 0.00e+00 | 6.83e-01 | 1 | 0.00000000e+00 144: E | 0.0 | 41 | 4 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 144: --- unscaling internal solution 144: --- unsimplifying solution and basis 144: --- unscaling external solution 144: --- verifying computed solution 144: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 144: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 144: --- unscaling external solution 144: --- verifying computed solution 144: 144: SoPlex status : problem is solved [optimal] 144: Solving time (sec) : 0.00 144: Iterations : 41 144: Objective value : -7.00000000e+01 144: 144: Solution passed validation 144: 144: postsolve finished after 0.000 seconds 144: feasible: true 144: objective value: -70 144: 144: violations: 144: bounds: 0 144: constraints: 0 144: integrality: 0 144: 144: validation: SUCCESS 144: Solving time 0.011 seconds 144: 144: solving finished after 0.011 seconds test 146 Start 146: r-solve-sc50b.mps-lp_presolvers_with_basis.set 146: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50b.mps" "-o" "-0.7e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 146: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 146: Test timeout computed to be: 10000000 143: 143: SoPlex status : problem is solved [optimal] 143: Solving time (sec) : 0.00 143: Iterations : 38 143: Objective value : -6.45750771e+01 143: 143: Solution passed validation 143: 143: postsolve finished after 0.013 seconds 143: feasible: true 143: objective value: -64.5750770585645 143: 143: violations: 143: bounds: 0 143: constraints: 0 143: integrality: 0 143: 143: validation: SUCCESS 143: Solving time 0.034 seconds 143: 143: solving finished after 0.034 seconds 143/287 Test #143: r-solve-sc50a.mps-lp_presolvers_with_basis.set ............................................. Passed 0.11 sec 144/287 Test #144: d-solve-sc50b.mps-lp_presolvers_with_basis.set ............................................. Passed 0.09 sec test 147 Start 147: d-solve-scagr7.mps-lp_presolvers_with_basis.set 147: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr7.mps" "-o" "-0.2331389824330984e7" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 147: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 147: Test timeout computed to be: 10000000 test 148 Start 148: q-solve-scagr7.mps-lp_presolvers_with_basis.set 148: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr7.mps" "-o" "-0.2331389824330984e7" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 148: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 148: Test timeout computed to be: 10000000 145: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 145: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 145: 145: External libraries: 145: Boost 1.83.0 (https://www.boost.org/) 145: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 145: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 145: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 145: 145: reading took 0.00125 seconds 145: Numerical Statistics: 145: Matrix range [0e+00,3e+00] 145: Objective range [1e+00,1e+00] 145: Bounds range [0e+00,0e+00] 145: RHS range [3e+02,3e+02] 145: Dynamism Variables: 1e+01 145: Dynamism Rows : 3e+00 145: set presolve.componentsmaxint = -1 145: set presolve.detectlindep = 0 145: set doubletoneq.enabled = 0 145: set dualinfer.enabled = 0 145: set substitution.enabled = 0 145: set sparsify.enabled = 0 145: 145: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50b.mps with dual-postsolve activated 145: rows: 50 145: columns: 48 145: int. columns: 0 145: cont. columns: 48 145: nonzeros: 118 145: 145: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 145: round 1 ( Final ): Unchanged 145: presolved 1 rounds: 0 del cols, 0 del rows, 3 chg bounds, 0 chg sides, 0 chg coeffs, 6 tsx applied, 0 tsx conflicts 145: 145: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 145: colsingleton 1 0.0 0 0.0 0.000 145: coefftightening 0 0.0 0 0.0 0.000 145: propagation 1 100.0 6 100.0 0.000 145: fixcontinuous 1 0.0 0 0.0 0.000 145: simpleprobing 0 0.0 0 0.0 0.000 145: parallelrows 1 0.0 0 0.0 0.000 145: parallelcols 1 0.0 0 0.0 0.000 145: stuffing 1 0.0 0 0.0 0.000 145: dualfix 1 0.0 0 0.0 0.000 145: simplifyineq 0 0.0 0 0.0 0.000 145: doubletoneq 0 0.0 0 0.0 0.000 145: implint 0 0.0 0 0.0 0.000 145: domcol 1 0.0 0 0.0 0.000 145: dualinfer 0 0.0 0 0.0 0.000 145: probing 0 0.0 0 0.0 0.000 145: substitution 0 0.0 0 0.0 0.000 145: sparsify 0 0.0 0 0.0 0.000 145: 145: reduced problem: 145: reduced rows: 48 145: reduced columns: 48 145: reduced int. columns: 0 145: reduced cont. columns: 48 145: reduced nonzeros: 118 145: 145: presolving finished after 0.002 seconds 145: 145: Equilibrium scaling LP (persistent) 145: Simplifier removed 8 rows, 8 columns, 17 nonzeros, 0 col bounds, 27 row bounds 145: Reduced LP has 40 rows 40 columns 101 nonzeros 145: Equilibrium scaling LP 145: type | time | iters | facts | shift | viol sum | viol num | obj value 145: L | 0.0 | 0 | 3 | 6.83e-01 | 0.00e+00 | 0 | 0.00000000e+00 145: E | 0.0 | 0 | 3 | 0.00e+00 | 6.83e-01 | 1 | 0.00000000e+00 145: E | 0.0 | 42 | 4 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 145: --- unscaling internal solution 145: --- unsimplifying solution and basis 145: --- unscaling external solution 145: --- verifying computed solution 145: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 145: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 145: --- unscaling external solution 145: --- verifying computed solution 145: 145: SoPlex status : problem is solved [optimal] 145: Solving time (sec) : 0.00 145: Iterations : 42 145: Objective value : -7.00000000e+01 145: 145: Solution passed validation 145: 145: postsolve finished after 0.001 seconds 145: feasible: true 145: objective value: -70 145: 145: violations: 145: bounds: 0 145: constraints: 0 145: integrality: 0 145: 145: validation: SUCCESS 145: Solving time 0.011 seconds 145: 145: solving finished after 0.011 seconds 145/287 Test #145: q-solve-sc50b.mps-lp_presolvers_with_basis.set ............................................. Passed 0.08 sec test 149 Start 149: r-solve-scagr7.mps-lp_presolvers_with_basis.set 149: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr7.mps" "-o" "-0.2331389824330984e7" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 149: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 149: Test timeout computed to be: 10000000 146: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 146: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 146: 146: External libraries: 146: Boost 1.83.0 (https://www.boost.org/) 146: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 146: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 146: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 146: 146: reading took 0.0115 seconds 146: Numerical Statistics: 146: Matrix range [0e+00,3e+00] 146: Objective range [1e+00,1e+00] 146: Bounds range [0e+00,0e+00] 146: RHS range [3e+02,3e+02] 146: Dynamism Variables: 1e+01 146: Dynamism Rows : 3e+00 146: set presolve.componentsmaxint = -1 146: set presolve.detectlindep = 0 146: set doubletoneq.enabled = 0 146: set dualinfer.enabled = 0 146: set substitution.enabled = 0 146: set sparsify.enabled = 0 146: 146: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50b.mps with dual-postsolve activated 146: rows: 50 146: columns: 48 146: int. columns: 0 146: cont. columns: 48 146: nonzeros: 118 146: 146: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 146: round 1 ( Final ): Unchanged 146: presolved 1 rounds: 0 del cols, 0 del rows, 3 chg bounds, 0 chg sides, 0 chg coeffs, 6 tsx applied, 0 tsx conflicts 146: 146: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 146: colsingleton 1 0.0 0 0.0 0.000 146: coefftightening 0 0.0 0 0.0 0.000 146: propagation 1 100.0 6 100.0 0.000 146: fixcontinuous 1 0.0 0 0.0 0.000 146: simpleprobing 0 0.0 0 0.0 0.000 146: parallelrows 1 0.0 0 0.0 0.000 146: parallelcols 1 0.0 0 0.0 0.000 146: stuffing 1 0.0 0 0.0 0.000 146: dualfix 1 0.0 0 0.0 0.000 146: simplifyineq 0 0.0 0 0.0 0.000 146: doubletoneq 0 0.0 0 0.0 0.000 146: implint 0 0.0 0 0.0 0.000 146: domcol 1 0.0 0 0.0 0.000 146: dualinfer 0 0.0 0 0.0 0.000 146: probing 0 0.0 0 0.0 0.000 146: substitution 0 0.0 0 0.0 0.000 146: sparsify 0 0.0 0 0.0 0.000 146: 146: reduced problem: 146: reduced rows: 48 146: reduced columns: 48 146: reduced int. columns: 0 146: reduced cont. columns: 48 146: reduced nonzeros: 118 146: 146: presolving finished after 0.007 seconds 146: 146: Equilibrium scaling LP (persistent) 146: Simplifier removed 8 rows, 8 columns, 17 nonzeros, 0 col bounds, 27 row bounds 146: Reduced LP has 40 rows 40 columns 101 nonzeros 146: Equilibrium scaling LP 146: type | time | iters | facts | shift | viol sum | viol num | obj value 146: L | 0.0 | 0 | 3 | 6.83e-01 | 0.00e+00 | 0 | 0.00000000e+00 146: E | 0.0 | 0 | 3 | 0.00e+00 | 6.83e-01 | 1 | 0.00000000e+00 146: E | 0.0 | 41 | 4 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 146: --- unscaling internal solution 146: --- unsimplifying solution and basis 146: --- unscaling external solution 146: --- verifying computed solution 146: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 146: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 146: --- unscaling external solution 146: --- verifying computed solution 147: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 147: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 147: 147: External libraries: 147: Boost 1.83.0 (https://www.boost.org/) 147: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 147: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 147: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 147: 147: reading took 0.00836 seconds 147: Numerical Statistics: 147: Matrix range [2e-01,9e+00] 147: Objective range [4e-01,7e+02] 147: Bounds range [0e+00,0e+00] 147: RHS range [9e+01,7e+03] 147: Dynamism Variables: 2e+01 147: Dynamism Rows : 2e+01 147: set presolve.componentsmaxint = -1 147: set presolve.detectlindep = 0 147: set doubletoneq.enabled = 0 147: set dualinfer.enabled = 0 147: set substitution.enabled = 0 147: set sparsify.enabled = 0 147: 147: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr7.mps with dual-postsolve activated 147: rows: 129 147: columns: 140 147: int. columns: 0 147: cont. columns: 140 147: nonzeros: 420 147: 147: round 0 ( Trivial ): 1 del cols, 34 del rows, 35 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 147: round 1 ( Fast ): 1 del cols, 34 del rows, 66 chg bounds, 0 chg sides, 0 chg coeffs, 62 tsx applied, 0 tsx conflicts 147: round 2 ( Fast ): 1 del cols, 34 del rows, 105 chg bounds, 0 chg sides, 0 chg coeffs, 158 tsx applied, 0 tsx conflicts 147: round 3 ( Fast ): 1 del cols, 34 del rows, 133 chg bounds, 0 chg sides, 0 chg coeffs, 234 tsx applied, 0 tsx conflicts 147: round 4 ( Medium ): 40 del cols, 39 del rows, 146 chg bounds, 38 chg sides, 38 chg coeffs, 291 tsx applied, 125 tsx conflicts 147: round 5 ( Medium ): 41 del cols, 40 del rows, 147 chg bounds, 38 chg sides, 38 chg coeffs, 296 tsx applied, 125 tsx conflicts 147: round 6 (Exhaustive): 41 del cols, 40 del rows, 148 chg bounds, 38 chg sides, 38 chg coeffs, 297 tsx applied, 125 tsx conflicts 147: round 7 ( Final ): 41 del cols, 40 del rows, 148 chg bounds, 38 chg sides, 38 chg coeffs, 297 tsx applied, 125 tsx conflicts 147: presolved 7 rounds: 41 del cols, 40 del rows, 148 chg bounds, 38 chg sides, 38 chg coeffs, 297 tsx applied, 125 tsx conflicts 147: 147: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 147: colsingleton 7 0.0 0 0.0 0.000 147: coefftightening 0 0.0 0 0.0 0.000 147: propagation 7 57.1 252 100.0 0.008 147: fixcontinuous 2 0.0 0 0.0 0.000 147: simpleprobing 0 0.0 0 0.0 0.000 147: parallelrows 2 0.0 0 0.0 0.000 147: parallelcols 2 0.0 0 0.0 0.000 147: stuffing 3 66.7 169 26.0 0.000 147: dualfix 3 33.3 1 100.0 0.000 147: simplifyineq 0 0.0 0 0.0 0.000 147: doubletoneq 0 0.0 0 0.0 0.000 147: implint 0 0.0 0 0.0 0.000 147: domcol 1 0.0 0 0.0 0.000 147: dualinfer 0 0.0 0 0.0 0.000 147: probing 0 0.0 0 0.0 0.000 147: substitution 0 0.0 0 0.0 0.000 147: sparsify 0 0.0 0 0.0 0.000 147: 147: reduced problem: 147: reduced rows: 89 147: reduced columns: 99 147: reduced int. columns: 0 147: reduced cont. columns: 99 147: reduced nonzeros: 333 147: 147: presolving finished after 0.012 seconds 147: 147: Equilibrium scaling LP (persistent) 146: 146: SoPlex status : problem is solved [optimal] 146: Solving time (sec) : 0.00 146: Iterations : 41 146: Objective value : -7.00000000e+01 146: 146: Solution passed validation 146: 146: postsolve finished after 0.010 seconds 146: feasible: true 146: objective value: -70 146: 146: violations: 146: bounds: 0 146: constraints: 0 146: integrality: 0 146: 146: validation: SUCCESS 146: Solving time 0.021 seconds 146: 146: solving finished after 0.021 seconds 147: Simplifier removed 22 rows, 22 columns, 72 nonzeros, 23 col bounds, 62 row bounds 147: Reduced LP has 67 rows 77 columns 261 nonzeros 147: Equilibrium scaling LP 147: type | time | iters | facts | shift | viol sum | viol num | obj value 147: L | 0.0 | 0 | 3 | 3.00e+00 | 1.71e+05 | 44 | -4.44039449e+07 146/287 Test #146: r-solve-sc50b.mps-lp_presolvers_with_basis.set ............................................. Passed 0.10 sec 147: E | 0.0 | 117 | 5 | 0.00e+00 | 1.32e-01 | 1 | -2.33112823e+06 147: E | 0.0 | 119 | 6 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 147: --- unscaling internal solution 147: --- unsimplifying solution and basis 147: --- unscaling external solution 147: --- verifying computed solution 147: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 147: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 147: --- unscaling external solution 147: --- verifying computed solution test 150 Start 150: d-solve-scagr25.mps-lp_presolvers_with_basis.set 150: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr25.mps" "-o" "-0.14753433060768523167790925075974e8" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 150: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 150: Test timeout computed to be: 10000000 147: 147: SoPlex status : problem is solved [optimal] 147: Solving time (sec) : 0.00 147: Iterations : 119 147: Objective value : -2.33138982e+06 147: 147: Solution passed validation 147: 147: postsolve finished after 0.004 seconds 147: feasible: true 147: objective value: -2331389.82433098 147: 147: violations: 147: bounds: 0 147: constraints: 0 147: integrality: 0 147: 147: validation: SUCCESS 147: Solving time 0.035 seconds 147: 147: solving finished after 0.035 seconds 147/287 Test #147: d-solve-scagr7.mps-lp_presolvers_with_basis.set ............................................ Passed 0.11 sec test 151 Start 151: q-solve-scagr25.mps-lp_presolvers_with_basis.set 151: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr25.mps" "-o" "-0.14753433060768523167790925075974e8" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 151: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 151: Test timeout computed to be: 10000000 148: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 148: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 148: 148: External libraries: 148: Boost 1.83.0 (https://www.boost.org/) 148: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 148: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 148: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 148: 148: reading took 0.0208 seconds 148: Numerical Statistics: 148: Matrix range [2e-01,9e+00] 148: Objective range [4e-01,7e+02] 148: Bounds range [0e+00,0e+00] 148: RHS range [9e+01,7e+03] 148: Dynamism Variables: 2e+01 148: Dynamism Rows : 2e+01 148: set presolve.componentsmaxint = -1 148: set presolve.detectlindep = 0 148: set doubletoneq.enabled = 0 148: set dualinfer.enabled = 0 148: set substitution.enabled = 0 148: set sparsify.enabled = 0 148: 148: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr7.mps with dual-postsolve activated 148: rows: 129 148: columns: 140 148: int. columns: 0 148: cont. columns: 140 148: nonzeros: 420 148: 148: round 0 ( Trivial ): 1 del cols, 34 del rows, 35 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 148: round 1 ( Fast ): 1 del cols, 34 del rows, 66 chg bounds, 0 chg sides, 0 chg coeffs, 62 tsx applied, 0 tsx conflicts 148: round 2 ( Fast ): 1 del cols, 34 del rows, 105 chg bounds, 0 chg sides, 0 chg coeffs, 158 tsx applied, 0 tsx conflicts 148: round 3 ( Fast ): 1 del cols, 34 del rows, 133 chg bounds, 0 chg sides, 0 chg coeffs, 234 tsx applied, 0 tsx conflicts 148: round 4 ( Medium ): 40 del cols, 39 del rows, 146 chg bounds, 38 chg sides, 38 chg coeffs, 291 tsx applied, 125 tsx conflicts 148: round 5 ( Medium ): 41 del cols, 40 del rows, 147 chg bounds, 38 chg sides, 38 chg coeffs, 296 tsx applied, 125 tsx conflicts 148: round 6 (Exhaustive): 41 del cols, 40 del rows, 148 chg bounds, 38 chg sides, 38 chg coeffs, 297 tsx applied, 125 tsx conflicts 148: round 7 ( Final ): 41 del cols, 40 del rows, 148 chg bounds, 38 chg sides, 38 chg coeffs, 297 tsx applied, 125 tsx conflicts 148: presolved 7 rounds: 41 del cols, 40 del rows, 148 chg bounds, 38 chg sides, 38 chg coeffs, 297 tsx applied, 125 tsx conflicts 148: 148: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 148: colsingleton 7 0.0 0 0.0 0.000 148: coefftightening 0 0.0 0 0.0 0.000 148: propagation 7 57.1 252 100.0 0.019 148: fixcontinuous 2 0.0 0 0.0 0.000 148: simpleprobing 0 0.0 0 0.0 0.000 148: parallelrows 2 0.0 0 0.0 0.001 148: parallelcols 2 0.0 0 0.0 0.001 148: stuffing 3 66.7 169 26.0 0.002 148: dualfix 3 33.3 1 100.0 0.000 148: simplifyineq 0 0.0 0 0.0 0.000 148: doubletoneq 0 0.0 0 0.0 0.000 148: implint 0 0.0 0 0.0 0.000 148: domcol 1 0.0 0 0.0 0.001 148: dualinfer 0 0.0 0 0.0 0.000 148: probing 0 0.0 0 0.0 0.000 148: substitution 0 0.0 0 0.0 0.000 148: sparsify 0 0.0 0 0.0 0.000 148: 148: reduced problem: 148: reduced rows: 89 148: reduced columns: 99 148: reduced int. columns: 0 148: reduced cont. columns: 99 148: reduced nonzeros: 333 148: 148: presolving finished after 0.058 seconds 148: 148: Equilibrium scaling LP (persistent) 148: Simplifier removed 22 rows, 22 columns, 72 nonzeros, 23 col bounds, 62 row bounds 148: Reduced LP has 67 rows 77 columns 261 nonzeros 148: Equilibrium scaling LP 148: type | time | iters | facts | shift | viol sum | viol num | obj value 148: L | 0.0 | 0 | 3 | 3.00e+00 | 1.71e+05 | 44 | -4.44039449e+07 148: E | 0.0 | 117 | 5 | 0.00e+00 | 1.32e-01 | 1 | -2.33112823e+06 148: E | 0.0 | 119 | 6 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 148: --- unscaling internal solution 148: --- unsimplifying solution and basis 148: --- unscaling external solution 148: --- verifying computed solution 148: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 148: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 148: --- unscaling external solution 148: --- verifying computed solution 149: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 149: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 149: 149: External libraries: 149: Boost 1.83.0 (https://www.boost.org/) 149: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 149: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 149: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 149: 149: reading took 0.00936 seconds 149: Numerical Statistics: 149: Matrix range [2e-01,9e+00] 149: Objective range [4e-01,7e+02] 149: Bounds range [0e+00,0e+00] 149: RHS range [9e+01,7e+03] 149: Dynamism Variables: 2e+01 149: Dynamism Rows : 2e+01 149: set presolve.componentsmaxint = -1 149: set presolve.detectlindep = 0 149: set doubletoneq.enabled = 0 149: set dualinfer.enabled = 0 149: set substitution.enabled = 0 149: set sparsify.enabled = 0 149: 149: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr7.mps with dual-postsolve activated 149: rows: 129 149: columns: 140 149: int. columns: 0 149: cont. columns: 140 149: nonzeros: 420 149: 149: round 0 ( Trivial ): 1 del cols, 34 del rows, 35 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 149: round 1 ( Fast ): 1 del cols, 34 del rows, 66 chg bounds, 0 chg sides, 0 chg coeffs, 62 tsx applied, 0 tsx conflicts 149: round 2 ( Fast ): 1 del cols, 34 del rows, 105 chg bounds, 0 chg sides, 0 chg coeffs, 158 tsx applied, 0 tsx conflicts 149: round 3 ( Fast ): 1 del cols, 34 del rows, 133 chg bounds, 0 chg sides, 0 chg coeffs, 234 tsx applied, 0 tsx conflicts 149: round 4 ( Medium ): 40 del cols, 39 del rows, 146 chg bounds, 38 chg sides, 38 chg coeffs, 291 tsx applied, 125 tsx conflicts 149: round 5 ( Medium ): 41 del cols, 40 del rows, 147 chg bounds, 38 chg sides, 38 chg coeffs, 296 tsx applied, 125 tsx conflicts 149: round 6 (Exhaustive): 41 del cols, 40 del rows, 148 chg bounds, 38 chg sides, 38 chg coeffs, 297 tsx applied, 125 tsx conflicts 149: round 7 ( Final ): 41 del cols, 40 del rows, 148 chg bounds, 38 chg sides, 38 chg coeffs, 297 tsx applied, 125 tsx conflicts 149: presolved 7 rounds: 41 del cols, 40 del rows, 148 chg bounds, 38 chg sides, 38 chg coeffs, 297 tsx applied, 125 tsx conflicts 149: 149: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 149: colsingleton 7 0.0 0 0.0 0.000 149: coefftightening 0 0.0 0 0.0 0.000 149: propagation 7 57.1 252 100.0 0.022 149: fixcontinuous 2 0.0 0 0.0 0.000 149: simpleprobing 0 0.0 0 0.0 0.000 149: parallelrows 2 0.0 0 0.0 0.002 149: parallelcols 2 0.0 0 0.0 0.003 149: stuffing 3 66.7 169 26.0 0.005 149: dualfix 3 33.3 1 100.0 0.000 149: simplifyineq 0 0.0 0 0.0 0.000 149: doubletoneq 0 0.0 0 0.0 0.000 149: implint 0 0.0 0 0.0 0.000 149: domcol 1 0.0 0 0.0 0.010 149: dualinfer 0 0.0 0 0.0 0.000 150: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 150: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 150: 150: External libraries: 150: Boost 1.83.0 (https://www.boost.org/) 150: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 150: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 150: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 150: 150: reading took 0.0245 seconds 150: Numerical Statistics: 150: Matrix range [2e-01,9e+00] 150: Objective range [4e-01,7e+02] 150: Bounds range [0e+00,0e+00] 150: RHS range [9e+01,7e+03] 150: Dynamism Variables: 2e+01 150: Dynamism Rows : 2e+01 150: set presolve.componentsmaxint = -1 150: set presolve.detectlindep = 0 150: set doubletoneq.enabled = 0 150: set dualinfer.enabled = 0 150: set substitution.enabled = 0 150: set sparsify.enabled = 0 150: 150: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr25.mps with dual-postsolve activated 150: rows: 471 150: columns: 500 150: int. columns: 0 150: cont. columns: 500 150: nonzeros: 1554 150: 150: round 0 ( Trivial ): 1 del cols, 124 del rows, 125 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 150: round 1 ( Fast ): 1 del cols, 124 del rows, 210 chg bounds, 0 chg sides, 0 chg coeffs, 170 tsx applied, 0 tsx conflicts 150: round 2 ( Fast ): 1 del cols, 124 del rows, 357 chg bounds, 0 chg sides, 0 chg coeffs, 518 tsx applied, 0 tsx conflicts 150: round 3 ( Fast ): 1 del cols, 124 del rows, 457 chg bounds, 0 chg sides, 0 chg coeffs, 810 tsx applied, 0 tsx conflicts 150: round 4 ( Medium ): 130 del cols, 129 del rows, 506 chg bounds, 128 chg sides, 128 chg coeffs, 1029 tsx applied, 395 tsx conflicts 150: round 5 (Exhaustive): 131 del cols, 130 del rows, 507 chg bounds, 128 chg sides, 128 chg coeffs, 1034 tsx applied, 395 tsx conflicts 150: round 6 ( Final ): 131 del cols, 130 del rows, 508 chg bounds, 128 chg sides, 128 chg coeffs, 1035 tsx applied, 395 tsx conflicts 150: presolved 6 rounds: 131 del cols, 130 del rows, 508 chg bounds, 128 chg sides, 128 chg coeffs, 1035 tsx applied, 395 tsx conflicts 150: 150: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 150: colsingleton 6 0.0 0 0.0 0.000 150: coefftightening 0 0.0 0 0.0 0.000 150: propagation 6 66.7 900 100.0 0.001 150: fixcontinuous 2 0.0 0 0.0 0.000 150: simpleprobing 0 0.0 0 0.0 0.000 150: parallelrows 1 0.0 0 0.0 0.000 150: parallelcols 1 0.0 0 0.0 0.000 150: stuffing 3 66.7 529 25.3 0.000 150: dualfix 2 50.0 1 100.0 0.000 150: simplifyineq 0 0.0 0 0.0 0.000 150: doubletoneq 0 0.0 0 0.0 0.000 150: implint 0 0.0 0 0.0 0.000 150: domcol 1 0.0 0 0.0 0.000 150: dualinfer 0 0.0 0 0.0 0.000 150: probing 0 0.0 0 0.0 0.000 150: substitution 0 0.0 0 0.0 0.000 150: sparsify 0 0.0 0 0.0 0.000 150: 150: reduced problem: 150: reduced rows: 341 150: reduced columns: 369 150: reduced int. columns: 0 150: reduced cont. columns: 369 150: reduced nonzeros: 1287 150: 150: presolving finished after 0.031 seconds 150: 150: Equilibrium scaling LP (persistent) 149: probing 0 0.0 0 0.0 0.000 149: substitution 0 0.0 0 0.0 0.000 149: sparsify 0 0.0 0 0.0 0.000 149: 149: reduced problem: 149: reduced rows: 89 149: reduced columns: 99 149: reduced int. columns: 0 149: reduced cont. columns: 99 149: reduced nonzeros: 333 149: 149: presolving finished after 0.104 seconds 149: 149: Equilibrium scaling LP (persistent) 148: 148: SoPlex status : problem is solved [optimal] 148: Solving time (sec) : 0.02 148: Iterations : 119 148: Objective value : -2.33138982e+06 148: 148: Solution passed validation 148: 148: postsolve finished after 0.022 seconds 148: feasible: true 148: objective value: -2331389.82433098 148: 148: violations: 148: bounds: 0 148: constraints: 0 148: integrality: 0 148: 148: validation: SUCCESS 148: Solving time 0.105 seconds 148: 148: solving finished after 0.105 seconds 148/287 Test #148: q-solve-scagr7.mps-lp_presolvers_with_basis.set ............................................ Passed 0.19 sec test 152 Start 152: r-solve-scagr25.mps-lp_presolvers_with_basis.set 152: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr25.mps" "-o" "-0.14753433060768523167790925075974e8" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 152: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 152: Test timeout computed to be: 10000000 149: Simplifier removed 22 rows, 22 columns, 72 nonzeros, 23 col bounds, 62 row bounds 149: Reduced LP has 67 rows 77 columns 261 nonzeros 149: Equilibrium scaling LP 149: type | time | iters | facts | shift | viol sum | viol num | obj value 149: L | 0.0 | 0 | 3 | 3.00e+00 | 1.71e+05 | 44 | -4.44039449e+07 149: E | 0.0 | 117 | 5 | 0.00e+00 | 1.32e-01 | 1 | -2.33112823e+06 149: E | 0.0 | 119 | 6 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 149: --- unscaling internal solution 149: --- unsimplifying solution and basis 149: --- unscaling external solution 149: --- verifying computed solution 149: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 149: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 149: --- unscaling external solution 149: --- verifying computed solution 150: Simplifier removed 76 rows, 76 columns, 252 nonzeros, 77 col bounds, 224 row bounds 150: Reduced LP has 265 rows 293 columns 1035 nonzeros 150: Equilibrium scaling LP 150: type | time | iters | facts | shift | viol sum | viol num | obj value 150: L | 0.0 | 0 | 3 | 3.00e+00 | 6.46e+05 | 170 | -1.64720394e+08 149: 149: SoPlex status : problem is solved [optimal] 149: Solving time (sec) : 0.00 149: Iterations : 119 149: Objective value : -2.33138982e+06 149: 149: Solution passed validation 149: 149: postsolve finished after 0.018 seconds 149: feasible: true 149: objective value: -2331389.82433098 149: 149: violations: 149: bounds: 0 149: constraints: 0 149: integrality: 0 149: 149: validation: SUCCESS 149: Solving time 0.151 seconds 149: 149: solving finished after 0.151 seconds 149/287 Test #149: r-solve-scagr7.mps-lp_presolvers_with_basis.set ............................................ Passed 0.22 sec test 153 Start 153: d-solve-scfxm1.mps-lp_presolvers_with_basis.set 153: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scfxm1.mps" "-o" "0.18416759028348943683579089143655e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 153: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 153: Test timeout computed to be: 10000000 150: L | 0.0 | 199 | 4 | 3.00e+00 | 8.57e+05 | 140 | -4.52480059e+07 151: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 151: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 151: 151: External libraries: 151: Boost 1.83.0 (https://www.boost.org/) 151: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 151: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 151: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 151: 151: reading took 0.0356 seconds 151: Numerical Statistics: 151: Matrix range [2e-01,9e+00] 151: Objective range [4e-01,7e+02] 151: Bounds range [0e+00,0e+00] 151: RHS range [9e+01,7e+03] 151: Dynamism Variables: 2e+01 151: Dynamism Rows : 2e+01 151: set presolve.componentsmaxint = -1 151: set presolve.detectlindep = 0 151: set doubletoneq.enabled = 0 151: set dualinfer.enabled = 0 151: set substitution.enabled = 0 151: set sparsify.enabled = 0 151: 151: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr25.mps with dual-postsolve activated 151: rows: 471 151: columns: 500 151: int. columns: 0 151: cont. columns: 500 151: nonzeros: 1554 151: 151: round 0 ( Trivial ): 1 del cols, 124 del rows, 125 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 151: round 1 ( Fast ): 1 del cols, 124 del rows, 210 chg bounds, 0 chg sides, 0 chg coeffs, 170 tsx applied, 0 tsx conflicts 151: round 2 ( Fast ): 1 del cols, 124 del rows, 357 chg bounds, 0 chg sides, 0 chg coeffs, 518 tsx applied, 0 tsx conflicts 151: round 3 ( Fast ): 1 del cols, 124 del rows, 457 chg bounds, 0 chg sides, 0 chg coeffs, 810 tsx applied, 0 tsx conflicts 151: round 4 ( Medium ): 130 del cols, 129 del rows, 506 chg bounds, 128 chg sides, 128 chg coeffs, 1029 tsx applied, 395 tsx conflicts 151: round 5 (Exhaustive): 131 del cols, 130 del rows, 507 chg bounds, 128 chg sides, 128 chg coeffs, 1034 tsx applied, 395 tsx conflicts 151: round 6 ( Final ): 131 del cols, 130 del rows, 508 chg bounds, 128 chg sides, 128 chg coeffs, 1035 tsx applied, 395 tsx conflicts 151: presolved 6 rounds: 131 del cols, 130 del rows, 508 chg bounds, 128 chg sides, 128 chg coeffs, 1035 tsx applied, 395 tsx conflicts 151: 151: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 151: colsingleton 6 0.0 0 0.0 0.000 151: coefftightening 0 0.0 0 0.0 0.000 151: propagation 6 66.7 900 100.0 0.016 151: fixcontinuous 2 0.0 0 0.0 0.000 151: simpleprobing 0 0.0 0 0.0 0.000 151: parallelrows 1 0.0 0 0.0 0.001 151: parallelcols 1 0.0 0 0.0 0.001 151: stuffing 3 66.7 529 25.3 0.008 151: dualfix 2 50.0 1 100.0 0.000 151: simplifyineq 0 0.0 0 0.0 0.000 151: doubletoneq 0 0.0 0 0.0 0.000 151: implint 0 0.0 0 0.0 0.000 151: domcol 1 0.0 0 0.0 0.007 151: dualinfer 0 0.0 0 0.0 0.000 151: probing 0 0.0 0 0.0 0.000 151: substitution 0 0.0 0 0.0 0.000 151: sparsify 0 0.0 0 0.0 0.000 151: 151: reduced problem: 151: reduced rows: 341 151: reduced columns: 369 151: reduced int. columns: 0 151: reduced cont. columns: 369 151: reduced nonzeros: 1287 151: 151: presolving finished after 0.091 seconds 151: 151: Equilibrium scaling LP (persistent) 151: Simplifier removed 76 rows, 76 columns, 252 nonzeros, 77 col bounds, 224 row bounds 151: Reduced LP has 265 rows 293 columns 1035 nonzeros 151: Equilibrium scaling LP 151: type | time | iters | facts | shift | viol sum | viol num | obj value 151: L | 0.0 | 0 | 3 | 3.00e+00 | 6.46e+05 | 170 | -1.64720394e+08 151: L | 0.0 | 199 | 4 | 3.00e+00 | 8.57e+05 | 140 | -4.52480059e+07 150: L | 0.0 | 399 | 6 | 3.00e+00 | 7.27e+05 | 78 | -1.95685480e+07 151: L | 0.0 | 399 | 6 | 3.00e+00 | 1.95e+05 | 69 | -1.99009210e+07 151: E | 0.0 | 519 | 8 | 0.00e+00 | 1.32e-01 | 1 | -1.47531344e+07 151: E | 0.0 | 520 | 9 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 151: --- unscaling internal solution 151: --- unsimplifying solution and basis 151: --- unscaling external solution 151: --- verifying computed solution 151: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 151: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 151: --- unscaling external solution 151: --- verifying computed solution 150: E | 0.0 | 579 | 8 | 0.00e+00 | 1.32e-01 | 1 | -1.47531344e+07 150: E | 0.0 | 580 | 9 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 150: --- unscaling internal solution 150: --- unsimplifying solution and basis 150: --- unscaling external solution 150: --- verifying computed solution 150: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 150: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 150: --- unscaling external solution 150: --- verifying computed solution 150: 150: SoPlex status : problem is solved [optimal] 150: Solving time (sec) : 0.06 150: Iterations : 580 150: Objective value : -1.47534331e+07 150: 150: Solution passed validation 150: 150: postsolve finished after 0.001 seconds 150: feasible: true 150: objective value: -14753433.0607685 150: 150: violations: 150: bounds: 0 150: constraints: 0 150: integrality: 0 150: 150: validation: SUCCESS 150: Solving time 0.170 seconds 150: 150: solving finished after 0.170 seconds 150/287 Test #150: d-solve-scagr25.mps-lp_presolvers_with_basis.set ........................................... Passed 0.25 sec test 154 Start 154: q-solve-scfxm1.mps-lp_presolvers_with_basis.set 154: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scfxm1.mps" "-o" "0.18416759028348943683579089143655e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 154: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 154: Test timeout computed to be: 10000000 151: 151: SoPlex status : problem is solved [optimal] 151: Solving time (sec) : 0.04 151: Iterations : 520 151: Objective value : -1.47534331e+07 151: 151: Solution passed validation 151: 151: postsolve finished after 0.022 seconds 151: feasible: true 151: objective value: -14753433.0607685 151: 151: violations: 151: bounds: 0 151: constraints: 0 151: integrality: 0 151: 151: validation: SUCCESS 151: Solving time 0.173 seconds 151: 151: solving finished after 0.173 seconds 151/287 Test #151: q-solve-scagr25.mps-lp_presolvers_with_basis.set ........................................... Passed 0.25 sec test 155 Start 155: r-solve-scfxm1.mps-lp_presolvers_with_basis.set 155: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scfxm1.mps" "-o" "0.18416759028348943683579089143655e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 155: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 155: Test timeout computed to be: 10000000 153: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 153: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 153: 153: External libraries: 153: Boost 1.83.0 (https://www.boost.org/) 153: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 153: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 153: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 153: 153: reading took 0.0514 seconds 153: Numerical Statistics: 153: Matrix range [5e-04,1e+02] 153: Objective range [1e+00,1e+01] 153: Bounds range [0e+00,0e+00] 153: RHS range [8e-01,2e+03] 153: Dynamism Variables: 1e+05 153: Dynamism Rows : 9e+03 153: set presolve.componentsmaxint = -1 153: set presolve.detectlindep = 0 153: set doubletoneq.enabled = 0 153: set dualinfer.enabled = 0 153: set substitution.enabled = 0 153: set sparsify.enabled = 0 153: 153: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scfxm1.mps with dual-postsolve activated 153: rows: 330 153: columns: 457 153: int. columns: 0 153: cont. columns: 457 153: nonzeros: 2589 153: 153: round 0 ( Trivial ): 9 del cols, 43 del rows, 48 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 153: round 1 ( Fast ): 18 del cols, 48 del rows, 324 chg bounds, 0 chg sides, 0 chg coeffs, 626 tsx applied, 0 tsx conflicts 153: round 2 ( Fast ): 18 del cols, 48 del rows, 433 chg bounds, 0 chg sides, 0 chg coeffs, 884 tsx applied, 0 tsx conflicts 153: round 3 ( Medium ): 53 del cols, 56 del rows, 465 chg bounds, 23 chg sides, 23 chg coeffs, 991 tsx applied, 63 tsx conflicts 153: round 4 ( Medium ): 58 del cols, 58 del rows, 485 chg bounds, 28 chg sides, 25 chg coeffs, 1036 tsx applied, 67 tsx conflicts 153: round 5 (Exhaustive): 58 del cols, 58 del rows, 500 chg bounds, 28 chg sides, 25 chg coeffs, 1066 tsx applied, 67 tsx conflicts 153: round 6 ( Final ): 58 del cols, 58 del rows, 502 chg bounds, 28 chg sides, 25 chg coeffs, 1074 tsx applied, 67 tsx conflicts 153: presolved 6 rounds: 58 del cols, 58 del rows, 502 chg bounds, 28 chg sides, 25 chg coeffs, 1074 tsx applied, 67 tsx conflicts 153: 153: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 153: colsingleton 6 0.0 0 0.0 0.000 153: coefftightening 0 0.0 0 0.0 0.000 153: propagation 6 100.0 1026 100.0 0.001 153: fixcontinuous 2 0.0 0 0.0 0.000 153: simpleprobing 0 0.0 0 0.0 0.000 153: parallelrows 2 0.0 0 0.0 0.001 153: parallelcols 2 50.0 4 100.0 0.001 153: stuffing 3 66.7 101 34.7 0.000 153: dualfix 3 66.7 10 90.0 0.000 153: simplifyineq 0 0.0 0 0.0 0.000 153: doubletoneq 0 0.0 0 0.0 0.000 153: implint 0 0.0 0 0.0 0.000 153: domcol 1 0.0 0 0.0 0.000 153: dualinfer 0 0.0 0 0.0 0.000 153: probing 0 0.0 0 0.0 0.000 153: substitution 0 0.0 0 0.0 0.000 153: sparsify 0 0.0 0 0.0 0.000 153: 153: reduced problem: 153: reduced rows: 272 153: reduced columns: 399 153: reduced int. columns: 0 153: reduced cont. columns: 399 153: reduced nonzeros: 2247 153: 153: presolving finished after 0.038 seconds 153: 153: Equilibrium scaling LP (persistent) 153: Simplifier removed 11 rows, 11 columns, 27 nonzeros, 13 col bounds, 44 row bounds 153: Reduced LP has 261 rows 388 columns 2220 nonzeros 153: Equilibrium scaling LP 153: type | time | iters | facts | shift | viol sum | viol num | obj value 153: L | 0.0 | 0 | 3 | 1.44e+00 | 1.96e+04 | 120 | -7.17176280e+03 154: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 154: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 154: 154: External libraries: 154: Boost 1.83.0 (https://www.boost.org/) 154: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 154: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 154: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 154: 154: reading took 0.0208 seconds 154: Numerical Statistics: 154: Matrix range [5e-04,1e+02] 154: Objective range [1e+00,1e+01] 154: Bounds range [0e+00,0e+00] 154: RHS range [8e-01,2e+03] 154: Dynamism Variables: 1e+05 154: Dynamism Rows : 9e+03 154: set presolve.componentsmaxint = -1 154: set presolve.detectlindep = 0 154: set doubletoneq.enabled = 0 154: set dualinfer.enabled = 0 154: set substitution.enabled = 0 154: set sparsify.enabled = 0 154: 154: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scfxm1.mps with dual-postsolve activated 154: rows: 330 154: columns: 457 154: int. columns: 0 154: cont. columns: 457 154: nonzeros: 2589 154: 154: round 0 ( Trivial ): 9 del cols, 43 del rows, 48 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 154: round 1 ( Fast ): 18 del cols, 48 del rows, 324 chg bounds, 0 chg sides, 0 chg coeffs, 626 tsx applied, 0 tsx conflicts 154: round 2 ( Fast ): 18 del cols, 48 del rows, 433 chg bounds, 0 chg sides, 0 chg coeffs, 884 tsx applied, 0 tsx conflicts 154: round 3 ( Medium ): 53 del cols, 56 del rows, 465 chg bounds, 23 chg sides, 23 chg coeffs, 991 tsx applied, 63 tsx conflicts 154: round 4 ( Medium ): 58 del cols, 58 del rows, 485 chg bounds, 28 chg sides, 25 chg coeffs, 1036 tsx applied, 67 tsx conflicts 154: round 5 (Exhaustive): 58 del cols, 58 del rows, 500 chg bounds, 28 chg sides, 25 chg coeffs, 1066 tsx applied, 67 tsx conflicts 154: round 6 ( Final ): 58 del cols, 58 del rows, 502 chg bounds, 28 chg sides, 25 chg coeffs, 1074 tsx applied, 67 tsx conflicts 154: presolved 6 rounds: 58 del cols, 58 del rows, 502 chg bounds, 28 chg sides, 25 chg coeffs, 1074 tsx applied, 67 tsx conflicts 154: 154: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 154: colsingleton 6 0.0 0 0.0 0.000 154: coefftightening 0 0.0 0 0.0 0.000 154: propagation 6 100.0 1026 100.0 0.014 154: fixcontinuous 2 0.0 0 0.0 0.000 154: simpleprobing 0 0.0 0 0.0 0.000 154: parallelrows 2 0.0 0 0.0 0.002 154: parallelcols 2 50.0 4 100.0 0.002 154: stuffing 3 66.7 101 34.7 0.001 154: dualfix 3 66.7 10 90.0 0.001 154: simplifyineq 0 0.0 0 0.0 0.000 154: doubletoneq 0 0.0 0 0.0 0.000 154: implint 0 0.0 0 0.0 0.000 154: domcol 1 0.0 0 0.0 0.009 154: dualinfer 0 0.0 0 0.0 0.000 154: probing 0 0.0 0 0.0 0.000 153: L | 0.0 | 199 | 4 | 1.44e+00 | 1.87e+04 | 119 | 8.71123358e+03 154: substitution 0 0.0 0 0.0 0.000 154: sparsify 0 0.0 0 0.0 0.000 154: 154: reduced problem: 154: reduced rows: 272 154: reduced columns: 399 154: reduced int. columns: 0 154: reduced cont. columns: 399 154: reduced nonzeros: 2247 154: 154: presolving finished after 0.100 seconds 154: 154: Equilibrium scaling LP (persistent) 154: Simplifier removed 11 rows, 11 columns, 27 nonzeros, 13 col bounds, 44 row bounds 154: Reduced LP has 261 rows 388 columns 2220 nonzeros 154: Equilibrium scaling LP 154: type | time | iters | facts | shift | viol sum | viol num | obj value 154: L | 0.0 | 0 | 3 | 1.44e+00 | 1.96e+04 | 120 | -7.17176280e+03 154: L | 0.0 | 199 | 3 | 1.44e+00 | 1.86e+04 | 120 | 8.71520603e+03 153: L | 0.0 | 399 | 5 | 1.44e+00 | 4.21e+04 | 88 | 1.69679426e+04 153: E | 0.0 | 553 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 153: E | 0.0 | 553 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 153: --- unscaling internal solution 153: --- unsimplifying solution and basis 153: --- unscaling external solution 153: --- verifying computed solution 154: L | 0.0 | 399 | 5 | 1.44e+00 | 9.94e+02 | 82 | 1.73730877e+04 153: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 153: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 153: --- unscaling external solution 153: --- verifying computed solution 153: 153: SoPlex status : problem is solved [optimal] 153: Solving time (sec) : 0.04 153: Iterations : 553 153: Objective value : 1.84167590e+04 153: 153: Solution passed validation 153: 153: postsolve finished after 0.001 seconds 153: feasible: true 153: objective value: 18416.7590283489 153: 153: violations: 153: bounds: 2.70006239588838e-14 153: constraints: 0 153: integrality: 0 153: 153: validation: SUCCESS 153: Solving time 0.204 seconds 153: 153: solving finished after 0.204 seconds 152/287 Test #153: d-solve-scfxm1.mps-lp_presolvers_with_basis.set ............................................ Passed 0.34 sec test 156 Start 156: d-solve-scorpion.mps-lp_presolvers_with_basis.set 156: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scorpion.mps" "-o" "0.18781248227381066296479411763586e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 156: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 156: Test timeout computed to be: 10000000 154: E | 0.0 | 561 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 154: E | 0.0 | 561 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 154: --- unscaling internal solution 154: --- unsimplifying solution and basis 154: --- unscaling external solution 154: --- verifying computed solution 154: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 154: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 154: --- unscaling external solution 154: --- verifying computed solution 152: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 152: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 152: 152: External libraries: 152: Boost 1.83.0 (https://www.boost.org/) 152: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 152: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 152: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 152: 152: reading took 0.0918 seconds 152: Numerical Statistics: 152: Matrix range [2e-01,9e+00] 152: Objective range [4e-01,7e+02] 152: Bounds range [0e+00,0e+00] 152: RHS range [9e+01,7e+03] 152: Dynamism Variables: 2e+01 152: Dynamism Rows : 2e+01 152: set presolve.componentsmaxint = -1 152: set presolve.detectlindep = 0 152: set doubletoneq.enabled = 0 152: set dualinfer.enabled = 0 152: set substitution.enabled = 0 152: set sparsify.enabled = 0 152: 152: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr25.mps with dual-postsolve activated 152: rows: 471 152: columns: 500 152: int. columns: 0 152: cont. columns: 500 152: nonzeros: 1554 152: 152: round 0 ( Trivial ): 1 del cols, 124 del rows, 125 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 152: round 1 ( Fast ): 1 del cols, 124 del rows, 210 chg bounds, 0 chg sides, 0 chg coeffs, 170 tsx applied, 0 tsx conflicts 152: round 2 ( Fast ): 1 del cols, 124 del rows, 357 chg bounds, 0 chg sides, 0 chg coeffs, 518 tsx applied, 0 tsx conflicts 152: round 3 ( Fast ): 1 del cols, 124 del rows, 457 chg bounds, 0 chg sides, 0 chg coeffs, 810 tsx applied, 0 tsx conflicts 152: round 4 ( Medium ): 130 del cols, 129 del rows, 506 chg bounds, 128 chg sides, 128 chg coeffs, 1029 tsx applied, 395 tsx conflicts 152: round 5 (Exhaustive): 131 del cols, 130 del rows, 507 chg bounds, 128 chg sides, 128 chg coeffs, 1034 tsx applied, 395 tsx conflicts 152: round 6 ( Final ): 131 del cols, 130 del rows, 508 chg bounds, 128 chg sides, 128 chg coeffs, 1035 tsx applied, 395 tsx conflicts 152: presolved 6 rounds: 131 del cols, 130 del rows, 508 chg bounds, 128 chg sides, 128 chg coeffs, 1035 tsx applied, 395 tsx conflicts 152: 152: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 152: colsingleton 6 0.0 0 0.0 0.000 152: coefftightening 0 0.0 0 0.0 0.000 152: propagation 6 66.7 900 100.0 0.062 152: fixcontinuous 2 0.0 0 0.0 0.001 152: simpleprobing 0 0.0 0 0.0 0.000 152: parallelrows 1 0.0 0 0.0 0.010 152: parallelcols 1 0.0 0 0.0 0.009 152: stuffing 3 66.7 529 25.3 0.026 152: dualfix 2 50.0 1 100.0 0.001 152: simplifyineq 0 0.0 0 0.0 0.000 152: doubletoneq 0 0.0 0 0.0 0.000 152: implint 0 0.0 0 0.0 0.000 152: domcol 1 0.0 0 0.0 0.008 152: dualinfer 0 0.0 0 0.0 0.000 152: probing 0 0.0 0 0.0 0.000 152: substitution 0 0.0 0 0.0 0.000 152: sparsify 0 0.0 0 0.0 0.000 152: 152: reduced problem: 152: reduced rows: 341 152: reduced columns: 369 152: reduced int. columns: 0 152: reduced cont. columns: 369 152: reduced nonzeros: 1287 152: 152: presolving finished after 0.253 seconds 152: 152: Equilibrium scaling LP (persistent) 152: Simplifier removed 76 rows, 76 columns, 252 nonzeros, 77 col bounds, 224 row bounds 152: Reduced LP has 265 rows 293 columns 1035 nonzeros 152: Equilibrium scaling LP 152: type | time | iters | facts | shift | viol sum | viol num | obj value 152: L | 0.0 | 0 | 3 | 3.00e+00 | 6.46e+05 | 170 | -1.64720394e+08 152: L | 0.0 | 199 | 4 | 3.00e+00 | 8.57e+05 | 140 | -4.52480059e+07 152: L | 0.0 | 399 | 6 | 3.00e+00 | 7.27e+05 | 78 | -1.95685480e+07 156: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 156: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 156: 156: External libraries: 156: Boost 1.83.0 (https://www.boost.org/) 156: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 156: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 156: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 156: 156: reading took 0.0264 seconds 156: Numerical Statistics: 156: Matrix range [1e-02,1e+00] 156: Objective range [6e-02,2e+02] 156: Bounds range [0e+00,0e+00] 156: RHS range [2e-03,1e+00] 156: Dynamism Variables: 1e+02 156: Dynamism Rows : 1e+02 156: set presolve.componentsmaxint = -1 156: set presolve.detectlindep = 0 156: set doubletoneq.enabled = 0 156: set dualinfer.enabled = 0 156: set substitution.enabled = 0 156: set sparsify.enabled = 0 156: 156: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scorpion.mps with dual-postsolve activated 156: rows: 388 156: columns: 358 156: int. columns: 0 156: cont. columns: 358 156: nonzeros: 1426 156: 156: round 0 ( Trivial ): 23 del cols, 91 del rows, 84 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 156: round 1 ( Fast ): 27 del cols, 96 del rows, 108 chg bounds, 0 chg sides, 0 chg coeffs, 48 tsx applied, 0 tsx conflicts 156: round 2 ( Medium ): 84 del cols, 135 del rows, 137 chg bounds, 103 chg sides, 53 chg coeffs, 111 tsx applied, 69 tsx conflicts 156: round 3 ( Medium ): 111 del cols, 138 del rows, 155 chg bounds, 115 chg sides, 59 chg coeffs, 162 tsx applied, 102 tsx conflicts 156: round 4 ( Medium ): 135 del cols, 150 del rows, 185 chg bounds, 127 chg sides, 65 chg coeffs, 228 tsx applied, 102 tsx conflicts 156: round 5 ( Medium ): 141 del cols, 156 del rows, 191 chg bounds, 139 chg sides, 71 chg coeffs, 234 tsx applied, 102 tsx conflicts 156: round 6 (Exhaustive): 141 del cols, 156 del rows, 191 chg bounds, 139 chg sides, 71 chg coeffs, 234 tsx applied, 102 tsx conflicts 156: round 7 ( Final ): Unchanged 156: presolved 7 rounds: 141 del cols, 156 del rows, 191 chg bounds, 139 chg sides, 71 chg coeffs, 234 tsx applied, 102 tsx conflicts 156: 156: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 156: colsingleton 7 0.0 0 0.0 0.000 156: coefftightening 0 0.0 0 0.0 0.000 156: propagation 7 14.3 48 100.0 0.000 156: fixcontinuous 3 0.0 0 0.0 0.000 156: simpleprobing 0 0.0 0 0.0 0.000 156: parallelrows 2 50.0 6 100.0 0.000 156: parallelcols 2 0.0 0 0.0 0.000 156: stuffing 5 80.0 264 61.4 0.000 156: dualfix 4 25.0 18 100.0 0.000 156: simplifyineq 0 0.0 0 0.0 0.000 156: doubletoneq 0 0.0 0 0.0 0.000 156: implint 0 0.0 0 0.0 0.000 156: domcol 1 0.0 0 0.0 0.000 156: dualinfer 0 0.0 0 0.0 0.000 156: probing 0 0.0 0 0.0 0.000 156: substitution 0 0.0 0 0.0 0.000 156: sparsify 0 0.0 0 0.0 0.000 156: 156: reduced problem: 156: reduced rows: 232 156: reduced columns: 217 156: reduced int. columns: 0 156: reduced cont. columns: 217 156: reduced nonzeros: 1036 156: 156: presolving finished after 0.015 seconds 156: 156: Equilibrium scaling LP (persistent) 155: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 155: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 155: 155: External libraries: 155: Boost 1.83.0 (https://www.boost.org/) 155: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 155: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 155: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 155: 155: reading took 0.0407 seconds 155: Numerical Statistics: 155: Matrix range [5e-04,1e+02] 155: Objective range [1e+00,1e+01] 155: Bounds range [0e+00,0e+00] 155: RHS range [8e-01,2e+03] 155: Dynamism Variables: 1e+05 155: Dynamism Rows : 9e+03 155: set presolve.componentsmaxint = -1 155: set presolve.detectlindep = 0 155: set doubletoneq.enabled = 0 155: set dualinfer.enabled = 0 155: set substitution.enabled = 0 155: set sparsify.enabled = 0 155: 155: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scfxm1.mps with dual-postsolve activated 155: rows: 330 155: columns: 457 155: int. columns: 0 155: cont. columns: 457 155: nonzeros: 2589 155: 155: round 0 ( Trivial ): 9 del cols, 43 del rows, 48 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 155: round 1 ( Fast ): 18 del cols, 48 del rows, 324 chg bounds, 0 chg sides, 0 chg coeffs, 626 tsx applied, 0 tsx conflicts 155: round 2 ( Fast ): 18 del cols, 48 del rows, 433 chg bounds, 0 chg sides, 0 chg coeffs, 884 tsx applied, 0 tsx conflicts 155: round 3 ( Medium ): 53 del cols, 56 del rows, 465 chg bounds, 23 chg sides, 23 chg coeffs, 991 tsx applied, 63 tsx conflicts 155: round 4 ( Medium ): 58 del cols, 58 del rows, 485 chg bounds, 28 chg sides, 25 chg coeffs, 1036 tsx applied, 67 tsx conflicts 155: round 5 (Exhaustive): 58 del cols, 58 del rows, 500 chg bounds, 28 chg sides, 25 chg coeffs, 1066 tsx applied, 67 tsx conflicts 155: round 6 ( Final ): 58 del cols, 58 del rows, 502 chg bounds, 28 chg sides, 25 chg coeffs, 1074 tsx applied, 67 tsx conflicts 155: presolved 6 rounds: 58 del cols, 58 del rows, 502 chg bounds, 28 chg sides, 25 chg coeffs, 1074 tsx applied, 67 tsx conflicts 155: 155: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 155: colsingleton 6 0.0 0 0.0 0.000 155: coefftightening 0 0.0 0 0.0 0.000 155: propagation 6 100.0 1026 100.0 0.048 155: fixcontinuous 2 0.0 0 0.0 0.001 155: simpleprobing 0 0.0 0 0.0 0.000 155: parallelrows 2 0.0 0 0.0 0.023 155: parallelcols 2 50.0 4 100.0 0.027 155: stuffing 3 66.7 101 34.7 0.002 155: dualfix 3 66.7 10 90.0 0.002 155: simplifyineq 0 0.0 0 0.0 0.000 155: doubletoneq 0 0.0 0 0.0 0.000 155: implint 0 0.0 0 0.0 0.000 155: domcol 1 0.0 0 0.0 0.018 155: dualinfer 0 0.0 0 0.0 0.000 155: probing 0 0.0 0 0.0 0.000 156: Simplifier removed 26 rows, 26 columns, 58 nonzeros, 0 col bounds, 58 row bounds 152: E | 0.0 | 579 | 8 | 0.00e+00 | 1.32e-01 | 1 | -1.47531344e+07 152: E | 0.0 | 580 | 9 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 152: --- unscaling internal solution 152: --- unsimplifying solution and basis 152: --- unscaling external solution 152: --- verifying computed solution 152: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 152: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 152: --- unscaling external solution 152: --- verifying computed solution 156: Reduced LP has 206 rows 191 columns 978 nonzeros 156: Equilibrium scaling LP 156: type | time | iters | facts | shift | viol sum | viol num | obj value 156: L | 0.0 | 0 | 3 | 0.00e+00 | 9.89e+00 | 24 | 1.54181186e+02 155: substitution 0 0.0 0 0.0 0.000 155: sparsify 0 0.0 0 0.0 0.000 155: 155: reduced problem: 155: reduced rows: 272 155: reduced columns: 399 155: reduced int. columns: 0 155: reduced cont. columns: 399 155: reduced nonzeros: 2247 155: 155: presolving finished after 0.318 seconds 155: 155: Equilibrium scaling LP (persistent) 154: 154: SoPlex status : problem is solved [optimal] 154: Solving time (sec) : 0.04 154: Iterations : 561 154: Objective value : 1.84167590e+04 154: 154: Solution passed validation 154: 154: postsolve finished after 0.076 seconds 154: feasible: true 154: objective value: 18416.7590283489 154: 154: violations: 154: bounds: 0 154: constraints: 0 154: integrality: 0 154: 154: validation: SUCCESS 154: Solving time 0.335 seconds 154: 154: solving finished after 0.335 seconds 156: L | 0.0 | 199 | 4 | 0.00e+00 | 3.45e-02 | 53 | 1.87639919e+03 153/287 Test #154: q-solve-scfxm1.mps-lp_presolvers_with_basis.set ............................................ Passed 0.44 sec test 157 Start 157: q-solve-scorpion.mps-lp_presolvers_with_basis.set 157: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scorpion.mps" "-o" "0.18781248227381066296479411763586e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 157: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 157: Test timeout computed to be: 10000000 156: L | 0.0 | 206 | 6 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 156: --- unscaling internal solution 156: --- unsimplifying solution and basis 156: --- unscaling external solution 156: --- verifying computed solution 156: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 156: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 156: --- unscaling external solution 156: --- verifying computed solution 156: 156: SoPlex status : problem is solved [optimal] 156: Solving time (sec) : 0.02 156: Iterations : 206 156: Objective value : 1.87812482e+03 156: 156: Solution passed validation 156: 156: postsolve finished after 0.001 seconds 156: feasible: true 156: objective value: 1878.12482273811 156: 156: violations: 156: bounds: 0 156: constraints: 0 156: integrality: 0 156: 156: validation: SUCCESS 156: Solving time 0.068 seconds 156: 156: solving finished after 0.068 seconds 155: Simplifier removed 11 rows, 11 columns, 27 nonzeros, 13 col bounds, 44 row bounds 155: Reduced LP has 261 rows 388 columns 2220 nonzeros 155: Equilibrium scaling LP 155: type | time | iters | facts | shift | viol sum | viol num | obj value 155: L | 0.0 | 0 | 3 | 1.44e+00 | 1.96e+04 | 120 | -7.17176280e+03 154/287 Test #156: d-solve-scorpion.mps-lp_presolvers_with_basis.set .......................................... Passed 0.19 sec test 158 Start 158: r-solve-scorpion.mps-lp_presolvers_with_basis.set 158: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scorpion.mps" "-o" "0.18781248227381066296479411763586e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 158: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 158: Test timeout computed to be: 10000000 155: L | 0.0 | 199 | 4 | 1.44e+00 | 1.87e+04 | 119 | 8.71123358e+03 152: 152: SoPlex status : problem is solved [optimal] 152: Solving time (sec) : 0.06 152: Iterations : 580 152: Objective value : -1.47534331e+07 152: 152: Solution passed validation 152: 152: postsolve finished after 0.032 seconds 152: feasible: true 152: objective value: -14753433.0607685 152: 152: violations: 152: bounds: 0 152: constraints: 0 152: integrality: 0 152: 152: validation: SUCCESS 152: Solving time 0.390 seconds 152: 152: solving finished after 0.390 seconds 155/287 Test #152: r-solve-scagr25.mps-lp_presolvers_with_basis.set ........................................... Passed 0.61 sec 155: L | 0.0 | 399 | 5 | 1.44e+00 | 4.21e+04 | 86 | 1.69679426e+04 test 159 Start 159: d-solve-scrs8.mps-lp_presolvers_with_basis.set 159: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scrs8.mps" "-o" "0.90429695380079143579923107948844e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 159: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 159: Test timeout computed to be: 10000000 155: E | 0.0 | 553 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 155: E | 0.0 | 553 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 155: --- unscaling internal solution 155: --- unsimplifying solution and basis 155: --- unscaling external solution 155: --- verifying computed solution 155: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 155: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 155: --- unscaling external solution 155: --- verifying computed solution 155: 155: SoPlex status : problem is solved [optimal] 155: Solving time (sec) : 0.04 155: Iterations : 553 155: Objective value : 1.84167590e+04 155: 155: Solution passed validation 155: 155: postsolve finished after 0.033 seconds 155: feasible: true 155: objective value: 18416.7590283489 155: 155: violations: 155: bounds: 2.70006239588838e-14 155: constraints: 0 155: integrality: 0 155: 155: validation: SUCCESS 155: Solving time 0.434 seconds 155: 155: solving finished after 0.434 seconds 156/287 Test #155: r-solve-scfxm1.mps-lp_presolvers_with_basis.set ............................................ Passed 0.54 sec test 160 Start 160: q-solve-scrs8.mps-lp_presolvers_with_basis.set 160: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scrs8.mps" "-o" "0.90429695380079143579923107948844e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 160: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 160: Test timeout computed to be: 10000000 157: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 157: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 157: 157: External libraries: 157: Boost 1.83.0 (https://www.boost.org/) 157: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 157: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 157: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 157: 157: reading took 0.0266 seconds 157: Numerical Statistics: 157: Matrix range [1e-02,1e+00] 157: Objective range [6e-02,2e+02] 157: Bounds range [0e+00,0e+00] 157: RHS range [2e-03,1e+00] 157: Dynamism Variables: 1e+02 157: Dynamism Rows : 1e+02 157: set presolve.componentsmaxint = -1 157: set presolve.detectlindep = 0 157: set doubletoneq.enabled = 0 157: set dualinfer.enabled = 0 157: set substitution.enabled = 0 157: set sparsify.enabled = 0 157: 157: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scorpion.mps with dual-postsolve activated 157: rows: 388 157: columns: 358 157: int. columns: 0 157: cont. columns: 358 157: nonzeros: 1426 157: 157: round 0 ( Trivial ): 23 del cols, 91 del rows, 84 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 157: round 1 ( Fast ): 27 del cols, 96 del rows, 108 chg bounds, 0 chg sides, 0 chg coeffs, 48 tsx applied, 0 tsx conflicts 157: round 2 ( Medium ): 84 del cols, 135 del rows, 137 chg bounds, 103 chg sides, 53 chg coeffs, 111 tsx applied, 69 tsx conflicts 157: round 3 ( Medium ): 111 del cols, 138 del rows, 155 chg bounds, 115 chg sides, 59 chg coeffs, 162 tsx applied, 102 tsx conflicts 157: round 4 ( Medium ): 135 del cols, 150 del rows, 185 chg bounds, 127 chg sides, 65 chg coeffs, 228 tsx applied, 102 tsx conflicts 157: round 5 ( Medium ): 141 del cols, 156 del rows, 191 chg bounds, 139 chg sides, 71 chg coeffs, 234 tsx applied, 102 tsx conflicts 157: round 6 (Exhaustive): 141 del cols, 156 del rows, 191 chg bounds, 139 chg sides, 71 chg coeffs, 234 tsx applied, 102 tsx conflicts 157: round 7 ( Final ): Unchanged 157: presolved 7 rounds: 141 del cols, 156 del rows, 191 chg bounds, 139 chg sides, 71 chg coeffs, 234 tsx applied, 102 tsx conflicts 157: 157: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 157: colsingleton 7 0.0 0 0.0 0.000 157: coefftightening 0 0.0 0 0.0 0.000 157: propagation 7 14.3 48 100.0 0.008 157: fixcontinuous 3 0.0 0 0.0 0.000 157: simpleprobing 0 0.0 0 0.0 0.000 157: parallelrows 2 50.0 6 100.0 0.001 157: parallelcols 2 0.0 0 0.0 0.002 157: stuffing 5 80.0 264 61.4 0.002 157: dualfix 4 25.0 18 100.0 0.001 157: simplifyineq 0 0.0 0 0.0 0.000 157: doubletoneq 0 0.0 0 0.0 0.000 157: implint 0 0.0 0 0.0 0.000 157: domcol 1 0.0 0 0.0 0.002 157: dualinfer 0 0.0 0 0.0 0.000 157: probing 0 0.0 0 0.0 0.000 157: substitution 0 0.0 0 0.0 0.000 157: sparsify 0 0.0 0 0.0 0.000 157: 157: reduced problem: 157: reduced rows: 232 157: reduced columns: 217 157: reduced int. columns: 0 157: reduced cont. columns: 217 157: reduced nonzeros: 1036 157: 157: presolving finished after 0.056 seconds 157: 157: Equilibrium scaling LP (persistent) 159: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 159: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 159: 159: External libraries: 159: Boost 1.83.0 (https://www.boost.org/) 159: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 159: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 159: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 159: 159: reading took 0.0438 seconds 159: Numerical Statistics: 159: Matrix range [1e-03,4e+02] 159: Objective range [2e-04,5e+03] 159: Bounds range [0e+00,0e+00] 159: RHS range [1e-02,4e+01] 159: Dynamism Variables: 4e+03 159: Dynamism Rows : 4e+02 159: set presolve.componentsmaxint = -1 159: set presolve.detectlindep = 0 159: set doubletoneq.enabled = 0 159: set dualinfer.enabled = 0 159: set substitution.enabled = 0 159: set sparsify.enabled = 0 159: 159: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scrs8.mps with dual-postsolve activated 159: rows: 490 159: columns: 1169 159: int. columns: 0 159: cont. columns: 1169 159: nonzeros: 3182 159: 159: round 0 ( Trivial ): 10 del cols, 16 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 159: round 1 ( Fast ): 17 del cols, 23 del rows, 544 chg bounds, 0 chg sides, 0 chg coeffs, 1056 tsx applied, 0 tsx conflicts 159: round 2 ( Fast ): 31 del cols, 36 del rows, 609 chg bounds, 0 chg sides, 0 chg coeffs, 1164 tsx applied, 0 tsx conflicts 159: round 3 ( Medium ): 112 del cols, 55 del rows, 636 chg bounds, 63 chg sides, 62 chg coeffs, 1289 tsx applied, 155 tsx conflicts 159: round 4 ( Medium ): 125 del cols, 59 del rows, 659 chg bounds, 73 chg sides, 72 chg coeffs, 1350 tsx applied, 166 tsx conflicts 159: round 5 (Exhaustive): 127 del cols, 62 del rows, 681 chg bounds, 73 chg sides, 72 chg coeffs, 1398 tsx applied, 167 tsx conflicts 159: round 6 ( Final ): 129 del cols, 65 del rows, 703 chg bounds, 73 chg sides, 72 chg coeffs, 1446 tsx applied, 168 tsx conflicts 159: presolved 6 rounds: 129 del cols, 65 del rows, 703 chg bounds, 73 chg sides, 72 chg coeffs, 1446 tsx applied, 168 tsx conflicts 159: 159: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 159: colsingleton 6 0.0 0 0.0 0.000 159: coefftightening 0 0.0 0 0.0 0.000 159: propagation 6 100.0 1350 100.0 0.001 159: fixcontinuous 2 0.0 0 0.0 0.000 159: simpleprobing 0 0.0 0 0.0 0.000 159: parallelrows 2 0.0 0 0.0 0.001 159: parallelcols 2 0.0 0 0.0 0.006 159: stuffing 4 100.0 259 35.5 0.000 159: dualfix 4 100.0 5 80.0 0.001 159: simplifyineq 0 0.0 0 0.0 0.000 159: doubletoneq 0 0.0 0 0.0 0.000 159: implint 0 0.0 0 0.0 0.000 159: domcol 1 0.0 0 0.0 0.006 159: dualinfer 0 0.0 0 0.0 0.000 159: probing 0 0.0 0 0.0 0.000 157: Simplifier removed 26 rows, 26 columns, 58 nonzeros, 0 col bounds, 58 row bounds 157: Reduced LP has 206 rows 191 columns 978 nonzeros 157: Equilibrium scaling LP 157: type | time | iters | facts | shift | viol sum | viol num | obj value 157: L | 0.0 | 0 | 3 | 0.00e+00 | 9.89e+00 | 24 | 1.54181186e+02 159: substitution 0 0.0 0 0.0 0.000 159: sparsify 0 0.0 0 0.0 0.000 159: 159: reduced problem: 159: reduced rows: 425 159: reduced columns: 1040 159: reduced int. columns: 0 159: reduced cont. columns: 1040 159: reduced nonzeros: 2889 159: 159: presolving finished after 0.026 seconds 159: 159: Equilibrium scaling LP (persistent) 157: L | 0.0 | 199 | 4 | 0.00e+00 | 3.42e-02 | 52 | 1.87644142e+03 157: L | 0.0 | 204 | 6 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 157: --- unscaling internal solution 157: --- unsimplifying solution and basis 157: --- unscaling external solution 157: --- verifying computed solution 157: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 157: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 157: --- unscaling external solution 157: --- verifying computed solution 159: Simplifier removed 43 rows, 32 columns, 30 nonzeros, 18 col bounds, 16 row bounds 159: Reduced LP has 382 rows 1008 columns 2743 nonzeros 159: Equilibrium scaling LP 159: type | time | iters | facts | shift | viol sum | viol num | obj value 159: L | 0.0 | 0 | 3 | 4.73e+03 | 5.16e+02 | 49 | -6.42583637e+02 159: L | 0.0 | 199 | 3 | 4.73e+03 | 8.43e+01 | 49 | 2.61704334e+02 158: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 158: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 158: 158: External libraries: 158: Boost 1.83.0 (https://www.boost.org/) 158: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 158: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 158: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 158: 158: reading took 0.0502 seconds 158: Numerical Statistics: 158: Matrix range [1e-02,1e+00] 158: Objective range [6e-02,2e+02] 158: Bounds range [0e+00,0e+00] 158: RHS range [2e-03,1e+00] 158: Dynamism Variables: 1e+02 158: Dynamism Rows : 1e+02 158: set presolve.componentsmaxint = -1 158: set presolve.detectlindep = 0 158: set doubletoneq.enabled = 0 158: set dualinfer.enabled = 0 158: set substitution.enabled = 0 158: set sparsify.enabled = 0 158: 158: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scorpion.mps with dual-postsolve activated 158: rows: 388 158: columns: 358 158: int. columns: 0 158: cont. columns: 358 158: nonzeros: 1426 158: 158: round 0 ( Trivial ): 23 del cols, 91 del rows, 84 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 158: round 1 ( Fast ): 27 del cols, 96 del rows, 108 chg bounds, 0 chg sides, 0 chg coeffs, 48 tsx applied, 0 tsx conflicts 158: round 2 ( Medium ): 84 del cols, 135 del rows, 137 chg bounds, 103 chg sides, 53 chg coeffs, 111 tsx applied, 69 tsx conflicts 158: round 3 ( Medium ): 111 del cols, 138 del rows, 155 chg bounds, 115 chg sides, 59 chg coeffs, 162 tsx applied, 102 tsx conflicts 158: round 4 ( Medium ): 135 del cols, 150 del rows, 185 chg bounds, 127 chg sides, 65 chg coeffs, 228 tsx applied, 102 tsx conflicts 158: round 5 ( Medium ): 141 del cols, 156 del rows, 191 chg bounds, 139 chg sides, 71 chg coeffs, 234 tsx applied, 102 tsx conflicts 158: round 6 (Exhaustive): 141 del cols, 156 del rows, 191 chg bounds, 139 chg sides, 71 chg coeffs, 234 tsx applied, 102 tsx conflicts 158: round 7 ( Final ): Unchanged 158: presolved 7 rounds: 141 del cols, 156 del rows, 191 chg bounds, 139 chg sides, 71 chg coeffs, 234 tsx applied, 102 tsx conflicts 158: 158: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 158: colsingleton 7 0.0 0 0.0 0.000 158: coefftightening 0 0.0 0 0.0 0.000 158: propagation 7 14.3 48 100.0 0.003 158: fixcontinuous 3 0.0 0 0.0 0.000 158: simpleprobing 0 0.0 0 0.0 0.000 158: parallelrows 2 50.0 6 100.0 0.016 158: parallelcols 2 0.0 0 0.0 0.007 158: stuffing 5 80.0 264 61.4 0.003 158: dualfix 4 25.0 18 100.0 0.006 158: simplifyineq 0 0.0 0 0.0 0.000 158: doubletoneq 0 0.0 0 0.0 0.000 158: implint 0 0.0 0 0.0 0.000 158: domcol 1 0.0 0 0.0 0.011 158: dualinfer 0 0.0 0 0.0 0.000 158: probing 0 0.0 0 0.0 0.000 158: substitution 0 0.0 0 0.0 0.000 158: sparsify 0 0.0 0 0.0 0.000 158: 158: reduced problem: 158: reduced rows: 232 158: reduced columns: 217 158: reduced int. columns: 0 158: reduced cont. columns: 217 158: reduced nonzeros: 1036 158: 158: presolving finished after 0.104 seconds 158: 158: Equilibrium scaling LP (persistent) 158: Simplifier removed 26 rows, 26 columns, 58 nonzeros, 0 col bounds, 58 row bounds 158: Reduced LP has 206 rows 191 columns 978 nonzeros 158: Equilibrium scaling LP 158: type | time | iters | facts | shift | viol sum | viol num | obj value 158: L | 0.0 | 0 | 3 | 0.00e+00 | 9.89e+00 | 24 | 1.54181186e+02 157: 157: SoPlex status : problem is solved [optimal] 157: Solving time (sec) : 0.02 157: Iterations : 204 157: Objective value : 1.87812482e+03 157: 157: Solution passed validation 157: 157: postsolve finished after 0.041 seconds 157: feasible: true 157: objective value: 1878.12482273811 157: 157: violations: 157: bounds: 0 157: constraints: 0 157: integrality: 0 157: 157: validation: SUCCESS 157: Solving time 0.151 seconds 157: 157: solving finished after 0.151 seconds 157/287 Test #157: q-solve-scorpion.mps-lp_presolvers_with_basis.set .......................................... Passed 0.26 sec 158: L | 0.0 | 199 | 4 | 0.00e+00 | 7.06e-03 | 55 | 1.87758153e+03 158: L | 0.0 | 202 | 6 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 158: --- unscaling internal solution 158: --- unsimplifying solution and basis 158: --- unscaling external solution 158: --- verifying computed solution 158: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 158: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 158: --- unscaling external solution 158: --- verifying computed solution test 161 Start 161: r-solve-scrs8.mps-lp_presolvers_with_basis.set 161: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scrs8.mps" "-o" "0.90429695380079143579923107948844e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 161: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 161: Test timeout computed to be: 10000000 158: 158: SoPlex status : problem is solved [optimal] 158: Solving time (sec) : 0.02 158: Iterations : 202 158: Objective value : 1.87812482e+03 158: 158: Solution passed validation 158: 158: postsolve finished after 0.031 seconds 158: feasible: true 158: objective value: 1878.12482273811 158: 158: violations: 158: bounds: 0 158: constraints: 0 158: integrality: 0 158: 158: validation: SUCCESS 158: Solving time 0.162 seconds 158: 158: solving finished after 0.162 seconds 159: L | 0.0 | 399 | 4 | 4.73e+03 | 4.84e+02 | 56 | 5.57472824e+02 158/287 Test #158: r-solve-scorpion.mps-lp_presolvers_with_basis.set .......................................... Passed 0.30 sec test 162 Start 162: d-solve-scsd1.mps-lp_presolvers_with_basis.set 162: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scsd1.mps" "-o" "0.86666666743333647292533502995263e1" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 162: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 162: Test timeout computed to be: 10000000 159: L | 0.1 | 599 | 5 | 4.73e+03 | 2.22e+02 | 80 | 6.52192330e+02 162: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 162: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 162: 162: External libraries: 162: Boost 1.83.0 (https://www.boost.org/) 162: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 162: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 162: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 162: 162: reading took 0.0598 seconds 162: Numerical Statistics: 162: Matrix range [2e-01,1e+00] 162: Objective range [1e+00,5e+00] 162: Bounds range [0e+00,0e+00] 162: RHS range [1e+00,1e+00] 162: Dynamism Variables: 4e+00 162: Dynamism Rows : 4e+00 162: set presolve.componentsmaxint = -1 162: set presolve.detectlindep = 0 162: set doubletoneq.enabled = 0 162: set dualinfer.enabled = 0 162: set substitution.enabled = 0 162: set sparsify.enabled = 0 162: 162: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scsd1.mps with dual-postsolve activated 162: rows: 77 162: columns: 760 162: int. columns: 0 162: cont. columns: 760 162: nonzeros: 2388 162: 162: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 162: round 1 ( Medium ): 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 162: round 2 (Exhaustive): 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 162: round 3 ( Final ): Unchanged 162: presolved 3 rounds: 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 162: 162: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 162: colsingleton 3 0.0 0 0.0 0.000 162: coefftightening 0 0.0 0 0.0 0.000 162: propagation 3 0.0 0 0.0 0.000 162: fixcontinuous 2 0.0 0 0.0 0.000 162: simpleprobing 0 0.0 0 0.0 0.000 162: parallelrows 1 0.0 0 0.0 0.000 162: parallelcols 1 0.0 0 0.0 0.003 162: stuffing 2 50.0 20 50.0 0.000 162: dualfix 2 0.0 0 0.0 0.000 162: simplifyineq 0 0.0 0 0.0 0.000 162: doubletoneq 0 0.0 0 0.0 0.000 162: implint 0 0.0 0 0.0 0.000 162: domcol 1 0.0 0 0.0 0.001 162: dualinfer 0 0.0 0 0.0 0.000 162: probing 0 0.0 0 0.0 0.000 162: substitution 0 0.0 0 0.0 0.000 162: sparsify 0 0.0 0 0.0 0.000 162: 162: reduced problem: 162: reduced rows: 77 162: reduced columns: 750 162: reduced int. columns: 0 162: reduced cont. columns: 750 162: reduced nonzeros: 2378 162: 162: presolving finished after 0.006 seconds 162: 162: Equilibrium scaling LP (persistent) 160: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 160: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 160: 160: External libraries: 160: Boost 1.83.0 (https://www.boost.org/) 160: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 160: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 160: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 160: 160: reading took 0.104 seconds 160: Numerical Statistics: 160: Matrix range [1e-03,4e+02] 160: Objective range [2e-04,5e+03] 160: Bounds range [0e+00,0e+00] 160: RHS range [1e-02,4e+01] 160: Dynamism Variables: 4e+03 160: Dynamism Rows : 4e+02 160: set presolve.componentsmaxint = -1 160: set presolve.detectlindep = 0 160: set doubletoneq.enabled = 0 160: set dualinfer.enabled = 0 160: set substitution.enabled = 0 160: set sparsify.enabled = 0 160: 160: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scrs8.mps with dual-postsolve activated 160: rows: 490 160: columns: 1169 160: int. columns: 0 160: cont. columns: 1169 160: nonzeros: 3182 160: 160: round 0 ( Trivial ): 10 del cols, 16 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 160: round 1 ( Fast ): 17 del cols, 23 del rows, 544 chg bounds, 0 chg sides, 0 chg coeffs, 1056 tsx applied, 0 tsx conflicts 160: round 2 ( Fast ): 31 del cols, 36 del rows, 609 chg bounds, 0 chg sides, 0 chg coeffs, 1164 tsx applied, 0 tsx conflicts 160: round 3 ( Medium ): 112 del cols, 55 del rows, 636 chg bounds, 63 chg sides, 62 chg coeffs, 1289 tsx applied, 155 tsx conflicts 160: round 4 ( Medium ): 125 del cols, 59 del rows, 659 chg bounds, 73 chg sides, 72 chg coeffs, 1350 tsx applied, 166 tsx conflicts 160: round 5 (Exhaustive): 127 del cols, 62 del rows, 681 chg bounds, 73 chg sides, 72 chg coeffs, 1398 tsx applied, 167 tsx conflicts 160: round 6 ( Final ): 129 del cols, 65 del rows, 703 chg bounds, 73 chg sides, 72 chg coeffs, 1446 tsx applied, 168 tsx conflicts 160: presolved 6 rounds: 129 del cols, 65 del rows, 703 chg bounds, 73 chg sides, 72 chg coeffs, 1446 tsx applied, 168 tsx conflicts 160: 160: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 160: colsingleton 6 0.0 0 0.0 0.000 160: coefftightening 0 0.0 0 0.0 0.000 160: propagation 6 100.0 1350 100.0 0.026 160: fixcontinuous 2 0.0 0 0.0 0.000 160: simpleprobing 0 0.0 0 0.0 0.000 160: parallelrows 2 0.0 0 0.0 0.003 160: parallelcols 2 0.0 0 0.0 0.007 160: stuffing 4 100.0 259 35.5 0.002 160: dualfix 4 100.0 5 80.0 0.002 160: simplifyineq 0 0.0 0 0.0 0.000 160: doubletoneq 0 0.0 0 0.0 0.000 160: implint 0 0.0 0 0.0 0.000 160: domcol 1 0.0 0 0.0 0.023 160: dualinfer 0 0.0 0 0.0 0.000 160: probing 0 0.0 0 0.0 0.000 159: L | 0.1 | 799 | 8 | 4.73e+03 | 3.08e+02 | 86 | 7.71388211e+02 160: substitution 0 0.0 0 0.0 0.000 160: sparsify 0 0.0 0 0.0 0.000 160: 160: reduced problem: 160: reduced rows: 425 160: reduced columns: 1040 160: reduced int. columns: 0 160: reduced cont. columns: 1040 160: reduced nonzeros: 2889 160: 160: presolving finished after 0.161 seconds 160: 160: Equilibrium scaling LP (persistent) 162: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 162: Reduced LP has 77 rows 750 columns 2378 nonzeros 162: Equilibrium scaling LP 162: type | time | iters | facts | shift | viol sum | viol num | obj value 162: L | 0.0 | 0 | 3 | 1.52e+01 | 1.00e+00 | 1 | 0.00000000e+00 162: E | 0.0 | 106 | 5 | 0.00e+00 | 2.58e+00 | 7 | 8.66666667e+00 162: E | 0.0 | 109 | 6 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 162: --- unscaling internal solution 162: --- unsimplifying solution and basis 162: --- unscaling external solution 162: --- verifying computed solution 162: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 160: Simplifier removed 43 rows, 32 columns, 30 nonzeros, 18 col bounds, 16 row bounds 160: Reduced LP has 382 rows 1008 columns 2743 nonzeros 160: Equilibrium scaling LP 160: type | time | iters | facts | shift | viol sum | viol num | obj value 160: L | 0.0 | 0 | 3 | 4.73e+03 | 5.16e+02 | 49 | -6.42583637e+02 162: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 162: --- unscaling external solution 162: --- verifying computed solution 162: 162: SoPlex status : problem is solved [optimal] 162: Solving time (sec) : 0.02 162: Iterations : 109 162: Objective value : 8.66666667e+00 162: 162: Solution passed validation 162: 162: postsolve finished after 0.000 seconds 162: feasible: true 162: objective value: 8.66666667433336 162: 162: violations: 162: bounds: 1.86190061582642e-16 162: constraints: 0 162: integrality: 0 162: 162: validation: SUCCESS 162: Solving time 0.076 seconds 162: 162: solving finished after 0.076 seconds 159/287 Test #162: d-solve-scsd1.mps-lp_presolvers_with_basis.set ............................................. Passed 0.19 sec test 163 Start 163: q-solve-scsd1.mps-lp_presolvers_with_basis.set 163: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scsd1.mps" "-o" "0.86666666743333647292533502995263e1" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 163: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 163: Test timeout computed to be: 10000000 160: L | 0.0 | 199 | 3 | 4.73e+03 | 8.27e+01 | 49 | 2.61717399e+02 159: L | 0.1 | 999 | 9 | 4.73e+03 | 4.51e+01 | 66 | 8.45236138e+02 160: L | 0.0 | 399 | 4 | 4.73e+03 | 6.33e+01 | 54 | 5.59383345e+02 159: E | 0.2 | 1187 | 12 | 0.00e+00 | 1.77e+01 | 4 | 9.04883324e+02 159: E | 0.2 | 1197 | 12 | 0.00e+00 | 4.88e+01 | 4 | 9.04296954e+02 159: E | 0.2 | 1197 | 13 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 159: --- unscaling internal solution 159: --- unsimplifying solution and basis 159: --- unscaling external solution 159: --- verifying computed solution 159: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 159: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 159: --- unscaling external solution 159: --- verifying computed solution 159: 159: SoPlex status : problem is solved [optimal] 159: Solving time (sec) : 0.20 159: Iterations : 1197 159: Objective value : 9.04296954e+02 159: 159: Solution passed validation 159: 159: postsolve finished after 0.009 seconds 159: feasible: true 159: objective value: 904.296953800791 159: 159: violations: 159: bounds: 0 159: constraints: 3.5527136788005e-15 159: integrality: 0 159: 159: validation: SUCCESS 159: Solving time 0.519 seconds 159: 159: solving finished after 0.519 seconds 160/287 Test #159: d-solve-scrs8.mps-lp_presolvers_with_basis.set ............................................. Passed 0.61 sec test 164 Start 164: r-solve-scsd1.mps-lp_presolvers_with_basis.set 164: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scsd1.mps" "-o" "0.86666666743333647292533502995263e1" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 164: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 164: Test timeout computed to be: 10000000 160: L | 0.1 | 599 | 5 | 4.73e+03 | 3.82e+02 | 74 | 6.53699779e+02 161: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 161: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 161: 161: External libraries: 161: Boost 1.83.0 (https://www.boost.org/) 161: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 161: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 161: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 161: 161: reading took 0.0473 seconds 161: Numerical Statistics: 161: Matrix range [1e-03,4e+02] 161: Objective range [2e-04,5e+03] 161: Bounds range [0e+00,0e+00] 161: RHS range [1e-02,4e+01] 161: Dynamism Variables: 4e+03 161: Dynamism Rows : 4e+02 161: set presolve.componentsmaxint = -1 161: set presolve.detectlindep = 0 161: set doubletoneq.enabled = 0 161: set dualinfer.enabled = 0 161: set substitution.enabled = 0 161: set sparsify.enabled = 0 161: 161: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scrs8.mps with dual-postsolve activated 161: rows: 490 161: columns: 1169 161: int. columns: 0 161: cont. columns: 1169 161: nonzeros: 3182 161: 161: round 0 ( Trivial ): 10 del cols, 16 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 161: round 1 ( Fast ): 17 del cols, 23 del rows, 544 chg bounds, 0 chg sides, 0 chg coeffs, 1056 tsx applied, 0 tsx conflicts 161: round 2 ( Fast ): 31 del cols, 36 del rows, 609 chg bounds, 0 chg sides, 0 chg coeffs, 1164 tsx applied, 0 tsx conflicts 161: round 3 ( Medium ): 112 del cols, 55 del rows, 636 chg bounds, 63 chg sides, 62 chg coeffs, 1289 tsx applied, 155 tsx conflicts 161: round 4 ( Medium ): 125 del cols, 59 del rows, 659 chg bounds, 73 chg sides, 72 chg coeffs, 1350 tsx applied, 166 tsx conflicts 161: round 5 (Exhaustive): 127 del cols, 62 del rows, 681 chg bounds, 73 chg sides, 72 chg coeffs, 1398 tsx applied, 167 tsx conflicts 161: round 6 ( Final ): 129 del cols, 65 del rows, 703 chg bounds, 73 chg sides, 72 chg coeffs, 1446 tsx applied, 168 tsx conflicts 161: presolved 6 rounds: 129 del cols, 65 del rows, 703 chg bounds, 73 chg sides, 72 chg coeffs, 1446 tsx applied, 168 tsx conflicts 161: 161: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 161: colsingleton 6 0.0 0 0.0 0.000 161: coefftightening 0 0.0 0 0.0 0.000 161: propagation 6 100.0 1350 100.0 0.047 161: fixcontinuous 2 0.0 0 0.0 0.002 161: simpleprobing 0 0.0 0 0.0 0.000 161: parallelrows 2 0.0 0 0.0 0.042 161: parallelcols 2 0.0 0 0.0 0.032 161: stuffing 4 100.0 259 35.5 0.002 161: dualfix 4 100.0 5 80.0 0.009 161: simplifyineq 0 0.0 0 0.0 0.000 161: doubletoneq 0 0.0 0 0.0 0.000 161: implint 0 0.0 0 0.0 0.000 161: domcol 1 0.0 0 0.0 0.076 161: dualinfer 0 0.0 0 0.0 0.000 161: probing 0 0.0 0 0.0 0.000 161: substitution 0 0.0 0 0.0 0.000 161: sparsify 0 0.0 0 0.0 0.000 161: 161: reduced problem: 161: reduced rows: 425 161: reduced columns: 1040 161: reduced int. columns: 0 161: reduced cont. columns: 1040 161: reduced nonzeros: 2889 161: 161: presolving finished after 0.320 seconds 161: 161: Equilibrium scaling LP (persistent) 161: Simplifier removed 43 rows, 32 columns, 30 nonzeros, 18 col bounds, 16 row bounds 161: Reduced LP has 382 rows 1008 columns 2743 nonzeros 161: Equilibrium scaling LP 161: type | time | iters | facts | shift | viol sum | viol num | obj value 161: L | 0.0 | 0 | 3 | 4.73e+03 | 5.16e+02 | 49 | -6.42583637e+02 161: L | 0.0 | 199 | 3 | 4.73e+03 | 8.27e+01 | 49 | 2.61717399e+02 163: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 163: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 163: 163: External libraries: 163: Boost 1.83.0 (https://www.boost.org/) 163: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 163: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 163: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 163: 163: reading took 0.0759 seconds 163: Numerical Statistics: 163: Matrix range [2e-01,1e+00] 163: Objective range [1e+00,5e+00] 163: Bounds range [0e+00,0e+00] 163: RHS range [1e+00,1e+00] 163: Dynamism Variables: 4e+00 163: Dynamism Rows : 4e+00 163: set presolve.componentsmaxint = -1 163: set presolve.detectlindep = 0 163: set doubletoneq.enabled = 0 163: set dualinfer.enabled = 0 163: set substitution.enabled = 0 163: set sparsify.enabled = 0 163: 163: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scsd1.mps with dual-postsolve activated 163: rows: 77 163: columns: 760 163: int. columns: 0 163: cont. columns: 760 163: nonzeros: 2388 163: 163: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 163: round 1 ( Medium ): 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 163: round 2 (Exhaustive): 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 163: round 3 ( Final ): Unchanged 163: presolved 3 rounds: 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 163: 163: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 163: colsingleton 3 0.0 0 0.0 0.000 163: coefftightening 0 0.0 0 0.0 0.000 163: propagation 3 0.0 0 0.0 0.000 163: fixcontinuous 2 0.0 0 0.0 0.000 163: simpleprobing 0 0.0 0 0.0 0.000 163: parallelrows 1 0.0 0 0.0 0.001 163: parallelcols 1 0.0 0 0.0 0.002 163: stuffing 2 50.0 20 50.0 0.000 163: dualfix 2 0.0 0 0.0 0.002 163: simplifyineq 0 0.0 0 0.0 0.000 163: doubletoneq 0 0.0 0 0.0 0.000 163: implint 0 0.0 0 0.0 0.000 163: domcol 1 0.0 0 0.0 0.022 163: dualinfer 0 0.0 0 0.0 0.000 163: probing 0 0.0 0 0.0 0.000 163: substitution 0 0.0 0 0.0 0.000 163: sparsify 0 0.0 0 0.0 0.000 163: 163: reduced problem: 163: reduced rows: 77 163: reduced columns: 750 163: reduced int. columns: 0 163: reduced cont. columns: 750 163: reduced nonzeros: 2378 163: 163: presolving finished after 0.067 seconds 163: 163: Equilibrium scaling LP (persistent) 160: L | 0.1 | 799 | 7 | 4.73e+03 | 3.56e+01 | 51 | 7.98761703e+02 163: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 163: Reduced LP has 77 rows 750 columns 2378 nonzeros 163: Equilibrium scaling LP 163: type | time | iters | facts | shift | viol sum | viol num | obj value 163: L | 0.0 | 0 | 3 | 1.52e+01 | 1.00e+00 | 1 | 0.00000000e+00 161: L | 0.0 | 399 | 4 | 4.73e+03 | 6.33e+01 | 54 | 5.59383345e+02 163: E | 0.0 | 106 | 6 | 0.00e+00 | 3.32e+00 | 8 | 8.66666667e+00 163: E | 0.0 | 109 | 7 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 163: --- unscaling internal solution 163: --- unsimplifying solution and basis 163: --- unscaling external solution 163: --- verifying computed solution 163: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 163: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 163: --- unscaling external solution 163: --- verifying computed solution 161: L | 0.1 | 599 | 5 | 4.73e+03 | 3.82e+02 | 74 | 6.53699779e+02 160: E | 0.1 | 989 | 9 | 0.00e+00 | 1.77e+01 | 4 | 9.04883324e+02 160: E | 0.1 | 997 | 9 | 0.00e+00 | 4.92e+01 | 4 | 9.04372443e+02 160: E | 0.1 | 1000 | 10 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 160: --- unscaling internal solution 160: --- unsimplifying solution and basis 160: --- unscaling external solution 160: --- verifying computed solution 160: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 160: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 160: --- unscaling external solution 160: --- verifying computed solution 161: L | 0.1 | 799 | 7 | 4.73e+03 | 3.56e+01 | 52 | 7.98761703e+02 163: 163: SoPlex status : problem is solved [optimal] 163: Solving time (sec) : 0.02 163: Iterations : 109 163: Objective value : 8.66666667e+00 163: 163: Solution passed validation 163: 163: postsolve finished after 0.034 seconds 163: feasible: true 163: objective value: 8.66666667433337 163: 163: violations: 163: bounds: 0 163: constraints: 0 163: integrality: 0 163: 163: validation: SUCCESS 163: Solving time 0.160 seconds 163: 163: solving finished after 0.160 seconds 161/287 Test #163: q-solve-scsd1.mps-lp_presolvers_with_basis.set ............................................. Passed 0.35 sec test 165 Start 165: d-solve-seba.mps-lp_presolvers_with_basis.set 165: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/seba.mps" "-o" "0.157116e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 165: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 165: Test timeout computed to be: 10000000 161: E | 0.1 | 994 | 9 | 0.00e+00 | 1.77e+01 | 4 | 9.04883324e+02 161: E | 0.1 | 997 | 9 | 0.00e+00 | 3.37e+01 | 4 | 9.04611412e+02 161: E | 0.1 | 1005 | 11 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 161: --- unscaling internal solution 161: --- unsimplifying solution and basis 161: --- unscaling external solution 161: --- verifying computed solution 161: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 161: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 161: --- unscaling external solution 161: --- verifying computed solution 164: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 164: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 164: 164: External libraries: 164: Boost 1.83.0 (https://www.boost.org/) 164: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 164: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 164: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 164: 164: reading took 0.0801 seconds 164: Numerical Statistics: 164: Matrix range [2e-01,1e+00] 164: Objective range [1e+00,5e+00] 164: Bounds range [0e+00,0e+00] 164: RHS range [1e+00,1e+00] 164: Dynamism Variables: 4e+00 164: Dynamism Rows : 4e+00 164: set presolve.componentsmaxint = -1 164: set presolve.detectlindep = 0 164: set doubletoneq.enabled = 0 164: set dualinfer.enabled = 0 164: set substitution.enabled = 0 164: set sparsify.enabled = 0 164: 164: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scsd1.mps with dual-postsolve activated 164: rows: 77 164: columns: 760 164: int. columns: 0 164: cont. columns: 760 164: nonzeros: 2388 164: 164: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 164: round 1 ( Medium ): 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 164: round 2 (Exhaustive): 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 164: round 3 ( Final ): Unchanged 164: presolved 3 rounds: 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 164: 164: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 164: colsingleton 3 0.0 0 0.0 0.000 164: coefftightening 0 0.0 0 0.0 0.000 164: propagation 3 0.0 0 0.0 0.000 164: fixcontinuous 2 0.0 0 0.0 0.000 164: simpleprobing 0 0.0 0 0.0 0.000 164: parallelrows 1 0.0 0 0.0 0.022 164: parallelcols 1 0.0 0 0.0 0.010 164: stuffing 2 50.0 20 50.0 0.000 164: dualfix 2 0.0 0 0.0 0.003 164: simplifyineq 0 0.0 0 0.0 0.000 164: doubletoneq 0 0.0 0 0.0 0.000 164: implint 0 0.0 0 0.0 0.000 164: domcol 1 0.0 0 0.0 0.038 164: dualinfer 0 0.0 0 0.0 0.000 164: probing 0 0.0 0 0.0 0.000 164: substitution 0 0.0 0 0.0 0.000 164: sparsify 0 0.0 0 0.0 0.000 164: 164: reduced problem: 164: reduced rows: 77 164: reduced columns: 750 164: reduced int. columns: 0 164: reduced cont. columns: 750 164: reduced nonzeros: 2378 164: 164: presolving finished after 0.098 seconds 164: 164: Equilibrium scaling LP (persistent) 160: 160: SoPlex status : problem is solved [optimal] 160: Solving time (sec) : 0.14 160: Iterations : 1000 160: Objective value : 9.04296954e+02 160: 160: Solution passed validation 160: 160: postsolve finished after 0.074 seconds 160: feasible: true 160: objective value: 904.296953800791 160: 160: violations: 160: bounds: 0 160: constraints: 7.32747196252603e-15 160: integrality: 0 160: 160: validation: SUCCESS 160: Solving time 0.603 seconds 160: 160: solving finished after 0.603 seconds 162/287 Test #160: q-solve-scrs8.mps-lp_presolvers_with_basis.set ............................................. Passed 0.81 sec test 166 Start 166: q-solve-seba.mps-lp_presolvers_with_basis.set 166: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/seba.mps" "-o" "0.157116e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 166: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 166: Test timeout computed to be: 10000000 164: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 164: Reduced LP has 77 rows 750 columns 2378 nonzeros 164: Equilibrium scaling LP 164: type | time | iters | facts | shift | viol sum | viol num | obj value 164: L | 0.0 | 0 | 3 | 1.52e+01 | 1.00e+00 | 1 | 0.00000000e+00 164: E | 0.0 | 107 | 5 | 0.00e+00 | 2.58e+00 | 7 | 8.66666667e+00 164: E | 0.0 | 110 | 6 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 164: --- unscaling internal solution 164: --- unsimplifying solution and basis 164: --- unscaling external solution 164: --- verifying computed solution 164: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 164: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 164: --- unscaling external solution 164: --- verifying computed solution 165: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 165: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 165: 165: External libraries: 165: Boost 1.83.0 (https://www.boost.org/) 165: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 165: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 165: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 165: 165: reading took 0.052 seconds 165: Numerical Statistics: 165: Matrix range [1e+00,2e+02] 165: Objective range [2e-03,5e+02] 165: Bounds range [3e-02,1e+03] 165: RHS range [2e+00,9e+01] 165: Dynamism Variables: 2e+02 165: Dynamism Rows : 2e+02 165: set presolve.componentsmaxint = -1 165: set presolve.detectlindep = 0 165: set doubletoneq.enabled = 0 165: set dualinfer.enabled = 0 165: set substitution.enabled = 0 165: set sparsify.enabled = 0 165: 165: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/seba.mps with dual-postsolve activated 165: rows: 515 165: columns: 1028 165: int. columns: 0 165: cont. columns: 1028 165: nonzeros: 4352 165: 165: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 165: round 1 ( Fast ): 104 del cols, 52 del rows, 134 chg bounds, 0 chg sides, 0 chg coeffs, 268 tsx applied, 0 tsx conflicts 165: round 2 ( Fast ): 130 del cols, 65 del rows, 489 chg bounds, 0 chg sides, 0 chg coeffs, 978 tsx applied, 0 tsx conflicts 165: round 3 ( Fast ): 132 del cols, 66 del rows, 582 chg bounds, 0 chg sides, 0 chg coeffs, 1164 tsx applied, 0 tsx conflicts 165: round 4 ( Medium ): 465 del cols, 67 del rows, 600 chg bounds, 331 chg sides, 331 chg coeffs, 1532 tsx applied, 1002 tsx conflicts 165: round 5 ( Medium ): 796 del cols, 398 del rows, 931 chg bounds, 331 chg sides, 331 chg coeffs, 3518 tsx applied, 1002 tsx conflicts 165: round 6 ( Medium ): 882 del cols, 398 del rows, 931 chg bounds, 417 chg sides, 417 chg coeffs, 3604 tsx applied, 1088 tsx conflicts 165: round 7 ( Medium ): 968 del cols, 484 del rows, 1017 chg bounds, 417 chg sides, 417 chg coeffs, 4206 tsx applied, 1088 tsx conflicts 165: round 8 ( Medium ): 986 del cols, 484 del rows, 1017 chg bounds, 435 chg sides, 435 chg coeffs, 4224 tsx applied, 1106 tsx conflicts 165: round 9 ( Medium ): 1004 del cols, 502 del rows, 1035 chg bounds, 435 chg sides, 435 chg coeffs, 4386 tsx applied, 1106 tsx conflicts 165: round 10 ( Medium ): 1008 del cols, 502 del rows, 1035 chg bounds, 439 chg sides, 439 chg coeffs, 4390 tsx applied, 1110 tsx conflicts 165: round 11 ( Medium ): 1012 del cols, 506 del rows, 1039 chg bounds, 439 chg sides, 439 chg coeffs, 4438 tsx applied, 1110 tsx conflicts 165: round 12 (Exhaustive): 1020 del cols, 506 del rows, 1047 chg bounds, 439 chg sides, 439 chg coeffs, 4446 tsx applied, 1110 tsx conflicts 165: round 13 (Exhaustive): 1020 del cols, 513 del rows, 1061 chg bounds, 439 chg sides, 439 chg coeffs, 4446 tsx applied, 1110 tsx conflicts 165: round 14 ( Final ): Unchanged 165: presolved 14 rounds: 1020 del cols, 513 del rows, 1061 chg bounds, 439 chg sides, 439 chg coeffs, 4446 tsx applied, 1110 tsx conflicts 165: 165: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 165: colsingleton 14 0.0 0 0.0 0.000 165: coefftightening 0 0.0 0 0.0 0.000 165: propagation 14 28.6 1200 100.0 0.001 165: fixcontinuous 4 0.0 0 0.0 0.000 165: simpleprobing 0 0.0 0 0.0 0.000 165: parallelrows 3 0.0 0 0.0 0.001 165: parallelcols 3 0.0 0 0.0 0.005 165: stuffing 10 80.0 4011 72.4 0.004 165: dualfix 7 42.9 337 99.4 0.000 165: simplifyineq 0 0.0 0 0.0 0.000 165: doubletoneq 0 0.0 0 0.0 0.000 165: implint 0 0.0 0 0.0 0.000 165: domcol 2 50.0 8 100.0 0.000 165: dualinfer 0 0.0 0 0.0 0.000 165: probing 0 0.0 0 0.0 0.000 165: substitution 0 0.0 0 0.0 0.000 165: sparsify 0 0.0 0 0.0 0.000 165: 165: reduced problem: 165: reduced rows: 2 165: reduced columns: 8 165: reduced int. columns: 0 165: reduced cont. columns: 8 165: reduced nonzeros: 11 165: 165: presolving finished after 0.029 seconds 165: 165: Equilibrium scaling LP (persistent) 165: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 165: Reduced LP has 2 rows 8 columns 11 nonzeros 165: Equilibrium scaling LP 165: type | time | iters | facts | shift | viol sum | viol num | obj value 165: L | 0.0 | 0 | 3 | 0.00e+00 | 5.15e+01 | 2 | 1.06773000e+04 165: L | 0.0 | 1 | 4 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 165: --- unscaling internal solution 165: --- unsimplifying solution and basis 165: --- unscaling external solution 165: --- verifying computed solution 165: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 165: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 165: --- unscaling external solution 165: --- verifying computed solution 165: 165: SoPlex status : problem is solved [optimal] 165: Solving time (sec) : 0.02 165: Iterations : 1 165: Objective value : 1.57116000e+04 165: 165: Solution passed validation 165: 165: postsolve finished after 0.005 seconds 165: feasible: true 165: objective value: 15711.6 165: 165: violations: 165: bounds: 0 165: constraints: 0 165: integrality: 0 165: 165: validation: SUCCESS 165: Solving time 0.036 seconds 165: 165: solving finished after 0.036 seconds 163/287 Test #165: d-solve-seba.mps-lp_presolvers_with_basis.set .............................................. Passed 0.16 sec 164: 164: SoPlex status : problem is solved [optimal] 164: Solving time (sec) : 0.02 164: Iterations : 110 164: Objective value : 8.66666667e+00 164: 164: Solution passed validation 164: 164: postsolve finished after 0.047 seconds 164: feasible: true 164: objective value: 8.66666667433336 164: 164: violations: 164: bounds: 0 164: constraints: 0 164: integrality: 0 164: 164: validation: SUCCESS 164: Solving time 0.205 seconds 164: 164: solving finished after 0.205 seconds test 167 Start 167: r-solve-seba.mps-lp_presolvers_with_basis.set 167: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/seba.mps" "-o" "0.157116e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 167: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 167: Test timeout computed to be: 10000000 164/287 Test #164: r-solve-scsd1.mps-lp_presolvers_with_basis.set ............................................. Passed 0.40 sec test 168 Start 168: d-solve-share1b.mps-lp_presolvers_with_basis.set 168: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share1b.mps" "-o" "-0.7658931857918568112797274346007e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 168: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 168: Test timeout computed to be: 10000000 161: 161: SoPlex status : problem is solved [optimal] 161: Solving time (sec) : 0.12 161: Iterations : 1005 161: Objective value : 9.04296954e+02 161: 161: Solution passed validation 161: 161: postsolve finished after 0.128 seconds 161: feasible: true 161: objective value: 904.296953800791 161: 161: violations: 161: bounds: 0 161: constraints: 3.30828697769903e-15 161: integrality: 0 161: 161: validation: SUCCESS 161: Solving time 0.655 seconds 161: 161: solving finished after 0.655 seconds 165/287 Test #161: r-solve-scrs8.mps-lp_presolvers_with_basis.set ............................................. Passed 0.81 sec test 169 Start 169: q-solve-share1b.mps-lp_presolvers_with_basis.set 169: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share1b.mps" "-o" "-0.7658931857918568112797274346007e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 169: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 169: Test timeout computed to be: 10000000 168: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 168: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 168: 168: External libraries: 168: Boost 1.83.0 (https://www.boost.org/) 168: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 168: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 168: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 168: 168: reading took 0.0154 seconds 168: Numerical Statistics: 168: Matrix range [1e-01,1e+03] 168: Objective range [2e-03,1e+02] 168: Bounds range [0e+00,0e+00] 168: RHS range [1e-04,3e+03] 168: Dynamism Variables: 1e+03 168: Dynamism Rows : 2e+02 168: set presolve.componentsmaxint = -1 168: set presolve.detectlindep = 0 168: set doubletoneq.enabled = 0 168: set dualinfer.enabled = 0 168: set substitution.enabled = 0 168: set sparsify.enabled = 0 168: 168: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share1b.mps with dual-postsolve activated 168: rows: 117 168: columns: 225 168: int. columns: 0 168: cont. columns: 225 168: nonzeros: 1151 168: 168: round 0 ( Trivial ): 5 del cols, 7 del rows, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 168: round 1 ( Fast ): 5 del cols, 7 del rows, 152 chg bounds, 0 chg sides, 0 chg coeffs, 380 tsx applied, 0 tsx conflicts 168: round 2 ( Medium ): 22 del cols, 10 del rows, 155 chg bounds, 17 chg sides, 17 chg coeffs, 397 tsx applied, 17 tsx conflicts 168: round 3 (Exhaustive): 22 del cols, 10 del rows, 155 chg bounds, 17 chg sides, 17 chg coeffs, 397 tsx applied, 17 tsx conflicts 168: round 4 ( Final ): Unchanged 168: presolved 4 rounds: 22 del cols, 10 del rows, 156 chg bounds, 17 chg sides, 17 chg coeffs, 398 tsx applied, 17 tsx conflicts 168: 168: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 168: colsingleton 4 0.0 0 0.0 0.000 168: coefftightening 0 0.0 0 0.0 0.000 168: propagation 4 25.0 380 100.0 0.000 168: fixcontinuous 2 0.0 0 0.0 0.000 168: simpleprobing 0 0.0 0 0.0 0.000 168: parallelrows 1 0.0 0 0.0 0.000 168: parallelcols 1 0.0 0 0.0 0.000 168: stuffing 2 50.0 34 50.0 0.000 168: dualfix 2 50.0 1 100.0 0.000 168: simplifyineq 0 0.0 0 0.0 0.000 168: doubletoneq 0 0.0 0 0.0 0.000 168: implint 0 0.0 0 0.0 0.000 168: domcol 1 0.0 0 0.0 0.000 168: dualinfer 0 0.0 0 0.0 0.000 168: probing 0 0.0 0 0.0 0.000 168: substitution 0 0.0 0 0.0 0.000 168: sparsify 0 0.0 0 0.0 0.000 168: 168: reduced problem: 168: reduced rows: 107 168: reduced columns: 203 168: reduced int. columns: 0 168: reduced cont. columns: 203 168: reduced nonzeros: 1098 168: 168: presolving finished after 0.003 seconds 168: 168: Equilibrium scaling LP (persistent) 168: Simplifier removed 11 rows, 9 columns, 53 nonzeros, 11 col bounds, 119 row bounds 168: Reduced LP has 96 rows 194 columns 1045 nonzeros 168: Equilibrium scaling LP 168: type | time | iters | facts | shift | viol sum | viol num | obj value 168: L | 0.0 | 0 | 3 | 1.25e+02 | 3.29e+04 | 68 | 9.61324134e+03 168: E | 0.0 | 193 | 5 | 0.00e+00 | 7.15e+02 | 54 | -3.46200132e+04 168: E | 0.0 | 197 | 5 | 0.00e+00 | 4.26e+03 | 54 | -4.51691694e+04 168: E | 0.0 | 290 | 8 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 168: --- unscaling internal solution 168: --- unsimplifying solution and basis 168: --- unscaling external solution 168: --- verifying computed solution 168: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 168: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 168: --- unscaling external solution 168: --- verifying computed solution 168: 168: SoPlex status : problem is solved [optimal] 168: Solving time (sec) : 0.02 168: Iterations : 290 168: Objective value : -7.65893186e+04 168: 168: Solution passed validation 168: 168: postsolve finished after 0.004 seconds 168: feasible: true 168: objective value: -76589.3185791856 168: 168: violations: 168: bounds: 0 168: constraints: 0 168: integrality: 0 168: 168: validation: SUCCESS 168: Solving time 0.064 seconds 168: 168: solving finished after 0.064 seconds 166/287 Test #168: d-solve-share1b.mps-lp_presolvers_with_basis.set ........................................... Passed 0.14 sec test 170 Start 170: r-solve-share1b.mps-lp_presolvers_with_basis.set 170: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share1b.mps" "-o" "-0.7658931857918568112797274346007e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 170: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 170: Test timeout computed to be: 10000000 169: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 169: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 169: 169: External libraries: 169: Boost 1.83.0 (https://www.boost.org/) 169: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 169: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 169: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 169: 169: reading took 0.0418 seconds 169: Numerical Statistics: 169: Matrix range [1e-01,1e+03] 169: Objective range [2e-03,1e+02] 169: Bounds range [0e+00,0e+00] 169: RHS range [1e-04,3e+03] 169: Dynamism Variables: 1e+03 169: Dynamism Rows : 2e+02 169: set presolve.componentsmaxint = -1 169: set presolve.detectlindep = 0 169: set doubletoneq.enabled = 0 169: set dualinfer.enabled = 0 169: set substitution.enabled = 0 169: set sparsify.enabled = 0 169: 169: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share1b.mps with dual-postsolve activated 169: rows: 117 169: columns: 225 169: int. columns: 0 169: cont. columns: 225 169: nonzeros: 1151 169: 169: round 0 ( Trivial ): 5 del cols, 7 del rows, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 169: round 1 ( Fast ): 5 del cols, 7 del rows, 152 chg bounds, 0 chg sides, 0 chg coeffs, 380 tsx applied, 0 tsx conflicts 169: round 2 ( Medium ): 22 del cols, 10 del rows, 155 chg bounds, 17 chg sides, 17 chg coeffs, 397 tsx applied, 17 tsx conflicts 169: round 3 (Exhaustive): 22 del cols, 10 del rows, 155 chg bounds, 17 chg sides, 17 chg coeffs, 397 tsx applied, 17 tsx conflicts 169: round 4 ( Final ): Unchanged 169: presolved 4 rounds: 22 del cols, 10 del rows, 156 chg bounds, 17 chg sides, 17 chg coeffs, 398 tsx applied, 17 tsx conflicts 169: 169: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 169: colsingleton 4 0.0 0 0.0 0.000 169: coefftightening 0 0.0 0 0.0 0.000 169: propagation 4 25.0 380 100.0 0.003 169: fixcontinuous 2 0.0 0 0.0 0.000 169: simpleprobing 0 0.0 0 0.0 0.000 169: parallelrows 1 0.0 0 0.0 0.000 169: parallelcols 1 0.0 0 0.0 0.018 169: stuffing 2 50.0 34 50.0 0.000 169: dualfix 2 50.0 1 100.0 0.000 169: simplifyineq 0 0.0 0 0.0 0.000 169: doubletoneq 0 0.0 0 0.0 0.000 169: implint 0 0.0 0 0.0 0.000 169: domcol 1 0.0 0 0.0 0.014 169: dualinfer 0 0.0 0 0.0 0.000 169: probing 0 0.0 0 0.0 0.000 169: substitution 0 0.0 0 0.0 0.000 169: sparsify 0 0.0 0 0.0 0.000 169: 169: reduced problem: 169: reduced rows: 107 169: reduced columns: 203 169: reduced int. columns: 0 169: reduced cont. columns: 203 169: reduced nonzeros: 1098 169: 169: presolving finished after 0.066 seconds 169: 169: Equilibrium scaling LP (persistent) 169: Simplifier removed 11 rows, 9 columns, 53 nonzeros, 11 col bounds, 119 row bounds 169: Reduced LP has 96 rows 194 columns 1045 nonzeros 169: Equilibrium scaling LP 169: type | time | iters | facts | shift | viol sum | viol num | obj value 169: L | 0.0 | 0 | 3 | 1.25e+02 | 3.29e+04 | 68 | 9.61324134e+03 169: E | 0.0 | 193 | 5 | 0.00e+00 | 7.15e+02 | 54 | -3.46200132e+04 169: E | 0.0 | 197 | 5 | 0.00e+00 | 4.26e+03 | 54 | -4.51691694e+04 169: E | 0.0 | 290 | 7 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 169: --- unscaling internal solution 169: --- unsimplifying solution and basis 169: --- unscaling external solution 169: --- verifying computed solution 169: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 169: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 169: --- unscaling external solution 169: --- verifying computed solution 170: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 170: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 170: 170: External libraries: 170: Boost 1.83.0 (https://www.boost.org/) 170: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 170: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 170: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 170: 170: reading took 0.0197 seconds 170: Numerical Statistics: 170: Matrix range [1e-01,1e+03] 170: Objective range [2e-03,1e+02] 170: Bounds range [0e+00,0e+00] 170: RHS range [1e-04,3e+03] 170: Dynamism Variables: 1e+03 170: Dynamism Rows : 2e+02 170: set presolve.componentsmaxint = -1 170: set presolve.detectlindep = 0 170: set doubletoneq.enabled = 0 170: set dualinfer.enabled = 0 170: set substitution.enabled = 0 170: set sparsify.enabled = 0 170: 170: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share1b.mps with dual-postsolve activated 170: rows: 117 170: columns: 225 170: int. columns: 0 170: cont. columns: 225 170: nonzeros: 1151 170: 170: round 0 ( Trivial ): 5 del cols, 7 del rows, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 170: round 1 ( Fast ): 5 del cols, 7 del rows, 152 chg bounds, 0 chg sides, 0 chg coeffs, 380 tsx applied, 0 tsx conflicts 170: round 2 ( Medium ): 22 del cols, 10 del rows, 155 chg bounds, 17 chg sides, 17 chg coeffs, 397 tsx applied, 17 tsx conflicts 170: round 3 (Exhaustive): 22 del cols, 10 del rows, 155 chg bounds, 17 chg sides, 17 chg coeffs, 397 tsx applied, 17 tsx conflicts 170: round 4 ( Final ): Unchanged 170: presolved 4 rounds: 22 del cols, 10 del rows, 156 chg bounds, 17 chg sides, 17 chg coeffs, 398 tsx applied, 17 tsx conflicts 170: 170: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 170: colsingleton 4 0.0 0 0.0 0.000 170: coefftightening 0 0.0 0 0.0 0.000 170: propagation 4 25.0 380 100.0 0.013 170: fixcontinuous 2 0.0 0 0.0 0.000 170: simpleprobing 0 0.0 0 0.0 0.000 170: parallelrows 1 0.0 0 0.0 0.002 170: parallelcols 1 0.0 0 0.0 0.005 170: stuffing 2 50.0 34 50.0 0.001 170: dualfix 2 50.0 1 100.0 0.001 170: simplifyineq 0 0.0 0 0.0 0.000 170: doubletoneq 0 0.0 0 0.0 0.000 170: implint 0 0.0 0 0.0 0.000 170: domcol 1 0.0 0 0.0 0.012 170: dualinfer 0 0.0 0 0.0 0.000 170: probing 0 0.0 0 0.0 0.000 170: substitution 0 0.0 0 0.0 0.000 170: sparsify 0 0.0 0 0.0 0.000 170: 170: reduced problem: 170: reduced rows: 107 170: reduced columns: 203 170: reduced int. columns: 0 170: reduced cont. columns: 203 170: reduced nonzeros: 1098 170: 170: presolving finished after 0.069 seconds 170: 170: Equilibrium scaling LP (persistent) 170: Simplifier removed 11 rows, 9 columns, 53 nonzeros, 11 col bounds, 119 row bounds 170: Reduced LP has 96 rows 194 columns 1045 nonzeros 170: Equilibrium scaling LP 170: type | time | iters | facts | shift | viol sum | viol num | obj value 170: L | 0.0 | 0 | 3 | 1.25e+02 | 3.29e+04 | 68 | 9.61324134e+03 169: 169: SoPlex status : problem is solved [optimal] 169: Solving time (sec) : 0.02 169: Iterations : 290 169: Objective value : -7.65893186e+04 169: 169: Solution passed validation 169: 169: postsolve finished after 0.017 seconds 169: feasible: true 169: objective value: -76589.3185791856 169: 169: violations: 169: bounds: 0 169: constraints: 0 169: integrality: 0 169: 169: validation: SUCCESS 169: Solving time 0.188 seconds 169: 169: solving finished after 0.188 seconds 167/287 Test #169: q-solve-share1b.mps-lp_presolvers_with_basis.set ........................................... Passed 0.30 sec test 171 Start 171: d-solve-share2b.mps-lp_presolvers_with_basis.set 171: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share2b.mps" "-o" "-0.41573224074141948654519910873841e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 171: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 171: Test timeout computed to be: 10000000 170: E | 0.0 | 193 | 5 | 0.00e+00 | 7.15e+02 | 54 | -3.46200132e+04 170: E | 0.0 | 197 | 5 | 0.00e+00 | 4.26e+03 | 54 | -4.51691694e+04 170: E | 0.0 | 290 | 8 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 170: --- unscaling internal solution 170: --- unsimplifying solution and basis 170: --- unscaling external solution 170: --- verifying computed solution 170: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 170: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 170: --- unscaling external solution 170: --- verifying computed solution 170: 170: SoPlex status : problem is solved [optimal] 170: Solving time (sec) : 0.02 170: Iterations : 290 170: Objective value : -7.65893186e+04 170: 170: Solution passed validation 170: 170: postsolve finished after 0.017 seconds 170: feasible: true 170: objective value: -76589.3185791856 170: 170: violations: 170: bounds: 0 170: constraints: 0 170: integrality: 0 170: 170: validation: SUCCESS 170: Solving time 0.144 seconds 170: 170: solving finished after 0.144 seconds 168/287 Test #170: r-solve-share1b.mps-lp_presolvers_with_basis.set ........................................... Passed 0.23 sec test 172 Start 172: q-solve-share2b.mps-lp_presolvers_with_basis.set 172: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share2b.mps" "-o" "-0.41573224074141948654519910873841e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 172: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 172: Test timeout computed to be: 10000000 166: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 166: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 166: 166: External libraries: 166: Boost 1.83.0 (https://www.boost.org/) 166: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 166: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 166: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 166: 166: reading took 0.0945 seconds 166: Numerical Statistics: 166: Matrix range [1e+00,2e+02] 166: Objective range [2e-03,5e+02] 166: Bounds range [3e-02,1e+03] 166: RHS range [2e+00,9e+01] 166: Dynamism Variables: 2e+02 166: Dynamism Rows : 2e+02 166: set presolve.componentsmaxint = -1 166: set presolve.detectlindep = 0 166: set doubletoneq.enabled = 0 166: set dualinfer.enabled = 0 166: set substitution.enabled = 0 166: set sparsify.enabled = 0 166: 166: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/seba.mps with dual-postsolve activated 166: rows: 515 166: columns: 1028 166: int. columns: 0 166: cont. columns: 1028 166: nonzeros: 4352 166: 166: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 166: round 1 ( Fast ): 104 del cols, 52 del rows, 134 chg bounds, 0 chg sides, 0 chg coeffs, 268 tsx applied, 0 tsx conflicts 166: round 2 ( Fast ): 130 del cols, 65 del rows, 489 chg bounds, 0 chg sides, 0 chg coeffs, 978 tsx applied, 0 tsx conflicts 166: round 3 ( Fast ): 132 del cols, 66 del rows, 582 chg bounds, 0 chg sides, 0 chg coeffs, 1164 tsx applied, 0 tsx conflicts 166: round 4 ( Medium ): 465 del cols, 67 del rows, 600 chg bounds, 331 chg sides, 331 chg coeffs, 1532 tsx applied, 1002 tsx conflicts 166: round 5 ( Medium ): 796 del cols, 398 del rows, 931 chg bounds, 331 chg sides, 331 chg coeffs, 3518 tsx applied, 1002 tsx conflicts 166: round 6 ( Medium ): 882 del cols, 398 del rows, 931 chg bounds, 417 chg sides, 417 chg coeffs, 3604 tsx applied, 1088 tsx conflicts 166: round 7 ( Medium ): 968 del cols, 484 del rows, 1017 chg bounds, 417 chg sides, 417 chg coeffs, 4206 tsx applied, 1088 tsx conflicts 166: round 8 ( Medium ): 986 del cols, 484 del rows, 1017 chg bounds, 435 chg sides, 435 chg coeffs, 4224 tsx applied, 1106 tsx conflicts 166: round 9 ( Medium ): 1004 del cols, 502 del rows, 1035 chg bounds, 435 chg sides, 435 chg coeffs, 4386 tsx applied, 1106 tsx conflicts 166: round 10 ( Medium ): 1008 del cols, 502 del rows, 1035 chg bounds, 439 chg sides, 439 chg coeffs, 4390 tsx applied, 1110 tsx conflicts 166: round 11 ( Medium ): 1012 del cols, 506 del rows, 1039 chg bounds, 439 chg sides, 439 chg coeffs, 4438 tsx applied, 1110 tsx conflicts 166: round 12 (Exhaustive): 1020 del cols, 506 del rows, 1047 chg bounds, 439 chg sides, 439 chg coeffs, 4446 tsx applied, 1110 tsx conflicts 166: round 13 (Exhaustive): 1020 del cols, 513 del rows, 1061 chg bounds, 439 chg sides, 439 chg coeffs, 4446 tsx applied, 1110 tsx conflicts 166: round 14 ( Final ): Unchanged 166: presolved 14 rounds: 1020 del cols, 513 del rows, 1061 chg bounds, 439 chg sides, 439 chg coeffs, 4446 tsx applied, 1110 tsx conflicts 166: 166: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 166: colsingleton 14 0.0 0 0.0 0.000 166: coefftightening 0 0.0 0 0.0 0.000 166: propagation 14 28.6 1200 100.0 0.070 166: fixcontinuous 4 0.0 0 0.0 0.000 166: simpleprobing 0 0.0 0 0.0 0.000 166: parallelrows 3 0.0 0 0.0 0.002 166: parallelcols 3 0.0 0 0.0 0.019 166: stuffing 10 80.0 4011 72.4 0.106 166: dualfix 7 42.9 337 99.4 0.001 166: simplifyineq 0 0.0 0 0.0 0.000 166: doubletoneq 0 0.0 0 0.0 0.000 166: implint 0 0.0 0 0.0 0.000 166: domcol 2 50.0 8 100.0 0.001 166: dualinfer 0 0.0 0 0.0 0.000 166: probing 0 0.0 0 0.0 0.000 166: substitution 0 0.0 0 0.0 0.000 166: sparsify 0 0.0 0 0.0 0.000 166: 166: reduced problem: 166: reduced rows: 2 166: reduced columns: 8 166: reduced int. columns: 0 166: reduced cont. columns: 8 166: reduced nonzeros: 11 166: 166: presolving finished after 0.343 seconds 166: 166: Equilibrium scaling LP (persistent) 166: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 166: Reduced LP has 2 rows 8 columns 11 nonzeros 166: Equilibrium scaling LP 166: type | time | iters | facts | shift | viol sum | viol num | obj value 166: L | 0.0 | 0 | 3 | 0.00e+00 | 5.15e+01 | 2 | 1.06773000e+04 166: L | 0.0 | 1 | 4 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 166: --- unscaling internal solution 166: --- unsimplifying solution and basis 166: --- unscaling external solution 166: --- verifying computed solution 166: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 166: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 166: --- unscaling external solution 166: --- verifying computed solution 171: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 171: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 171: 171: External libraries: 171: Boost 1.83.0 (https://www.boost.org/) 171: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 171: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 171: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 171: 171: reading took 0.01 seconds 171: Numerical Statistics: 171: Matrix range [1e-02,1e+02] 171: Objective range [3e-02,4e+00] 171: Bounds range [0e+00,0e+00] 171: RHS range [1e+00,2e+01] 171: Dynamism Variables: 9e+03 171: Dynamism Rows : 1e+02 171: set presolve.componentsmaxint = -1 171: set presolve.detectlindep = 0 171: set doubletoneq.enabled = 0 171: set dualinfer.enabled = 0 171: set substitution.enabled = 0 171: set sparsify.enabled = 0 171: 171: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share2b.mps with dual-postsolve activated 171: rows: 96 171: columns: 79 171: int. columns: 0 171: cont. columns: 79 171: nonzeros: 694 171: 171: round 0 ( Trivial ): 0 del cols, 3 del rows, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 171: round 1 ( Fast ): 0 del cols, 3 del rows, 58 chg bounds, 0 chg sides, 0 chg coeffs, 110 tsx applied, 0 tsx conflicts 171: round 2 ( Fast ): 0 del cols, 3 del rows, 66 chg bounds, 0 chg sides, 0 chg coeffs, 134 tsx applied, 0 tsx conflicts 171: round 3 (Exhaustive): 0 del cols, 3 del rows, 76 chg bounds, 0 chg sides, 0 chg coeffs, 158 tsx applied, 0 tsx conflicts 171: round 4 ( Final ): 0 del cols, 3 del rows, 76 chg bounds, 0 chg sides, 0 chg coeffs, 158 tsx applied, 0 tsx conflicts 171: presolved 4 rounds: 0 del cols, 3 del rows, 76 chg bounds, 0 chg sides, 0 chg coeffs, 158 tsx applied, 0 tsx conflicts 171: 171: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 171: colsingleton 4 0.0 0 0.0 0.000 171: coefftightening 0 0.0 0 0.0 0.000 171: propagation 4 75.0 154 100.0 0.000 171: fixcontinuous 1 0.0 0 0.0 0.000 171: simpleprobing 0 0.0 0 0.0 0.000 171: parallelrows 1 0.0 0 0.0 0.000 171: parallelcols 1 0.0 0 0.0 0.000 171: stuffing 1 0.0 0 0.0 0.000 171: dualfix 2 50.0 4 100.0 0.000 171: simplifyineq 0 0.0 0 0.0 0.000 171: doubletoneq 0 0.0 0 0.0 0.000 171: implint 0 0.0 0 0.0 0.000 171: domcol 1 0.0 0 0.0 0.000 171: dualinfer 0 0.0 0 0.0 0.000 171: probing 0 0.0 0 0.0 0.000 171: substitution 0 0.0 0 0.0 0.000 171: sparsify 0 0.0 0 0.0 0.000 171: 171: reduced problem: 171: reduced rows: 93 171: reduced columns: 79 171: reduced int. columns: 0 171: reduced cont. columns: 79 171: reduced nonzeros: 691 171: 171: presolving finished after 0.002 seconds 171: 171: Equilibrium scaling LP (persistent) 171: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 2 col bounds, 0 row bounds 171: Reduced LP has 93 rows 79 columns 691 nonzeros 171: Equilibrium scaling LP 171: type | time | iters | facts | shift | viol sum | viol num | obj value 171: L | 0.0 | 0 | 3 | 6.50e+00 | 1.10e+03 | 42 | -9.83644605e+02 171: E | 0.0 | 104 | 4 | 0.00e+00 | 4.55e+00 | 2 | -3.72683656e+02 172: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 172: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 172: 172: External libraries: 172: Boost 1.83.0 (https://www.boost.org/) 172: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 172: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 172: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 172: 172: reading took 0.00775 seconds 172: Numerical Statistics: 172: Matrix range [1e-02,1e+02] 172: Objective range [3e-02,4e+00] 172: Bounds range [0e+00,0e+00] 172: RHS range [1e+00,2e+01] 172: Dynamism Variables: 9e+03 172: Dynamism Rows : 1e+02 172: set presolve.componentsmaxint = -1 172: set presolve.detectlindep = 0 172: set doubletoneq.enabled = 0 172: set dualinfer.enabled = 0 172: set substitution.enabled = 0 172: set sparsify.enabled = 0 172: 172: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share2b.mps with dual-postsolve activated 172: rows: 96 172: columns: 79 172: int. columns: 0 172: cont. columns: 79 172: nonzeros: 694 172: 172: round 0 ( Trivial ): 0 del cols, 3 del rows, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 172: round 1 ( Fast ): 0 del cols, 3 del rows, 58 chg bounds, 0 chg sides, 0 chg coeffs, 110 tsx applied, 0 tsx conflicts 172: round 2 ( Fast ): 0 del cols, 3 del rows, 66 chg bounds, 0 chg sides, 0 chg coeffs, 134 tsx applied, 0 tsx conflicts 172: round 3 (Exhaustive): 0 del cols, 3 del rows, 76 chg bounds, 0 chg sides, 0 chg coeffs, 158 tsx applied, 0 tsx conflicts 172: round 4 ( Final ): 0 del cols, 3 del rows, 76 chg bounds, 0 chg sides, 0 chg coeffs, 158 tsx applied, 0 tsx conflicts 172: presolved 4 rounds: 0 del cols, 3 del rows, 76 chg bounds, 0 chg sides, 0 chg coeffs, 158 tsx applied, 0 tsx conflicts 172: 172: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 172: colsingleton 4 0.0 0 0.0 0.000 172: coefftightening 0 0.0 0 0.0 0.000 172: propagation 4 75.0 154 100.0 0.002 172: fixcontinuous 1 0.0 0 0.0 0.000 172: simpleprobing 0 0.0 0 0.0 0.000 172: parallelrows 1 0.0 0 0.0 0.000 172: parallelcols 1 0.0 0 0.0 0.000 172: stuffing 1 0.0 0 0.0 0.000 172: dualfix 2 50.0 4 100.0 0.000 172: simplifyineq 0 0.0 0 0.0 0.000 172: doubletoneq 0 0.0 0 0.0 0.000 172: implint 0 0.0 0 0.0 0.000 172: domcol 1 0.0 0 0.0 0.003 172: dualinfer 0 0.0 0 0.0 0.000 172: probing 0 0.0 0 0.0 0.000 172: substitution 0 0.0 0 0.0 0.000 172: sparsify 0 0.0 0 0.0 0.000 172: 172: reduced problem: 172: reduced rows: 93 172: reduced columns: 79 172: reduced int. columns: 0 172: reduced cont. columns: 79 172: reduced nonzeros: 691 172: 172: presolving finished after 0.013 seconds 172: 172: Equilibrium scaling LP (persistent) 172: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 2 col bounds, 0 row bounds 172: Reduced LP has 93 rows 79 columns 691 nonzeros 172: Equilibrium scaling LP 172: type | time | iters | facts | shift | viol sum | viol num | obj value 172: L | 0.0 | 0 | 3 | 6.50e+00 | 1.10e+03 | 42 | -9.83644605e+02 172: E | 0.0 | 104 | 4 | 0.00e+00 | 4.55e+00 | 2 | -3.72683656e+02 172: E | 0.0 | 128 | 5 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 172: --- unscaling internal solution 172: --- unsimplifying solution and basis 172: --- unscaling external solution 172: --- verifying computed solution 172: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 172: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 172: --- unscaling external solution 172: --- verifying computed solution 171: E | 0.0 | 128 | 5 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 171: --- unscaling internal solution 171: --- unsimplifying solution and basis 171: --- unscaling external solution 171: --- verifying computed solution 171: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 171: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 171: --- unscaling external solution 171: --- verifying computed solution 171: 171: SoPlex status : problem is solved [optimal] 171: Solving time (sec) : 0.00 171: Iterations : 128 171: Objective value : -4.15732241e+02 171: 171: Solution passed validation 171: 171: postsolve finished after 0.000 seconds 171: feasible: true 171: objective value: -415.732240741419 171: 171: violations: 171: bounds: 0 171: constraints: 0 171: integrality: 0 171: 171: validation: SUCCESS 171: Solving time 0.033 seconds 171: 171: solving finished after 0.033 seconds 172: 172: SoPlex status : problem is solved [optimal] 172: Solving time (sec) : 0.00 172: Iterations : 128 172: Objective value : -4.15732241e+02 172: 172: Solution passed validation 172: 172: postsolve finished after 0.006 seconds 172: feasible: true 172: objective value: -415.732240741419 172: 172: violations: 172: bounds: 0 172: constraints: 0 172: integrality: 0 172: 172: validation: SUCCESS 172: Solving time 0.031 seconds 172: 172: solving finished after 0.031 seconds 169/287 Test #171: d-solve-share2b.mps-lp_presolvers_with_basis.set ........................................... Passed 0.13 sec 170/287 Test #172: q-solve-share2b.mps-lp_presolvers_with_basis.set ........................................... Passed 0.09 sec test 173 Start 173: r-solve-share2b.mps-lp_presolvers_with_basis.set 173: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share2b.mps" "-o" "-0.41573224074141948654519910873841e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 173: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 173: Test timeout computed to be: 10000000 test 174 Start 174: d-solve-shell.mps-lp_presolvers_with_basis.set 174: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/shell.mps" "-o" "0.1208825346e10" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 174: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 174: Test timeout computed to be: 10000000 166: 166: SoPlex status : problem is solved [optimal] 166: Solving time (sec) : 0.00 166: Iterations : 1 166: Objective value : 1.57116000e+04 166: 166: Solution passed validation 166: 166: postsolve finished after 0.117 seconds 166: feasible: true 166: objective value: 15711.6 166: 166: violations: 166: bounds: 0 166: constraints: 0 166: integrality: 0 166: 166: validation: SUCCESS 166: Solving time 0.475 seconds 166: 166: solving finished after 0.475 seconds 171/287 Test #166: q-solve-seba.mps-lp_presolvers_with_basis.set .............................................. Passed 0.66 sec test 175 Start 175: q-solve-shell.mps-lp_presolvers_with_basis.set 175: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/shell.mps" "-o" "0.1208825346e10" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 175: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 175: Test timeout computed to be: 10000000 173: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 173: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 173: 173: External libraries: 173: Boost 1.83.0 (https://www.boost.org/) 173: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 173: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 173: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 173: 173: reading took 0.0153 seconds 173: Numerical Statistics: 173: Matrix range [1e-02,1e+02] 173: Objective range [3e-02,4e+00] 173: Bounds range [0e+00,0e+00] 173: RHS range [1e+00,2e+01] 173: Dynamism Variables: 9e+03 173: Dynamism Rows : 1e+02 173: set presolve.componentsmaxint = -1 173: set presolve.detectlindep = 0 173: set doubletoneq.enabled = 0 173: set dualinfer.enabled = 0 173: set substitution.enabled = 0 173: set sparsify.enabled = 0 173: 173: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share2b.mps with dual-postsolve activated 173: rows: 96 173: columns: 79 173: int. columns: 0 173: cont. columns: 79 173: nonzeros: 694 173: 173: round 0 ( Trivial ): 0 del cols, 3 del rows, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 173: round 1 ( Fast ): 0 del cols, 3 del rows, 58 chg bounds, 0 chg sides, 0 chg coeffs, 110 tsx applied, 0 tsx conflicts 173: round 2 ( Fast ): 0 del cols, 3 del rows, 66 chg bounds, 0 chg sides, 0 chg coeffs, 134 tsx applied, 0 tsx conflicts 173: round 3 (Exhaustive): 0 del cols, 3 del rows, 76 chg bounds, 0 chg sides, 0 chg coeffs, 158 tsx applied, 0 tsx conflicts 173: round 4 ( Final ): 0 del cols, 3 del rows, 76 chg bounds, 0 chg sides, 0 chg coeffs, 158 tsx applied, 0 tsx conflicts 173: presolved 4 rounds: 0 del cols, 3 del rows, 76 chg bounds, 0 chg sides, 0 chg coeffs, 158 tsx applied, 0 tsx conflicts 173: 173: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 173: colsingleton 4 0.0 0 0.0 0.000 173: coefftightening 0 0.0 0 0.0 0.000 173: propagation 4 75.0 154 100.0 0.006 173: fixcontinuous 1 0.0 0 0.0 0.000 173: simpleprobing 0 0.0 0 0.0 0.000 173: parallelrows 1 0.0 0 0.0 0.002 173: parallelcols 1 0.0 0 0.0 0.004 173: stuffing 1 0.0 0 0.0 0.000 173: dualfix 2 50.0 4 100.0 0.000 173: simplifyineq 0 0.0 0 0.0 0.000 173: doubletoneq 0 0.0 0 0.0 0.000 173: implint 0 0.0 0 0.0 0.000 173: domcol 1 0.0 0 0.0 0.009 173: dualinfer 0 0.0 0 0.0 0.000 173: probing 0 0.0 0 0.0 0.000 173: substitution 0 0.0 0 0.0 0.000 173: sparsify 0 0.0 0 0.0 0.000 173: 173: reduced problem: 173: reduced rows: 93 173: reduced columns: 79 173: reduced int. columns: 0 173: reduced cont. columns: 79 173: reduced nonzeros: 691 173: 173: presolving finished after 0.046 seconds 173: 173: Equilibrium scaling LP (persistent) 173: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 2 col bounds, 0 row bounds 173: Reduced LP has 93 rows 79 columns 691 nonzeros 173: Equilibrium scaling LP 173: type | time | iters | facts | shift | viol sum | viol num | obj value 173: L | 0.0 | 0 | 3 | 6.50e+00 | 1.10e+03 | 42 | -9.83644605e+02 173: E | 0.0 | 104 | 4 | 0.00e+00 | 4.55e+00 | 2 | -3.72683656e+02 173: E | 0.0 | 128 | 5 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 173: --- unscaling internal solution 173: --- unsimplifying solution and basis 173: --- unscaling external solution 173: --- verifying computed solution 173: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 173: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 173: --- unscaling external solution 173: --- verifying computed solution 173: 173: SoPlex status : problem is solved [optimal] 173: Solving time (sec) : 0.00 173: Iterations : 128 173: Objective value : -4.15732241e+02 173: 173: Solution passed validation 173: 173: postsolve finished after 0.007 seconds 173: feasible: true 173: objective value: -415.732240741419 173: 173: violations: 173: bounds: 0 173: constraints: 0 173: integrality: 0 173: 173: validation: SUCCESS 173: Solving time 0.064 seconds 173: 173: solving finished after 0.064 seconds 172/287 Test #173: r-solve-share2b.mps-lp_presolvers_with_basis.set ........................................... Passed 0.13 sec test 176 Start 176: r-solve-shell.mps-lp_presolvers_with_basis.set 176: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/shell.mps" "-o" "0.1208825346e10" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 176: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 176: Test timeout computed to be: 10000000 174: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 174: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 174: 174: External libraries: 174: Boost 1.83.0 (https://www.boost.org/) 174: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 174: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 174: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 174: 174: reading took 0.0815 seconds 174: Numerical Statistics: 174: Matrix range [1e+00,1e+00] 174: Objective range [1e+00,4e+03] 174: Bounds range [6e+00,5e+05] 174: RHS range [4e+04,5e+04] 174: Dynamism Variables: 1e+00 174: Dynamism Rows : 1e+00 174: set presolve.componentsmaxint = -1 174: set presolve.detectlindep = 0 174: set doubletoneq.enabled = 0 174: set dualinfer.enabled = 0 174: set substitution.enabled = 0 174: set sparsify.enabled = 0 174: 174: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/shell.mps with dual-postsolve activated 174: rows: 536 174: columns: 1775 174: int. columns: 0 174: cont. columns: 1775 174: nonzeros: 3556 174: 174: round 0 ( Trivial ): 290 del cols, 40 del rows, 80 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 174: round 1 ( Fast ): 297 del cols, 47 del rows, 908 chg bounds, 0 chg sides, 0 chg coeffs, 1694 tsx applied, 0 tsx conflicts 174: round 2 (Exhaustive): 327 del cols, 49 del rows, 1039 chg bounds, 0 chg sides, 0 chg coeffs, 1928 tsx applied, 0 tsx conflicts 174: round 3 (Exhaustive): 327 del cols, 49 del rows, 1092 chg bounds, 0 chg sides, 0 chg coeffs, 2034 tsx applied, 0 tsx conflicts 174: round 4 ( Final ): 327 del cols, 49 del rows, 1136 chg bounds, 0 chg sides, 0 chg coeffs, 2122 tsx applied, 0 tsx conflicts 174: presolved 4 rounds: 327 del cols, 49 del rows, 1136 chg bounds, 0 chg sides, 0 chg coeffs, 2122 tsx applied, 0 tsx conflicts 174: 174: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 174: colsingleton 4 0.0 0 0.0 0.000 174: coefftightening 0 0.0 0 0.0 0.000 174: propagation 4 100.0 2094 100.0 0.001 174: fixcontinuous 2 0.0 0 0.0 0.000 174: simpleprobing 0 0.0 0 0.0 0.000 174: parallelrows 1 0.0 0 0.0 0.001 174: parallelcols 2 50.0 3 100.0 0.008 174: stuffing 2 0.0 0 0.0 0.000 174: dualfix 2 0.0 0 0.0 0.000 174: simplifyineq 0 0.0 0 0.0 0.000 174: doubletoneq 0 0.0 0 0.0 0.000 174: implint 0 0.0 0 0.0 0.000 174: domcol 2 50.0 25 100.0 0.007 174: dualinfer 0 0.0 0 0.0 0.000 174: probing 0 0.0 0 0.0 0.000 174: substitution 0 0.0 0 0.0 0.000 174: sparsify 0 0.0 0 0.0 0.000 174: 174: reduced problem: 174: reduced rows: 487 174: reduced columns: 1448 174: reduced int. columns: 0 174: reduced cont. columns: 1448 174: reduced nonzeros: 2902 174: 174: presolving finished after 0.044 seconds 174: 174: Equilibrium scaling LP (persistent) 174: Simplifier removed 124 rows, 124 columns, 248 nonzeros, 110 col bounds, 248 row bounds 174: Reduced LP has 363 rows 1324 columns 2654 nonzeros 174: Equilibrium scaling LP 174: type | time | iters | facts | shift | viol sum | viol num | obj value 174: L | 0.0 | 0 | 3 | 6.24e+02 | 9.67e+05 | 166 | 3.86023100e+06 174: L | 0.0 | 199 | 3 | 6.24e+02 | 8.46e+05 | 166 | 1.18702586e+09 174: L | 0.0 | 399 | 4 | 6.24e+02 | 3.22e+04 | 140 | 1.20659973e+09 174: E | 0.1 | 517 | 6 | 0.00e+00 | 1.44e+02 | 2 | 1.20884428e+09 174: E | 0.1 | 517 | 6 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 174: --- unscaling internal solution 174: --- unsimplifying solution and basis 174: --- unscaling external solution 174: --- verifying computed solution 174: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 174: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 174: --- unscaling external solution 174: --- verifying computed solution 174: 174: SoPlex status : problem is solved [optimal] 174: Solving time (sec) : 0.08 174: Iterations : 517 174: Objective value : 1.20882535e+09 174: 174: Solution passed validation 174: 174: postsolve finished after 0.001 seconds 174: feasible: true 174: objective value: 1208825346 174: 174: violations: 174: bounds: 0 174: constraints: 0 174: integrality: 0 174: 174: validation: SUCCESS 174: Solving time 0.264 seconds 174: 174: solving finished after 0.264 seconds 167: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 167: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 167: 167: External libraries: 167: Boost 1.83.0 (https://www.boost.org/) 167: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 167: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 167: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 167: 167: reading took 0.138 seconds 167: Numerical Statistics: 167: Matrix range [1e+00,2e+02] 167: Objective range [2e-03,5e+02] 167: Bounds range [3e-02,1e+03] 167: RHS range [2e+00,9e+01] 167: Dynamism Variables: 2e+02 167: Dynamism Rows : 2e+02 167: set presolve.componentsmaxint = -1 167: set presolve.detectlindep = 0 167: set doubletoneq.enabled = 0 167: set dualinfer.enabled = 0 167: set substitution.enabled = 0 167: set sparsify.enabled = 0 167: 167: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/seba.mps with dual-postsolve activated 167: rows: 515 167: columns: 1028 167: int. columns: 0 167: cont. columns: 1028 167: nonzeros: 4352 167: 167: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 167: round 1 ( Fast ): 104 del cols, 52 del rows, 134 chg bounds, 0 chg sides, 0 chg coeffs, 268 tsx applied, 0 tsx conflicts 167: round 2 ( Fast ): 130 del cols, 65 del rows, 489 chg bounds, 0 chg sides, 0 chg coeffs, 978 tsx applied, 0 tsx conflicts 167: round 3 ( Fast ): 132 del cols, 66 del rows, 582 chg bounds, 0 chg sides, 0 chg coeffs, 1164 tsx applied, 0 tsx conflicts 167: round 4 ( Medium ): 465 del cols, 67 del rows, 600 chg bounds, 331 chg sides, 331 chg coeffs, 1532 tsx applied, 1002 tsx conflicts 167: round 5 ( Medium ): 796 del cols, 398 del rows, 931 chg bounds, 331 chg sides, 331 chg coeffs, 3518 tsx applied, 1002 tsx conflicts 167: round 6 ( Medium ): 882 del cols, 398 del rows, 931 chg bounds, 417 chg sides, 417 chg coeffs, 3604 tsx applied, 1088 tsx conflicts 167: round 7 ( Medium ): 968 del cols, 484 del rows, 1017 chg bounds, 417 chg sides, 417 chg coeffs, 4206 tsx applied, 1088 tsx conflicts 167: round 8 ( Medium ): 986 del cols, 484 del rows, 1017 chg bounds, 435 chg sides, 435 chg coeffs, 4224 tsx applied, 1106 tsx conflicts 167: round 9 ( Medium ): 1004 del cols, 502 del rows, 1035 chg bounds, 435 chg sides, 435 chg coeffs, 4386 tsx applied, 1106 tsx conflicts 167: round 10 ( Medium ): 1008 del cols, 502 del rows, 1035 chg bounds, 439 chg sides, 439 chg coeffs, 4390 tsx applied, 1110 tsx conflicts 167: round 11 ( Medium ): 1012 del cols, 506 del rows, 1039 chg bounds, 439 chg sides, 439 chg coeffs, 4438 tsx applied, 1110 tsx conflicts 167: round 12 (Exhaustive): 1020 del cols, 506 del rows, 1047 chg bounds, 439 chg sides, 439 chg coeffs, 4446 tsx applied, 1110 tsx conflicts 167: round 13 (Exhaustive): 1020 del cols, 513 del rows, 1061 chg bounds, 439 chg sides, 439 chg coeffs, 4446 tsx applied, 1110 tsx conflicts 167: round 14 ( Final ): Unchanged 167: presolved 14 rounds: 1020 del cols, 513 del rows, 1061 chg bounds, 439 chg sides, 439 chg coeffs, 4446 tsx applied, 1110 tsx conflicts 167: 167: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 167: colsingleton 14 0.0 0 0.0 0.000 167: coefftightening 0 0.0 0 0.0 0.000 167: propagation 14 28.6 1200 100.0 0.131 167: fixcontinuous 4 0.0 0 0.0 0.001 167: simpleprobing 0 0.0 0 0.0 0.000 167: parallelrows 3 0.0 0 0.0 0.038 167: parallelcols 3 0.0 0 0.0 0.031 167: stuffing 10 80.0 4011 72.4 0.166 167: dualfix 7 42.9 337 99.4 0.003 167: simplifyineq 0 0.0 0 0.0 0.000 167: doubletoneq 0 0.0 0 0.0 0.000 167: implint 0 0.0 0 0.0 0.000 167: domcol 2 50.0 8 100.0 0.001 167: dualinfer 0 0.0 0 0.0 0.000 167: probing 0 0.0 0 0.0 0.000 167: substitution 0 0.0 0 0.0 0.000 167: sparsify 0 0.0 0 0.0 0.000 167: 167: reduced problem: 167: reduced rows: 2 167: reduced columns: 8 167: reduced int. columns: 0 167: reduced cont. columns: 8 167: reduced nonzeros: 11 167: 167: presolving finished after 0.675 seconds 167: 167: Equilibrium scaling LP (persistent) 173/287 Test #174: d-solve-shell.mps-lp_presolvers_with_basis.set ............................................. Passed 0.41 sec 167: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 167: Reduced LP has 2 rows 8 columns 11 nonzeros 167: Equilibrium scaling LP 167: type | time | iters | facts | shift | viol sum | viol num | obj value 167: L | 0.0 | 0 | 3 | 0.00e+00 | 5.15e+01 | 2 | 1.06773000e+04 167: L | 0.0 | 1 | 4 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 167: --- unscaling internal solution 167: --- unsimplifying solution and basis 167: --- unscaling external solution 167: --- verifying computed solution 167: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 167: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 167: --- unscaling external solution 167: --- verifying computed solution test 177 Start 177: d-solve-vtp-base.mps-lp_presolvers_with_basis.set 177: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/vtp-base.mps" "-o" "0.1298314624613613657395984384889e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 177: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 177: Test timeout computed to be: 10000000 175: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 175: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 175: 175: External libraries: 175: Boost 1.83.0 (https://www.boost.org/) 175: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 175: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 175: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 175: 175: reading took 0.104 seconds 175: Numerical Statistics: 175: Matrix range [1e+00,1e+00] 175: Objective range [1e+00,4e+03] 175: Bounds range [6e+00,5e+05] 175: RHS range [4e+04,5e+04] 175: Dynamism Variables: 1e+00 175: Dynamism Rows : 1e+00 175: set presolve.componentsmaxint = -1 175: set presolve.detectlindep = 0 175: set doubletoneq.enabled = 0 175: set dualinfer.enabled = 0 175: set substitution.enabled = 0 175: set sparsify.enabled = 0 175: 175: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/shell.mps with dual-postsolve activated 175: rows: 536 175: columns: 1775 175: int. columns: 0 175: cont. columns: 1775 175: nonzeros: 3556 175: 175: round 0 ( Trivial ): 290 del cols, 40 del rows, 80 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 175: round 1 ( Fast ): 297 del cols, 47 del rows, 908 chg bounds, 0 chg sides, 0 chg coeffs, 1694 tsx applied, 0 tsx conflicts 175: round 2 (Exhaustive): 327 del cols, 49 del rows, 1039 chg bounds, 0 chg sides, 0 chg coeffs, 1928 tsx applied, 0 tsx conflicts 175: round 3 (Exhaustive): 327 del cols, 49 del rows, 1092 chg bounds, 0 chg sides, 0 chg coeffs, 2034 tsx applied, 0 tsx conflicts 175: round 4 ( Final ): 327 del cols, 49 del rows, 1136 chg bounds, 0 chg sides, 0 chg coeffs, 2122 tsx applied, 0 tsx conflicts 175: presolved 4 rounds: 327 del cols, 49 del rows, 1136 chg bounds, 0 chg sides, 0 chg coeffs, 2122 tsx applied, 0 tsx conflicts 175: 175: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 175: colsingleton 4 0.0 0 0.0 0.000 175: coefftightening 0 0.0 0 0.0 0.000 175: propagation 4 100.0 2094 100.0 0.032 175: fixcontinuous 2 0.0 0 0.0 0.001 175: simpleprobing 0 0.0 0 0.0 0.000 175: parallelrows 1 0.0 0 0.0 0.003 175: parallelcols 2 50.0 3 100.0 0.008 175: stuffing 2 0.0 0 0.0 0.000 175: dualfix 2 0.0 0 0.0 0.001 175: simplifyineq 0 0.0 0 0.0 0.000 175: doubletoneq 0 0.0 0 0.0 0.000 175: implint 0 0.0 0 0.0 0.000 175: domcol 2 50.0 25 100.0 0.039 175: dualinfer 0 0.0 0 0.0 0.000 175: probing 0 0.0 0 0.0 0.000 175: substitution 0 0.0 0 0.0 0.000 175: sparsify 0 0.0 0 0.0 0.000 175: 175: reduced problem: 175: reduced rows: 487 175: reduced columns: 1448 175: reduced int. columns: 0 175: reduced cont. columns: 1448 175: reduced nonzeros: 2902 175: 175: presolving finished after 0.201 seconds 175: 175: Equilibrium scaling LP (persistent) 177: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 177: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 177: 177: External libraries: 177: Boost 1.83.0 (https://www.boost.org/) 177: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 177: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 177: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 177: 177: reading took 0.0139 seconds 177: Numerical Statistics: 177: Matrix range [1e-01,4e+03] 177: Objective range [1e+00,1e+00] 177: Bounds range [1e+00,1e+03] 177: RHS range [1e+00,4e+03] 177: Dynamism Variables: 4e+03 177: Dynamism Rows : 4e+03 177: set presolve.componentsmaxint = -1 177: set presolve.detectlindep = 0 177: set doubletoneq.enabled = 0 177: set dualinfer.enabled = 0 177: set substitution.enabled = 0 177: set sparsify.enabled = 0 177: 177: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/vtp-base.mps with dual-postsolve activated 177: rows: 198 177: columns: 203 177: int. columns: 0 177: cont. columns: 203 177: nonzeros: 908 177: 177: round 0 ( Trivial ): 21 del cols, 32 del rows, 24 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 177: round 1 ( Fast ): 53 del cols, 105 del rows, 110 chg bounds, 0 chg sides, 0 chg coeffs, 180 tsx applied, 0 tsx conflicts 177: round 2 ( Fast ): 85 del cols, 144 del rows, 154 chg bounds, 0 chg sides, 0 chg coeffs, 200 tsx applied, 0 tsx conflicts 177: round 3 ( Medium ): 125 del cols, 149 del rows, 160 chg bounds, 2 chg sides, 1 chg coeffs, 213 tsx applied, 108 tsx conflicts 177: round 4 (Exhaustive): 125 del cols, 149 del rows, 164 chg bounds, 2 chg sides, 1 chg coeffs, 221 tsx applied, 108 tsx conflicts 177: round 5 ( Final ): 125 del cols, 149 del rows, 168 chg bounds, 2 chg sides, 1 chg coeffs, 229 tsx applied, 108 tsx conflicts 177: presolved 5 rounds: 125 del cols, 149 del rows, 168 chg bounds, 2 chg sides, 1 chg coeffs, 229 tsx applied, 108 tsx conflicts 177: 177: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 177: colsingleton 5 0.0 0 0.0 0.000 177: coefftightening 0 0.0 0 0.0 0.000 177: propagation 5 100.0 224 100.0 0.000 177: fixcontinuous 2 0.0 0 0.0 0.000 177: simpleprobing 0 0.0 0 0.0 0.000 177: parallelrows 1 0.0 0 0.0 0.000 177: parallelcols 1 0.0 0 0.0 0.000 177: stuffing 2 50.0 113 4.4 0.000 177: dualfix 2 0.0 0 0.0 0.000 177: simplifyineq 0 0.0 0 0.0 0.000 177: doubletoneq 0 0.0 0 0.0 0.000 177: implint 0 0.0 0 0.0 0.000 177: domcol 1 0.0 0 0.0 0.000 177: dualinfer 0 0.0 0 0.0 0.000 177: probing 0 0.0 0 0.0 0.000 177: substitution 0 0.0 0 0.0 0.000 177: sparsify 0 0.0 0 0.0 0.000 177: 177: reduced problem: 177: reduced rows: 49 177: reduced columns: 78 177: reduced int. columns: 0 177: reduced cont. columns: 78 177: reduced nonzeros: 227 177: 177: presolving finished after 0.007 seconds 177: 177: Equilibrium scaling LP (persistent) 177: Simplifier removed 1 rows, 1 columns, 3 nonzeros, 11 col bounds, 2 row bounds 177: Reduced LP has 48 rows 77 columns 224 nonzeros 177: Equilibrium scaling LP 177: type | time | iters | facts | shift | viol sum | viol num | obj value 177: L | 0.0 | 0 | 3 | 4.73e+02 | 2.40e+03 | 36 | 4.11541090e+04 177: E | 0.0 | 50 | 4 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 177: E | 0.0 | 50 | 4 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 177: --- unscaling internal solution 177: --- unsimplifying solution and basis 177: --- unscaling external solution 177: --- verifying computed solution 177: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 177: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 177: --- unscaling external solution 177: --- verifying computed solution 177: 177: SoPlex status : problem is solved [optimal] 177: Solving time (sec) : 0.00 177: Iterations : 50 177: Objective value : 1.29831462e+05 177: 177: Solution passed validation 177: 177: postsolve finished after 0.000 seconds 177: feasible: true 177: objective value: 129831.462461361 177: 177: violations: 177: bounds: 0 177: constraints: 0 177: integrality: 0 177: 177: validation: SUCCESS 177: Solving time 0.019 seconds 177: 177: solving finished after 0.019 seconds 174/287 Test #177: d-solve-vtp-base.mps-lp_presolvers_with_basis.set .......................................... Passed 0.08 sec test 178 Start 178: q-solve-vtp-base.mps-lp_presolvers_with_basis.set 178: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/vtp-base.mps" "-o" "0.1298314624613613657395984384889e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 178: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 178: Test timeout computed to be: 10000000 175: Simplifier removed 124 rows, 124 columns, 248 nonzeros, 110 col bounds, 248 row bounds 175: Reduced LP has 363 rows 1324 columns 2654 nonzeros 175: Equilibrium scaling LP 175: type | time | iters | facts | shift | viol sum | viol num | obj value 175: L | 0.0 | 0 | 3 | 6.24e+02 | 9.67e+05 | 166 | 3.86023100e+06 175: L | 0.0 | 199 | 3 | 6.24e+02 | 8.46e+05 | 166 | 1.18702586e+09 175: L | 0.0 | 399 | 4 | 6.24e+02 | 3.22e+04 | 140 | 1.20659973e+09 167: 167: SoPlex status : problem is solved [optimal] 167: Solving time (sec) : 0.00 167: Iterations : 1 167: Objective value : 1.57116000e+04 167: 167: Solution passed validation 167: 167: postsolve finished after 0.146 seconds 167: feasible: true 167: objective value: 15711.6 167: 167: violations: 167: bounds: 0 167: constraints: 0 167: integrality: 0 167: 167: validation: SUCCESS 167: Solving time 0.832 seconds 167: 167: solving finished after 0.832 seconds 175/287 Test #167: r-solve-seba.mps-lp_presolvers_with_basis.set .............................................. Passed 1.10 sec test 179 Start 179: r-solve-vtp-base.mps-lp_presolvers_with_basis.set 179: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/vtp-base.mps" "-o" "0.1298314624613613657395984384889e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 179: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 179: Test timeout computed to be: 10000000 178: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 178: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 178: 178: External libraries: 178: Boost 1.83.0 (https://www.boost.org/) 178: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 178: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 178: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 178: 178: reading took 0.0352 seconds 178: Numerical Statistics: 178: Matrix range [1e-01,4e+03] 178: Objective range [1e+00,1e+00] 178: Bounds range [1e+00,1e+03] 178: RHS range [1e+00,4e+03] 178: Dynamism Variables: 4e+03 178: Dynamism Rows : 4e+03 178: set presolve.componentsmaxint = -1 178: set presolve.detectlindep = 0 178: set doubletoneq.enabled = 0 178: set dualinfer.enabled = 0 178: set substitution.enabled = 0 178: set sparsify.enabled = 0 178: 178: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/vtp-base.mps with dual-postsolve activated 178: rows: 198 178: columns: 203 178: int. columns: 0 178: cont. columns: 203 178: nonzeros: 908 178: 178: round 0 ( Trivial ): 21 del cols, 32 del rows, 24 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 178: round 1 ( Fast ): 53 del cols, 105 del rows, 110 chg bounds, 0 chg sides, 0 chg coeffs, 180 tsx applied, 0 tsx conflicts 178: round 2 ( Fast ): 85 del cols, 144 del rows, 154 chg bounds, 0 chg sides, 0 chg coeffs, 200 tsx applied, 0 tsx conflicts 178: round 3 ( Medium ): 125 del cols, 149 del rows, 160 chg bounds, 2 chg sides, 1 chg coeffs, 213 tsx applied, 108 tsx conflicts 178: round 4 (Exhaustive): 125 del cols, 149 del rows, 164 chg bounds, 2 chg sides, 1 chg coeffs, 221 tsx applied, 108 tsx conflicts 178: round 5 ( Final ): 125 del cols, 149 del rows, 168 chg bounds, 2 chg sides, 1 chg coeffs, 229 tsx applied, 108 tsx conflicts 178: presolved 5 rounds: 125 del cols, 149 del rows, 168 chg bounds, 2 chg sides, 1 chg coeffs, 229 tsx applied, 108 tsx conflicts 178: 178: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 178: colsingleton 5 0.0 0 0.0 0.000 178: coefftightening 0 0.0 0 0.0 0.000 178: propagation 5 100.0 224 100.0 0.012 178: fixcontinuous 2 0.0 0 0.0 0.000 178: simpleprobing 0 0.0 0 0.0 0.000 178: parallelrows 1 0.0 0 0.0 0.000 178: parallelcols 1 0.0 0 0.0 0.001 178: stuffing 2 50.0 113 4.4 0.001 178: dualfix 2 0.0 0 0.0 0.000 178: simplifyineq 0 0.0 0 0.0 0.000 178: doubletoneq 0 0.0 0 0.0 0.000 178: implint 0 0.0 0 0.0 0.000 178: domcol 1 0.0 0 0.0 0.003 178: dualinfer 0 0.0 0 0.0 0.000 178: probing 0 0.0 0 0.0 0.000 178: substitution 0 0.0 0 0.0 0.000 178: sparsify 0 0.0 0 0.0 0.000 178: 178: reduced problem: 178: reduced rows: 49 178: reduced columns: 78 178: reduced int. columns: 0 178: reduced cont. columns: 78 178: reduced nonzeros: 227 178: 178: presolving finished after 0.037 seconds 178: 178: Equilibrium scaling LP (persistent) 178: Simplifier removed 1 rows, 1 columns, 3 nonzeros, 11 col bounds, 2 row bounds 178: Reduced LP has 48 rows 77 columns 224 nonzeros 178: Equilibrium scaling LP 178: type | time | iters | facts | shift | viol sum | viol num | obj value 178: L | 0.0 | 0 | 3 | 4.73e+02 | 2.40e+03 | 36 | 4.11541090e+04 178: E | 0.0 | 50 | 4 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 178: E | 0.0 | 50 | 4 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 178: --- unscaling internal solution 178: --- unsimplifying solution and basis 178: --- unscaling external solution 178: --- verifying computed solution 178: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 178: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 178: --- unscaling external solution 178: --- verifying computed solution 175: E | 0.1 | 517 | 6 | 0.00e+00 | 1.44e+02 | 2 | 1.20884428e+09 175: E | 0.1 | 517 | 6 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 175: --- unscaling internal solution 175: --- unsimplifying solution and basis 175: --- unscaling external solution 175: --- verifying computed solution 175: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 175: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 175: --- unscaling external solution 175: --- verifying computed solution 178: 178: SoPlex status : problem is solved [optimal] 178: Solving time (sec) : 0.00 178: Iterations : 50 178: Objective value : 1.29831462e+05 178: 178: Solution passed validation 178: 178: postsolve finished after 0.040 seconds 178: feasible: true 178: objective value: 129831.462461361 178: 178: violations: 178: bounds: 0 178: constraints: 0 178: integrality: 0 178: 178: validation: SUCCESS 178: Solving time 0.082 seconds 178: 178: solving finished after 0.082 seconds 176/287 Test #178: q-solve-vtp-base.mps-lp_presolvers_with_basis.set .......................................... Passed 0.18 sec test 180 Start 180: d-solve-adlittle.mps-lp_presolvers_without_basis.set 180: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/adlittle.mps" "-o" "0.22549496316238038228101176621492e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 180: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 180: Test timeout computed to be: 10000000 180: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 180: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 180: 180: External libraries: 180: Boost 1.83.0 (https://www.boost.org/) 180: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 180: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 180: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 180: 180: reading took 0.0123 seconds 180: Numerical Statistics: 180: Matrix range [1e-02,6e+01] 180: Objective range [2e+00,3e+03] 180: Bounds range [0e+00,0e+00] 180: RHS range [2e+00,2e+03] 180: Dynamism Variables: 2e+03 180: Dynamism Rows : 8e+02 180: set presolve.componentsmaxint = -1 180: set presolve.detectlindep = 0 180: set doubletoneq.enabled = 0 180: set dualinfer.enabled = 0 180: set substitution.enabled = 0 180: set sparsify.enabled = 0 180: set calculate_basis_for_dual = 0 180: 180: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/adlittle.mps with dual-postsolve activated 180: rows: 56 180: columns: 97 180: int. columns: 0 180: cont. columns: 97 180: nonzeros: 383 180: 180: round 0 ( Trivial ): 2 del cols, 3 del rows, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 180: round 1 ( Fast ): 2 del cols, 3 del rows, 90 chg bounds, 0 chg sides, 0 chg coeffs, 194 tsx applied, 0 tsx conflicts 180: round 2 ( Fast ): 2 del cols, 3 del rows, 108 chg bounds, 0 chg sides, 0 chg coeffs, 236 tsx applied, 0 tsx conflicts 180: round 3 ( Medium ): 3 del cols, 3 del rows, 113 chg bounds, 1 chg sides, 1 chg coeffs, 248 tsx applied, 2 tsx conflicts 180: round 4 (Exhaustive): 3 del cols, 3 del rows, 113 chg bounds, 1 chg sides, 1 chg coeffs, 248 tsx applied, 2 tsx conflicts 180: round 5 ( Final ): Unchanged 180: presolved 5 rounds: 3 del cols, 3 del rows, 113 chg bounds, 1 chg sides, 1 chg coeffs, 248 tsx applied, 2 tsx conflicts 180: 180: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 180: colsingleton 5 0.0 0 0.0 0.000 180: coefftightening 0 0.0 0 0.0 0.000 180: propagation 5 60.0 246 100.0 0.000 180: fixcontinuous 2 0.0 0 0.0 0.000 180: simpleprobing 0 0.0 0 0.0 0.000 180: parallelrows 1 0.0 0 0.0 0.000 180: parallelcols 1 0.0 0 0.0 0.000 180: stuffing 2 50.0 3 33.3 0.000 180: dualfix 2 50.0 1 100.0 0.000 180: simplifyineq 0 0.0 0 0.0 0.000 180: doubletoneq 0 0.0 0 0.0 0.000 180: implint 0 0.0 0 0.0 0.000 180: domcol 1 0.0 0 0.0 0.000 180: dualinfer 0 0.0 0 0.0 0.000 180: probing 0 0.0 0 0.0 0.000 180: substitution 0 0.0 0 0.0 0.000 180: sparsify 0 0.0 0 0.0 0.000 180: 180: reduced problem: 180: reduced rows: 53 180: reduced columns: 94 180: reduced int. columns: 0 179: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 179: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 179: 179: External libraries: 179: Boost 1.83.0 (https://www.boost.org/) 179: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 179: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 179: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 179: 179: reading took 0.018 seconds 179: Numerical Statistics: 179: Matrix range [1e-01,4e+03] 179: Objective range [1e+00,1e+00] 179: Bounds range [1e+00,1e+03] 179: RHS range [1e+00,4e+03] 179: Dynamism Variables: 4e+03 179: Dynamism Rows : 4e+03 179: set presolve.componentsmaxint = -1 179: set presolve.detectlindep = 0 179: set doubletoneq.enabled = 0 179: set dualinfer.enabled = 0 179: set substitution.enabled = 0 179: set sparsify.enabled = 0 179: 179: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/vtp-base.mps with dual-postsolve activated 179: rows: 198 179: columns: 203 179: int. columns: 0 179: cont. columns: 203 179: nonzeros: 908 179: 179: round 0 ( Trivial ): 21 del cols, 32 del rows, 24 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 179: round 1 ( Fast ): 53 del cols, 105 del rows, 110 chg bounds, 0 chg sides, 0 chg coeffs, 180 tsx applied, 0 tsx conflicts 179: round 2 ( Fast ): 85 del cols, 144 del rows, 154 chg bounds, 0 chg sides, 0 chg coeffs, 200 tsx applied, 0 tsx conflicts 179: round 3 ( Medium ): 125 del cols, 149 del rows, 160 chg bounds, 2 chg sides, 1 chg coeffs, 213 tsx applied, 108 tsx conflicts 179: round 4 (Exhaustive): 125 del cols, 149 del rows, 164 chg bounds, 2 chg sides, 1 chg coeffs, 221 tsx applied, 108 tsx conflicts 179: round 5 ( Final ): 125 del cols, 149 del rows, 168 chg bounds, 2 chg sides, 1 chg coeffs, 229 tsx applied, 108 tsx conflicts 179: presolved 5 rounds: 125 del cols, 149 del rows, 168 chg bounds, 2 chg sides, 1 chg coeffs, 229 tsx applied, 108 tsx conflicts 179: 179: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 179: colsingleton 5 0.0 0 0.0 0.000 179: coefftightening 0 0.0 0 0.0 0.000 179: propagation 5 100.0 224 100.0 0.009 179: fixcontinuous 2 0.0 0 0.0 0.000 179: simpleprobing 0 0.0 0 0.0 0.000 179: parallelrows 1 0.0 0 0.0 0.001 179: parallelcols 1 0.0 0 0.0 0.001 179: stuffing 2 50.0 113 4.4 0.001 179: dualfix 2 0.0 0 0.0 0.000 179: simplifyineq 0 0.0 0 0.0 0.000 179: doubletoneq 0 0.0 0 0.0 0.000 179: implint 0 0.0 0 0.0 0.000 179: domcol 1 0.0 0 0.0 0.002 179: dualinfer 0 0.0 0 0.0 0.000 179: probing 0 0.0 0 0.0 0.000 179: substitution 0 0.0 0 0.0 0.000 179: sparsify 0 0.0 0 0.0 0.000 179: 179: reduced problem: 179: reduced rows: 49 179: reduced columns: 78 179: reduced int. columns: 0 179: reduced cont. columns: 78 179: reduced nonzeros: 227 179: 179: presolving finished after 0.068 seconds 179: 179: Equilibrium scaling LP (persistent) 179: Simplifier removed 1 rows, 1 columns, 3 nonzeros, 11 col bounds, 2 row bounds 179: Reduced LP has 48 rows 77 columns 224 nonzeros 179: Equilibrium scaling LP 179: type | time | iters | facts | shift | viol sum | viol num | obj value 179: L | 0.0 | 0 | 3 | 4.73e+02 | 2.40e+03 | 36 | 4.11541090e+04 179: E | 0.0 | 50 | 4 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 179: E | 0.0 | 50 | 4 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 179: --- unscaling internal solution 179: --- unsimplifying solution and basis 179: --- unscaling external solution 179: --- verifying computed solution 179: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 179: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 179: --- unscaling external solution 179: --- verifying computed solution 180: reduced cont. columns: 94 180: reduced nonzeros: 372 180: 180: presolving finished after 0.019 seconds 180: 180: Equilibrium scaling LP (persistent) 180: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 180: Reduced LP has 53 rows 94 columns 372 nonzeros 180: Equilibrium scaling LP 180: type | time | iters | facts | shift | viol sum | viol num | obj value 180: L | 0.0 | 0 | 3 | 0.00e+00 | 1.35e+03 | 26 | -5.17823246e+05 179: 179: SoPlex status : problem is solved [optimal] 179: Solving time (sec) : 0.00 179: Iterations : 50 179: Objective value : 1.29831462e+05 179: 179: Solution passed validation 179: 179: postsolve finished after 0.025 seconds 179: feasible: true 179: objective value: 129831.462461361 179: 179: violations: 179: bounds: 0 179: constraints: 0 179: integrality: 0 179: 179: validation: SUCCESS 179: Solving time 0.102 seconds 179: 179: solving finished after 0.102 seconds 175: 175: SoPlex status : problem is solved [optimal] 175: Solving time (sec) : 0.08 175: Iterations : 517 175: Objective value : 1.20882535e+09 175: 175: Solution passed validation 175: 175: postsolve finished after 0.077 seconds 175: feasible: true 175: objective value: 1208825346 175: 175: violations: 175: bounds: 0 175: constraints: 0 175: integrality: 0 175: 175: validation: SUCCESS 175: Solving time 0.496 seconds 175: 175: solving finished after 0.496 seconds 180: L | 0.0 | 133 | 5 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 180: --- unscaling internal solution 180: --- unsimplifying solution and basis 180: --- unscaling external solution 180: --- verifying computed solution 180: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 180: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 180: --- unscaling external solution 180: --- verifying computed solution 177/287 Test #175: q-solve-shell.mps-lp_presolvers_with_basis.set ............................................. Passed 0.76 sec 178/287 Test #179: r-solve-vtp-base.mps-lp_presolvers_with_basis.set .......................................... Passed 0.21 sec test 181 Start 181: q-solve-adlittle.mps-lp_presolvers_without_basis.set 181: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/adlittle.mps" "-o" "0.22549496316238038228101176621492e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 181: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 181: Test timeout computed to be: 10000000 test 182 Start 182: r-solve-adlittle.mps-lp_presolvers_without_basis.set 182: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/adlittle.mps" "-o" "0.22549496316238038228101176621492e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 182: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 182: Test timeout computed to be: 10000000 180: 180: SoPlex status : problem is solved [optimal] 180: Solving time (sec) : 0.02 180: Iterations : 133 180: Objective value : 2.25494963e+05 180: 180: Solution passed validation 180: 180: postsolve finished after 0.000 seconds 180: feasible: true 180: objective value: 225494.96316238 180: 180: violations: 180: bounds: 0 180: constraints: 0 180: integrality: 0 180: 180: validation: SUCCESS 180: Solving time 0.057 seconds 180: 180: solving finished after 0.057 seconds 176: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 176: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 176: 176: External libraries: 176: Boost 1.83.0 (https://www.boost.org/) 176: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 176: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 176: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 176: 176: reading took 0.141 seconds 176: Numerical Statistics: 176: Matrix range [1e+00,1e+00] 176: Objective range [1e+00,4e+03] 176: Bounds range [6e+00,5e+05] 176: RHS range [4e+04,5e+04] 176: Dynamism Variables: 1e+00 176: Dynamism Rows : 1e+00 176: set presolve.componentsmaxint = -1 176: set presolve.detectlindep = 0 176: set doubletoneq.enabled = 0 176: set dualinfer.enabled = 0 176: set substitution.enabled = 0 176: set sparsify.enabled = 0 176: 176: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/shell.mps with dual-postsolve activated 176: rows: 536 176: columns: 1775 176: int. columns: 0 176: cont. columns: 1775 176: nonzeros: 3556 176: 176: round 0 ( Trivial ): 290 del cols, 40 del rows, 80 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 176: round 1 ( Fast ): 297 del cols, 47 del rows, 908 chg bounds, 0 chg sides, 0 chg coeffs, 1694 tsx applied, 0 tsx conflicts 176: round 2 (Exhaustive): 327 del cols, 49 del rows, 1039 chg bounds, 0 chg sides, 0 chg coeffs, 1928 tsx applied, 0 tsx conflicts 176: round 3 (Exhaustive): 327 del cols, 49 del rows, 1092 chg bounds, 0 chg sides, 0 chg coeffs, 2034 tsx applied, 0 tsx conflicts 176: round 4 ( Final ): 327 del cols, 49 del rows, 1136 chg bounds, 0 chg sides, 0 chg coeffs, 2122 tsx applied, 0 tsx conflicts 176: presolved 4 rounds: 327 del cols, 49 del rows, 1136 chg bounds, 0 chg sides, 0 chg coeffs, 2122 tsx applied, 0 tsx conflicts 176: 176: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 176: colsingleton 4 0.0 0 0.0 0.000 176: coefftightening 0 0.0 0 0.0 0.000 176: propagation 4 100.0 2094 100.0 0.057 176: fixcontinuous 2 0.0 0 0.0 0.002 176: simpleprobing 0 0.0 0 0.0 0.000 176: parallelrows 1 0.0 0 0.0 0.012 176: parallelcols 2 50.0 3 100.0 0.047 176: stuffing 2 0.0 0 0.0 0.000 176: dualfix 2 0.0 0 0.0 0.009 176: simplifyineq 0 0.0 0 0.0 0.000 176: doubletoneq 0 0.0 0 0.0 0.000 176: implint 0 0.0 0 0.0 0.000 176: domcol 2 50.0 25 100.0 0.103 176: dualinfer 0 0.0 0 0.0 0.000 176: probing 0 0.0 0 0.0 0.000 176: substitution 0 0.0 0 0.0 0.000 176: sparsify 0 0.0 0 0.0 0.000 176: 176: reduced problem: 176: reduced rows: 487 176: reduced columns: 1448 176: reduced int. columns: 0 176: reduced cont. columns: 1448 176: reduced nonzeros: 2902 176: 176: presolving finished after 0.441 seconds 176: 176: Equilibrium scaling LP (persistent) 179/287 Test #180: d-solve-adlittle.mps-lp_presolvers_without_basis.set ....................................... Passed 0.18 sec test 183 Start 183: d-solve-afiro.mps-lp_presolvers_without_basis.set 183: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/afiro.mps" "-o" "-0.46475314285714285714285714285714e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 183: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 183: Test timeout computed to be: 10000000 181: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 181: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 181: 181: External libraries: 181: Boost 1.83.0 (https://www.boost.org/) 181: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 181: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 181: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 181: 181: reading took 0.0123 seconds 181: Numerical Statistics: 181: Matrix range [1e-02,6e+01] 181: Objective range [2e+00,3e+03] 181: Bounds range [0e+00,0e+00] 181: RHS range [2e+00,2e+03] 181: Dynamism Variables: 2e+03 181: Dynamism Rows : 8e+02 181: set presolve.componentsmaxint = -1 181: set presolve.detectlindep = 0 181: set doubletoneq.enabled = 0 181: set dualinfer.enabled = 0 181: set substitution.enabled = 0 181: set sparsify.enabled = 0 181: set calculate_basis_for_dual = 0 181: 181: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/adlittle.mps with dual-postsolve activated 181: rows: 56 181: columns: 97 181: int. columns: 0 181: cont. columns: 97 181: nonzeros: 383 181: 181: round 0 ( Trivial ): 2 del cols, 3 del rows, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 181: round 1 ( Fast ): 2 del cols, 3 del rows, 90 chg bounds, 0 chg sides, 0 chg coeffs, 194 tsx applied, 0 tsx conflicts 181: round 2 ( Fast ): 2 del cols, 3 del rows, 108 chg bounds, 0 chg sides, 0 chg coeffs, 236 tsx applied, 0 tsx conflicts 181: round 3 ( Medium ): 3 del cols, 3 del rows, 113 chg bounds, 1 chg sides, 1 chg coeffs, 248 tsx applied, 2 tsx conflicts 181: round 4 (Exhaustive): 3 del cols, 3 del rows, 113 chg bounds, 1 chg sides, 1 chg coeffs, 248 tsx applied, 2 tsx conflicts 181: round 5 ( Final ): Unchanged 181: presolved 5 rounds: 3 del cols, 3 del rows, 113 chg bounds, 1 chg sides, 1 chg coeffs, 248 tsx applied, 2 tsx conflicts 181: 181: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 181: colsingleton 5 0.0 0 0.0 0.000 181: coefftightening 0 0.0 0 0.0 0.000 181: propagation 5 60.0 246 100.0 0.006 181: fixcontinuous 2 0.0 0 0.0 0.005 181: simpleprobing 0 0.0 0 0.0 0.000 181: parallelrows 1 0.0 0 0.0 0.000 181: parallelcols 1 0.0 0 0.0 0.000 181: stuffing 2 50.0 3 33.3 0.000 181: dualfix 2 50.0 1 100.0 0.000 181: simplifyineq 0 0.0 0 0.0 0.000 181: doubletoneq 0 0.0 0 0.0 0.000 181: implint 0 0.0 0 0.0 0.000 181: domcol 1 0.0 0 0.0 0.001 181: dualinfer 0 0.0 0 0.0 0.000 181: probing 0 0.0 0 0.0 0.000 181: substitution 0 0.0 0 0.0 0.000 181: sparsify 0 0.0 0 0.0 0.000 181: 181: reduced problem: 181: reduced rows: 53 181: reduced columns: 94 181: reduced int. columns: 0 181: reduced cont. columns: 94 181: reduced nonzeros: 372 181: 181: presolving finished after 0.023 seconds 181: 181: Equilibrium scaling LP (persistent) 181: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 181: Reduced LP has 53 rows 94 columns 372 nonzeros 181: Equilibrium scaling LP 181: type | time | iters | facts | shift | viol sum | viol num | obj value 181: L | 0.0 | 0 | 3 | 0.00e+00 | 1.35e+03 | 26 | -5.17823246e+05 176: Simplifier removed 124 rows, 124 columns, 248 nonzeros, 110 col bounds, 248 row bounds 176: Reduced LP has 363 rows 1324 columns 2654 nonzeros 176: Equilibrium scaling LP 176: type | time | iters | facts | shift | viol sum | viol num | obj value 176: L | 0.0 | 0 | 3 | 6.24e+02 | 9.67e+05 | 166 | 3.86023100e+06 181: L | 0.0 | 131 | 5 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 181: --- unscaling internal solution 181: --- unsimplifying solution and basis 181: --- unscaling external solution 181: --- verifying computed solution 181: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 181: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 181: --- unscaling external solution 181: --- verifying computed solution 183: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 183: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 183: 183: External libraries: 183: Boost 1.83.0 (https://www.boost.org/) 183: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 183: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 183: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 183: 183: reading took 0.000635 seconds 183: Numerical Statistics: 183: Matrix range [1e-01,2e+00] 183: Objective range [3e-01,1e+01] 183: Bounds range [0e+00,0e+00] 183: RHS range [4e+01,5e+02] 183: Dynamism Variables: 9e+00 183: Dynamism Rows : 9e+00 183: set presolve.componentsmaxint = -1 183: set presolve.detectlindep = 0 183: set doubletoneq.enabled = 0 183: set dualinfer.enabled = 0 183: set substitution.enabled = 0 183: set sparsify.enabled = 0 183: set calculate_basis_for_dual = 0 183: 183: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/afiro.mps with dual-postsolve activated 183: rows: 27 183: columns: 32 183: int. columns: 0 183: cont. columns: 32 183: nonzeros: 83 183: 183: round 0 ( Trivial ): 0 del cols, 2 del rows, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 183: round 1 ( Fast ): 0 del cols, 3 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 22 tsx applied, 0 tsx conflicts 183: round 2 ( Fast ): 0 del cols, 3 del rows, 29 chg bounds, 0 chg sides, 0 chg coeffs, 58 tsx applied, 0 tsx conflicts 183: round 3 ( Fast ): 0 del cols, 4 del rows, 42 chg bounds, 0 chg sides, 0 chg coeffs, 84 tsx applied, 0 tsx conflicts 183: round 4 ( Medium ): 4 del cols, 6 del rows, 45 chg bounds, 1 chg sides, 1 chg coeffs, 93 tsx applied, 9 tsx conflicts 183: round 5 (Exhaustive): 4 del cols, 6 del rows, 45 chg bounds, 1 chg sides, 1 chg coeffs, 93 tsx applied, 9 tsx conflicts 183: round 6 ( Final ): Unchanged 183: presolved 6 rounds: 4 del cols, 6 del rows, 45 chg bounds, 1 chg sides, 1 chg coeffs, 93 tsx applied, 9 tsx conflicts 183: 183: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 183: colsingleton 6 0.0 0 0.0 0.000 183: coefftightening 0 0.0 0 0.0 0.000 183: propagation 6 66.7 86 100.0 0.000 183: fixcontinuous 2 0.0 0 0.0 0.000 183: simpleprobing 0 0.0 0 0.0 0.000 183: parallelrows 1 0.0 0 0.0 0.000 183: parallelcols 1 0.0 0 0.0 0.000 183: stuffing 2 50.0 14 35.7 0.000 183: dualfix 2 50.0 2 100.0 0.000 183: simplifyineq 0 0.0 0 0.0 0.000 183: doubletoneq 0 0.0 0 0.0 0.000 183: implint 0 0.0 0 0.0 0.000 183: domcol 1 0.0 0 0.0 0.000 183: dualinfer 0 0.0 0 0.0 0.000 183: probing 0 0.0 0 0.0 0.000 183: substitution 0 0.0 0 0.0 0.000 183: sparsify 0 0.0 0 0.0 0.000 183: 183: reduced problem: 183: reduced rows: 21 183: reduced columns: 28 183: reduced int. columns: 0 183: reduced cont. columns: 28 183: reduced nonzeros: 71 183: 183: presolving finished after 0.010 seconds 183: 183: Equilibrium scaling LP (persistent) 183: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 183: Reduced LP has 21 rows 28 columns 71 nonzeros 183: Equilibrium scaling LP 183: type | time | iters | facts | shift | viol sum | viol num | obj value 183: L | 0.0 | 0 | 3 | 0.00e+00 | 3.28e+03 | 9 | -1.46035651e+04 183: L | 0.0 | 12 | 4 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 183: --- unscaling internal solution 183: --- unsimplifying solution and basis 183: --- unscaling external solution 183: --- verifying computed solution 183: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 183: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 183: --- unscaling external solution 183: --- verifying computed solution 183: 183: SoPlex status : problem is solved [optimal] 183: Solving time (sec) : 0.00 183: Iterations : 12 183: Objective value : -4.64753143e+02 183: 183: Solution passed validation 183: 183: postsolve finished after 0.000 seconds 183: feasible: true 183: objective value: -464.753142857143 183: 183: violations: 183: bounds: 0 183: constraints: 0 183: integrality: 0 183: 183: validation: SUCCESS 183: Solving time 0.011 seconds 183: 183: solving finished after 0.011 seconds 181: 181: SoPlex status : problem is solved [optimal] 181: Solving time (sec) : 0.00 181: Iterations : 131 181: Objective value : 2.25494963e+05 181: 181: Solution passed validation 181: 181: postsolve finished after 0.008 seconds 181: feasible: true 181: objective value: 225494.96316238 181: 181: violations: 181: bounds: 0 181: constraints: 0 181: integrality: 0 181: 181: validation: SUCCESS 181: Solving time 0.053 seconds 181: 181: solving finished after 0.053 seconds 180/287 Test #181: q-solve-adlittle.mps-lp_presolvers_without_basis.set ....................................... Passed 0.14 sec 181/287 Test #183: d-solve-afiro.mps-lp_presolvers_without_basis.set .......................................... Passed 0.09 sec test 184 Start 184: q-solve-afiro.mps-lp_presolvers_without_basis.set 184: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/afiro.mps" "-o" "-0.46475314285714285714285714285714e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 184: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 184: Test timeout computed to be: 10000000 test 185 Start 185: r-solve-afiro.mps-lp_presolvers_without_basis.set 185: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/afiro.mps" "-o" "-0.46475314285714285714285714285714e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 185: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 185: Test timeout computed to be: 10000000 182: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 182: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 182: 182: External libraries: 182: Boost 1.83.0 (https://www.boost.org/) 182: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 182: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 182: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 182: 182: reading took 0.0135 seconds 182: Numerical Statistics: 182: Matrix range [1e-02,6e+01] 182: Objective range [2e+00,3e+03] 182: Bounds range [0e+00,0e+00] 182: RHS range [2e+00,2e+03] 182: Dynamism Variables: 2e+03 182: Dynamism Rows : 8e+02 182: set presolve.componentsmaxint = -1 182: set presolve.detectlindep = 0 182: set doubletoneq.enabled = 0 182: set dualinfer.enabled = 0 182: set substitution.enabled = 0 182: set sparsify.enabled = 0 182: set calculate_basis_for_dual = 0 182: 182: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/adlittle.mps with dual-postsolve activated 182: rows: 56 182: columns: 97 182: int. columns: 0 182: cont. columns: 97 182: nonzeros: 383 182: 182: round 0 ( Trivial ): 2 del cols, 3 del rows, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 182: round 1 ( Fast ): 2 del cols, 3 del rows, 90 chg bounds, 0 chg sides, 0 chg coeffs, 194 tsx applied, 0 tsx conflicts 182: round 2 ( Fast ): 2 del cols, 3 del rows, 108 chg bounds, 0 chg sides, 0 chg coeffs, 236 tsx applied, 0 tsx conflicts 182: round 3 ( Medium ): 3 del cols, 3 del rows, 113 chg bounds, 1 chg sides, 1 chg coeffs, 248 tsx applied, 2 tsx conflicts 182: round 4 (Exhaustive): 3 del cols, 3 del rows, 113 chg bounds, 1 chg sides, 1 chg coeffs, 248 tsx applied, 2 tsx conflicts 182: round 5 ( Final ): Unchanged 182: presolved 5 rounds: 3 del cols, 3 del rows, 113 chg bounds, 1 chg sides, 1 chg coeffs, 248 tsx applied, 2 tsx conflicts 182: 182: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 182: colsingleton 5 0.0 0 0.0 0.000 182: coefftightening 0 0.0 0 0.0 0.000 182: propagation 5 60.0 246 100.0 0.009 182: fixcontinuous 2 0.0 0 0.0 0.000 182: simpleprobing 0 0.0 0 0.0 0.000 182: parallelrows 1 0.0 0 0.0 0.001 182: parallelcols 1 0.0 0 0.0 0.001 182: stuffing 2 50.0 3 33.3 0.000 182: dualfix 2 50.0 1 100.0 0.001 182: simplifyineq 0 0.0 0 0.0 0.000 182: doubletoneq 0 0.0 0 0.0 0.000 182: implint 0 0.0 0 0.0 0.000 182: domcol 1 0.0 0 0.0 0.002 182: dualinfer 0 0.0 0 0.0 0.000 182: probing 0 0.0 0 0.0 0.000 182: substitution 0 0.0 0 0.0 0.000 182: sparsify 0 0.0 0 0.0 0.000 182: 182: reduced problem: 182: reduced rows: 53 182: reduced columns: 94 182: reduced int. columns: 0 182: reduced cont. columns: 94 182: reduced nonzeros: 372 182: 182: presolving finished after 0.057 seconds 182: 182: Equilibrium scaling LP (persistent) 182: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 182: Reduced LP has 53 rows 94 columns 372 nonzeros 182: Equilibrium scaling LP 182: type | time | iters | facts | shift | viol sum | viol num | obj value 182: L | 0.0 | 0 | 3 | 0.00e+00 | 1.35e+03 | 26 | -5.17823246e+05 182: L | 0.0 | 133 | 5 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 182: --- unscaling internal solution 182: --- unsimplifying solution and basis 182: --- unscaling external solution 182: --- verifying computed solution 182: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 182: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.25494963e+05 182: --- unscaling external solution 182: --- verifying computed solution 182: 182: SoPlex status : problem is solved [optimal] 182: Solving time (sec) : 0.00 182: Iterations : 133 182: Objective value : 2.25494963e+05 182: 182: Solution passed validation 182: 182: postsolve finished after 0.006 seconds 182: feasible: true 182: objective value: 225494.96316238 182: 182: violations: 182: bounds: 0 182: constraints: 0 182: integrality: 0 182: 182: validation: SUCCESS 182: Solving time 0.073 seconds 182: 182: solving finished after 0.073 seconds 176: L | 0.0 | 199 | 3 | 6.24e+02 | 8.46e+05 | 166 | 1.18702586e+09 182/287 Test #182: r-solve-adlittle.mps-lp_presolvers_without_basis.set ....................................... Passed 0.17 sec test 186 Start 186: d-solve-agg.mps-lp_presolvers_without_basis.set 186: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/agg.mps" "-o" "-0.35991767286576506712640824319636e8" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 186: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 186: Test timeout computed to be: 10000000 176: L | 0.0 | 399 | 4 | 6.24e+02 | 3.22e+04 | 140 | 1.20659973e+09 184: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 184: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 184: 184: External libraries: 184: Boost 1.83.0 (https://www.boost.org/) 184: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 184: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 184: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 184: 184: reading took 0.00104 seconds 184: Numerical Statistics: 184: Matrix range [1e-01,2e+00] 184: Objective range [3e-01,1e+01] 184: Bounds range [0e+00,0e+00] 184: RHS range [4e+01,5e+02] 184: Dynamism Variables: 9e+00 184: Dynamism Rows : 9e+00 184: set presolve.componentsmaxint = -1 184: set presolve.detectlindep = 0 184: set doubletoneq.enabled = 0 184: set dualinfer.enabled = 0 184: set substitution.enabled = 0 184: set sparsify.enabled = 0 184: set calculate_basis_for_dual = 0 184: 184: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/afiro.mps with dual-postsolve activated 184: rows: 27 184: columns: 32 184: int. columns: 0 184: cont. columns: 32 184: nonzeros: 83 184: 184: round 0 ( Trivial ): 0 del cols, 2 del rows, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 184: round 1 ( Fast ): 0 del cols, 3 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 22 tsx applied, 0 tsx conflicts 184: round 2 ( Fast ): 0 del cols, 3 del rows, 29 chg bounds, 0 chg sides, 0 chg coeffs, 58 tsx applied, 0 tsx conflicts 184: round 3 ( Fast ): 0 del cols, 4 del rows, 42 chg bounds, 0 chg sides, 0 chg coeffs, 84 tsx applied, 0 tsx conflicts 184: round 4 ( Medium ): 4 del cols, 6 del rows, 45 chg bounds, 1 chg sides, 1 chg coeffs, 93 tsx applied, 9 tsx conflicts 184: round 5 (Exhaustive): 4 del cols, 6 del rows, 45 chg bounds, 1 chg sides, 1 chg coeffs, 93 tsx applied, 9 tsx conflicts 184: round 6 ( Final ): Unchanged 184: presolved 6 rounds: 4 del cols, 6 del rows, 45 chg bounds, 1 chg sides, 1 chg coeffs, 93 tsx applied, 9 tsx conflicts 184: 184: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 184: colsingleton 6 0.0 0 0.0 0.000 184: coefftightening 0 0.0 0 0.0 0.000 184: propagation 6 66.7 86 100.0 0.001 184: fixcontinuous 2 0.0 0 0.0 0.000 184: simpleprobing 0 0.0 0 0.0 0.000 184: parallelrows 1 0.0 0 0.0 0.000 184: parallelcols 1 0.0 0 0.0 0.000 184: stuffing 2 50.0 14 35.7 0.000 184: dualfix 2 50.0 2 100.0 0.000 184: simplifyineq 0 0.0 0 0.0 0.000 184: doubletoneq 0 0.0 0 0.0 0.000 184: implint 0 0.0 0 0.0 0.000 184: domcol 1 0.0 0 0.0 0.000 184: dualinfer 0 0.0 0 0.0 0.000 184: probing 0 0.0 0 0.0 0.000 184: substitution 0 0.0 0 0.0 0.000 184: sparsify 0 0.0 0 0.0 0.000 184: 184: reduced problem: 184: reduced rows: 21 184: reduced columns: 28 184: reduced int. columns: 0 184: reduced cont. columns: 28 184: reduced nonzeros: 71 184: 184: presolving finished after 0.016 seconds 184: 184: Equilibrium scaling LP (persistent) 184: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 184: Reduced LP has 21 rows 28 columns 71 nonzeros 184: Equilibrium scaling LP 184: type | time | iters | facts | shift | viol sum | viol num | obj value 184: L | 0.0 | 0 | 3 | 0.00e+00 | 3.28e+03 | 9 | -1.46035651e+04 184: L | 0.0 | 12 | 4 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 184: --- unscaling internal solution 184: --- unsimplifying solution and basis 184: --- unscaling external solution 184: --- verifying computed solution 184: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 184: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 184: --- unscaling external solution 184: --- verifying computed solution 176: E | 0.1 | 517 | 6 | 0.00e+00 | 1.44e+02 | 2 | 1.20884428e+09 176: E | 0.1 | 517 | 6 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 176: --- unscaling internal solution 176: --- unsimplifying solution and basis 176: --- unscaling external solution 176: --- verifying computed solution 184: 184: SoPlex status : problem is solved [optimal] 184: Solving time (sec) : 0.02 184: Iterations : 12 184: Objective value : -4.64753143e+02 184: 184: Solution passed validation 184: 184: postsolve finished after 0.001 seconds 184: feasible: true 184: objective value: -464.753142857143 184: 184: violations: 184: bounds: 0 184: constraints: 0 184: integrality: 0 184: 184: validation: SUCCESS 184: Solving time 0.019 seconds 184: 184: solving finished after 0.019 seconds 176: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 176: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 176: --- unscaling external solution 176: --- verifying computed solution 183/287 Test #184: q-solve-afiro.mps-lp_presolvers_without_basis.set .......................................... Passed 0.09 sec test 187 Start 187: q-solve-agg.mps-lp_presolvers_without_basis.set 187: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/agg.mps" "-o" "-0.35991767286576506712640824319636e8" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 187: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 187: Test timeout computed to be: 10000000 185: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 185: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 185: 185: External libraries: 185: Boost 1.83.0 (https://www.boost.org/) 185: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 185: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 185: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 185: 185: reading took 0.00133 seconds 185: Numerical Statistics: 185: Matrix range [1e-01,2e+00] 185: Objective range [3e-01,1e+01] 185: Bounds range [0e+00,0e+00] 185: RHS range [4e+01,5e+02] 185: Dynamism Variables: 9e+00 185: Dynamism Rows : 9e+00 185: set presolve.componentsmaxint = -1 185: set presolve.detectlindep = 0 185: set doubletoneq.enabled = 0 185: set dualinfer.enabled = 0 185: set substitution.enabled = 0 185: set sparsify.enabled = 0 185: set calculate_basis_for_dual = 0 185: 185: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/afiro.mps with dual-postsolve activated 185: rows: 27 185: columns: 32 185: int. columns: 0 185: cont. columns: 32 185: nonzeros: 83 185: 185: round 0 ( Trivial ): 0 del cols, 2 del rows, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 185: round 1 ( Fast ): 0 del cols, 3 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 22 tsx applied, 0 tsx conflicts 185: round 2 ( Fast ): 0 del cols, 3 del rows, 29 chg bounds, 0 chg sides, 0 chg coeffs, 58 tsx applied, 0 tsx conflicts 185: round 3 ( Fast ): 0 del cols, 4 del rows, 42 chg bounds, 0 chg sides, 0 chg coeffs, 84 tsx applied, 0 tsx conflicts 185: round 4 ( Medium ): 4 del cols, 6 del rows, 45 chg bounds, 1 chg sides, 1 chg coeffs, 93 tsx applied, 9 tsx conflicts 185: round 5 (Exhaustive): 4 del cols, 6 del rows, 45 chg bounds, 1 chg sides, 1 chg coeffs, 93 tsx applied, 9 tsx conflicts 185: round 6 ( Final ): Unchanged 185: presolved 6 rounds: 4 del cols, 6 del rows, 45 chg bounds, 1 chg sides, 1 chg coeffs, 93 tsx applied, 9 tsx conflicts 185: 185: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 185: colsingleton 6 0.0 0 0.0 0.000 185: coefftightening 0 0.0 0 0.0 0.000 185: propagation 6 66.7 86 100.0 0.005 185: fixcontinuous 2 0.0 0 0.0 0.000 185: simpleprobing 0 0.0 0 0.0 0.000 185: parallelrows 1 0.0 0 0.0 0.000 185: parallelcols 1 0.0 0 0.0 0.000 185: stuffing 2 50.0 14 35.7 0.000 185: dualfix 2 50.0 2 100.0 0.005 185: simplifyineq 0 0.0 0 0.0 0.000 185: doubletoneq 0 0.0 0 0.0 0.000 185: implint 0 0.0 0 0.0 0.000 185: domcol 1 0.0 0 0.0 0.001 185: dualinfer 0 0.0 0 0.0 0.000 185: probing 0 0.0 0 0.0 0.000 185: substitution 0 0.0 0 0.0 0.000 185: sparsify 0 0.0 0 0.0 0.000 185: 185: reduced problem: 185: reduced rows: 21 185: reduced columns: 28 185: reduced int. columns: 0 185: reduced cont. columns: 28 185: reduced nonzeros: 71 185: 185: presolving finished after 0.016 seconds 185: 185: Equilibrium scaling LP (persistent) 185: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 185: Reduced LP has 21 rows 28 columns 71 nonzeros 185: Equilibrium scaling LP 185: type | time | iters | facts | shift | viol sum | viol num | obj value 185: L | 0.0 | 0 | 3 | 0.00e+00 | 3.28e+03 | 9 | -1.46035651e+04 185: L | 0.0 | 12 | 4 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 185: --- unscaling internal solution 185: --- unsimplifying solution and basis 185: --- unscaling external solution 185: --- verifying computed solution 185: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 185: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.64753143e+02 185: --- unscaling external solution 185: --- verifying computed solution 185: 185: SoPlex status : problem is solved [optimal] 185: Solving time (sec) : 0.00 185: Iterations : 12 185: Objective value : -4.64753143e+02 185: 185: Solution passed validation 185: 185: postsolve finished after 0.006 seconds 185: feasible: true 185: objective value: -464.753142857143 185: 185: violations: 185: bounds: 0 185: constraints: 0 185: integrality: 0 185: 185: validation: SUCCESS 185: Solving time 0.023 seconds 185: 185: solving finished after 0.023 seconds 184/287 Test #185: r-solve-afiro.mps-lp_presolvers_without_basis.set .......................................... Passed 0.09 sec test 188 Start 188: r-solve-agg.mps-lp_presolvers_without_basis.set 188: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/agg.mps" "-o" "-0.35991767286576506712640824319636e8" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 188: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 188: Test timeout computed to be: 10000000 186: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 186: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 186: 186: External libraries: 186: Boost 1.83.0 (https://www.boost.org/) 186: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 186: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 186: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 186: 186: reading took 0.0437 seconds 186: Numerical Statistics: 186: Matrix range [2e-05,4e+02] 186: Objective range [3e+00,1e+02] 186: Bounds range [0e+00,0e+00] 186: RHS range [1e+02,6e+06] 186: Dynamism Variables: 4e+06 186: Dynamism Rows : 3e+03 186: set presolve.componentsmaxint = -1 186: set presolve.detectlindep = 0 186: set doubletoneq.enabled = 0 186: set dualinfer.enabled = 0 186: set substitution.enabled = 0 186: set sparsify.enabled = 0 186: set calculate_basis_for_dual = 0 186: 186: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/agg.mps with dual-postsolve activated 186: rows: 488 186: columns: 163 186: int. columns: 0 186: cont. columns: 163 186: nonzeros: 2410 186: 186: round 0 ( Trivial ): 3 del cols, 80 del rows, 26 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 186: round 1 ( Fast ): 29 del cols, 288 del rows, 504 chg bounds, 0 chg sides, 0 chg coeffs, 2964 tsx applied, 0 tsx conflicts 186: round 2 ( Fast ): 54 del cols, 318 del rows, 529 chg bounds, 0 chg sides, 0 chg coeffs, 3014 tsx applied, 0 tsx conflicts 186: round 3 ( Fast ): 54 del cols, 322 del rows, 545 chg bounds, 0 chg sides, 0 chg coeffs, 3056 tsx applied, 0 tsx conflicts 186: round 4 ( Fast ): 54 del cols, 324 del rows, 558 chg bounds, 0 chg sides, 0 chg coeffs, 3084 tsx applied, 0 tsx conflicts 186: round 5 ( Fast ): 54 del cols, 324 del rows, 573 chg bounds, 0 chg sides, 0 chg coeffs, 3114 tsx applied, 0 tsx conflicts 186: round 6 ( Fast ): 54 del cols, 324 del rows, 589 chg bounds, 0 chg sides, 0 chg coeffs, 3146 tsx applied, 0 tsx conflicts 186: round 7 ( Fast ): 54 del cols, 324 del rows, 601 chg bounds, 0 chg sides, 0 chg coeffs, 3170 tsx applied, 0 tsx conflicts 186: round 8 ( Fast ): 54 del cols, 324 del rows, 613 chg bounds, 0 chg sides, 0 chg coeffs, 3196 tsx applied, 0 tsx conflicts 186: round 9 ( Fast ): 54 del cols, 324 del rows, 624 chg bounds, 0 chg sides, 0 chg coeffs, 3218 tsx applied, 0 tsx conflicts 186: round 10 ( Fast ): 54 del cols, 325 del rows, 635 chg bounds, 0 chg sides, 0 chg coeffs, 3240 tsx applied, 0 tsx conflicts 186: round 11 ( Fast ): 54 del cols, 325 del rows, 646 chg bounds, 0 chg sides, 0 chg coeffs, 3262 tsx applied, 0 tsx conflicts 186: round 12 ( Fast ): 54 del cols, 325 del rows, 657 chg bounds, 0 chg sides, 0 chg coeffs, 3284 tsx applied, 0 tsx conflicts 186: round 13 ( Fast ): 54 del cols, 325 del rows, 668 chg bounds, 0 chg sides, 0 chg coeffs, 3306 tsx applied, 0 tsx conflicts 186: round 14 ( Fast ): 54 del cols, 325 del rows, 680 chg bounds, 0 chg sides, 0 chg coeffs, 3330 tsx applied, 0 tsx conflicts 186: round 15 ( Fast ): 54 del cols, 325 del rows, 693 chg bounds, 0 chg sides, 0 chg coeffs, 3356 tsx applied, 0 tsx conflicts 186: round 16 ( Fast ): 54 del cols, 325 del rows, 707 chg bounds, 0 chg sides, 0 chg coeffs, 3384 tsx applied, 0 tsx conflicts 186: round 17 ( Fast ): 54 del cols, 325 del rows, 722 chg bounds, 0 chg sides, 0 chg coeffs, 3414 tsx applied, 0 tsx conflicts 186: round 18 ( Fast ): 54 del cols, 325 del rows, 738 chg bounds, 0 chg sides, 0 chg coeffs, 3446 tsx applied, 0 tsx conflicts 186: round 19 ( Fast ): 54 del cols, 325 del rows, 754 chg bounds, 0 chg sides, 0 chg coeffs, 3478 tsx applied, 0 tsx conflicts 186: round 20 ( Fast ): 54 del cols, 325 del rows, 770 chg bounds, 0 chg sides, 0 chg coeffs, 3510 tsx applied, 0 tsx conflicts 186: round 21 ( Fast ): 54 del cols, 325 del rows, 786 chg bounds, 0 chg sides, 0 chg coeffs, 3542 tsx applied, 0 tsx conflicts 186: round 22 ( Fast ): 54 del cols, 325 del rows, 802 chg bounds, 0 chg sides, 0 chg coeffs, 3574 tsx applied, 0 tsx conflicts 186: round 23 ( Fast ): 54 del cols, 325 del rows, 818 chg bounds, 0 chg sides, 0 chg coeffs, 3606 tsx applied, 0 tsx conflicts 186: round 24 ( Fast ): 54 del cols, 325 del rows, 834 chg bounds, 0 chg sides, 0 chg coeffs, 3638 tsx applied, 0 tsx conflicts 186: round 25 ( Fast ): 54 del cols, 325 del rows, 850 chg bounds, 0 chg sides, 0 chg coeffs, 3670 tsx applied, 0 tsx conflicts 186: round 26 ( Fast ): 54 del cols, 325 del rows, 866 chg bounds, 0 chg sides, 0 chg coeffs, 3702 tsx applied, 0 tsx conflicts 186: round 27 ( Fast ): 54 del cols, 325 del rows, 882 chg bounds, 0 chg sides, 0 chg coeffs, 3734 tsx applied, 0 tsx conflicts 186: round 28 ( Fast ): 54 del cols, 325 del rows, 898 chg bounds, 0 chg sides, 0 chg coeffs, 3766 tsx applied, 0 tsx conflicts 186: round 29 ( Fast ): 54 del cols, 325 del rows, 914 chg bounds, 0 chg sides, 0 chg coeffs, 3798 tsx applied, 0 tsx conflicts 186: round 30 ( Fast ): 54 del cols, 325 del rows, 930 chg bounds, 0 chg sides, 0 chg coeffs, 3830 tsx applied, 0 tsx conflicts 186: round 31 ( Fast ): 54 del cols, 325 del rows, 946 chg bounds, 0 chg sides, 0 chg coeffs, 3862 tsx applied, 0 tsx conflicts 186: round 32 ( Fast ): 54 del cols, 325 del rows, 962 chg bounds, 0 chg sides, 0 chg coeffs, 3894 tsx applied, 0 tsx conflicts 186: round 33 ( Fast ): 54 del cols, 325 del rows, 978 chg bounds, 0 chg sides, 0 chg coeffs, 3926 tsx applied, 0 tsx conflicts 186: round 34 ( Fast ): 54 del cols, 325 del rows, 994 chg bounds, 0 chg sides, 0 chg coeffs, 3958 tsx applied, 0 tsx conflicts 186: round 35 ( Fast ): 54 del cols, 325 del rows, 1010 chg bounds, 0 chg sides, 0 chg coeffs, 3990 tsx applied, 0 tsx conflicts 186: round 36 ( Fast ): 54 del cols, 325 del rows, 1026 chg bounds, 0 chg sides, 0 chg coeffs, 4022 tsx applied, 0 tsx conflicts 186: round 37 ( Fast ): 54 del cols, 325 del rows, 1042 chg bounds, 0 chg sides, 0 chg coeffs, 4054 tsx applied, 0 tsx conflicts 186: round 38 ( Fast ): 54 del cols, 325 del rows, 1058 chg bounds, 0 chg sides, 0 chg coeffs, 4086 tsx applied, 0 tsx conflicts 186: round 39 ( Fast ): 54 del cols, 325 del rows, 1074 chg bounds, 0 chg sides, 0 chg coeffs, 4118 tsx applied, 0 tsx conflicts 186: round 40 ( Fast ): 54 del cols, 325 del rows, 1090 chg bounds, 0 chg sides, 0 chg coeffs, 4150 tsx applied, 0 tsx conflicts 186: round 41 ( Fast ): 54 del cols, 325 del rows, 1106 chg bounds, 0 chg sides, 0 chg coeffs, 4182 tsx applied, 0 tsx conflicts 186: round 42 ( Fast ): 54 del cols, 325 del rows, 1122 chg bounds, 0 chg sides, 0 chg coeffs, 4214 tsx applied, 0 tsx conflicts 186: round 43 ( Fast ): 54 del cols, 325 del rows, 1138 chg bounds, 0 chg sides, 0 chg coeffs, 4246 tsx applied, 0 tsx conflicts 186: round 44 ( Fast ): 54 del cols, 325 del rows, 1154 chg bounds, 0 chg sides, 0 chg coeffs, 4278 tsx applied, 0 tsx conflicts 186: round 45 ( Fast ): 54 del cols, 325 del rows, 1169 chg bounds, 0 chg sides, 0 chg coeffs, 4308 tsx applied, 0 tsx conflicts 186: round 46 ( Fast ): 54 del cols, 325 del rows, 1185 chg bounds, 0 chg sides, 0 chg coeffs, 4340 tsx applied, 0 tsx conflicts 186: round 47 ( Fast ): 54 del cols, 325 del rows, 1200 chg bounds, 0 chg sides, 0 chg coeffs, 4370 tsx applied, 0 tsx conflicts 186: round 48 ( Fast ): 54 del cols, 325 del rows, 1216 chg bounds, 0 chg sides, 0 chg coeffs, 4402 tsx applied, 0 tsx conflicts 186: round 49 ( Fast ): 54 del cols, 325 del rows, 1231 chg bounds, 0 chg sides, 0 chg coeffs, 4432 tsx applied, 0 tsx conflicts 186: round 50 ( Fast ): 54 del cols, 325 del rows, 1247 chg bounds, 0 chg sides, 0 chg coeffs, 4464 tsx applied, 0 tsx conflicts 186: round 51 ( Fast ): 54 del cols, 325 del rows, 1261 chg bounds, 0 chg sides, 0 chg coeffs, 4492 tsx applied, 0 tsx conflicts 186: round 52 ( Fast ): 54 del cols, 325 del rows, 1277 chg bounds, 0 chg sides, 0 chg coeffs, 4524 tsx applied, 0 tsx conflicts 186: round 53 ( Fast ): 54 del cols, 325 del rows, 1291 chg bounds, 0 chg sides, 0 chg coeffs, 4552 tsx applied, 0 tsx conflicts 186: round 54 ( Fast ): 54 del cols, 325 del rows, 1307 chg bounds, 0 chg sides, 0 chg coeffs, 4584 tsx applied, 0 tsx conflicts 186: round 55 ( Fast ): 54 del cols, 325 del rows, 1321 chg bounds, 0 chg sides, 0 chg coeffs, 4612 tsx applied, 0 tsx conflicts 186: round 56 ( Fast ): 54 del cols, 325 del rows, 1337 chg bounds, 0 chg sides, 0 chg coeffs, 4644 tsx applied, 0 tsx conflicts 186: round 57 ( Fast ): 54 del cols, 325 del rows, 1351 chg bounds, 0 chg sides, 0 chg coeffs, 4672 tsx applied, 0 tsx conflicts 186: round 58 ( Fast ): 54 del cols, 325 del rows, 1367 chg bounds, 0 chg sides, 0 chg coeffs, 4704 tsx applied, 0 tsx conflicts 186: round 59 ( Fast ): 54 del cols, 325 del rows, 1381 chg bounds, 0 chg sides, 0 chg coeffs, 4732 tsx applied, 0 tsx conflicts 186: round 60 ( Fast ): 54 del cols, 325 del rows, 1397 chg bounds, 0 chg sides, 0 chg coeffs, 4764 tsx applied, 0 tsx conflicts 186: round 61 ( Fast ): 54 del cols, 325 del rows, 1411 chg bounds, 0 chg sides, 0 chg coeffs, 4792 tsx applied, 0 tsx conflicts 186: round 62 ( Fast ): 54 del cols, 325 del rows, 1427 chg bounds, 0 chg sides, 0 chg coeffs, 4824 tsx applied, 0 tsx conflicts 186: round 63 ( Fast ): 54 del cols, 325 del rows, 1440 chg bounds, 0 chg sides, 0 chg coeffs, 4850 tsx applied, 0 tsx conflicts 186: round 64 ( Fast ): 54 del cols, 325 del rows, 1455 chg bounds, 0 chg sides, 0 chg coeffs, 4880 tsx applied, 0 tsx conflicts 186: round 65 ( Fast ): 54 del cols, 325 del rows, 1466 chg bounds, 0 chg sides, 0 chg coeffs, 4902 tsx applied, 0 tsx conflicts 186: round 66 ( Fast ): 54 del cols, 325 del rows, 1479 chg bounds, 0 chg sides, 0 chg coeffs, 4928 tsx applied, 0 tsx conflicts 186: round 67 ( Medium ): 60 del cols, 341 del rows, 1489 chg bounds, 22 chg sides, 6 chg coeffs, 4970 tsx applied, 397 tsx conflicts 186: round 68 ( Medium ): 60 del cols, 344 del rows, 1502 chg bounds, 22 chg sides, 6 chg coeffs, 4993 tsx applied, 397 tsx conflicts 186: round 69 (Exhaustive): 68 del cols, 348 del rows, 1517 chg bounds, 22 chg sides, 6 chg coeffs, 5014 tsx applied, 397 tsx conflicts 186: round 70 ( Fast ): 68 del cols, 351 del rows, 1543 chg bounds, 22 chg sides, 6 chg coeffs, 5092 tsx applied, 397 tsx conflicts 186: round 71 ( Fast ): 68 del cols, 352 del rows, 1560 chg bounds, 22 chg sides, 6 chg coeffs, 5126 tsx applied, 397 tsx conflicts 186: round 72 ( Fast ): 68 del cols, 352 del rows, 1577 chg bounds, 22 chg sides, 6 chg coeffs, 5160 tsx applied, 397 tsx conflicts 186: round 73 ( Fast ): 68 del cols, 352 del rows, 1588 chg bounds, 22 chg sides, 6 chg coeffs, 5182 tsx applied, 397 tsx conflicts 186: round 74 ( Fast ): 68 del cols, 352 del rows, 1600 chg bounds, 22 chg sides, 6 chg coeffs, 5206 tsx applied, 397 tsx conflicts 186: round 75 (Exhaustive): 68 del cols, 352 del rows, 1609 chg bounds, 22 chg sides, 6 chg coeffs, 5222 tsx applied, 397 tsx conflicts 186: round 76 ( Final ): 68 del cols, 352 del rows, 1618 chg bounds, 22 chg sides, 6 chg coeffs, 5239 tsx applied, 397 tsx conflicts 186: presolved 76 rounds: 68 del cols, 352 del rows, 1618 chg bounds, 22 chg sides, 6 chg coeffs, 5239 tsx applied, 397 tsx conflicts 186: 186: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 186: colsingleton 76 0.0 0 0.0 0.000 186: coefftightening 0 0.0 0 0.0 0.000 186: propagation 76 100.0 5202 100.0 0.003 186: fixcontinuous 2 0.0 0 0.0 0.000 186: simpleprobing 0 0.0 0 0.0 0.000 186: parallelrows 2 50.0 16 100.0 0.000 186: parallelcols 2 0.0 0 0.0 0.000 186: stuffing 3 33.3 402 1.5 0.000 186: dualfix 5 100.0 8 87.5 0.009 186: simplifyineq 0 0.0 0 0.0 0.000 186: doubletoneq 0 0.0 0 0.0 0.000 186: implint 0 0.0 0 0.0 0.000 186: domcol 2 50.0 8 100.0 0.000 186: dualinfer 0 0.0 0 0.0 0.000 186: probing 0 0.0 0 0.0 0.000 186: substitution 0 0.0 0 0.0 0.000 186: sparsify 0 0.0 0 0.0 0.000 186: 186: reduced problem: 186: reduced rows: 136 186: reduced columns: 95 186: reduced int. columns: 0 186: reduced cont. columns: 95 186: reduced nonzeros: 664 186: 186: presolving finished after 0.065 seconds 186: 186: Equilibrium scaling LP (persistent) 186: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 65 col bounds, 0 row bounds 186: Reduced LP has 136 rows 95 columns 664 nonzeros 186: Equilibrium scaling LP 186: type | time | iters | facts | shift | viol sum | viol num | obj value 186: E | 0.0 | 0 | 2 | 1.61e+03 | 5.50e+06 | 33 | -3.51002362e+08 186: L | 0.0 | 74 | 3 | 0.00e+00 | 9.26e+02 | 35 | -3.34751497e+07 186: L | 0.0 | 95 | 4 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 186: --- unscaling internal solution 186: --- unsimplifying solution and basis 186: --- unscaling external solution 186: --- verifying computed solution 186: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 186: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 186: --- unscaling external solution 186: --- verifying computed solution 186: 186: SoPlex status : problem is solved [optimal] 186: Solving time (sec) : 0.00 186: Iterations : 95 186: Objective value : -3.59917673e+07 186: 186: Solution passed validation 186: 186: postsolve finished after 0.001 seconds 186: feasible: true 186: objective value: -35991767.2865765 186: 186: violations: 186: bounds: 0 186: constraints: 0 186: integrality: 0 186: 186: validation: SUCCESS 186: Solving time 0.087 seconds 186: 186: solving finished after 0.087 seconds 185/287 Test #186: d-solve-agg.mps-lp_presolvers_without_basis.set ............................................ Passed 0.20 sec test 189 Start 189: d-solve-beaconfd.mps-lp_presolvers_without_basis.set 189: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/beaconfd.mps" "-o" "0.335924858072e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 189: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 189: Test timeout computed to be: 10000000 187: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 187: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 187: 187: External libraries: 187: Boost 1.83.0 (https://www.boost.org/) 187: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 187: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 187: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 187: 187: reading took 0.0256 seconds 187: Numerical Statistics: 187: Matrix range [2e-05,4e+02] 187: Objective range [3e+00,1e+02] 187: Bounds range [0e+00,0e+00] 187: RHS range [1e+02,6e+06] 187: Dynamism Variables: 4e+06 187: Dynamism Rows : 3e+03 187: set presolve.componentsmaxint = -1 187: set presolve.detectlindep = 0 187: set doubletoneq.enabled = 0 187: set dualinfer.enabled = 0 187: set substitution.enabled = 0 187: set sparsify.enabled = 0 187: set calculate_basis_for_dual = 0 187: 187: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/agg.mps with dual-postsolve activated 187: rows: 488 187: columns: 163 187: int. columns: 0 187: cont. columns: 163 187: nonzeros: 2410 187: 187: round 0 ( Trivial ): 3 del cols, 80 del rows, 26 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 187: round 1 ( Fast ): 29 del cols, 288 del rows, 504 chg bounds, 0 chg sides, 0 chg coeffs, 2964 tsx applied, 0 tsx conflicts 187: round 2 ( Fast ): 54 del cols, 318 del rows, 529 chg bounds, 0 chg sides, 0 chg coeffs, 3014 tsx applied, 0 tsx conflicts 187: round 3 ( Fast ): 54 del cols, 322 del rows, 545 chg bounds, 0 chg sides, 0 chg coeffs, 3056 tsx applied, 0 tsx conflicts 187: round 4 ( Fast ): 54 del cols, 324 del rows, 558 chg bounds, 0 chg sides, 0 chg coeffs, 3084 tsx applied, 0 tsx conflicts 187: round 5 ( Fast ): 54 del cols, 324 del rows, 573 chg bounds, 0 chg sides, 0 chg coeffs, 3114 tsx applied, 0 tsx conflicts 187: round 6 ( Fast ): 54 del cols, 324 del rows, 589 chg bounds, 0 chg sides, 0 chg coeffs, 3146 tsx applied, 0 tsx conflicts 187: round 7 ( Fast ): 54 del cols, 324 del rows, 601 chg bounds, 0 chg sides, 0 chg coeffs, 3170 tsx applied, 0 tsx conflicts 187: round 8 ( Fast ): 54 del cols, 324 del rows, 613 chg bounds, 0 chg sides, 0 chg coeffs, 3196 tsx applied, 0 tsx conflicts 187: round 9 ( Fast ): 54 del cols, 324 del rows, 624 chg bounds, 0 chg sides, 0 chg coeffs, 3218 tsx applied, 0 tsx conflicts 187: round 10 ( Fast ): 54 del cols, 325 del rows, 635 chg bounds, 0 chg sides, 0 chg coeffs, 3240 tsx applied, 0 tsx conflicts 187: round 11 ( Fast ): 54 del cols, 325 del rows, 646 chg bounds, 0 chg sides, 0 chg coeffs, 3262 tsx applied, 0 tsx conflicts 187: round 12 ( Fast ): 54 del cols, 325 del rows, 657 chg bounds, 0 chg sides, 0 chg coeffs, 3284 tsx applied, 0 tsx conflicts 187: round 13 ( Fast ): 54 del cols, 325 del rows, 668 chg bounds, 0 chg sides, 0 chg coeffs, 3306 tsx applied, 0 tsx conflicts 187: round 14 ( Fast ): 54 del cols, 325 del rows, 680 chg bounds, 0 chg sides, 0 chg coeffs, 3330 tsx applied, 0 tsx conflicts 187: round 15 ( Fast ): 54 del cols, 325 del rows, 693 chg bounds, 0 chg sides, 0 chg coeffs, 3356 tsx applied, 0 tsx conflicts 187: round 16 ( Fast ): 54 del cols, 325 del rows, 707 chg bounds, 0 chg sides, 0 chg coeffs, 3384 tsx applied, 0 tsx conflicts 187: round 17 ( Fast ): 54 del cols, 325 del rows, 722 chg bounds, 0 chg sides, 0 chg coeffs, 3414 tsx applied, 0 tsx conflicts 187: round 18 ( Fast ): 54 del cols, 325 del rows, 738 chg bounds, 0 chg sides, 0 chg coeffs, 3446 tsx applied, 0 tsx conflicts 187: round 19 ( Fast ): 54 del cols, 325 del rows, 754 chg bounds, 0 chg sides, 0 chg coeffs, 3478 tsx applied, 0 tsx conflicts 189: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 189: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 189: 189: External libraries: 189: Boost 1.83.0 (https://www.boost.org/) 189: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 189: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 189: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 189: 189: reading took 0.0492 seconds 189: Numerical Statistics: 189: Matrix range [1e-03,5e+02] 189: Objective range [3e-02,1e+02] 189: Bounds range [0e+00,0e+00] 189: RHS range [1e+00,2e+03] 189: Dynamism Variables: 7e+04 189: Dynamism Rows : 2e+03 189: set presolve.componentsmaxint = -1 189: set presolve.detectlindep = 0 189: set doubletoneq.enabled = 0 189: set dualinfer.enabled = 0 189: set substitution.enabled = 0 189: set sparsify.enabled = 0 189: set calculate_basis_for_dual = 0 189: 189: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/beaconfd.mps with dual-postsolve activated 189: rows: 173 189: columns: 262 189: int. columns: 0 189: cont. columns: 262 189: nonzeros: 3375 189: 189: round 0 ( Trivial ): 37 del cols, 37 del rows, 41 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 189: round 1 ( Fast ): 87 del cols, 59 del rows, 214 chg bounds, 0 chg sides, 0 chg coeffs, 346 tsx applied, 0 tsx conflicts 189: round 2 ( Fast ): 114 del cols, 86 del rows, 271 chg bounds, 0 chg sides, 0 chg coeffs, 454 tsx applied, 0 tsx conflicts 189: round 3 ( Medium ): 167 del cols, 135 del rows, 276 chg bounds, 0 chg sides, 0 chg coeffs, 512 tsx applied, 74 tsx conflicts 189: round 4 ( Medium ): 170 del cols, 136 del rows, 276 chg bounds, 1 chg sides, 1 chg coeffs, 514 tsx applied, 82 tsx conflicts 189: round 5 ( Medium ): 172 del cols, 137 del rows, 276 chg bounds, 2 chg sides, 1 chg coeffs, 515 tsx applied, 87 tsx conflicts 189: round 6 (Exhaustive): 184 del cols, 137 del rows, 288 chg bounds, 2 chg sides, 1 chg coeffs, 527 tsx applied, 87 tsx conflicts 189: round 7 ( Fast ): 186 del cols, 139 del rows, 293 chg bounds, 2 chg sides, 1 chg coeffs, 537 tsx applied, 87 tsx conflicts 189: round 8 (Exhaustive): 186 del cols, 139 del rows, 293 chg bounds, 2 chg sides, 1 chg coeffs, 537 tsx applied, 87 tsx conflicts 189: round 9 ( Medium ): 188 del cols, 141 del rows, 293 chg bounds, 2 chg sides, 1 chg coeffs, 539 tsx applied, 91 tsx conflicts 189: round 10 ( Medium ): 191 del cols, 142 del rows, 296 chg bounds, 3 chg sides, 2 chg coeffs, 544 tsx applied, 95 tsx conflicts 189: round 11 (Exhaustive): 192 del cols, 142 del rows, 297 chg bounds, 3 chg sides, 2 chg coeffs, 545 tsx applied, 95 tsx conflicts 189: round 12 ( Fast ): 193 del cols, 143 del rows, 302 chg bounds, 3 chg sides, 2 chg coeffs, 561 tsx applied, 95 tsx conflicts 189: round 13 (Exhaustive): 193 del cols, 143 del rows, 302 chg bounds, 3 chg sides, 2 chg coeffs, 561 tsx applied, 95 tsx conflicts 189: round 14 ( Final ): Unchanged 189: presolved 14 rounds: 193 del cols, 143 del rows, 304 chg bounds, 3 chg sides, 2 chg coeffs, 563 tsx applied, 95 tsx conflicts 189: 189: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 189: colsingleton 14 0.0 0 0.0 0.000 189: coefftightening 0 0.0 0 0.0 0.000 189: propagation 14 28.6 480 100.0 0.000 189: fixcontinuous 4 0.0 0 0.0 0.000 189: simpleprobing 0 0.0 0 0.0 0.000 189: parallelrows 3 0.0 0 0.0 0.000 189: parallelcols 3 33.3 4 100.0 0.000 189: stuffing 8 62.5 151 37.1 0.000 189: dualfix 6 50.0 10 100.0 0.000 189: simplifyineq 0 0.0 0 0.0 0.000 189: doubletoneq 0 0.0 0 0.0 0.000 189: implint 0 0.0 0 0.0 0.000 189: domcol 2 100.0 13 100.0 0.000 189: dualinfer 0 0.0 0 0.0 0.000 189: probing 0 0.0 0 0.0 0.000 189: substitution 0 0.0 0 0.0 0.000 189: sparsify 0 0.0 0 0.0 0.000 189: 189: reduced problem: 189: reduced rows: 30 189: reduced columns: 69 189: reduced int. columns: 0 189: reduced cont. columns: 69 189: reduced nonzeros: 187 189: 189: presolving finished after 0.023 seconds 189: 189: Equilibrium scaling LP (persistent) 189: Simplifier removed 8 rows, 8 columns, 27 nonzeros, 22 col bounds, 24 row bounds 189: Reduced LP has 22 rows 61 columns 159 nonzeros 189: Equilibrium scaling LP 189: type | time | iters | facts | shift | viol sum | viol num | obj value 189: L | 0.0 | 0 | 3 | 8.21e+00 | 7.75e+03 | 19 | 1.06615847e+04 189: E | 0.0 | 20 | 4 | 0.00e+00 | 4.85e+00 | 22 | 3.38146823e+04 189: E | 0.0 | 24 | 5 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 189: --- unscaling internal solution 189: --- unsimplifying solution and basis 189: --- unscaling external solution 189: --- verifying computed solution 189: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 189: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 189: --- unscaling external solution 189: --- verifying computed solution 189: 189: SoPlex status : problem is solved [optimal] 189: Solving time (sec) : 0.02 189: Iterations : 24 189: Objective value : 3.35924858e+04 189: 189: Solution passed validation 189: 189: postsolve finished after 0.000 seconds 189: feasible: true 189: objective value: 33592.4858072 189: 189: violations: 189: bounds: 0 189: constraints: 0 189: integrality: 0 189: 189: validation: SUCCESS 189: Solving time 0.026 seconds 189: 189: solving finished after 0.026 seconds 186/287 Test #189: d-solve-beaconfd.mps-lp_presolvers_without_basis.set ....................................... Passed 0.13 sec test 190 Start 190: q-solve-beaconfd.mps-lp_presolvers_without_basis.set 190: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/beaconfd.mps" "-o" "0.335924858072e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 190: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 190: Test timeout computed to be: 10000000 187: round 20 ( Fast ): 54 del cols, 325 del rows, 770 chg bounds, 0 chg sides, 0 chg coeffs, 3510 tsx applied, 0 tsx conflicts 187: round 21 ( Fast ): 54 del cols, 325 del rows, 786 chg bounds, 0 chg sides, 0 chg coeffs, 3542 tsx applied, 0 tsx conflicts 187: round 22 ( Fast ): 54 del cols, 325 del rows, 802 chg bounds, 0 chg sides, 0 chg coeffs, 3574 tsx applied, 0 tsx conflicts 187: round 23 ( Fast ): 54 del cols, 325 del rows, 818 chg bounds, 0 chg sides, 0 chg coeffs, 3606 tsx applied, 0 tsx conflicts 187: round 24 ( Fast ): 54 del cols, 325 del rows, 834 chg bounds, 0 chg sides, 0 chg coeffs, 3638 tsx applied, 0 tsx conflicts 187: round 25 ( Fast ): 54 del cols, 325 del rows, 850 chg bounds, 0 chg sides, 0 chg coeffs, 3670 tsx applied, 0 tsx conflicts 187: round 26 ( Fast ): 54 del cols, 325 del rows, 866 chg bounds, 0 chg sides, 0 chg coeffs, 3702 tsx applied, 0 tsx conflicts 187: round 27 ( Fast ): 54 del cols, 325 del rows, 882 chg bounds, 0 chg sides, 0 chg coeffs, 3734 tsx applied, 0 tsx conflicts 187: round 28 ( Fast ): 54 del cols, 325 del rows, 898 chg bounds, 0 chg sides, 0 chg coeffs, 3766 tsx applied, 0 tsx conflicts 187: round 29 ( Fast ): 54 del cols, 325 del rows, 914 chg bounds, 0 chg sides, 0 chg coeffs, 3798 tsx applied, 0 tsx conflicts 187: round 30 ( Fast ): 54 del cols, 325 del rows, 930 chg bounds, 0 chg sides, 0 chg coeffs, 3830 tsx applied, 0 tsx conflicts 187: round 31 ( Fast ): 54 del cols, 325 del rows, 946 chg bounds, 0 chg sides, 0 chg coeffs, 3862 tsx applied, 0 tsx conflicts 187: round 32 ( Fast ): 54 del cols, 325 del rows, 962 chg bounds, 0 chg sides, 0 chg coeffs, 3894 tsx applied, 0 tsx conflicts 187: round 33 ( Fast ): 54 del cols, 325 del rows, 978 chg bounds, 0 chg sides, 0 chg coeffs, 3926 tsx applied, 0 tsx conflicts 187: round 34 ( Fast ): 54 del cols, 325 del rows, 994 chg bounds, 0 chg sides, 0 chg coeffs, 3958 tsx applied, 0 tsx conflicts 187: round 35 ( Fast ): 54 del cols, 325 del rows, 1010 chg bounds, 0 chg sides, 0 chg coeffs, 3990 tsx applied, 0 tsx conflicts 187: round 36 ( Fast ): 54 del cols, 325 del rows, 1026 chg bounds, 0 chg sides, 0 chg coeffs, 4022 tsx applied, 0 tsx conflicts 187: round 37 ( Fast ): 54 del cols, 325 del rows, 1042 chg bounds, 0 chg sides, 0 chg coeffs, 4054 tsx applied, 0 tsx conflicts 187: round 38 ( Fast ): 54 del cols, 325 del rows, 1058 chg bounds, 0 chg sides, 0 chg coeffs, 4086 tsx applied, 0 tsx conflicts 187: round 39 ( Fast ): 54 del cols, 325 del rows, 1074 chg bounds, 0 chg sides, 0 chg coeffs, 4118 tsx applied, 0 tsx conflicts 187: round 40 ( Fast ): 54 del cols, 325 del rows, 1090 chg bounds, 0 chg sides, 0 chg coeffs, 4150 tsx applied, 0 tsx conflicts 187: round 41 ( Fast ): 54 del cols, 325 del rows, 1106 chg bounds, 0 chg sides, 0 chg coeffs, 4182 tsx applied, 0 tsx conflicts 187: round 42 ( Fast ): 54 del cols, 325 del rows, 1122 chg bounds, 0 chg sides, 0 chg coeffs, 4214 tsx applied, 0 tsx conflicts 187: round 43 ( Fast ): 54 del cols, 325 del rows, 1138 chg bounds, 0 chg sides, 0 chg coeffs, 4246 tsx applied, 0 tsx conflicts 187: round 44 ( Fast ): 54 del cols, 325 del rows, 1154 chg bounds, 0 chg sides, 0 chg coeffs, 4278 tsx applied, 0 tsx conflicts 187: round 45 ( Fast ): 54 del cols, 325 del rows, 1169 chg bounds, 0 chg sides, 0 chg coeffs, 4308 tsx applied, 0 tsx conflicts 187: round 46 ( Fast ): 54 del cols, 325 del rows, 1185 chg bounds, 0 chg sides, 0 chg coeffs, 4340 tsx applied, 0 tsx conflicts 187: round 47 ( Fast ): 54 del cols, 325 del rows, 1200 chg bounds, 0 chg sides, 0 chg coeffs, 4370 tsx applied, 0 tsx conflicts 187: round 48 ( Fast ): 54 del cols, 325 del rows, 1216 chg bounds, 0 chg sides, 0 chg coeffs, 4402 tsx applied, 0 tsx conflicts 176: 176: SoPlex status : problem is solved [optimal] 176: Solving time (sec) : 0.08 176: Iterations : 517 176: Objective value : 1.20882535e+09 176: 176: Solution passed validation 176: 176: postsolve finished after 0.216 seconds 176: feasible: true 176: objective value: 1208825346 176: 176: violations: 176: bounds: 0 176: constraints: 0 176: integrality: 0 176: 176: validation: SUCCESS 176: Solving time 0.887 seconds 176: 176: solving finished after 0.887 seconds 187/287 Test #176: r-solve-shell.mps-lp_presolvers_with_basis.set ............................................. Passed 1.26 sec test 191 Start 191: r-solve-beaconfd.mps-lp_presolvers_without_basis.set 191: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/beaconfd.mps" "-o" "0.335924858072e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 191: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 191: Test timeout computed to be: 10000000 187: round 49 ( Fast ): 54 del cols, 325 del rows, 1231 chg bounds, 0 chg sides, 0 chg coeffs, 4432 tsx applied, 0 tsx conflicts 187: round 50 ( Fast ): 54 del cols, 325 del rows, 1247 chg bounds, 0 chg sides, 0 chg coeffs, 4464 tsx applied, 0 tsx conflicts 187: round 51 ( Fast ): 54 del cols, 325 del rows, 1261 chg bounds, 0 chg sides, 0 chg coeffs, 4492 tsx applied, 0 tsx conflicts 187: round 52 ( Fast ): 54 del cols, 325 del rows, 1277 chg bounds, 0 chg sides, 0 chg coeffs, 4524 tsx applied, 0 tsx conflicts 187: round 53 ( Fast ): 54 del cols, 325 del rows, 1291 chg bounds, 0 chg sides, 0 chg coeffs, 4552 tsx applied, 0 tsx conflicts 187: round 54 ( Fast ): 54 del cols, 325 del rows, 1307 chg bounds, 0 chg sides, 0 chg coeffs, 4584 tsx applied, 0 tsx conflicts 187: round 55 ( Fast ): 54 del cols, 325 del rows, 1321 chg bounds, 0 chg sides, 0 chg coeffs, 4612 tsx applied, 0 tsx conflicts 187: round 56 ( Fast ): 54 del cols, 325 del rows, 1337 chg bounds, 0 chg sides, 0 chg coeffs, 4644 tsx applied, 0 tsx conflicts 187: round 57 ( Fast ): 54 del cols, 325 del rows, 1351 chg bounds, 0 chg sides, 0 chg coeffs, 4672 tsx applied, 0 tsx conflicts 187: round 58 ( Fast ): 54 del cols, 325 del rows, 1367 chg bounds, 0 chg sides, 0 chg coeffs, 4704 tsx applied, 0 tsx conflicts 187: round 59 ( Fast ): 54 del cols, 325 del rows, 1381 chg bounds, 0 chg sides, 0 chg coeffs, 4732 tsx applied, 0 tsx conflicts 187: round 60 ( Fast ): 54 del cols, 325 del rows, 1397 chg bounds, 0 chg sides, 0 chg coeffs, 4764 tsx applied, 0 tsx conflicts 187: round 61 ( Fast ): 54 del cols, 325 del rows, 1411 chg bounds, 0 chg sides, 0 chg coeffs, 4792 tsx applied, 0 tsx conflicts 187: round 62 ( Fast ): 54 del cols, 325 del rows, 1427 chg bounds, 0 chg sides, 0 chg coeffs, 4824 tsx applied, 0 tsx conflicts 187: round 63 ( Fast ): 54 del cols, 325 del rows, 1440 chg bounds, 0 chg sides, 0 chg coeffs, 4850 tsx applied, 0 tsx conflicts 187: round 64 ( Fast ): 54 del cols, 325 del rows, 1455 chg bounds, 0 chg sides, 0 chg coeffs, 4880 tsx applied, 0 tsx conflicts 187: round 65 ( Fast ): 54 del cols, 325 del rows, 1466 chg bounds, 0 chg sides, 0 chg coeffs, 4902 tsx applied, 0 tsx conflicts 187: round 66 ( Fast ): 54 del cols, 325 del rows, 1479 chg bounds, 0 chg sides, 0 chg coeffs, 4928 tsx applied, 0 tsx conflicts 187: round 67 ( Medium ): 60 del cols, 341 del rows, 1489 chg bounds, 22 chg sides, 6 chg coeffs, 4970 tsx applied, 397 tsx conflicts 187: round 68 ( Medium ): 60 del cols, 344 del rows, 1502 chg bounds, 22 chg sides, 6 chg coeffs, 4993 tsx applied, 397 tsx conflicts 187: round 69 (Exhaustive): 68 del cols, 348 del rows, 1517 chg bounds, 22 chg sides, 6 chg coeffs, 5014 tsx applied, 397 tsx conflicts 187: round 70 ( Fast ): 68 del cols, 351 del rows, 1543 chg bounds, 22 chg sides, 6 chg coeffs, 5092 tsx applied, 397 tsx conflicts 187: round 71 ( Fast ): 68 del cols, 352 del rows, 1560 chg bounds, 22 chg sides, 6 chg coeffs, 5126 tsx applied, 397 tsx conflicts 187: round 72 ( Fast ): 68 del cols, 352 del rows, 1577 chg bounds, 22 chg sides, 6 chg coeffs, 5160 tsx applied, 397 tsx conflicts 187: round 73 ( Fast ): 68 del cols, 352 del rows, 1588 chg bounds, 22 chg sides, 6 chg coeffs, 5182 tsx applied, 397 tsx conflicts 187: round 74 ( Fast ): 68 del cols, 352 del rows, 1600 chg bounds, 22 chg sides, 6 chg coeffs, 5206 tsx applied, 397 tsx conflicts 187: round 75 (Exhaustive): 68 del cols, 352 del rows, 1609 chg bounds, 22 chg sides, 6 chg coeffs, 5222 tsx applied, 397 tsx conflicts 187: round 76 ( Final ): 68 del cols, 352 del rows, 1618 chg bounds, 22 chg sides, 6 chg coeffs, 5239 tsx applied, 397 tsx conflicts 187: presolved 76 rounds: 68 del cols, 352 del rows, 1618 chg bounds, 22 chg sides, 6 chg coeffs, 5239 tsx applied, 397 tsx conflicts 187: 187: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 187: colsingleton 76 0.0 0 0.0 0.000 187: coefftightening 0 0.0 0 0.0 0.000 187: propagation 76 100.0 5202 100.0 0.068 187: fixcontinuous 2 0.0 0 0.0 0.000 187: simpleprobing 0 0.0 0 0.0 0.000 187: parallelrows 2 50.0 16 100.0 0.001 187: parallelcols 2 0.0 0 0.0 0.001 187: stuffing 3 33.3 402 1.5 0.008 187: dualfix 5 100.0 8 87.5 0.002 187: simplifyineq 0 0.0 0 0.0 0.000 187: doubletoneq 0 0.0 0 0.0 0.000 187: implint 0 0.0 0 0.0 0.000 187: domcol 2 50.0 8 100.0 0.003 187: dualinfer 0 0.0 0 0.0 0.000 187: probing 0 0.0 0 0.0 0.000 187: substitution 0 0.0 0 0.0 0.000 187: sparsify 0 0.0 0 0.0 0.000 187: 187: reduced problem: 187: reduced rows: 136 187: reduced columns: 95 187: reduced int. columns: 0 187: reduced cont. columns: 95 187: reduced nonzeros: 664 187: 187: presolving finished after 0.366 seconds 187: 187: Equilibrium scaling LP (persistent) 187: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 65 col bounds, 0 row bounds 187: Reduced LP has 136 rows 95 columns 664 nonzeros 187: Equilibrium scaling LP 187: type | time | iters | facts | shift | viol sum | viol num | obj value 187: E | 0.0 | 0 | 2 | 1.61e+03 | 5.50e+06 | 33 | -3.51002362e+08 187: L | 0.0 | 74 | 3 | 0.00e+00 | 9.26e+02 | 35 | -3.34751497e+07 187: L | 0.0 | 95 | 4 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 187: --- unscaling internal solution 187: --- unsimplifying solution and basis 187: --- unscaling external solution 187: --- verifying computed solution 187: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 187: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 187: --- unscaling external solution 187: --- verifying computed solution 190: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 190: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 190: 190: External libraries: 190: Boost 1.83.0 (https://www.boost.org/) 190: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 190: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 190: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 190: 190: reading took 0.0682 seconds 190: Numerical Statistics: 190: Matrix range [1e-03,5e+02] 190: Objective range [3e-02,1e+02] 190: Bounds range [0e+00,0e+00] 190: RHS range [1e+00,2e+03] 190: Dynamism Variables: 7e+04 190: Dynamism Rows : 2e+03 190: set presolve.componentsmaxint = -1 190: set presolve.detectlindep = 0 190: set doubletoneq.enabled = 0 190: set dualinfer.enabled = 0 190: set substitution.enabled = 0 190: set sparsify.enabled = 0 190: set calculate_basis_for_dual = 0 190: 190: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/beaconfd.mps with dual-postsolve activated 190: rows: 173 190: columns: 262 190: int. columns: 0 190: cont. columns: 262 190: nonzeros: 3375 190: 190: round 0 ( Trivial ): 37 del cols, 37 del rows, 41 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 190: round 1 ( Fast ): 87 del cols, 59 del rows, 214 chg bounds, 0 chg sides, 0 chg coeffs, 346 tsx applied, 0 tsx conflicts 190: round 2 ( Fast ): 114 del cols, 86 del rows, 271 chg bounds, 0 chg sides, 0 chg coeffs, 454 tsx applied, 0 tsx conflicts 190: round 3 ( Medium ): 167 del cols, 135 del rows, 276 chg bounds, 0 chg sides, 0 chg coeffs, 512 tsx applied, 74 tsx conflicts 190: round 4 ( Medium ): 170 del cols, 136 del rows, 276 chg bounds, 1 chg sides, 1 chg coeffs, 514 tsx applied, 82 tsx conflicts 190: round 5 ( Medium ): 172 del cols, 137 del rows, 276 chg bounds, 2 chg sides, 1 chg coeffs, 515 tsx applied, 87 tsx conflicts 190: round 6 (Exhaustive): 184 del cols, 137 del rows, 288 chg bounds, 2 chg sides, 1 chg coeffs, 527 tsx applied, 87 tsx conflicts 190: round 7 ( Fast ): 186 del cols, 139 del rows, 293 chg bounds, 2 chg sides, 1 chg coeffs, 537 tsx applied, 87 tsx conflicts 190: round 8 (Exhaustive): 186 del cols, 139 del rows, 293 chg bounds, 2 chg sides, 1 chg coeffs, 537 tsx applied, 87 tsx conflicts 190: round 9 ( Medium ): 188 del cols, 141 del rows, 293 chg bounds, 2 chg sides, 1 chg coeffs, 539 tsx applied, 91 tsx conflicts 190: round 10 ( Medium ): 191 del cols, 142 del rows, 296 chg bounds, 3 chg sides, 2 chg coeffs, 544 tsx applied, 95 tsx conflicts 190: round 11 (Exhaustive): 192 del cols, 142 del rows, 297 chg bounds, 3 chg sides, 2 chg coeffs, 545 tsx applied, 95 tsx conflicts 190: round 12 ( Fast ): 193 del cols, 143 del rows, 302 chg bounds, 3 chg sides, 2 chg coeffs, 561 tsx applied, 95 tsx conflicts 190: round 13 (Exhaustive): 193 del cols, 143 del rows, 302 chg bounds, 3 chg sides, 2 chg coeffs, 561 tsx applied, 95 tsx conflicts 190: round 14 ( Final ): Unchanged 190: presolved 14 rounds: 193 del cols, 143 del rows, 304 chg bounds, 3 chg sides, 2 chg coeffs, 563 tsx applied, 95 tsx conflicts 190: 190: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 190: colsingleton 14 0.0 0 0.0 0.000 190: coefftightening 0 0.0 0 0.0 0.000 190: propagation 14 28.6 480 100.0 0.028 190: fixcontinuous 4 0.0 0 0.0 0.000 190: simpleprobing 0 0.0 0 0.0 0.000 190: parallelrows 3 0.0 0 0.0 0.001 190: parallelcols 3 33.3 4 100.0 0.002 190: stuffing 8 62.5 151 37.1 0.007 190: dualfix 6 50.0 10 100.0 0.009 190: simplifyineq 0 0.0 0 0.0 0.000 190: doubletoneq 0 0.0 0 0.0 0.000 190: implint 0 0.0 0 0.0 0.000 190: domcol 2 100.0 13 100.0 0.008 190: dualinfer 0 0.0 0 0.0 0.000 190: probing 0 0.0 0 0.0 0.000 190: substitution 0 0.0 0 0.0 0.000 190: sparsify 0 0.0 0 0.0 0.000 190: 190: reduced problem: 190: reduced rows: 30 190: reduced columns: 69 190: reduced int. columns: 0 190: reduced cont. columns: 69 190: reduced nonzeros: 187 190: 190: presolving finished after 0.132 seconds 190: 190: Equilibrium scaling LP (persistent) 190: Simplifier removed 8 rows, 8 columns, 27 nonzeros, 22 col bounds, 24 row bounds 190: Reduced LP has 22 rows 61 columns 159 nonzeros 190: Equilibrium scaling LP 190: type | time | iters | facts | shift | viol sum | viol num | obj value 190: L | 0.0 | 0 | 3 | 8.21e+00 | 7.75e+03 | 19 | 1.06615847e+04 187: 187: SoPlex status : problem is solved [optimal] 187: Solving time (sec) : 0.02 187: Iterations : 95 187: Objective value : -3.59917673e+07 187: 187: Solution passed validation 187: 187: postsolve finished after 0.066 seconds 187: feasible: true 187: objective value: -35991767.2865765 187: 187: violations: 187: bounds: 0 187: constraints: 0 187: integrality: 0 187: 187: validation: SUCCESS 187: Solving time 0.455 seconds 187: 187: solving finished after 0.455 seconds 188/287 Test #187: q-solve-agg.mps-lp_presolvers_without_basis.set ............................................ Passed 0.58 sec test 192 Start 192: d-solve-bore3d.mps-lp_presolvers_without_basis.set 192: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bore3d.mps" "-o" "0.13730803942084927215581987251301e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 192: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 192: Test timeout computed to be: 10000000 190: E | 0.0 | 20 | 4 | 0.00e+00 | 4.85e+00 | 22 | 3.38146823e+04 190: E | 0.0 | 24 | 5 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 190: --- unscaling internal solution 190: --- unsimplifying solution and basis 190: --- unscaling external solution 190: --- verifying computed solution 190: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 190: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 190: --- unscaling external solution 190: --- verifying computed solution 188: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 188: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 188: 188: External libraries: 188: Boost 1.83.0 (https://www.boost.org/) 188: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 188: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 188: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 188: 188: reading took 0.0833 seconds 188: Numerical Statistics: 188: Matrix range [2e-05,4e+02] 188: Objective range [3e+00,1e+02] 188: Bounds range [0e+00,0e+00] 188: RHS range [1e+02,6e+06] 188: Dynamism Variables: 4e+06 188: Dynamism Rows : 3e+03 188: set presolve.componentsmaxint = -1 188: set presolve.detectlindep = 0 188: set doubletoneq.enabled = 0 188: set dualinfer.enabled = 0 188: set substitution.enabled = 0 188: set sparsify.enabled = 0 188: set calculate_basis_for_dual = 0 188: 188: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/agg.mps with dual-postsolve activated 188: rows: 488 188: columns: 163 188: int. columns: 0 188: cont. columns: 163 188: nonzeros: 2410 188: 188: round 0 ( Trivial ): 3 del cols, 80 del rows, 26 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 188: round 1 ( Fast ): 29 del cols, 288 del rows, 504 chg bounds, 0 chg sides, 0 chg coeffs, 2964 tsx applied, 0 tsx conflicts 188: round 2 ( Fast ): 54 del cols, 318 del rows, 529 chg bounds, 0 chg sides, 0 chg coeffs, 3014 tsx applied, 0 tsx conflicts 188: round 3 ( Fast ): 54 del cols, 322 del rows, 545 chg bounds, 0 chg sides, 0 chg coeffs, 3056 tsx applied, 0 tsx conflicts 188: round 4 ( Fast ): 54 del cols, 324 del rows, 558 chg bounds, 0 chg sides, 0 chg coeffs, 3084 tsx applied, 0 tsx conflicts 188: round 5 ( Fast ): 54 del cols, 324 del rows, 573 chg bounds, 0 chg sides, 0 chg coeffs, 3114 tsx applied, 0 tsx conflicts 188: round 6 ( Fast ): 54 del cols, 324 del rows, 589 chg bounds, 0 chg sides, 0 chg coeffs, 3146 tsx applied, 0 tsx conflicts 188: round 7 ( Fast ): 54 del cols, 324 del rows, 601 chg bounds, 0 chg sides, 0 chg coeffs, 3170 tsx applied, 0 tsx conflicts 188: round 8 ( Fast ): 54 del cols, 324 del rows, 613 chg bounds, 0 chg sides, 0 chg coeffs, 3196 tsx applied, 0 tsx conflicts 188: round 9 ( Fast ): 54 del cols, 324 del rows, 624 chg bounds, 0 chg sides, 0 chg coeffs, 3218 tsx applied, 0 tsx conflicts 188: round 10 ( Fast ): 54 del cols, 325 del rows, 635 chg bounds, 0 chg sides, 0 chg coeffs, 3240 tsx applied, 0 tsx conflicts 188: round 11 ( Fast ): 54 del cols, 325 del rows, 646 chg bounds, 0 chg sides, 0 chg coeffs, 3262 tsx applied, 0 tsx conflicts 188: round 12 ( Fast ): 54 del cols, 325 del rows, 657 chg bounds, 0 chg sides, 0 chg coeffs, 3284 tsx applied, 0 tsx conflicts 188: round 13 ( Fast ): 54 del cols, 325 del rows, 668 chg bounds, 0 chg sides, 0 chg coeffs, 3306 tsx applied, 0 tsx conflicts 188: round 14 ( Fast ): 54 del cols, 325 del rows, 680 chg bounds, 0 chg sides, 0 chg coeffs, 3330 tsx applied, 0 tsx conflicts 188: round 15 ( Fast ): 54 del cols, 325 del rows, 693 chg bounds, 0 chg sides, 0 chg coeffs, 3356 tsx applied, 0 tsx conflicts 188: round 16 ( Fast ): 54 del cols, 325 del rows, 707 chg bounds, 0 chg sides, 0 chg coeffs, 3384 tsx applied, 0 tsx conflicts 188: round 17 ( Fast ): 54 del cols, 325 del rows, 722 chg bounds, 0 chg sides, 0 chg coeffs, 3414 tsx applied, 0 tsx conflicts 188: round 18 ( Fast ): 54 del cols, 325 del rows, 738 chg bounds, 0 chg sides, 0 chg coeffs, 3446 tsx applied, 0 tsx conflicts 188: round 19 ( Fast ): 54 del cols, 325 del rows, 754 chg bounds, 0 chg sides, 0 chg coeffs, 3478 tsx applied, 0 tsx conflicts 190: 190: SoPlex status : problem is solved [optimal] 190: Solving time (sec) : 0.00 190: Iterations : 24 190: Objective value : 3.35924858e+04 190: 190: Solution passed validation 190: 190: postsolve finished after 0.063 seconds 190: feasible: true 190: objective value: 33592.4858072 190: 190: violations: 190: bounds: 0 190: constraints: 0 190: integrality: 0 190: 190: validation: SUCCESS 190: Solving time 0.229 seconds 190: 190: solving finished after 0.229 seconds 189/287 Test #190: q-solve-beaconfd.mps-lp_presolvers_without_basis.set ....................................... Passed 0.42 sec test 193 Start 193: q-solve-bore3d.mps-lp_presolvers_without_basis.set 193: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bore3d.mps" "-o" "0.13730803942084927215581987251301e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 193: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 193: Test timeout computed to be: 10000000 192: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 192: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 192: 192: External libraries: 192: Boost 1.83.0 (https://www.boost.org/) 192: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 192: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 192: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 192: 192: reading took 0.0234 seconds 192: Numerical Statistics: 192: Matrix range [1e-04,1e+03] 192: Objective range [3e-04,3e+02] 192: Bounds range [1e+01,1e+02] 192: RHS range [0e+00,0e+00] 192: Dynamism Variables: 2e+05 192: Dynamism Rows : 2e+06 192: set presolve.componentsmaxint = -1 192: set presolve.detectlindep = 0 192: set doubletoneq.enabled = 0 192: set dualinfer.enabled = 0 192: set substitution.enabled = 0 192: set sparsify.enabled = 0 192: set calculate_basis_for_dual = 0 192: 192: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bore3d.mps with dual-postsolve activated 192: rows: 233 192: columns: 315 192: int. columns: 0 192: cont. columns: 315 192: nonzeros: 1429 192: 192: round 0 ( Trivial ): 39 del cols, 41 del rows, 40 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 192: round 1 ( Fast ): 91 del cols, 58 del rows, 134 chg bounds, 0 chg sides, 0 chg coeffs, 190 tsx applied, 0 tsx conflicts 192: round 2 ( Fast ): 122 del cols, 90 del rows, 233 chg bounds, 0 chg sides, 0 chg coeffs, 430 tsx applied, 0 tsx conflicts 192: round 3 ( Fast ): 126 del cols, 94 del rows, 332 chg bounds, 0 chg sides, 0 chg coeffs, 626 tsx applied, 0 tsx conflicts 192: round 4 ( Fast ): 126 del cols, 94 del rows, 418 chg bounds, 0 chg sides, 0 chg coeffs, 804 tsx applied, 0 tsx conflicts 192: round 5 ( Fast ): 126 del cols, 94 del rows, 509 chg bounds, 0 chg sides, 0 chg coeffs, 990 tsx applied, 0 tsx conflicts 192: round 6 ( Fast ): 126 del cols, 94 del rows, 613 chg bounds, 0 chg sides, 0 chg coeffs, 1206 tsx applied, 0 tsx conflicts 192: round 7 ( Fast ): 126 del cols, 95 del rows, 729 chg bounds, 0 chg sides, 0 chg coeffs, 1446 tsx applied, 0 tsx conflicts 192: round 8 ( Fast ): 126 del cols, 95 del rows, 836 chg bounds, 0 chg sides, 0 chg coeffs, 1660 tsx applied, 0 tsx conflicts 192: round 9 ( Fast ): 126 del cols, 95 del rows, 937 chg bounds, 0 chg sides, 0 chg coeffs, 1870 tsx applied, 0 tsx conflicts 192: round 10 ( Fast ): 126 del cols, 95 del rows, 1036 chg bounds, 0 chg sides, 0 chg coeffs, 2072 tsx applied, 0 tsx conflicts 192: round 11 ( Fast ): 126 del cols, 95 del rows, 1139 chg bounds, 0 chg sides, 0 chg coeffs, 2280 tsx applied, 0 tsx conflicts 192: round 12 ( Fast ): 126 del cols, 95 del rows, 1241 chg bounds, 0 chg sides, 0 chg coeffs, 2488 tsx applied, 0 tsx conflicts 192: round 13 ( Fast ): 126 del cols, 95 del rows, 1333 chg bounds, 0 chg sides, 0 chg coeffs, 2678 tsx applied, 0 tsx conflicts 192: round 14 ( Fast ): 126 del cols, 95 del rows, 1400 chg bounds, 0 chg sides, 0 chg coeffs, 2816 tsx applied, 0 tsx conflicts 192: round 15 ( Fast ): 126 del cols, 95 del rows, 1451 chg bounds, 0 chg sides, 0 chg coeffs, 2918 tsx applied, 0 tsx conflicts 192: round 16 ( Fast ): 126 del cols, 95 del rows, 1495 chg bounds, 0 chg sides, 0 chg coeffs, 3010 tsx applied, 0 tsx conflicts 192: round 17 ( Fast ): 126 del cols, 95 del rows, 1542 chg bounds, 0 chg sides, 0 chg coeffs, 3104 tsx applied, 0 tsx conflicts 192: round 18 ( Fast ): 126 del cols, 95 del rows, 1570 chg bounds, 0 chg sides, 0 chg coeffs, 3160 tsx applied, 0 tsx conflicts 192: round 19 ( Fast ): 126 del cols, 95 del rows, 1591 chg bounds, 0 chg sides, 0 chg coeffs, 3202 tsx applied, 0 tsx conflicts 192: round 20 ( Medium ): 194 del cols, 159 del rows, 1605 chg bounds, 6 chg sides, 6 chg coeffs, 3300 tsx applied, 1774 tsx conflicts 192: round 21 ( Medium ): 223 del cols, 163 del rows, 1635 chg bounds, 7 chg sides, 7 chg coeffs, 3840 tsx applied, 1781 tsx conflicts 192: round 22 (Exhaustive): 223 del cols, 163 del rows, 1638 chg bounds, 7 chg sides, 7 chg coeffs, 3844 tsx applied, 1781 tsx conflicts 192: round 23 ( Final ): 223 del cols, 163 del rows, 1639 chg bounds, 7 chg sides, 7 chg coeffs, 3845 tsx applied, 1781 tsx conflicts 192: presolved 23 rounds: 223 del cols, 163 del rows, 1639 chg bounds, 7 chg sides, 7 chg coeffs, 3845 tsx applied, 1781 tsx conflicts 192: 192: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 192: colsingleton 23 0.0 0 0.0 0.000 192: coefftightening 0 0.0 0 0.0 0.000 192: propagation 23 95.7 3234 100.0 0.002 192: fixcontinuous 2 0.0 0 0.0 0.000 192: simpleprobing 0 0.0 0 0.0 0.000 192: parallelrows 2 50.0 2 100.0 0.000 192: parallelcols 2 0.0 0 0.0 0.000 192: stuffing 3 66.7 2348 24.6 0.009 192: dualfix 4 100.0 42 76.2 0.000 192: simplifyineq 0 0.0 0 0.0 0.000 192: doubletoneq 0 0.0 0 0.0 0.000 192: implint 0 0.0 0 0.0 0.000 192: domcol 1 0.0 0 0.0 0.000 192: dualinfer 0 0.0 0 0.0 0.000 192: probing 0 0.0 0 0.0 0.000 192: substitution 0 0.0 0 0.0 0.000 192: sparsify 0 0.0 0 0.0 0.000 192: 192: reduced problem: 192: reduced rows: 70 192: reduced columns: 92 192: reduced int. columns: 0 192: reduced cont. columns: 92 192: reduced nonzeros: 475 192: 192: presolving finished after 0.036 seconds 192: 192: Equilibrium scaling LP (persistent) 192: Simplifier removed 10 rows, 10 columns, 67 nonzeros, 4 col bounds, 140 row bounds 192: Reduced LP has 60 rows 82 columns 408 nonzeros 192: Equilibrium scaling LP 192: type | time | iters | facts | shift | viol sum | viol num | obj value 192: L | 0.0 | 0 | 3 | 1.92e-03 | 6.90e+03 | 41 | -1.23498867e+03 192: E | 0.0 | 58 | 4 | 0.00e+00 | 3.44e-03 | 2 | 1.37467410e+03 192: E | 0.0 | 61 | 6 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 192: --- unscaling internal solution 192: --- unsimplifying solution and basis 192: --- unscaling external solution 192: --- verifying computed solution 192: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 192: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 192: --- unscaling external solution 192: --- verifying computed solution 192: 192: SoPlex status : problem is solved [optimal] 192: Solving time (sec) : 0.00 192: Iterations : 61 192: Objective value : 1.37308039e+03 192: 192: Solution passed validation 192: 192: postsolve finished after 0.009 seconds 192: feasible: true 192: objective value: 1373.08039420849 192: 192: violations: 192: bounds: 0 192: constraints: 0 192: integrality: 0 192: 192: validation: SUCCESS 192: Solving time 0.058 seconds 192: 192: solving finished after 0.058 seconds 190/287 Test #192: d-solve-bore3d.mps-lp_presolvers_without_basis.set ......................................... Passed 0.17 sec test 194 Start 194: r-solve-bore3d.mps-lp_presolvers_without_basis.set 194: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bore3d.mps" "-o" "0.13730803942084927215581987251301e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 194: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 194: Test timeout computed to be: 10000000 191: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 191: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 191: 191: External libraries: 191: Boost 1.83.0 (https://www.boost.org/) 191: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 191: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 191: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 191: 191: reading took 0.108 seconds 191: Numerical Statistics: 191: Matrix range [1e-03,5e+02] 191: Objective range [3e-02,1e+02] 191: Bounds range [0e+00,0e+00] 191: RHS range [1e+00,2e+03] 191: Dynamism Variables: 7e+04 191: Dynamism Rows : 2e+03 191: set presolve.componentsmaxint = -1 191: set presolve.detectlindep = 0 191: set doubletoneq.enabled = 0 191: set dualinfer.enabled = 0 191: set substitution.enabled = 0 191: set sparsify.enabled = 0 191: set calculate_basis_for_dual = 0 191: 191: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/beaconfd.mps with dual-postsolve activated 191: rows: 173 191: columns: 262 191: int. columns: 0 191: cont. columns: 262 191: nonzeros: 3375 191: 191: round 0 ( Trivial ): 37 del cols, 37 del rows, 41 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 191: round 1 ( Fast ): 87 del cols, 59 del rows, 214 chg bounds, 0 chg sides, 0 chg coeffs, 346 tsx applied, 0 tsx conflicts 191: round 2 ( Fast ): 114 del cols, 86 del rows, 271 chg bounds, 0 chg sides, 0 chg coeffs, 454 tsx applied, 0 tsx conflicts 191: round 3 ( Medium ): 167 del cols, 135 del rows, 276 chg bounds, 0 chg sides, 0 chg coeffs, 512 tsx applied, 74 tsx conflicts 191: round 4 ( Medium ): 170 del cols, 136 del rows, 276 chg bounds, 1 chg sides, 1 chg coeffs, 514 tsx applied, 82 tsx conflicts 191: round 5 ( Medium ): 172 del cols, 137 del rows, 276 chg bounds, 2 chg sides, 1 chg coeffs, 515 tsx applied, 87 tsx conflicts 191: round 6 (Exhaustive): 184 del cols, 137 del rows, 288 chg bounds, 2 chg sides, 1 chg coeffs, 527 tsx applied, 87 tsx conflicts 191: round 7 ( Fast ): 186 del cols, 139 del rows, 293 chg bounds, 2 chg sides, 1 chg coeffs, 537 tsx applied, 87 tsx conflicts 191: round 8 (Exhaustive): 186 del cols, 139 del rows, 293 chg bounds, 2 chg sides, 1 chg coeffs, 537 tsx applied, 87 tsx conflicts 191: round 9 ( Medium ): 188 del cols, 141 del rows, 293 chg bounds, 2 chg sides, 1 chg coeffs, 539 tsx applied, 91 tsx conflicts 191: round 10 ( Medium ): 191 del cols, 142 del rows, 296 chg bounds, 3 chg sides, 2 chg coeffs, 544 tsx applied, 95 tsx conflicts 191: round 11 (Exhaustive): 192 del cols, 142 del rows, 297 chg bounds, 3 chg sides, 2 chg coeffs, 545 tsx applied, 95 tsx conflicts 191: round 12 ( Fast ): 193 del cols, 143 del rows, 302 chg bounds, 3 chg sides, 2 chg coeffs, 561 tsx applied, 95 tsx conflicts 191: round 13 (Exhaustive): 193 del cols, 143 del rows, 302 chg bounds, 3 chg sides, 2 chg coeffs, 561 tsx applied, 95 tsx conflicts 191: round 14 ( Final ): Unchanged 191: presolved 14 rounds: 193 del cols, 143 del rows, 304 chg bounds, 3 chg sides, 2 chg coeffs, 563 tsx applied, 95 tsx conflicts 191: 191: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 191: colsingleton 14 0.0 0 0.0 0.000 191: coefftightening 0 0.0 0 0.0 0.000 191: propagation 14 28.6 480 100.0 0.043 191: fixcontinuous 4 0.0 0 0.0 0.000 191: simpleprobing 0 0.0 0 0.0 0.000 191: parallelrows 3 0.0 0 0.0 0.006 191: parallelcols 3 33.3 4 100.0 0.027 191: stuffing 8 62.5 151 37.1 0.005 191: dualfix 6 50.0 10 100.0 0.004 191: simplifyineq 0 0.0 0 0.0 0.000 191: doubletoneq 0 0.0 0 0.0 0.000 191: implint 0 0.0 0 0.0 0.000 191: domcol 2 100.0 13 100.0 0.016 191: dualinfer 0 0.0 0 0.0 0.000 191: probing 0 0.0 0 0.0 0.000 191: substitution 0 0.0 0 0.0 0.000 191: sparsify 0 0.0 0 0.0 0.000 191: 191: reduced problem: 191: reduced rows: 30 191: reduced columns: 69 191: reduced int. columns: 0 191: reduced cont. columns: 69 191: reduced nonzeros: 187 191: 191: presolving finished after 0.337 seconds 191: 191: Equilibrium scaling LP (persistent) 191: Simplifier removed 8 rows, 8 columns, 27 nonzeros, 22 col bounds, 24 row bounds 191: Reduced LP has 22 rows 61 columns 159 nonzeros 191: Equilibrium scaling LP 191: type | time | iters | facts | shift | viol sum | viol num | obj value 191: L | 0.0 | 0 | 3 | 8.21e+00 | 7.75e+03 | 19 | 1.06615847e+04 191: E | 0.0 | 20 | 4 | 0.00e+00 | 4.85e+00 | 22 | 3.38146823e+04 191: E | 0.0 | 24 | 5 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 191: --- unscaling internal solution 191: --- unsimplifying solution and basis 191: --- unscaling external solution 191: --- verifying computed solution 191: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 191: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 3.35924858e+04 191: --- unscaling external solution 191: --- verifying computed solution 191: 191: SoPlex status : problem is solved [optimal] 191: Solving time (sec) : 0.00 191: Iterations : 24 191: Objective value : 3.35924858e+04 191: 191: Solution passed validation 191: 191: postsolve finished after 0.098 seconds 191: feasible: true 191: objective value: 33592.4858072 191: 191: violations: 191: bounds: 0 191: constraints: 0 191: integrality: 0 191: 191: validation: SUCCESS 191: Solving time 0.447 seconds 191: 191: solving finished after 0.447 seconds 191/287 Test #191: r-solve-beaconfd.mps-lp_presolvers_without_basis.set ....................................... Passed 0.70 sec test 195 Start 195: d-solve-brandy.mps-lp_presolvers_without_basis.set 195: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/brandy.mps" "-o" "0.15185098964881283835426751550618e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 195: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 195: Test timeout computed to be: 10000000 193: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 193: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 193: 193: External libraries: 193: Boost 1.83.0 (https://www.boost.org/) 193: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 193: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 193: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 193: 193: reading took 0.029 seconds 193: Numerical Statistics: 193: Matrix range [1e-04,1e+03] 193: Objective range [3e-04,3e+02] 193: Bounds range [1e+01,1e+02] 193: RHS range [0e+00,0e+00] 193: Dynamism Variables: 2e+05 193: Dynamism Rows : 2e+06 193: set presolve.componentsmaxint = -1 193: set presolve.detectlindep = 0 193: set doubletoneq.enabled = 0 193: set dualinfer.enabled = 0 193: set substitution.enabled = 0 193: set sparsify.enabled = 0 193: set calculate_basis_for_dual = 0 193: 193: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bore3d.mps with dual-postsolve activated 193: rows: 233 193: columns: 315 193: int. columns: 0 193: cont. columns: 315 193: nonzeros: 1429 193: 193: round 0 ( Trivial ): 39 del cols, 41 del rows, 40 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 193: round 1 ( Fast ): 91 del cols, 58 del rows, 134 chg bounds, 0 chg sides, 0 chg coeffs, 190 tsx applied, 0 tsx conflicts 193: round 2 ( Fast ): 122 del cols, 90 del rows, 233 chg bounds, 0 chg sides, 0 chg coeffs, 430 tsx applied, 0 tsx conflicts 193: round 3 ( Fast ): 126 del cols, 94 del rows, 332 chg bounds, 0 chg sides, 0 chg coeffs, 626 tsx applied, 0 tsx conflicts 193: round 4 ( Fast ): 126 del cols, 94 del rows, 418 chg bounds, 0 chg sides, 0 chg coeffs, 804 tsx applied, 0 tsx conflicts 193: round 5 ( Fast ): 126 del cols, 94 del rows, 509 chg bounds, 0 chg sides, 0 chg coeffs, 990 tsx applied, 0 tsx conflicts 193: round 6 ( Fast ): 126 del cols, 94 del rows, 613 chg bounds, 0 chg sides, 0 chg coeffs, 1206 tsx applied, 0 tsx conflicts 193: round 7 ( Fast ): 126 del cols, 95 del rows, 729 chg bounds, 0 chg sides, 0 chg coeffs, 1446 tsx applied, 0 tsx conflicts 193: round 8 ( Fast ): 126 del cols, 95 del rows, 836 chg bounds, 0 chg sides, 0 chg coeffs, 1660 tsx applied, 0 tsx conflicts 193: round 9 ( Fast ): 126 del cols, 95 del rows, 937 chg bounds, 0 chg sides, 0 chg coeffs, 1870 tsx applied, 0 tsx conflicts 193: round 10 ( Fast ): 126 del cols, 95 del rows, 1036 chg bounds, 0 chg sides, 0 chg coeffs, 2072 tsx applied, 0 tsx conflicts 193: round 11 ( Fast ): 126 del cols, 95 del rows, 1139 chg bounds, 0 chg sides, 0 chg coeffs, 2280 tsx applied, 0 tsx conflicts 193: round 12 ( Fast ): 126 del cols, 95 del rows, 1241 chg bounds, 0 chg sides, 0 chg coeffs, 2488 tsx applied, 0 tsx conflicts 193: round 13 ( Fast ): 126 del cols, 95 del rows, 1333 chg bounds, 0 chg sides, 0 chg coeffs, 2678 tsx applied, 0 tsx conflicts 193: round 14 ( Fast ): 126 del cols, 95 del rows, 1400 chg bounds, 0 chg sides, 0 chg coeffs, 2816 tsx applied, 0 tsx conflicts 193: round 15 ( Fast ): 126 del cols, 95 del rows, 1451 chg bounds, 0 chg sides, 0 chg coeffs, 2918 tsx applied, 0 tsx conflicts 193: round 16 ( Fast ): 126 del cols, 95 del rows, 1495 chg bounds, 0 chg sides, 0 chg coeffs, 3010 tsx applied, 0 tsx conflicts 193: round 17 ( Fast ): 126 del cols, 95 del rows, 1542 chg bounds, 0 chg sides, 0 chg coeffs, 3104 tsx applied, 0 tsx conflicts 193: round 18 ( Fast ): 126 del cols, 95 del rows, 1570 chg bounds, 0 chg sides, 0 chg coeffs, 3160 tsx applied, 0 tsx conflicts 193: round 19 ( Fast ): 126 del cols, 95 del rows, 1591 chg bounds, 0 chg sides, 0 chg coeffs, 3202 tsx applied, 0 tsx conflicts 193: round 20 ( Medium ): 194 del cols, 159 del rows, 1605 chg bounds, 6 chg sides, 6 chg coeffs, 3300 tsx applied, 1774 tsx conflicts 193: round 21 ( Medium ): 223 del cols, 163 del rows, 1635 chg bounds, 7 chg sides, 7 chg coeffs, 3840 tsx applied, 1781 tsx conflicts 193: round 22 (Exhaustive): 223 del cols, 163 del rows, 1638 chg bounds, 7 chg sides, 7 chg coeffs, 3844 tsx applied, 1781 tsx conflicts 193: round 23 ( Final ): 223 del cols, 163 del rows, 1639 chg bounds, 7 chg sides, 7 chg coeffs, 3845 tsx applied, 1781 tsx conflicts 193: presolved 23 rounds: 223 del cols, 163 del rows, 1639 chg bounds, 7 chg sides, 7 chg coeffs, 3845 tsx applied, 1781 tsx conflicts 193: 193: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 193: colsingleton 23 0.0 0 0.0 0.000 193: coefftightening 0 0.0 0 0.0 0.000 193: propagation 23 95.7 3234 100.0 0.080 193: fixcontinuous 2 0.0 0 0.0 0.000 193: simpleprobing 0 0.0 0 0.0 0.000 193: parallelrows 2 50.0 2 100.0 0.001 193: parallelcols 2 0.0 0 0.0 0.007 193: stuffing 3 66.7 2348 24.6 0.023 193: dualfix 4 100.0 42 76.2 0.002 193: simplifyineq 0 0.0 0 0.0 0.000 193: doubletoneq 0 0.0 0 0.0 0.000 193: implint 0 0.0 0 0.0 0.000 193: domcol 1 0.0 0 0.0 0.002 193: dualinfer 0 0.0 0 0.0 0.000 193: probing 0 0.0 0 0.0 0.000 193: substitution 0 0.0 0 0.0 0.000 193: sparsify 0 0.0 0 0.0 0.000 193: 193: reduced problem: 193: reduced rows: 70 193: reduced columns: 92 193: reduced int. columns: 0 193: reduced cont. columns: 92 193: reduced nonzeros: 475 193: 193: presolving finished after 0.274 seconds 193: 193: Equilibrium scaling LP (persistent) 193: Simplifier removed 10 rows, 10 columns, 67 nonzeros, 5 col bounds, 140 row bounds 193: Reduced LP has 60 rows 82 columns 408 nonzeros 193: Equilibrium scaling LP 193: type | time | iters | facts | shift | viol sum | viol num | obj value 193: L | 0.0 | 0 | 3 | 1.74e+01 | 6.90e+03 | 41 | -1.26627398e+03 193: E | 0.0 | 58 | 4 | 0.00e+00 | 3.44e-03 | 2 | 1.37467410e+03 193: E | 0.0 | 61 | 6 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 193: --- unscaling internal solution 193: --- unsimplifying solution and basis 193: --- unscaling external solution 193: --- verifying computed solution 193: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 193: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 193: --- unscaling external solution 193: --- verifying computed solution 195: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 195: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 195: 195: External libraries: 195: Boost 1.83.0 (https://www.boost.org/) 195: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 195: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 195: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 195: 195: reading took 0.0231 seconds 195: Numerical Statistics: 195: Matrix range [0e+00,2e+02] 195: Objective range [1e+00,1e+00] 195: Bounds range [0e+00,0e+00] 195: RHS range [2e-01,1e+02] 195: Dynamism Variables: 4e+04 195: Dynamism Rows : 2e+04 195: set presolve.componentsmaxint = -1 195: set presolve.detectlindep = 0 195: set doubletoneq.enabled = 0 195: set dualinfer.enabled = 0 195: set substitution.enabled = 0 195: set sparsify.enabled = 0 195: set calculate_basis_for_dual = 0 195: 195: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/brandy.mps with dual-postsolve activated 195: rows: 220 195: columns: 249 195: int. columns: 0 195: cont. columns: 249 195: nonzeros: 2148 195: 195: round 0 ( Trivial ): 41 del cols, 58 del rows, 73 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 195: round 1 ( Fast ): 44 del cols, 59 del rows, 166 chg bounds, 0 chg sides, 0 chg coeffs, 192 tsx applied, 0 tsx conflicts 195: round 2 ( Fast ): 44 del cols, 59 del rows, 245 chg bounds, 0 chg sides, 0 chg coeffs, 392 tsx applied, 0 tsx conflicts 195: round 3 ( Fast ): 44 del cols, 59 del rows, 288 chg bounds, 0 chg sides, 0 chg coeffs, 480 tsx applied, 0 tsx conflicts 195: round 4 ( Medium ): 61 del cols, 61 del rows, 305 chg bounds, 11 chg sides, 11 chg coeffs, 531 tsx applied, 43 tsx conflicts 195: round 5 ( Medium ): 64 del cols, 63 del rows, 321 chg bounds, 12 chg sides, 12 chg coeffs, 566 tsx applied, 46 tsx conflicts 195: round 6 (Exhaustive): 66 del cols, 64 del rows, 330 chg bounds, 12 chg sides, 12 chg coeffs, 581 tsx applied, 46 tsx conflicts 195: round 7 ( Final ): 66 del cols, 64 del rows, 334 chg bounds, 12 chg sides, 12 chg coeffs, 589 tsx applied, 46 tsx conflicts 195: presolved 7 rounds: 66 del cols, 64 del rows, 334 chg bounds, 12 chg sides, 12 chg coeffs, 589 tsx applied, 46 tsx conflicts 195: 195: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 195: colsingleton 7 0.0 0 0.0 0.000 195: coefftightening 0 0.0 0 0.0 0.000 195: propagation 7 100.0 564 100.0 0.003 195: fixcontinuous 2 0.0 0 0.0 0.000 195: simpleprobing 0 0.0 0 0.0 0.000 195: parallelrows 2 0.0 0 0.0 0.000 195: parallelcols 2 50.0 4 100.0 0.001 195: stuffing 3 66.7 62 25.8 0.000 195: dualfix 3 33.3 4 100.0 0.000 195: simplifyineq 0 0.0 0 0.0 0.000 195: doubletoneq 0 0.0 0 0.0 0.000 195: implint 0 0.0 0 0.0 0.000 195: domcol 1 100.0 1 100.0 0.000 195: dualinfer 0 0.0 0 0.0 0.000 195: probing 0 0.0 0 0.0 0.000 195: substitution 0 0.0 0 0.0 0.000 195: sparsify 0 0.0 0 0.0 0.000 195: 195: reduced problem: 195: reduced rows: 118 195: reduced columns: 183 195: reduced int. columns: 0 195: reduced cont. columns: 183 195: reduced nonzeros: 1657 195: 195: presolving finished after 0.014 seconds 195: 195: Equilibrium scaling LP (persistent) 193: 193: SoPlex status : problem is solved [optimal] 193: Solving time (sec) : 0.00 193: Iterations : 61 193: Objective value : 1.37308039e+03 193: 193: Solution passed validation 193: 193: postsolve finished after 0.027 seconds 193: feasible: true 193: objective value: 1373.08039420849 193: 193: violations: 193: bounds: 0 193: constraints: 0 193: integrality: 0 193: 193: validation: SUCCESS 193: Solving time 0.317 seconds 193: 193: solving finished after 0.317 seconds 195: Simplifier removed 5 rows, 4 columns, 16 nonzeros, 19 col bounds, 33 row bounds 195: Reduced LP has 113 rows 179 columns 1636 nonzeros 195: Equilibrium scaling LP 195: type | time | iters | facts | shift | viol sum | viol num | obj value 195: L | 0.0 | 0 | 3 | 8.70e-01 | 5.51e+02 | 67 | -4.21328568e+02 192/287 Test #193: q-solve-bore3d.mps-lp_presolvers_without_basis.set ......................................... Passed 0.44 sec test 196 Start 196: q-solve-brandy.mps-lp_presolvers_without_basis.set 196: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/brandy.mps" "-o" "0.15185098964881283835426751550618e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 196: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 196: Test timeout computed to be: 10000000 195: L | 0.0 | 199 | 4 | 8.70e-01 | 1.01e+03 | 36 | 7.65607970e+02 195: L | 0.0 | 399 | 6 | 8.70e-01 | 9.03e+02 | 23 | 1.44780551e+03 195: E | 0.0 | 488 | 9 | 0.00e+00 | 1.47e-02 | 2 | 1.51851652e+03 195: E | 0.0 | 489 | 11 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 195: --- unscaling internal solution 195: --- unsimplifying solution and basis 195: --- unscaling external solution 195: --- verifying computed solution 195: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 195: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 195: --- unscaling external solution 195: --- verifying computed solution 195: 195: SoPlex status : problem is solved [optimal] 195: Solving time (sec) : 0.04 195: Iterations : 489 195: Objective value : 1.51850990e+03 195: 195: Solution passed validation 195: 195: postsolve finished after 0.009 seconds 195: feasible: true 195: objective value: 1518.50989648813 195: 195: violations: 195: bounds: 0 195: constraints: 0 195: integrality: 0 195: 195: validation: SUCCESS 195: Solving time 0.131 seconds 195: 195: solving finished after 0.131 seconds 193/287 Test #195: d-solve-brandy.mps-lp_presolvers_without_basis.set ......................................... Passed 0.23 sec test 197 Start 197: r-solve-brandy.mps-lp_presolvers_without_basis.set 197: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/brandy.mps" "-o" "0.15185098964881283835426751550618e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 197: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 197: Test timeout computed to be: 10000000 188: round 20 ( Fast ): 54 del cols, 325 del rows, 770 chg bounds, 0 chg sides, 0 chg coeffs, 3510 tsx applied, 0 tsx conflicts 188: round 21 ( Fast ): 54 del cols, 325 del rows, 786 chg bounds, 0 chg sides, 0 chg coeffs, 3542 tsx applied, 0 tsx conflicts 188: round 22 ( Fast ): 54 del cols, 325 del rows, 802 chg bounds, 0 chg sides, 0 chg coeffs, 3574 tsx applied, 0 tsx conflicts 188: round 23 ( Fast ): 54 del cols, 325 del rows, 818 chg bounds, 0 chg sides, 0 chg coeffs, 3606 tsx applied, 0 tsx conflicts 188: round 24 ( Fast ): 54 del cols, 325 del rows, 834 chg bounds, 0 chg sides, 0 chg coeffs, 3638 tsx applied, 0 tsx conflicts 188: round 25 ( Fast ): 54 del cols, 325 del rows, 850 chg bounds, 0 chg sides, 0 chg coeffs, 3670 tsx applied, 0 tsx conflicts 188: round 26 ( Fast ): 54 del cols, 325 del rows, 866 chg bounds, 0 chg sides, 0 chg coeffs, 3702 tsx applied, 0 tsx conflicts 188: round 27 ( Fast ): 54 del cols, 325 del rows, 882 chg bounds, 0 chg sides, 0 chg coeffs, 3734 tsx applied, 0 tsx conflicts 188: round 28 ( Fast ): 54 del cols, 325 del rows, 898 chg bounds, 0 chg sides, 0 chg coeffs, 3766 tsx applied, 0 tsx conflicts 188: round 29 ( Fast ): 54 del cols, 325 del rows, 914 chg bounds, 0 chg sides, 0 chg coeffs, 3798 tsx applied, 0 tsx conflicts 188: round 30 ( Fast ): 54 del cols, 325 del rows, 930 chg bounds, 0 chg sides, 0 chg coeffs, 3830 tsx applied, 0 tsx conflicts 188: round 31 ( Fast ): 54 del cols, 325 del rows, 946 chg bounds, 0 chg sides, 0 chg coeffs, 3862 tsx applied, 0 tsx conflicts 188: round 32 ( Fast ): 54 del cols, 325 del rows, 962 chg bounds, 0 chg sides, 0 chg coeffs, 3894 tsx applied, 0 tsx conflicts 188: round 33 ( Fast ): 54 del cols, 325 del rows, 978 chg bounds, 0 chg sides, 0 chg coeffs, 3926 tsx applied, 0 tsx conflicts 188: round 34 ( Fast ): 54 del cols, 325 del rows, 994 chg bounds, 0 chg sides, 0 chg coeffs, 3958 tsx applied, 0 tsx conflicts 188: round 35 ( Fast ): 54 del cols, 325 del rows, 1010 chg bounds, 0 chg sides, 0 chg coeffs, 3990 tsx applied, 0 tsx conflicts 188: round 36 ( Fast ): 54 del cols, 325 del rows, 1026 chg bounds, 0 chg sides, 0 chg coeffs, 4022 tsx applied, 0 tsx conflicts 188: round 37 ( Fast ): 54 del cols, 325 del rows, 1042 chg bounds, 0 chg sides, 0 chg coeffs, 4054 tsx applied, 0 tsx conflicts 188: round 38 ( Fast ): 54 del cols, 325 del rows, 1058 chg bounds, 0 chg sides, 0 chg coeffs, 4086 tsx applied, 0 tsx conflicts 188: round 39 ( Fast ): 54 del cols, 325 del rows, 1074 chg bounds, 0 chg sides, 0 chg coeffs, 4118 tsx applied, 0 tsx conflicts 188: round 40 ( Fast ): 54 del cols, 325 del rows, 1090 chg bounds, 0 chg sides, 0 chg coeffs, 4150 tsx applied, 0 tsx conflicts 188: round 41 ( Fast ): 54 del cols, 325 del rows, 1106 chg bounds, 0 chg sides, 0 chg coeffs, 4182 tsx applied, 0 tsx conflicts 188: round 42 ( Fast ): 54 del cols, 325 del rows, 1122 chg bounds, 0 chg sides, 0 chg coeffs, 4214 tsx applied, 0 tsx conflicts 188: round 43 ( Fast ): 54 del cols, 325 del rows, 1138 chg bounds, 0 chg sides, 0 chg coeffs, 4246 tsx applied, 0 tsx conflicts 188: round 44 ( Fast ): 54 del cols, 325 del rows, 1154 chg bounds, 0 chg sides, 0 chg coeffs, 4278 tsx applied, 0 tsx conflicts 188: round 45 ( Fast ): 54 del cols, 325 del rows, 1169 chg bounds, 0 chg sides, 0 chg coeffs, 4308 tsx applied, 0 tsx conflicts 188: round 46 ( Fast ): 54 del cols, 325 del rows, 1185 chg bounds, 0 chg sides, 0 chg coeffs, 4340 tsx applied, 0 tsx conflicts 188: round 47 ( Fast ): 54 del cols, 325 del rows, 1200 chg bounds, 0 chg sides, 0 chg coeffs, 4370 tsx applied, 0 tsx conflicts 188: round 48 ( Fast ): 54 del cols, 325 del rows, 1216 chg bounds, 0 chg sides, 0 chg coeffs, 4402 tsx applied, 0 tsx conflicts 196: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 196: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 196: 196: External libraries: 196: Boost 1.83.0 (https://www.boost.org/) 196: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 196: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 196: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 196: 196: reading took 0.0376 seconds 196: Numerical Statistics: 196: Matrix range [0e+00,2e+02] 196: Objective range [1e+00,1e+00] 196: Bounds range [0e+00,0e+00] 196: RHS range [2e-01,1e+02] 196: Dynamism Variables: 4e+04 196: Dynamism Rows : 2e+04 196: set presolve.componentsmaxint = -1 196: set presolve.detectlindep = 0 196: set doubletoneq.enabled = 0 196: set dualinfer.enabled = 0 196: set substitution.enabled = 0 196: set sparsify.enabled = 0 196: set calculate_basis_for_dual = 0 196: 196: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/brandy.mps with dual-postsolve activated 196: rows: 220 196: columns: 249 196: int. columns: 0 196: cont. columns: 249 196: nonzeros: 2148 196: 196: round 0 ( Trivial ): 41 del cols, 58 del rows, 73 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 196: round 1 ( Fast ): 44 del cols, 59 del rows, 166 chg bounds, 0 chg sides, 0 chg coeffs, 192 tsx applied, 0 tsx conflicts 196: round 2 ( Fast ): 44 del cols, 59 del rows, 245 chg bounds, 0 chg sides, 0 chg coeffs, 392 tsx applied, 0 tsx conflicts 196: round 3 ( Fast ): 44 del cols, 59 del rows, 288 chg bounds, 0 chg sides, 0 chg coeffs, 480 tsx applied, 0 tsx conflicts 196: round 4 ( Medium ): 61 del cols, 61 del rows, 305 chg bounds, 11 chg sides, 11 chg coeffs, 531 tsx applied, 43 tsx conflicts 196: round 5 ( Medium ): 64 del cols, 63 del rows, 321 chg bounds, 12 chg sides, 12 chg coeffs, 566 tsx applied, 46 tsx conflicts 196: round 6 (Exhaustive): 66 del cols, 64 del rows, 330 chg bounds, 12 chg sides, 12 chg coeffs, 581 tsx applied, 46 tsx conflicts 196: round 7 ( Final ): 66 del cols, 64 del rows, 334 chg bounds, 12 chg sides, 12 chg coeffs, 589 tsx applied, 46 tsx conflicts 196: presolved 7 rounds: 66 del cols, 64 del rows, 334 chg bounds, 12 chg sides, 12 chg coeffs, 589 tsx applied, 46 tsx conflicts 196: 196: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 196: colsingleton 7 0.0 0 0.0 0.000 196: coefftightening 0 0.0 0 0.0 0.000 196: propagation 7 100.0 564 100.0 0.005 196: fixcontinuous 2 0.0 0 0.0 0.000 196: simpleprobing 0 0.0 0 0.0 0.000 196: parallelrows 2 0.0 0 0.0 0.003 196: parallelcols 2 50.0 4 100.0 0.002 196: stuffing 3 66.7 62 25.8 0.001 196: dualfix 3 33.3 4 100.0 0.001 196: simplifyineq 0 0.0 0 0.0 0.000 196: doubletoneq 0 0.0 0 0.0 0.000 196: implint 0 0.0 0 0.0 0.000 196: domcol 1 100.0 1 100.0 0.003 196: dualinfer 0 0.0 0 0.0 0.000 196: probing 0 0.0 0 0.0 0.000 196: substitution 0 0.0 0 0.0 0.000 196: sparsify 0 0.0 0 0.0 0.000 196: 196: reduced problem: 196: reduced rows: 118 196: reduced columns: 183 196: reduced int. columns: 0 196: reduced cont. columns: 183 196: reduced nonzeros: 1657 196: 196: presolving finished after 0.070 seconds 196: 196: Equilibrium scaling LP (persistent) 196: Simplifier removed 5 rows, 4 columns, 16 nonzeros, 19 col bounds, 33 row bounds 196: Reduced LP has 113 rows 179 columns 1636 nonzeros 196: Equilibrium scaling LP 196: type | time | iters | facts | shift | viol sum | viol num | obj value 196: L | 0.0 | 0 | 3 | 8.70e-01 | 5.51e+02 | 67 | -4.21328568e+02 196: L | 0.0 | 199 | 4 | 8.70e-01 | 1.01e+03 | 36 | 7.65607970e+02 196: L | 0.0 | 399 | 6 | 8.70e-01 | 1.27e+02 | 20 | 1.44784033e+03 196: E | 0.0 | 487 | 9 | 0.00e+00 | 1.47e-02 | 2 | 1.51851652e+03 196: E | 0.0 | 488 | 11 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 196: --- unscaling internal solution 196: --- unsimplifying solution and basis 196: --- unscaling external solution 196: --- verifying computed solution 196: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 196: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 196: --- unscaling external solution 196: --- verifying computed solution 196: 196: SoPlex status : problem is solved [optimal] 196: Solving time (sec) : 0.04 196: Iterations : 488 196: Objective value : 1.51850990e+03 196: 196: Solution passed validation 196: 196: postsolve finished after 0.019 seconds 196: feasible: true 196: objective value: 1518.50989648813 196: 196: violations: 196: bounds: 0 196: constraints: 0 196: integrality: 0 196: 196: validation: SUCCESS 196: Solving time 0.149 seconds 196: 196: solving finished after 0.149 seconds 194/287 Test #196: q-solve-brandy.mps-lp_presolvers_without_basis.set ......................................... Passed 0.26 sec test 198 Start 198: d-solve-capri.mps-lp_presolvers_without_basis.set 198: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/capri.mps" "-o" "0.26900129137681610087717280693754e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 198: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 198: Test timeout computed to be: 10000000 198: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 198: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 198: 198: External libraries: 198: Boost 1.83.0 (https://www.boost.org/) 198: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 198: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 198: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 198: 198: reading took 0.012 seconds 198: Numerical Statistics: 198: Matrix range [4e-03,2e+02] 198: Objective range [2e-01,1e+00] 198: Bounds range [1e+00,3e+02] 198: RHS range [3e-02,3e+03] 198: Dynamism Variables: 1e+04 198: Dynamism Rows : 2e+06 198: set presolve.componentsmaxint = -1 198: set presolve.detectlindep = 0 198: set doubletoneq.enabled = 0 198: set dualinfer.enabled = 0 198: set substitution.enabled = 0 198: set sparsify.enabled = 0 198: set calculate_basis_for_dual = 0 198: 198: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/capri.mps with dual-postsolve activated 198: rows: 271 198: columns: 353 198: int. columns: 0 198: cont. columns: 353 198: nonzeros: 1767 198: 198: round 0 ( Trivial ): 24 del cols, 8 del rows, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 198: round 1 ( Fast ): 27 del cols, 13 del rows, 154 chg bounds, 0 chg sides, 0 chg coeffs, 344 tsx applied, 0 tsx conflicts 198: round 2 ( Fast ): 32 del cols, 20 del rows, 217 chg bounds, 0 chg sides, 0 chg coeffs, 512 tsx applied, 0 tsx conflicts 198: round 3 ( Fast ): 32 del cols, 22 del rows, 259 chg bounds, 0 chg sides, 0 chg coeffs, 598 tsx applied, 0 tsx conflicts 198: round 4 ( Fast ): 32 del cols, 22 del rows, 307 chg bounds, 0 chg sides, 0 chg coeffs, 696 tsx applied, 0 tsx conflicts 198: round 5 ( Medium ): 56 del cols, 33 del rows, 368 chg bounds, 0 chg sides, 0 chg coeffs, 843 tsx applied, 49 tsx conflicts 198: round 6 ( Medium ): 64 del cols, 37 del rows, 379 chg bounds, 8 chg sides, 4 chg coeffs, 866 tsx applied, 61 tsx conflicts 198: round 7 (Exhaustive): 64 del cols, 37 del rows, 383 chg bounds, 8 chg sides, 4 chg coeffs, 870 tsx applied, 61 tsx conflicts 198: round 8 ( Final ): 64 del cols, 37 del rows, 383 chg bounds, 8 chg sides, 4 chg coeffs, 870 tsx applied, 61 tsx conflicts 198: presolved 8 rounds: 64 del cols, 37 del rows, 383 chg bounds, 8 chg sides, 4 chg coeffs, 870 tsx applied, 61 tsx conflicts 198: 198: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 198: colsingleton 8 0.0 0 0.0 0.000 198: coefftightening 0 0.0 0 0.0 0.000 198: propagation 8 75.0 754 100.0 0.001 198: fixcontinuous 2 0.0 0 0.0 0.000 198: simpleprobing 0 0.0 0 0.0 0.000 198: parallelrows 2 0.0 0 0.0 0.000 198: parallelcols 2 0.0 0 0.0 0.002 198: stuffing 3 66.7 124 54.0 0.000 198: dualfix 4 75.0 53 92.5 0.000 198: simplifyineq 0 0.0 0 0.0 0.000 198: doubletoneq 0 0.0 0 0.0 0.000 198: implint 0 0.0 0 0.0 0.000 198: domcol 1 0.0 0 0.0 0.000 198: dualinfer 0 0.0 0 0.0 0.000 198: probing 0 0.0 0 0.0 0.000 198: substitution 0 0.0 0 0.0 0.000 198: sparsify 0 0.0 0 0.0 0.000 198: 198: reduced problem: 198: reduced rows: 234 198: reduced columns: 289 198: reduced int. columns: 0 198: reduced cont. columns: 289 198: reduced nonzeros: 1298 198: 198: presolving finished after 0.021 seconds 198: 198: Equilibrium scaling LP (persistent) 198: Simplifier removed 22 rows, 22 columns, 55 nonzeros, 106 col bounds, 95 row bounds 198: Reduced LP has 212 rows 267 columns 1243 nonzeros 198: Equilibrium scaling LP 198: type | time | iters | facts | shift | viol sum | viol num | obj value 198: L | 0.0 | 0 | 3 | 8.49e+00 | 1.06e+04 | 94 | -1.62468034e+03 198: L | 0.0 | 199 | 3 | 8.49e+00 | 4.44e+01 | 94 | -1.33608584e+03 198: E | 0.0 | 246 | 5 | 0.00e+00 | 2.87e+02 | 21 | 3.05866573e+03 198: L | 0.0 | 296 | 6 | 0.00e+00 | 4.03e-05 | 1 | 2.69001291e+03 198: L | 0.0 | 297 | 7 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 198: --- unscaling internal solution 198: --- unsimplifying solution and basis 198: --- unscaling external solution 198: --- verifying computed solution 198: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 198: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 198: --- unscaling external solution 198: --- verifying computed solution 198: 198: SoPlex status : problem is solved [optimal] 198: Solving time (sec) : 0.02 198: Iterations : 297 198: Objective value : 2.69001291e+03 198: 198: Solution passed validation 198: 198: postsolve finished after 0.000 seconds 198: feasible: true 198: objective value: 2690.01291376816 198: 198: violations: 198: bounds: 3.5527136788005e-15 198: constraints: 0 198: integrality: 0 198: 198: validation: SUCCESS 198: Solving time 0.055 seconds 198: 198: solving finished after 0.055 seconds 195/287 Test #198: d-solve-capri.mps-lp_presolvers_without_basis.set .......................................... Passed 0.10 sec test 199 Start 199: q-solve-capri.mps-lp_presolvers_without_basis.set 199: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/capri.mps" "-o" "0.26900129137681610087717280693754e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 199: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 199: Test timeout computed to be: 10000000 199: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 199: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 199: 199: External libraries: 199: Boost 1.83.0 (https://www.boost.org/) 199: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 199: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 199: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 199: 199: reading took 0.0157 seconds 199: Numerical Statistics: 199: Matrix range [4e-03,2e+02] 199: Objective range [2e-01,1e+00] 199: Bounds range [1e+00,3e+02] 199: RHS range [3e-02,3e+03] 199: Dynamism Variables: 1e+04 199: Dynamism Rows : 2e+06 199: set presolve.componentsmaxint = -1 199: set presolve.detectlindep = 0 199: set doubletoneq.enabled = 0 199: set dualinfer.enabled = 0 199: set substitution.enabled = 0 199: set sparsify.enabled = 0 199: set calculate_basis_for_dual = 0 199: 199: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/capri.mps with dual-postsolve activated 199: rows: 271 199: columns: 353 199: int. columns: 0 199: cont. columns: 353 199: nonzeros: 1767 199: 199: round 0 ( Trivial ): 24 del cols, 8 del rows, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 199: round 1 ( Fast ): 27 del cols, 13 del rows, 166 chg bounds, 0 chg sides, 0 chg coeffs, 344 tsx applied, 0 tsx conflicts 199: round 2 ( Fast ): 32 del cols, 20 del rows, 229 chg bounds, 0 chg sides, 0 chg coeffs, 512 tsx applied, 0 tsx conflicts 199: round 3 ( Fast ): 32 del cols, 22 del rows, 271 chg bounds, 0 chg sides, 0 chg coeffs, 598 tsx applied, 0 tsx conflicts 199: round 4 ( Fast ): 32 del cols, 22 del rows, 319 chg bounds, 0 chg sides, 0 chg coeffs, 696 tsx applied, 0 tsx conflicts 199: round 5 ( Medium ): 56 del cols, 33 del rows, 380 chg bounds, 0 chg sides, 0 chg coeffs, 843 tsx applied, 49 tsx conflicts 199: round 6 ( Medium ): 64 del cols, 37 del rows, 391 chg bounds, 8 chg sides, 4 chg coeffs, 866 tsx applied, 61 tsx conflicts 199: round 7 (Exhaustive): 64 del cols, 37 del rows, 395 chg bounds, 8 chg sides, 4 chg coeffs, 870 tsx applied, 61 tsx conflicts 199: round 8 ( Final ): 64 del cols, 37 del rows, 395 chg bounds, 8 chg sides, 4 chg coeffs, 870 tsx applied, 61 tsx conflicts 199: presolved 8 rounds: 64 del cols, 37 del rows, 395 chg bounds, 8 chg sides, 4 chg coeffs, 870 tsx applied, 61 tsx conflicts 199: 199: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 199: colsingleton 8 0.0 0 0.0 0.000 199: coefftightening 0 0.0 0 0.0 0.000 199: propagation 8 75.0 754 100.0 0.008 199: fixcontinuous 2 0.0 0 0.0 0.000 199: simpleprobing 0 0.0 0 0.0 0.000 199: parallelrows 2 0.0 0 0.0 0.004 199: parallelcols 2 0.0 0 0.0 0.002 199: stuffing 3 66.7 124 54.0 0.001 199: dualfix 4 75.0 53 92.5 0.004 199: simplifyineq 0 0.0 0 0.0 0.000 199: doubletoneq 0 0.0 0 0.0 0.000 199: implint 0 0.0 0 0.0 0.000 199: domcol 1 0.0 0 0.0 0.005 199: dualinfer 0 0.0 0 0.0 0.000 199: probing 0 0.0 0 0.0 0.000 199: substitution 0 0.0 0 0.0 0.000 199: sparsify 0 0.0 0 0.0 0.000 199: 199: reduced problem: 199: reduced rows: 234 199: reduced columns: 289 199: reduced int. columns: 0 199: reduced cont. columns: 289 199: reduced nonzeros: 1298 199: 199: presolving finished after 0.063 seconds 199: 199: Equilibrium scaling LP (persistent) 199: Simplifier removed 22 rows, 22 columns, 55 nonzeros, 94 col bounds, 129 row bounds 199: Reduced LP has 212 rows 267 columns 1243 nonzeros 199: Equilibrium scaling LP 199: type | time | iters | facts | shift | viol sum | viol num | obj value 199: L | 0.0 | 0 | 3 | 7.86e+00 | 1.07e+04 | 91 | -1.57074719e+03 194: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 194: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 194: 194: External libraries: 194: Boost 1.83.0 (https://www.boost.org/) 194: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 194: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 194: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 194: 194: reading took 0.0706 seconds 194: Numerical Statistics: 194: Matrix range [1e-04,1e+03] 194: Objective range [3e-04,3e+02] 194: Bounds range [1e+01,1e+02] 194: RHS range [0e+00,0e+00] 194: Dynamism Variables: 2e+05 194: Dynamism Rows : 2e+06 194: set presolve.componentsmaxint = -1 194: set presolve.detectlindep = 0 194: set doubletoneq.enabled = 0 194: set dualinfer.enabled = 0 194: set substitution.enabled = 0 194: set sparsify.enabled = 0 194: set calculate_basis_for_dual = 0 194: 194: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bore3d.mps with dual-postsolve activated 194: rows: 233 194: columns: 315 194: int. columns: 0 194: cont. columns: 315 194: nonzeros: 1429 194: 194: round 0 ( Trivial ): 39 del cols, 41 del rows, 40 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 194: round 1 ( Fast ): 91 del cols, 58 del rows, 134 chg bounds, 0 chg sides, 0 chg coeffs, 190 tsx applied, 0 tsx conflicts 194: round 2 ( Fast ): 122 del cols, 90 del rows, 233 chg bounds, 0 chg sides, 0 chg coeffs, 430 tsx applied, 0 tsx conflicts 194: round 3 ( Fast ): 126 del cols, 94 del rows, 332 chg bounds, 0 chg sides, 0 chg coeffs, 626 tsx applied, 0 tsx conflicts 194: round 4 ( Fast ): 126 del cols, 94 del rows, 418 chg bounds, 0 chg sides, 0 chg coeffs, 804 tsx applied, 0 tsx conflicts 194: round 5 ( Fast ): 126 del cols, 94 del rows, 509 chg bounds, 0 chg sides, 0 chg coeffs, 990 tsx applied, 0 tsx conflicts 194: round 6 ( Fast ): 126 del cols, 94 del rows, 613 chg bounds, 0 chg sides, 0 chg coeffs, 1206 tsx applied, 0 tsx conflicts 194: round 7 ( Fast ): 126 del cols, 95 del rows, 729 chg bounds, 0 chg sides, 0 chg coeffs, 1446 tsx applied, 0 tsx conflicts 194: round 8 ( Fast ): 126 del cols, 95 del rows, 836 chg bounds, 0 chg sides, 0 chg coeffs, 1660 tsx applied, 0 tsx conflicts 194: round 9 ( Fast ): 126 del cols, 95 del rows, 937 chg bounds, 0 chg sides, 0 chg coeffs, 1870 tsx applied, 0 tsx conflicts 194: round 10 ( Fast ): 126 del cols, 95 del rows, 1036 chg bounds, 0 chg sides, 0 chg coeffs, 2072 tsx applied, 0 tsx conflicts 194: round 11 ( Fast ): 126 del cols, 95 del rows, 1139 chg bounds, 0 chg sides, 0 chg coeffs, 2280 tsx applied, 0 tsx conflicts 194: round 12 ( Fast ): 126 del cols, 95 del rows, 1241 chg bounds, 0 chg sides, 0 chg coeffs, 2488 tsx applied, 0 tsx conflicts 194: round 13 ( Fast ): 126 del cols, 95 del rows, 1333 chg bounds, 0 chg sides, 0 chg coeffs, 2678 tsx applied, 0 tsx conflicts 194: round 14 ( Fast ): 126 del cols, 95 del rows, 1400 chg bounds, 0 chg sides, 0 chg coeffs, 2816 tsx applied, 0 tsx conflicts 194: round 15 ( Fast ): 126 del cols, 95 del rows, 1451 chg bounds, 0 chg sides, 0 chg coeffs, 2918 tsx applied, 0 tsx conflicts 194: round 16 ( Fast ): 126 del cols, 95 del rows, 1495 chg bounds, 0 chg sides, 0 chg coeffs, 3010 tsx applied, 0 tsx conflicts 194: round 17 ( Fast ): 126 del cols, 95 del rows, 1542 chg bounds, 0 chg sides, 0 chg coeffs, 3104 tsx applied, 0 tsx conflicts 194: round 18 ( Fast ): 126 del cols, 95 del rows, 1570 chg bounds, 0 chg sides, 0 chg coeffs, 3160 tsx applied, 0 tsx conflicts 194: round 19 ( Fast ): 126 del cols, 95 del rows, 1591 chg bounds, 0 chg sides, 0 chg coeffs, 3202 tsx applied, 0 tsx conflicts 199: L | 0.0 | 199 | 3 | 7.86e+00 | 6.17e+01 | 91 | -1.21555206e+03 199: E | 0.0 | 278 | 5 | 0.00e+00 | 1.62e+02 | 16 | 3.02731552e+03 199: L | 0.0 | 330 | 6 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 199: L | 0.0 | 330 | 6 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 199: --- unscaling internal solution 199: --- unsimplifying solution and basis 199: --- unscaling external solution 199: --- verifying computed solution 199: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 199: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 199: --- unscaling external solution 199: --- verifying computed solution 199: 199: SoPlex status : problem is solved [optimal] 199: Solving time (sec) : 0.04 199: Iterations : 330 199: Objective value : 2.69001291e+03 199: 199: Solution passed validation 199: 199: postsolve finished after 0.016 seconds 199: feasible: true 199: objective value: 2690.01291376816 199: 199: violations: 199: bounds: 1.97712779481662e-14 199: constraints: 0 199: integrality: 0 199: 199: validation: SUCCESS 199: Solving time 0.130 seconds 199: 199: solving finished after 0.130 seconds 196/287 Test #199: q-solve-capri.mps-lp_presolvers_without_basis.set .......................................... Passed 0.18 sec test 200 Start 200: r-solve-capri.mps-lp_presolvers_without_basis.set 200: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/capri.mps" "-o" "0.26900129137681610087717280693754e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 200: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 200: Test timeout computed to be: 10000000 197: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 197: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 197: 197: External libraries: 197: Boost 1.83.0 (https://www.boost.org/) 197: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 197: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 197: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 197: 197: reading took 0.0785 seconds 197: Numerical Statistics: 197: Matrix range [0e+00,2e+02] 197: Objective range [1e+00,1e+00] 197: Bounds range [0e+00,0e+00] 197: RHS range [2e-01,1e+02] 197: Dynamism Variables: 4e+04 197: Dynamism Rows : 2e+04 197: set presolve.componentsmaxint = -1 197: set presolve.detectlindep = 0 197: set doubletoneq.enabled = 0 197: set dualinfer.enabled = 0 197: set substitution.enabled = 0 197: set sparsify.enabled = 0 197: set calculate_basis_for_dual = 0 197: 197: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/brandy.mps with dual-postsolve activated 197: rows: 220 197: columns: 249 197: int. columns: 0 197: cont. columns: 249 197: nonzeros: 2148 197: 197: round 0 ( Trivial ): 41 del cols, 58 del rows, 73 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 197: round 1 ( Fast ): 44 del cols, 59 del rows, 166 chg bounds, 0 chg sides, 0 chg coeffs, 192 tsx applied, 0 tsx conflicts 197: round 2 ( Fast ): 44 del cols, 59 del rows, 245 chg bounds, 0 chg sides, 0 chg coeffs, 392 tsx applied, 0 tsx conflicts 197: round 3 ( Fast ): 44 del cols, 59 del rows, 288 chg bounds, 0 chg sides, 0 chg coeffs, 480 tsx applied, 0 tsx conflicts 197: round 4 ( Medium ): 61 del cols, 61 del rows, 305 chg bounds, 11 chg sides, 11 chg coeffs, 531 tsx applied, 43 tsx conflicts 197: round 5 ( Medium ): 64 del cols, 63 del rows, 321 chg bounds, 12 chg sides, 12 chg coeffs, 566 tsx applied, 46 tsx conflicts 197: round 6 (Exhaustive): 66 del cols, 64 del rows, 330 chg bounds, 12 chg sides, 12 chg coeffs, 581 tsx applied, 46 tsx conflicts 197: round 7 ( Final ): 66 del cols, 64 del rows, 334 chg bounds, 12 chg sides, 12 chg coeffs, 589 tsx applied, 46 tsx conflicts 197: presolved 7 rounds: 66 del cols, 64 del rows, 334 chg bounds, 12 chg sides, 12 chg coeffs, 589 tsx applied, 46 tsx conflicts 197: 197: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 197: colsingleton 7 0.0 0 0.0 0.000 197: coefftightening 0 0.0 0 0.0 0.000 197: propagation 7 100.0 564 100.0 0.042 197: fixcontinuous 2 0.0 0 0.0 0.000 197: simpleprobing 0 0.0 0 0.0 0.000 197: parallelrows 2 0.0 0 0.0 0.027 197: parallelcols 2 50.0 4 100.0 0.026 197: stuffing 3 66.7 62 25.8 0.001 197: dualfix 3 33.3 4 100.0 0.003 197: simplifyineq 0 0.0 0 0.0 0.000 197: doubletoneq 0 0.0 0 0.0 0.000 197: implint 0 0.0 0 0.0 0.000 197: domcol 1 100.0 1 100.0 0.016 197: dualinfer 0 0.0 0 0.0 0.000 194: round 20 ( Medium ): 194 del cols, 159 del rows, 1605 chg bounds, 6 chg sides, 6 chg coeffs, 3300 tsx applied, 1774 tsx conflicts 194: round 21 ( Medium ): 223 del cols, 163 del rows, 1635 chg bounds, 7 chg sides, 7 chg coeffs, 3840 tsx applied, 1781 tsx conflicts 194: round 22 (Exhaustive): 223 del cols, 163 del rows, 1638 chg bounds, 7 chg sides, 7 chg coeffs, 3844 tsx applied, 1781 tsx conflicts 194: round 23 ( Final ): 223 del cols, 163 del rows, 1639 chg bounds, 7 chg sides, 7 chg coeffs, 3845 tsx applied, 1781 tsx conflicts 194: presolved 23 rounds: 223 del cols, 163 del rows, 1639 chg bounds, 7 chg sides, 7 chg coeffs, 3845 tsx applied, 1781 tsx conflicts 194: 194: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 194: colsingleton 23 0.0 0 0.0 0.000 194: coefftightening 0 0.0 0 0.0 0.000 194: propagation 23 95.7 3234 100.0 0.187 194: fixcontinuous 2 0.0 0 0.0 0.001 194: simpleprobing 0 0.0 0 0.0 0.000 194: parallelrows 2 50.0 2 100.0 0.003 194: parallelcols 2 0.0 0 0.0 0.018 194: stuffing 3 66.7 2348 24.6 0.131 194: dualfix 4 100.0 42 76.2 0.019 194: simplifyineq 0 0.0 0 0.0 0.000 194: doubletoneq 0 0.0 0 0.0 0.000 194: implint 0 0.0 0 0.0 0.000 194: domcol 1 0.0 0 0.0 0.010 194: dualinfer 0 0.0 0 0.0 0.000 194: probing 0 0.0 0 0.0 0.000 194: substitution 0 0.0 0 0.0 0.000 194: sparsify 0 0.0 0 0.0 0.000 194: 194: reduced problem: 194: reduced rows: 70 194: reduced columns: 92 194: reduced int. columns: 0 194: reduced cont. columns: 92 194: reduced nonzeros: 475 194: 194: presolving finished after 0.823 seconds 194: 194: Equilibrium scaling LP (persistent) 194: Simplifier removed 10 rows, 10 columns, 67 nonzeros, 8 col bounds, 140 row bounds 194: Reduced LP has 60 rows 82 columns 408 nonzeros 194: Equilibrium scaling LP 194: type | time | iters | facts | shift | viol sum | viol num | obj value 194: L | 0.0 | 0 | 3 | 1.74e+01 | 6.90e+03 | 41 | -1.26627398e+03 194: E | 0.0 | 59 | 4 | 0.00e+00 | 3.44e-03 | 2 | 1.37467410e+03 194: E | 0.0 | 62 | 6 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 194: --- unscaling internal solution 194: --- unsimplifying solution and basis 194: --- unscaling external solution 194: --- verifying computed solution 194: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 194: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.37308039e+03 194: --- unscaling external solution 194: --- verifying computed solution 197: probing 0 0.0 0 0.0 0.000 197: substitution 0 0.0 0 0.0 0.000 197: sparsify 0 0.0 0 0.0 0.000 197: 197: reduced problem: 197: reduced rows: 118 197: reduced columns: 183 197: reduced int. columns: 0 197: reduced cont. columns: 183 197: reduced nonzeros: 1657 197: 197: presolving finished after 0.272 seconds 197: 197: Equilibrium scaling LP (persistent) 197: Simplifier removed 5 rows, 4 columns, 16 nonzeros, 18 col bounds, 33 row bounds 197: Reduced LP has 113 rows 179 columns 1636 nonzeros 197: Equilibrium scaling LP 197: type | time | iters | facts | shift | viol sum | viol num | obj value 197: L | 0.0 | 0 | 3 | 8.70e-01 | 5.56e+02 | 67 | -4.21328568e+02 197: L | 0.0 | 199 | 5 | 8.70e-01 | 5.64e+03 | 30 | 1.06113609e+03 197: L | 0.0 | 399 | 6 | 8.70e-01 | 2.21e+01 | 28 | 1.51113029e+03 197: E | 0.0 | 410 | 8 | 0.00e+00 | 1.47e-02 | 2 | 1.51851652e+03 197: E | 0.0 | 411 | 10 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 197: --- unscaling internal solution 197: --- unsimplifying solution and basis 197: --- unscaling external solution 197: --- verifying computed solution 197: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 197: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.51850990e+03 197: --- unscaling external solution 197: --- verifying computed solution 197: 197: SoPlex status : problem is solved [optimal] 197: Solving time (sec) : 0.02 197: Iterations : 411 197: Objective value : 1.51850990e+03 197: 197: Solution passed validation 197: 197: postsolve finished after 0.029 seconds 197: feasible: true 197: objective value: 1518.50989648813 197: 197: violations: 197: bounds: 0 197: constraints: 0 197: integrality: 0 197: 197: validation: SUCCESS 197: Solving time 0.380 seconds 197: 197: solving finished after 0.380 seconds 197/287 Test #197: r-solve-brandy.mps-lp_presolvers_without_basis.set ......................................... Passed 0.58 sec test 201 Start 201: d-solve-finnis.mps-lp_presolvers_without_basis.set 201: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/finnis.mps" "-o" "0.17279106559561159432297900375543e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 201: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 201: Test timeout computed to be: 10000000 194: 194: SoPlex status : problem is solved [optimal] 194: Solving time (sec) : 0.00 194: Iterations : 62 194: Objective value : 1.37308039e+03 194: 194: Solution passed validation 194: 194: postsolve finished after 0.097 seconds 194: feasible: true 194: objective value: 1373.08039420849 194: 194: violations: 194: bounds: 0 194: constraints: 0 194: integrality: 0 194: 194: validation: SUCCESS 194: Solving time 0.933 seconds 194: 194: solving finished after 0.933 seconds 198/287 Test #194: r-solve-bore3d.mps-lp_presolvers_without_basis.set ......................................... Passed 1.13 sec test 202 Start 202: q-solve-finnis.mps-lp_presolvers_without_basis.set 202: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/finnis.mps" "-o" "0.17279106559561159432297900375543e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 202: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 202: Test timeout computed to be: 10000000 201: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 201: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 201: 201: External libraries: 201: Boost 1.83.0 (https://www.boost.org/) 201: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 201: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 201: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 201: 201: reading took 0.0251 seconds 201: Numerical Statistics: 201: Matrix range [5e-04,3e+01] 201: Objective range [1e-05,4e+03] 201: Bounds range [1e-04,3e+04] 201: RHS range [1e-02,4e+03] 201: Dynamism Variables: 2e+03 201: Dynamism Rows : 4e+03 201: set presolve.componentsmaxint = -1 201: set presolve.detectlindep = 0 201: set doubletoneq.enabled = 0 201: set dualinfer.enabled = 0 201: set substitution.enabled = 0 201: set sparsify.enabled = 0 201: set calculate_basis_for_dual = 0 201: 201: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/finnis.mps with dual-postsolve activated 201: rows: 497 201: columns: 614 201: int. columns: 0 201: cont. columns: 614 201: nonzeros: 2310 201: 201: round 0 ( Trivial ): 74 del cols, 73 del rows, 57 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 201: round 1 ( Fast ): 86 del cols, 101 del rows, 274 chg bounds, 0 chg sides, 0 chg coeffs, 474 tsx applied, 0 tsx conflicts 201: round 2 ( Medium ): 147 del cols, 124 del rows, 434 chg bounds, 22 chg sides, 15 chg coeffs, 706 tsx applied, 40 tsx conflicts 201: round 3 ( Medium ): 176 del cols, 143 del rows, 529 chg bounds, 26 chg sides, 15 chg coeffs, 824 tsx applied, 46 tsx conflicts 201: round 4 ( Medium ): 180 del cols, 146 del rows, 615 chg bounds, 29 chg sides, 15 chg coeffs, 919 tsx applied, 54 tsx conflicts 201: round 5 (Exhaustive): 181 del cols, 146 del rows, 629 chg bounds, 29 chg sides, 15 chg coeffs, 934 tsx applied, 54 tsx conflicts 201: round 6 ( Final ): 181 del cols, 146 del rows, 636 chg bounds, 29 chg sides, 15 chg coeffs, 941 tsx applied, 54 tsx conflicts 201: presolved 6 rounds: 181 del cols, 146 del rows, 636 chg bounds, 29 chg sides, 15 chg coeffs, 941 tsx applied, 54 tsx conflicts 201: 201: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 201: colsingleton 6 0.0 0 0.0 0.000 201: coefftightening 0 0.0 0 0.0 0.000 201: propagation 6 66.7 564 100.0 0.001 201: fixcontinuous 2 0.0 0 0.0 0.000 201: simpleprobing 0 0.0 0 0.0 0.000 201: parallelrows 2 0.0 0 0.0 0.001 201: parallelcols 2 50.0 1 100.0 0.001 201: stuffing 4 75.0 92 64.1 0.000 201: dualfix 5 100.0 338 93.8 0.000 201: simplifyineq 0 0.0 0 0.0 0.000 201: doubletoneq 0 0.0 0 0.0 0.000 201: implint 0 0.0 0 0.0 0.000 201: domcol 1 0.0 0 0.0 0.000 201: dualinfer 0 0.0 0 0.0 0.000 201: probing 0 0.0 0 0.0 0.000 201: substitution 0 0.0 0 0.0 0.000 201: sparsify 0 0.0 0 0.0 0.000 201: 201: reduced problem: 201: reduced rows: 351 201: reduced columns: 433 201: reduced int. columns: 0 201: reduced cont. columns: 433 201: reduced nonzeros: 1488 201: 201: presolving finished after 0.010 seconds 201: 201: Equilibrium scaling LP (persistent) 201: Simplifier removed 9 rows, 9 columns, 18 nonzeros, 13 col bounds, 18 row bounds 201: Reduced LP has 342 rows 424 columns 1470 nonzeros 201: Equilibrium scaling LP 201: type | time | iters | facts | shift | viol sum | viol num | obj value 201: L | 0.0 | 0 | 3 | 1.80e+01 | 2.21e+04 | 69 | -2.15747933e+05 201: L | 0.0 | 199 | 3 | 1.80e+01 | 9.11e+03 | 69 | 1.43966364e+05 201: E | 0.0 | 352 | 5 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 201: E | 0.0 | 352 | 5 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 201: --- unscaling internal solution 201: --- unsimplifying solution and basis 201: --- unscaling external solution 201: --- verifying computed solution 201: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 201: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 201: --- unscaling external solution 201: --- verifying computed solution 201: 201: SoPlex status : problem is solved [optimal] 201: Solving time (sec) : 0.02 201: Iterations : 352 201: Objective value : 1.72791066e+05 201: 201: Solution passed validation 201: 201: postsolve finished after 0.003 seconds 201: feasible: true 201: objective value: 172791.065595612 201: 201: violations: 201: bounds: 0 201: constraints: 0 201: integrality: 0 201: 201: validation: SUCCESS 201: Solving time 0.067 seconds 201: 201: solving finished after 0.067 seconds 199/287 Test #201: d-solve-finnis.mps-lp_presolvers_without_basis.set ......................................... Passed 0.12 sec test 203 Start 203: r-solve-finnis.mps-lp_presolvers_without_basis.set 203: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/finnis.mps" "-o" "0.17279106559561159432297900375543e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 203: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 203: Test timeout computed to be: 10000000 200: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 200: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 200: 200: External libraries: 200: Boost 1.83.0 (https://www.boost.org/) 200: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 200: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 200: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 200: 200: reading took 0.0478 seconds 200: Numerical Statistics: 200: Matrix range [4e-03,2e+02] 200: Objective range [2e-01,1e+00] 200: Bounds range [1e+00,3e+02] 200: RHS range [3e-02,3e+03] 200: Dynamism Variables: 1e+04 200: Dynamism Rows : 2e+06 200: set presolve.componentsmaxint = -1 200: set presolve.detectlindep = 0 200: set doubletoneq.enabled = 0 200: set dualinfer.enabled = 0 200: set substitution.enabled = 0 200: set sparsify.enabled = 0 200: set calculate_basis_for_dual = 0 200: 200: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/capri.mps with dual-postsolve activated 200: rows: 271 200: columns: 353 200: int. columns: 0 200: cont. columns: 353 200: nonzeros: 1767 200: 200: round 0 ( Trivial ): 24 del cols, 8 del rows, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 200: round 1 ( Fast ): 27 del cols, 13 del rows, 154 chg bounds, 0 chg sides, 0 chg coeffs, 344 tsx applied, 0 tsx conflicts 200: round 2 ( Fast ): 32 del cols, 20 del rows, 217 chg bounds, 0 chg sides, 0 chg coeffs, 512 tsx applied, 0 tsx conflicts 200: round 3 ( Fast ): 32 del cols, 22 del rows, 259 chg bounds, 0 chg sides, 0 chg coeffs, 598 tsx applied, 0 tsx conflicts 200: round 4 ( Fast ): 32 del cols, 22 del rows, 307 chg bounds, 0 chg sides, 0 chg coeffs, 696 tsx applied, 0 tsx conflicts 200: round 5 ( Medium ): 56 del cols, 33 del rows, 368 chg bounds, 0 chg sides, 0 chg coeffs, 843 tsx applied, 49 tsx conflicts 200: round 6 ( Medium ): 64 del cols, 37 del rows, 379 chg bounds, 8 chg sides, 4 chg coeffs, 866 tsx applied, 61 tsx conflicts 200: round 7 (Exhaustive): 64 del cols, 37 del rows, 383 chg bounds, 8 chg sides, 4 chg coeffs, 870 tsx applied, 61 tsx conflicts 200: round 8 ( Final ): 64 del cols, 37 del rows, 383 chg bounds, 8 chg sides, 4 chg coeffs, 870 tsx applied, 61 tsx conflicts 200: presolved 8 rounds: 64 del cols, 37 del rows, 383 chg bounds, 8 chg sides, 4 chg coeffs, 870 tsx applied, 61 tsx conflicts 200: 200: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 200: colsingleton 8 0.0 0 0.0 0.000 200: coefftightening 0 0.0 0 0.0 0.000 200: propagation 8 75.0 754 100.0 0.032 200: fixcontinuous 2 0.0 0 0.0 0.001 200: simpleprobing 0 0.0 0 0.0 0.000 200: parallelrows 2 0.0 0 0.0 0.024 200: parallelcols 2 0.0 0 0.0 0.007 200: stuffing 3 66.7 124 54.0 0.001 200: dualfix 4 75.0 53 92.5 0.018 200: simplifyineq 0 0.0 0 0.0 0.000 200: doubletoneq 0 0.0 0 0.0 0.000 200: implint 0 0.0 0 0.0 0.000 200: domcol 1 0.0 0 0.0 0.014 200: dualinfer 0 0.0 0 0.0 0.000 200: probing 0 0.0 0 0.0 0.000 200: substitution 0 0.0 0 0.0 0.000 200: sparsify 0 0.0 0 0.0 0.000 200: 200: reduced problem: 200: reduced rows: 234 200: reduced columns: 289 200: reduced int. columns: 0 200: reduced cont. columns: 289 200: reduced nonzeros: 1298 200: 200: presolving finished after 0.231 seconds 200: 200: Equilibrium scaling LP (persistent) 200: Simplifier removed 22 rows, 22 columns, 55 nonzeros, 96 col bounds, 95 row bounds 200: Reduced LP has 212 rows 267 columns 1243 nonzeros 200: Equilibrium scaling LP 200: type | time | iters | facts | shift | viol sum | viol num | obj value 200: L | 0.0 | 0 | 3 | 8.90e+00 | 1.11e+04 | 86 | -1.67293834e+03 200: L | 0.0 | 199 | 3 | 8.90e+00 | 6.99e+01 | 86 | -1.41446009e+03 200: E | 0.0 | 240 | 5 | 0.00e+00 | 2.42e+02 | 21 | 3.05622598e+03 200: L | 0.0 | 287 | 7 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 200: L | 0.0 | 287 | 7 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 200: --- unscaling internal solution 200: --- unsimplifying solution and basis 200: --- unscaling external solution 200: --- verifying computed solution 200: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 200: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 2.69001291e+03 200: --- unscaling external solution 200: --- verifying computed solution 202: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 202: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 202: 202: External libraries: 202: Boost 1.83.0 (https://www.boost.org/) 202: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 202: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 202: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 202: 202: reading took 0.0831 seconds 202: Numerical Statistics: 202: Matrix range [5e-04,3e+01] 202: Objective range [1e-05,4e+03] 202: Bounds range [1e-04,3e+04] 202: RHS range [1e-02,4e+03] 202: Dynamism Variables: 2e+03 202: Dynamism Rows : 4e+03 202: set presolve.componentsmaxint = -1 202: set presolve.detectlindep = 0 202: set doubletoneq.enabled = 0 202: set dualinfer.enabled = 0 202: set substitution.enabled = 0 202: set sparsify.enabled = 0 202: set calculate_basis_for_dual = 0 202: 202: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/finnis.mps with dual-postsolve activated 202: rows: 497 202: columns: 614 202: int. columns: 0 202: cont. columns: 614 202: nonzeros: 2310 202: 202: round 0 ( Trivial ): 74 del cols, 73 del rows, 57 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 202: round 1 ( Fast ): 86 del cols, 101 del rows, 274 chg bounds, 0 chg sides, 0 chg coeffs, 474 tsx applied, 0 tsx conflicts 202: round 2 ( Medium ): 147 del cols, 124 del rows, 434 chg bounds, 22 chg sides, 15 chg coeffs, 706 tsx applied, 40 tsx conflicts 202: round 3 ( Medium ): 176 del cols, 143 del rows, 529 chg bounds, 26 chg sides, 15 chg coeffs, 824 tsx applied, 46 tsx conflicts 202: round 4 ( Medium ): 180 del cols, 146 del rows, 615 chg bounds, 29 chg sides, 15 chg coeffs, 919 tsx applied, 54 tsx conflicts 202: round 5 (Exhaustive): 181 del cols, 146 del rows, 629 chg bounds, 29 chg sides, 15 chg coeffs, 934 tsx applied, 54 tsx conflicts 202: round 6 ( Final ): 181 del cols, 146 del rows, 636 chg bounds, 29 chg sides, 15 chg coeffs, 941 tsx applied, 54 tsx conflicts 202: presolved 6 rounds: 181 del cols, 146 del rows, 636 chg bounds, 29 chg sides, 15 chg coeffs, 941 tsx applied, 54 tsx conflicts 202: 202: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 202: colsingleton 6 0.0 0 0.0 0.000 202: coefftightening 0 0.0 0 0.0 0.000 202: propagation 6 66.7 564 100.0 0.004 202: fixcontinuous 2 0.0 0 0.0 0.000 202: simpleprobing 0 0.0 0 0.0 0.000 202: parallelrows 2 0.0 0 0.0 0.002 202: parallelcols 2 50.0 1 100.0 0.008 202: stuffing 4 75.0 92 64.1 0.004 202: dualfix 5 100.0 338 93.8 0.007 202: simplifyineq 0 0.0 0 0.0 0.000 202: doubletoneq 0 0.0 0 0.0 0.000 202: implint 0 0.0 0 0.0 0.000 202: domcol 1 0.0 0 0.0 0.009 202: dualinfer 0 0.0 0 0.0 0.000 202: probing 0 0.0 0 0.0 0.000 202: substitution 0 0.0 0 0.0 0.000 202: sparsify 0 0.0 0 0.0 0.000 202: 202: reduced problem: 202: reduced rows: 351 202: reduced columns: 433 202: reduced int. columns: 0 202: reduced cont. columns: 433 202: reduced nonzeros: 1488 202: 202: presolving finished after 0.137 seconds 202: 202: Equilibrium scaling LP (persistent) 200: 200: SoPlex status : problem is solved [optimal] 200: Solving time (sec) : 0.02 200: Iterations : 287 200: Objective value : 2.69001291e+03 200: 200: Solution passed validation 200: 200: postsolve finished after 0.091 seconds 200: feasible: true 200: objective value: 2690.01291376816 200: 200: violations: 200: bounds: 1.42063072416931e-14 200: constraints: 0 200: integrality: 0 200: 200: validation: SUCCESS 200: Solving time 0.393 seconds 200: 200: solving finished after 0.393 seconds 200/287 Test #200: r-solve-capri.mps-lp_presolvers_without_basis.set .......................................... Passed 0.50 sec test 204 Start 204: d-solve-israel.mps-lp_presolvers_without_basis.set 204: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/israel.mps" "-o" "-0.89664482186304572966200464196045e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 204: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 204: Test timeout computed to be: 10000000 202: Simplifier removed 9 rows, 9 columns, 18 nonzeros, 13 col bounds, 18 row bounds 202: Reduced LP has 342 rows 424 columns 1470 nonzeros 202: Equilibrium scaling LP 202: type | time | iters | facts | shift | viol sum | viol num | obj value 202: L | 0.0 | 0 | 3 | 1.80e+01 | 2.21e+04 | 69 | -2.15747933e+05 202: L | 0.0 | 199 | 3 | 1.80e+01 | 3.83e+04 | 69 | 1.39809557e+05 203: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 203: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 203: 203: External libraries: 203: Boost 1.83.0 (https://www.boost.org/) 203: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 203: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 203: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 203: 203: reading took 0.0345 seconds 203: Numerical Statistics: 203: Matrix range [5e-04,3e+01] 203: Objective range [1e-05,4e+03] 203: Bounds range [1e-04,3e+04] 203: RHS range [1e-02,4e+03] 203: Dynamism Variables: 2e+03 203: Dynamism Rows : 4e+03 203: set presolve.componentsmaxint = -1 203: set presolve.detectlindep = 0 203: set doubletoneq.enabled = 0 203: set dualinfer.enabled = 0 203: set substitution.enabled = 0 203: set sparsify.enabled = 0 203: set calculate_basis_for_dual = 0 203: 203: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/finnis.mps with dual-postsolve activated 203: rows: 497 203: columns: 614 203: int. columns: 0 203: cont. columns: 614 203: nonzeros: 2310 203: 203: round 0 ( Trivial ): 74 del cols, 73 del rows, 57 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 203: round 1 ( Fast ): 86 del cols, 101 del rows, 274 chg bounds, 0 chg sides, 0 chg coeffs, 474 tsx applied, 0 tsx conflicts 203: round 2 ( Medium ): 147 del cols, 124 del rows, 434 chg bounds, 22 chg sides, 15 chg coeffs, 706 tsx applied, 40 tsx conflicts 203: round 3 ( Medium ): 176 del cols, 143 del rows, 529 chg bounds, 26 chg sides, 15 chg coeffs, 824 tsx applied, 46 tsx conflicts 203: round 4 ( Medium ): 180 del cols, 146 del rows, 615 chg bounds, 29 chg sides, 15 chg coeffs, 919 tsx applied, 54 tsx conflicts 203: round 5 (Exhaustive): 181 del cols, 146 del rows, 629 chg bounds, 29 chg sides, 15 chg coeffs, 934 tsx applied, 54 tsx conflicts 203: round 6 ( Final ): 181 del cols, 146 del rows, 636 chg bounds, 29 chg sides, 15 chg coeffs, 941 tsx applied, 54 tsx conflicts 203: presolved 6 rounds: 181 del cols, 146 del rows, 636 chg bounds, 29 chg sides, 15 chg coeffs, 941 tsx applied, 54 tsx conflicts 203: 203: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 203: colsingleton 6 0.0 0 0.0 0.000 203: coefftightening 0 0.0 0 0.0 0.000 203: propagation 6 66.7 564 100.0 0.013 203: fixcontinuous 2 0.0 0 0.0 0.000 203: simpleprobing 0 0.0 0 0.0 0.000 203: parallelrows 2 0.0 0 0.0 0.013 203: parallelcols 2 50.0 1 100.0 0.026 203: stuffing 4 75.0 92 64.1 0.016 203: dualfix 5 100.0 338 93.8 0.028 203: simplifyineq 0 0.0 0 0.0 0.000 203: doubletoneq 0 0.0 0 0.0 0.000 203: implint 0 0.0 0 0.0 0.000 203: domcol 1 0.0 0 0.0 0.022 203: dualinfer 0 0.0 0 0.0 0.000 203: probing 0 0.0 0 0.0 0.000 203: substitution 0 0.0 0 0.0 0.000 203: sparsify 0 0.0 0 0.0 0.000 203: 203: reduced problem: 203: reduced rows: 351 203: reduced columns: 433 203: reduced int. columns: 0 203: reduced cont. columns: 433 203: reduced nonzeros: 1488 203: 203: presolving finished after 0.198 seconds 203: 203: Equilibrium scaling LP (persistent) 203: Simplifier removed 9 rows, 9 columns, 18 nonzeros, 13 col bounds, 18 row bounds 203: Reduced LP has 342 rows 424 columns 1470 nonzeros 203: Equilibrium scaling LP 203: type | time | iters | facts | shift | viol sum | viol num | obj value 203: L | 0.0 | 0 | 3 | 1.80e+01 | 2.21e+04 | 69 | -2.15747933e+05 202: E | 0.0 | 364 | 5 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 203: L | 0.0 | 199 | 3 | 1.80e+01 | 9.14e+03 | 69 | 1.43966364e+05 202: E | 0.0 | 364 | 5 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 202: --- unscaling internal solution 202: --- unsimplifying solution and basis 202: --- unscaling external solution 202: --- verifying computed solution 202: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 202: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 202: --- unscaling external solution 202: --- verifying computed solution 204: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 204: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 204: 204: External libraries: 204: Boost 1.83.0 (https://www.boost.org/) 204: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 204: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 204: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 204: 204: reading took 0.0213 seconds 204: Numerical Statistics: 204: Matrix range [1e-03,2e+03] 204: Objective range [2e-01,3e+03] 204: Bounds range [0e+00,0e+00] 204: RHS range [5e-01,9e+05] 204: Dynamism Variables: 5e+05 204: Dynamism Rows : 1e+04 204: set presolve.componentsmaxint = -1 204: set presolve.detectlindep = 0 204: set doubletoneq.enabled = 0 204: set dualinfer.enabled = 0 204: set substitution.enabled = 0 204: set sparsify.enabled = 0 204: set calculate_basis_for_dual = 0 204: 204: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/israel.mps with dual-postsolve activated 204: rows: 174 204: columns: 142 204: int. columns: 0 204: cont. columns: 142 204: nonzeros: 2269 204: 204: round 0 ( Trivial ): 1 del cols, 11 del rows, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 204: round 1 ( Fast ): 1 del cols, 11 del rows, 298 chg bounds, 0 chg sides, 0 chg coeffs, 1506 tsx applied, 0 tsx conflicts 204: round 2 ( Fast ): 1 del cols, 11 del rows, 407 chg bounds, 0 chg sides, 0 chg coeffs, 1830 tsx applied, 0 tsx conflicts 204: round 3 ( Fast ): 1 del cols, 11 del rows, 439 chg bounds, 0 chg sides, 0 chg coeffs, 1902 tsx applied, 0 tsx conflicts 204: round 4 ( Medium ): 1 del cols, 11 del rows, 457 chg bounds, 0 chg sides, 0 chg coeffs, 1920 tsx applied, 0 tsx conflicts 204: round 5 (Exhaustive): 3 del cols, 11 del rows, 471 chg bounds, 0 chg sides, 0 chg coeffs, 1934 tsx applied, 0 tsx conflicts 204: round 6 (Exhaustive): 3 del cols, 11 del rows, 483 chg bounds, 0 chg sides, 0 chg coeffs, 1946 tsx applied, 0 tsx conflicts 204: round 7 ( Final ): 3 del cols, 11 del rows, 483 chg bounds, 0 chg sides, 0 chg coeffs, 1946 tsx applied, 0 tsx conflicts 204: presolved 7 rounds: 3 del cols, 11 del rows, 483 chg bounds, 0 chg sides, 0 chg coeffs, 1946 tsx applied, 0 tsx conflicts 204: 204: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 204: colsingleton 7 0.0 0 0.0 0.000 204: coefftightening 0 0.0 0 0.0 0.000 204: propagation 7 42.9 1902 100.0 0.001 204: fixcontinuous 2 0.0 0 0.0 0.000 204: simpleprobing 0 0.0 0 0.0 0.000 204: parallelrows 2 0.0 0 0.0 0.000 204: parallelcols 2 0.0 0 0.0 0.001 204: stuffing 2 0.0 0 0.0 0.000 204: dualfix 4 75.0 42 100.0 0.000 204: simplifyineq 0 0.0 0 0.0 0.000 204: doubletoneq 0 0.0 0 0.0 0.000 204: implint 0 0.0 0 0.0 0.000 204: domcol 2 50.0 2 100.0 0.001 204: dualinfer 0 0.0 0 0.0 0.000 203: E | 0.0 | 381 | 5 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 203: E | 0.0 | 381 | 5 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 203: --- unscaling internal solution 203: --- unsimplifying solution and basis 203: --- unscaling external solution 203: --- verifying computed solution 203: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 203: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.72791066e+05 203: --- unscaling external solution 203: --- verifying computed solution 204: probing 0 0.0 0 0.0 0.000 204: substitution 0 0.0 0 0.0 0.000 204: sparsify 0 0.0 0 0.0 0.000 204: 204: reduced problem: 204: reduced rows: 163 204: reduced columns: 139 204: reduced int. columns: 0 204: reduced cont. columns: 139 204: reduced nonzeros: 2200 204: 204: presolving finished after 0.020 seconds 204: 204: Equilibrium scaling LP (persistent) 204: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 204: Reduced LP has 163 rows 139 columns 2200 nonzeros 204: Equilibrium scaling LP 204: type | time | iters | facts | shift | viol sum | viol num | obj value 204: L | 0.0 | 0 | 3 | 0.00e+00 | 1.01e+05 | 87 | -4.25806009e+06 204: L | 0.0 | 119 | 5 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 204: --- unscaling internal solution 204: --- unsimplifying solution and basis 204: --- unscaling external solution 204: --- verifying computed solution 204: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 204: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 204: --- unscaling external solution 204: --- verifying computed solution 204: 204: SoPlex status : problem is solved [optimal] 204: Solving time (sec) : 0.00 204: Iterations : 119 204: Objective value : -8.96644822e+05 204: 204: Solution passed validation 204: 204: postsolve finished after 0.001 seconds 204: feasible: true 204: objective value: -896644.821863046 204: 204: violations: 204: bounds: 0 204: constraints: 0 204: integrality: 0 204: 204: validation: SUCCESS 204: Solving time 0.064 seconds 204: 204: solving finished after 0.064 seconds 201/287 Test #204: d-solve-israel.mps-lp_presolvers_without_basis.set ......................................... Passed 0.14 sec test 205 Start 205: q-solve-israel.mps-lp_presolvers_without_basis.set 205: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/israel.mps" "-o" "-0.89664482186304572966200464196045e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 205: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 205: Test timeout computed to be: 10000000 203: 203: SoPlex status : problem is solved [optimal] 203: Solving time (sec) : 0.04 203: Iterations : 381 203: Objective value : 1.72791066e+05 203: 203: Solution passed validation 203: 203: postsolve finished after 0.037 seconds 203: feasible: true 203: objective value: 172791.065595612 203: 203: violations: 203: bounds: 5.02914190292358e-14 203: constraints: 0 203: integrality: 0 203: 203: validation: SUCCESS 203: Solving time 0.294 seconds 203: 203: solving finished after 0.294 seconds 188: round 49 ( Fast ): 54 del cols, 325 del rows, 1231 chg bounds, 0 chg sides, 0 chg coeffs, 4432 tsx applied, 0 tsx conflicts 188: round 50 ( Fast ): 54 del cols, 325 del rows, 1247 chg bounds, 0 chg sides, 0 chg coeffs, 4464 tsx applied, 0 tsx conflicts 188: round 51 ( Fast ): 54 del cols, 325 del rows, 1261 chg bounds, 0 chg sides, 0 chg coeffs, 4492 tsx applied, 0 tsx conflicts 188: round 52 ( Fast ): 54 del cols, 325 del rows, 1277 chg bounds, 0 chg sides, 0 chg coeffs, 4524 tsx applied, 0 tsx conflicts 188: round 53 ( Fast ): 54 del cols, 325 del rows, 1291 chg bounds, 0 chg sides, 0 chg coeffs, 4552 tsx applied, 0 tsx conflicts 188: round 54 ( Fast ): 54 del cols, 325 del rows, 1307 chg bounds, 0 chg sides, 0 chg coeffs, 4584 tsx applied, 0 tsx conflicts 188: round 55 ( Fast ): 54 del cols, 325 del rows, 1321 chg bounds, 0 chg sides, 0 chg coeffs, 4612 tsx applied, 0 tsx conflicts 188: round 56 ( Fast ): 54 del cols, 325 del rows, 1337 chg bounds, 0 chg sides, 0 chg coeffs, 4644 tsx applied, 0 tsx conflicts 188: round 57 ( Fast ): 54 del cols, 325 del rows, 1351 chg bounds, 0 chg sides, 0 chg coeffs, 4672 tsx applied, 0 tsx conflicts 188: round 58 ( Fast ): 54 del cols, 325 del rows, 1367 chg bounds, 0 chg sides, 0 chg coeffs, 4704 tsx applied, 0 tsx conflicts 188: round 59 ( Fast ): 54 del cols, 325 del rows, 1381 chg bounds, 0 chg sides, 0 chg coeffs, 4732 tsx applied, 0 tsx conflicts 188: round 60 ( Fast ): 54 del cols, 325 del rows, 1397 chg bounds, 0 chg sides, 0 chg coeffs, 4764 tsx applied, 0 tsx conflicts 188: round 61 ( Fast ): 54 del cols, 325 del rows, 1411 chg bounds, 0 chg sides, 0 chg coeffs, 4792 tsx applied, 0 tsx conflicts 188: round 62 ( Fast ): 54 del cols, 325 del rows, 1427 chg bounds, 0 chg sides, 0 chg coeffs, 4824 tsx applied, 0 tsx conflicts 188: round 63 ( Fast ): 54 del cols, 325 del rows, 1440 chg bounds, 0 chg sides, 0 chg coeffs, 4850 tsx applied, 0 tsx conflicts 188: round 64 ( Fast ): 54 del cols, 325 del rows, 1455 chg bounds, 0 chg sides, 0 chg coeffs, 4880 tsx applied, 0 tsx conflicts 188: round 65 ( Fast ): 54 del cols, 325 del rows, 1466 chg bounds, 0 chg sides, 0 chg coeffs, 4902 tsx applied, 0 tsx conflicts 188: round 66 ( Fast ): 54 del cols, 325 del rows, 1479 chg bounds, 0 chg sides, 0 chg coeffs, 4928 tsx applied, 0 tsx conflicts 188: round 67 ( Medium ): 60 del cols, 341 del rows, 1489 chg bounds, 22 chg sides, 6 chg coeffs, 4970 tsx applied, 397 tsx conflicts 188: round 68 ( Medium ): 60 del cols, 344 del rows, 1502 chg bounds, 22 chg sides, 6 chg coeffs, 4993 tsx applied, 397 tsx conflicts 188: round 69 (Exhaustive): 68 del cols, 348 del rows, 1517 chg bounds, 22 chg sides, 6 chg coeffs, 5014 tsx applied, 397 tsx conflicts 188: round 70 ( Fast ): 68 del cols, 351 del rows, 1543 chg bounds, 22 chg sides, 6 chg coeffs, 5092 tsx applied, 397 tsx conflicts 188: round 71 ( Fast ): 68 del cols, 352 del rows, 1560 chg bounds, 22 chg sides, 6 chg coeffs, 5126 tsx applied, 397 tsx conflicts 188: round 72 ( Fast ): 68 del cols, 352 del rows, 1577 chg bounds, 22 chg sides, 6 chg coeffs, 5160 tsx applied, 397 tsx conflicts 188: round 73 ( Fast ): 68 del cols, 352 del rows, 1588 chg bounds, 22 chg sides, 6 chg coeffs, 5182 tsx applied, 397 tsx conflicts 188: round 74 ( Fast ): 68 del cols, 352 del rows, 1600 chg bounds, 22 chg sides, 6 chg coeffs, 5206 tsx applied, 397 tsx conflicts 188: round 75 (Exhaustive): 68 del cols, 352 del rows, 1609 chg bounds, 22 chg sides, 6 chg coeffs, 5222 tsx applied, 397 tsx conflicts 188: round 76 ( Final ): 68 del cols, 352 del rows, 1618 chg bounds, 22 chg sides, 6 chg coeffs, 5239 tsx applied, 397 tsx conflicts 188: presolved 76 rounds: 68 del cols, 352 del rows, 1618 chg bounds, 22 chg sides, 6 chg coeffs, 5239 tsx applied, 397 tsx conflicts 188: 188: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 202/287 Test #203: r-solve-finnis.mps-lp_presolvers_without_basis.set ......................................... Passed 0.40 sec 188: colsingleton 76 0.0 0 0.0 0.000 188: coefftightening 0 0.0 0 0.0 0.000 188: propagation 76 100.0 5202 100.0 0.502 188: fixcontinuous 2 0.0 0 0.0 0.001 188: simpleprobing 0 0.0 0 0.0 0.000 188: parallelrows 2 50.0 16 100.0 0.038 188: parallelcols 2 0.0 0 0.0 0.008 188: stuffing 3 33.3 402 1.5 0.048 188: dualfix 5 100.0 8 87.5 0.039 188: simplifyineq 0 0.0 0 0.0 0.000 188: doubletoneq 0 0.0 0 0.0 0.000 188: implint 0 0.0 0 0.0 0.000 188: domcol 2 50.0 8 100.0 0.006 188: dualinfer 0 0.0 0 0.0 0.000 188: probing 0 0.0 0 0.0 0.000 188: substitution 0 0.0 0 0.0 0.000 188: sparsify 0 0.0 0 0.0 0.000 188: 188: reduced problem: 188: reduced rows: 136 188: reduced columns: 95 188: reduced int. columns: 0 188: reduced cont. columns: 95 188: reduced nonzeros: 664 188: 188: presolving finished after 2.194 seconds 188: 188: Equilibrium scaling LP (persistent) 188: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 65 col bounds, 0 row bounds 188: Reduced LP has 136 rows 95 columns 664 nonzeros 188: Equilibrium scaling LP 188: type | time | iters | facts | shift | viol sum | viol num | obj value 188: E | 0.0 | 0 | 2 | 1.61e+03 | 5.50e+06 | 33 | -3.51002362e+08 188: L | 0.0 | 74 | 3 | 0.00e+00 | 9.26e+02 | 35 | -3.34751497e+07 188: L | 0.0 | 95 | 4 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 188: --- unscaling internal solution 188: --- unsimplifying solution and basis 188: --- unscaling external solution 188: --- verifying computed solution 202: 202: SoPlex status : problem is solved [optimal] 202: Solving time (sec) : 0.04 202: Iterations : 364 202: Objective value : 1.72791066e+05 202: 202: Solution passed validation 202: 202: postsolve finished after 0.059 seconds 202: feasible: true 202: objective value: 172791.065595612 202: 202: violations: 202: bounds: 2.8421709430404e-14 202: constraints: 0 202: integrality: 0 202: 202: validation: SUCCESS 202: Solving time 0.297 seconds 202: 202: solving finished after 0.297 seconds 203/287 Test #202: q-solve-finnis.mps-lp_presolvers_without_basis.set ......................................... Passed 0.50 sec test 206 Start 206: r-solve-israel.mps-lp_presolvers_without_basis.set 206: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/israel.mps" "-o" "-0.89664482186304572966200464196045e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 206: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 206: Test timeout computed to be: 10000000 188: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 188: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -3.59917673e+07 188: --- unscaling external solution 188: --- verifying computed solution test 207 Start 207: d-solve-kb2.mps-lp_presolvers_without_basis.set 207: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/kb2.mps" "-o" "-0.17499001299062057129526866493726e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 207: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 207: Test timeout computed to be: 10000000 207: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 207: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 207: 207: External libraries: 207: Boost 1.83.0 (https://www.boost.org/) 207: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 207: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 207: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 207: 207: reading took 0.0057 seconds 207: Numerical Statistics: 207: Matrix range [2e-01,1e+02] 207: Objective range [9e-02,2e+01] 207: Bounds range [5e+00,2e+02] 207: RHS range [0e+00,0e+00] 207: Dynamism Variables: 2e+02 207: Dynamism Rows : 4e+02 207: set presolve.componentsmaxint = -1 207: set presolve.detectlindep = 0 207: set doubletoneq.enabled = 0 207: set dualinfer.enabled = 0 207: set substitution.enabled = 0 207: set sparsify.enabled = 0 207: set calculate_basis_for_dual = 0 207: 207: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/kb2.mps with dual-postsolve activated 207: rows: 43 207: columns: 41 207: int. columns: 0 207: cont. columns: 41 207: nonzeros: 286 207: 207: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 207: round 1 ( Fast ): 0 del cols, 0 del rows, 21 chg bounds, 0 chg sides, 0 chg coeffs, 42 tsx applied, 0 tsx conflicts 207: round 2 ( Fast ): 0 del cols, 0 del rows, 29 chg bounds, 0 chg sides, 0 chg coeffs, 58 tsx applied, 0 tsx conflicts 207: round 3 ( Fast ): 0 del cols, 0 del rows, 41 chg bounds, 0 chg sides, 0 chg coeffs, 90 tsx applied, 0 tsx conflicts 207: round 4 ( Fast ): 0 del cols, 0 del rows, 50 chg bounds, 0 chg sides, 0 chg coeffs, 120 tsx applied, 0 tsx conflicts 207: round 5 ( Medium ): 8 del cols, 2 del rows, 51 chg bounds, 12 chg sides, 6 chg coeffs, 129 tsx applied, 32 tsx conflicts 207: round 6 (Exhaustive): 8 del cols, 2 del rows, 51 chg bounds, 12 chg sides, 6 chg coeffs, 129 tsx applied, 32 tsx conflicts 207: round 7 ( Final ): Unchanged 207: presolved 7 rounds: 8 del cols, 2 del rows, 51 chg bounds, 12 chg sides, 6 chg coeffs, 129 tsx applied, 32 tsx conflicts 207: 207: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 207: colsingleton 7 0.0 0 0.0 0.000 207: coefftightening 0 0.0 0 0.0 0.000 207: propagation 7 57.1 120 100.0 0.000 207: fixcontinuous 2 0.0 0 0.0 0.000 207: simpleprobing 0 0.0 0 0.0 0.000 207: parallelrows 1 0.0 0 0.0 0.000 207: parallelcols 1 0.0 0 0.0 0.000 207: stuffing 2 50.0 40 20.0 0.000 207: dualfix 2 50.0 1 100.0 0.000 207: simplifyineq 0 0.0 0 0.0 0.000 207: doubletoneq 0 0.0 0 0.0 0.000 207: implint 0 0.0 0 0.0 0.000 207: domcol 1 0.0 0 0.0 0.000 207: dualinfer 0 0.0 0 0.0 0.000 207: probing 0 0.0 0 0.0 0.000 207: substitution 0 0.0 0 0.0 0.000 207: sparsify 0 0.0 0 0.0 0.000 207: 207: reduced problem: 207: reduced rows: 41 207: reduced columns: 33 207: reduced int. columns: 0 207: reduced cont. columns: 33 207: reduced nonzeros: 274 207: 207: presolving finished after 0.006 seconds 207: 207: Equilibrium scaling LP (persistent) 207: Simplifier removed 3 rows, 3 columns, 8 nonzeros, 16 col bounds, 25 row bounds 207: Reduced LP has 38 rows 30 columns 266 nonzeros 207: Equilibrium scaling LP 207: type | time | iters | facts | shift | viol sum | viol num | obj value 207: E | 0.0 | 0 | 2 | 0.00e+00 | 4.81e+04 | 18 | -3.30000000e+03 207: E | 0.0 | 44 | 3 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 207: --- unscaling internal solution 207: --- unsimplifying solution and basis 207: --- unscaling external solution 207: --- verifying computed solution 207: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 207: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 207: --- unscaling external solution 207: --- verifying computed solution 207: 207: SoPlex status : problem is solved [optimal] 207: Solving time (sec) : 0.00 207: Iterations : 44 207: Objective value : -1.74990013e+03 207: 207: Solution passed validation 207: 207: postsolve finished after 0.000 seconds 207: feasible: true 207: objective value: -1749.90012990621 207: 207: violations: 207: bounds: 0 207: constraints: 0 207: integrality: 0 207: 207: validation: SUCCESS 207: Solving time 0.010 seconds 207: 207: solving finished after 0.010 seconds 204/287 Test #207: d-solve-kb2.mps-lp_presolvers_without_basis.set ............................................ Passed 0.07 sec test 208 Start 208: q-solve-kb2.mps-lp_presolvers_without_basis.set 208: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/kb2.mps" "-o" "-0.17499001299062057129526866493726e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 208: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 208: Test timeout computed to be: 10000000 188: 188: SoPlex status : problem is solved [optimal] 188: Solving time (sec) : 0.00 188: Iterations : 95 188: Objective value : -3.59917673e+07 188: 188: Solution passed validation 188: 188: postsolve finished after 0.100 seconds 188: feasible: true 188: objective value: -35991767.2865765 188: 188: violations: 188: bounds: 0 188: constraints: 0 188: integrality: 0 188: 188: validation: SUCCESS 188: Solving time 2.310 seconds 188: 188: solving finished after 2.310 seconds 205/287 Test #188: r-solve-agg.mps-lp_presolvers_without_basis.set ............................................ Passed 2.49 sec test 209 Start 209: r-solve-kb2.mps-lp_presolvers_without_basis.set 209: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/kb2.mps" "-o" "-0.17499001299062057129526866493726e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 209: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 209: Test timeout computed to be: 10000000 208: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 208: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 208: 208: External libraries: 208: Boost 1.83.0 (https://www.boost.org/) 208: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 208: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 208: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 208: 208: reading took 0.0111 seconds 208: Numerical Statistics: 208: Matrix range [2e-01,1e+02] 208: Objective range [9e-02,2e+01] 208: Bounds range [5e+00,2e+02] 208: RHS range [0e+00,0e+00] 208: Dynamism Variables: 2e+02 208: Dynamism Rows : 4e+02 208: set presolve.componentsmaxint = -1 208: set presolve.detectlindep = 0 208: set doubletoneq.enabled = 0 208: set dualinfer.enabled = 0 208: set substitution.enabled = 0 208: set sparsify.enabled = 0 208: set calculate_basis_for_dual = 0 208: 208: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/kb2.mps with dual-postsolve activated 208: rows: 43 208: columns: 41 208: int. columns: 0 208: cont. columns: 41 208: nonzeros: 286 208: 208: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 208: round 1 ( Fast ): 0 del cols, 0 del rows, 21 chg bounds, 0 chg sides, 0 chg coeffs, 42 tsx applied, 0 tsx conflicts 208: round 2 ( Fast ): 0 del cols, 0 del rows, 29 chg bounds, 0 chg sides, 0 chg coeffs, 58 tsx applied, 0 tsx conflicts 208: round 3 ( Fast ): 0 del cols, 0 del rows, 41 chg bounds, 0 chg sides, 0 chg coeffs, 90 tsx applied, 0 tsx conflicts 208: round 4 ( Fast ): 0 del cols, 0 del rows, 50 chg bounds, 0 chg sides, 0 chg coeffs, 120 tsx applied, 0 tsx conflicts 208: round 5 ( Medium ): 8 del cols, 2 del rows, 51 chg bounds, 12 chg sides, 6 chg coeffs, 129 tsx applied, 32 tsx conflicts 208: round 6 (Exhaustive): 8 del cols, 2 del rows, 51 chg bounds, 12 chg sides, 6 chg coeffs, 129 tsx applied, 32 tsx conflicts 208: round 7 ( Final ): Unchanged 208: presolved 7 rounds: 8 del cols, 2 del rows, 51 chg bounds, 12 chg sides, 6 chg coeffs, 129 tsx applied, 32 tsx conflicts 208: 208: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 208: colsingleton 7 0.0 0 0.0 0.000 208: coefftightening 0 0.0 0 0.0 0.000 208: propagation 7 57.1 120 100.0 0.002 208: fixcontinuous 2 0.0 0 0.0 0.000 208: simpleprobing 0 0.0 0 0.0 0.000 208: parallelrows 1 0.0 0 0.0 0.000 208: parallelcols 1 0.0 0 0.0 0.000 208: stuffing 2 50.0 40 20.0 0.000 208: dualfix 2 50.0 1 100.0 0.000 208: simplifyineq 0 0.0 0 0.0 0.000 208: doubletoneq 0 0.0 0 0.0 0.000 208: implint 0 0.0 0 0.0 0.000 208: domcol 1 0.0 0 0.0 0.001 208: dualinfer 0 0.0 0 0.0 0.000 208: probing 0 0.0 0 0.0 0.000 208: substitution 0 0.0 0 0.0 0.000 208: sparsify 0 0.0 0 0.0 0.000 208: 208: reduced problem: 208: reduced rows: 41 208: reduced columns: 33 208: reduced int. columns: 0 208: reduced cont. columns: 33 208: reduced nonzeros: 274 208: 208: presolving finished after 0.021 seconds 208: 208: Equilibrium scaling LP (persistent) 208: Simplifier removed 3 rows, 3 columns, 8 nonzeros, 17 col bounds, 25 row bounds 208: Reduced LP has 38 rows 30 columns 266 nonzeros 208: Equilibrium scaling LP 208: type | time | iters | facts | shift | viol sum | viol num | obj value 208: E | 0.0 | 0 | 2 | 0.00e+00 | 4.81e+04 | 18 | -3.30000000e+03 208: E | 0.0 | 44 | 3 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 208: --- unscaling internal solution 208: --- unsimplifying solution and basis 208: --- unscaling external solution 208: --- verifying computed solution 208: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 208: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 208: --- unscaling external solution 208: --- verifying computed solution 208: 208: SoPlex status : problem is solved [optimal] 208: Solving time (sec) : 0.00 208: Iterations : 44 208: Objective value : -1.74990013e+03 208: 208: Solution passed validation 208: 208: postsolve finished after 0.010 seconds 208: feasible: true 208: objective value: -1749.90012990621 208: 208: violations: 208: bounds: 0 208: constraints: 0 208: integrality: 0 208: 208: validation: SUCCESS 208: Solving time 0.052 seconds 208: 208: solving finished after 0.052 seconds 206/287 Test #208: q-solve-kb2.mps-lp_presolvers_without_basis.set ............................................ Passed 0.12 sec test 210 Start 210: d-solve-lotfi.mps-lp_presolvers_without_basis.set 210: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/lotfi.mps" "-o" "-0.2526470606188e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 210: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 210: Test timeout computed to be: 10000000 209: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 209: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 209: 209: External libraries: 209: Boost 1.83.0 (https://www.boost.org/) 209: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 209: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 209: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 209: 209: reading took 0.00318 seconds 209: Numerical Statistics: 209: Matrix range [2e-01,1e+02] 209: Objective range [9e-02,2e+01] 209: Bounds range [5e+00,2e+02] 209: RHS range [0e+00,0e+00] 209: Dynamism Variables: 2e+02 209: Dynamism Rows : 4e+02 209: set presolve.componentsmaxint = -1 209: set presolve.detectlindep = 0 209: set doubletoneq.enabled = 0 209: set dualinfer.enabled = 0 209: set substitution.enabled = 0 209: set sparsify.enabled = 0 209: set calculate_basis_for_dual = 0 209: 209: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/kb2.mps with dual-postsolve activated 209: rows: 43 209: columns: 41 209: int. columns: 0 209: cont. columns: 41 209: nonzeros: 286 209: 209: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 209: round 1 ( Fast ): 0 del cols, 0 del rows, 21 chg bounds, 0 chg sides, 0 chg coeffs, 42 tsx applied, 0 tsx conflicts 209: round 2 ( Fast ): 0 del cols, 0 del rows, 29 chg bounds, 0 chg sides, 0 chg coeffs, 58 tsx applied, 0 tsx conflicts 209: round 3 ( Fast ): 0 del cols, 0 del rows, 41 chg bounds, 0 chg sides, 0 chg coeffs, 90 tsx applied, 0 tsx conflicts 209: round 4 ( Fast ): 0 del cols, 0 del rows, 50 chg bounds, 0 chg sides, 0 chg coeffs, 120 tsx applied, 0 tsx conflicts 209: round 5 ( Medium ): 8 del cols, 2 del rows, 51 chg bounds, 12 chg sides, 6 chg coeffs, 129 tsx applied, 32 tsx conflicts 209: round 6 (Exhaustive): 8 del cols, 2 del rows, 51 chg bounds, 12 chg sides, 6 chg coeffs, 129 tsx applied, 32 tsx conflicts 209: round 7 ( Final ): Unchanged 209: presolved 7 rounds: 8 del cols, 2 del rows, 51 chg bounds, 12 chg sides, 6 chg coeffs, 129 tsx applied, 32 tsx conflicts 209: 209: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 209: colsingleton 7 0.0 0 0.0 0.000 209: coefftightening 0 0.0 0 0.0 0.000 209: propagation 7 57.1 120 100.0 0.013 209: fixcontinuous 2 0.0 0 0.0 0.000 209: simpleprobing 0 0.0 0 0.0 0.000 209: parallelrows 1 0.0 0 0.0 0.008 209: parallelcols 1 0.0 0 0.0 0.001 209: stuffing 2 50.0 40 20.0 0.001 209: dualfix 2 50.0 1 100.0 0.001 209: simplifyineq 0 0.0 0 0.0 0.000 209: doubletoneq 0 0.0 0 0.0 0.000 209: implint 0 0.0 0 0.0 0.000 209: domcol 1 0.0 0 0.0 0.002 209: dualinfer 0 0.0 0 0.0 0.000 209: probing 0 0.0 0 0.0 0.000 209: substitution 0 0.0 0 0.0 0.000 209: sparsify 0 0.0 0 0.0 0.000 209: 209: reduced problem: 209: reduced rows: 41 209: reduced columns: 33 209: reduced int. columns: 0 209: reduced cont. columns: 33 209: reduced nonzeros: 274 209: 209: presolving finished after 0.053 seconds 209: 209: Equilibrium scaling LP (persistent) 209: Simplifier removed 3 rows, 3 columns, 8 nonzeros, 16 col bounds, 25 row bounds 209: Reduced LP has 38 rows 30 columns 266 nonzeros 209: Equilibrium scaling LP 209: type | time | iters | facts | shift | viol sum | viol num | obj value 209: E | 0.0 | 0 | 2 | 0.00e+00 | 4.81e+04 | 18 | -3.30000000e+03 209: E | 0.0 | 44 | 3 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 209: --- unscaling internal solution 209: --- unsimplifying solution and basis 209: --- unscaling external solution 209: --- verifying computed solution 209: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 209: E | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.74990013e+03 209: --- unscaling external solution 209: --- verifying computed solution 210: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 210: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 210: 210: External libraries: 210: Boost 1.83.0 (https://www.boost.org/) 210: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 210: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 210: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 210: 210: reading took 0.0102 seconds 210: Numerical Statistics: 210: Matrix range [2e-02,1e+03] 210: Objective range [1e+00,1e+00] 210: Bounds range [0e+00,0e+00] 210: RHS range [1e+00,2e+04] 210: Dynamism Variables: 2e+04 210: Dynamism Rows : 1e+03 210: set presolve.componentsmaxint = -1 210: set presolve.detectlindep = 0 210: set doubletoneq.enabled = 0 210: set dualinfer.enabled = 0 210: set substitution.enabled = 0 210: set sparsify.enabled = 0 210: set calculate_basis_for_dual = 0 210: 210: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/lotfi.mps with dual-postsolve activated 210: rows: 153 210: columns: 308 210: int. columns: 0 210: cont. columns: 308 210: nonzeros: 1078 210: 210: round 0 ( Trivial ): 4 del cols, 9 del rows, 13 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 210: round 1 ( Fast ): 6 del cols, 13 del rows, 219 chg bounds, 0 chg sides, 0 chg coeffs, 406 tsx applied, 0 tsx conflicts 210: round 2 ( Fast ): 8 del cols, 19 del rows, 286 chg bounds, 0 chg sides, 0 chg coeffs, 532 tsx applied, 0 tsx conflicts 210: round 3 ( Fast ): 8 del cols, 19 del rows, 336 chg bounds, 0 chg sides, 0 chg coeffs, 632 tsx applied, 0 tsx conflicts 210: round 4 ( Medium ): 23 del cols, 25 del rows, 347 chg bounds, 9 chg sides, 9 chg coeffs, 669 tsx applied, 46 tsx conflicts 210: round 5 ( Medium ): 30 del cols, 32 del rows, 348 chg bounds, 9 chg sides, 9 chg coeffs, 678 tsx applied, 52 tsx conflicts 210: round 6 ( Medium ): 80 del cols, 36 del rows, 356 chg bounds, 55 chg sides, 55 chg coeffs, 736 tsx applied, 102 tsx conflicts 210: round 7 ( Medium ): 96 del cols, 36 del rows, 366 chg bounds, 71 chg sides, 71 chg coeffs, 762 tsx applied, 150 tsx conflicts 210: round 8 (Exhaustive): 96 del cols, 36 del rows, 382 chg bounds, 71 chg sides, 71 chg coeffs, 778 tsx applied, 150 tsx conflicts 210: round 9 ( Final ): 96 del cols, 36 del rows, 382 chg bounds, 71 chg sides, 71 chg coeffs, 778 tsx applied, 150 tsx conflicts 210: presolved 9 rounds: 96 del cols, 36 del rows, 382 chg bounds, 71 chg sides, 71 chg coeffs, 778 tsx applied, 150 tsx conflicts 210: 210: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 210: colsingleton 9 0.0 0 0.0 0.000 210: coefftightening 0 0.0 0 0.0 0.000 210: propagation 9 55.6 656 100.0 0.000 210: fixcontinuous 3 0.0 0 0.0 0.000 210: simpleprobing 0 0.0 0 0.0 0.000 210: parallelrows 2 0.0 0 0.0 0.000 210: parallelcols 2 0.0 0 0.0 0.001 210: stuffing 5 80.0 236 36.9 0.000 210: dualfix 6 83.3 36 97.2 0.000 210: simplifyineq 0 0.0 0 0.0 0.000 210: doubletoneq 0 0.0 0 0.0 0.000 209: 209: SoPlex status : problem is solved [optimal] 209: Solving time (sec) : 0.00 209: Iterations : 44 209: Objective value : -1.74990013e+03 209: 209: Solution passed validation 209: 209: postsolve finished after 0.017 seconds 209: feasible: true 209: objective value: -1749.90012990621 209: 209: violations: 209: bounds: 0 209: constraints: 0 209: integrality: 0 209: 209: validation: SUCCESS 209: Solving time 0.074 seconds 209: 209: solving finished after 0.074 seconds 207/287 Test #209: r-solve-kb2.mps-lp_presolvers_without_basis.set ............................................ Passed 0.17 sec test 211 Start 211: q-solve-lotfi.mps-lp_presolvers_without_basis.set 211: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/lotfi.mps" "-o" "-0.2526470606188e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 211: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 211: Test timeout computed to be: 10000000 205: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 205: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 205: 205: External libraries: 205: Boost 1.83.0 (https://www.boost.org/) 205: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 205: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 205: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 205: 205: reading took 0.0597 seconds 205: Numerical Statistics: 205: Matrix range [1e-03,2e+03] 205: Objective range [2e-01,3e+03] 205: Bounds range [0e+00,0e+00] 205: RHS range [5e-01,9e+05] 205: Dynamism Variables: 5e+05 205: Dynamism Rows : 1e+04 205: set presolve.componentsmaxint = -1 205: set presolve.detectlindep = 0 205: set doubletoneq.enabled = 0 205: set dualinfer.enabled = 0 205: set substitution.enabled = 0 205: set sparsify.enabled = 0 205: set calculate_basis_for_dual = 0 205: 205: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/israel.mps with dual-postsolve activated 205: rows: 174 205: columns: 142 205: int. columns: 0 205: cont. columns: 142 205: nonzeros: 2269 205: 205: round 0 ( Trivial ): 1 del cols, 11 del rows, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 205: round 1 ( Fast ): 1 del cols, 11 del rows, 298 chg bounds, 0 chg sides, 0 chg coeffs, 1506 tsx applied, 0 tsx conflicts 205: round 2 ( Fast ): 1 del cols, 11 del rows, 407 chg bounds, 0 chg sides, 0 chg coeffs, 1830 tsx applied, 0 tsx conflicts 205: round 3 ( Fast ): 1 del cols, 11 del rows, 439 chg bounds, 0 chg sides, 0 chg coeffs, 1902 tsx applied, 0 tsx conflicts 205: round 4 ( Medium ): 1 del cols, 11 del rows, 457 chg bounds, 0 chg sides, 0 chg coeffs, 1920 tsx applied, 0 tsx conflicts 205: round 5 (Exhaustive): 3 del cols, 11 del rows, 471 chg bounds, 0 chg sides, 0 chg coeffs, 1934 tsx applied, 0 tsx conflicts 205: round 6 (Exhaustive): 3 del cols, 11 del rows, 483 chg bounds, 0 chg sides, 0 chg coeffs, 1946 tsx applied, 0 tsx conflicts 205: round 7 ( Final ): 3 del cols, 11 del rows, 483 chg bounds, 0 chg sides, 0 chg coeffs, 1946 tsx applied, 0 tsx conflicts 205: presolved 7 rounds: 3 del cols, 11 del rows, 483 chg bounds, 0 chg sides, 0 chg coeffs, 1946 tsx applied, 0 tsx conflicts 205: 205: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 205: colsingleton 7 0.0 0 0.0 0.000 205: coefftightening 0 0.0 0 0.0 0.000 205: propagation 7 42.9 1902 100.0 0.031 205: fixcontinuous 2 0.0 0 0.0 0.000 205: simpleprobing 0 0.0 0 0.0 0.000 205: parallelrows 2 0.0 0 0.0 0.002 205: parallelcols 2 0.0 0 0.0 0.004 205: stuffing 2 0.0 0 0.0 0.000 205: dualfix 4 75.0 42 100.0 0.002 205: simplifyineq 0 0.0 0 0.0 0.000 205: doubletoneq 0 0.0 0 0.0 0.000 205: implint 0 0.0 0 0.0 0.000 205: domcol 2 50.0 2 100.0 0.014 205: dualinfer 0 0.0 0 0.0 0.000 210: implint 0 0.0 0 0.0 0.000 210: domcol 1 0.0 0 0.0 0.000 210: dualinfer 0 0.0 0 0.0 0.000 210: probing 0 0.0 0 0.0 0.000 210: substitution 0 0.0 0 0.0 0.000 210: sparsify 0 0.0 0 0.0 0.000 210: 210: reduced problem: 210: reduced rows: 117 210: reduced columns: 212 210: reduced int. columns: 0 210: reduced cont. columns: 212 210: reduced nonzeros: 526 210: 210: presolving finished after 0.037 seconds 210: 210: Equilibrium scaling LP (persistent) 210: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 210: Reduced LP has 117 rows 212 columns 526 nonzeros 210: Equilibrium scaling LP 210: type | time | iters | facts | shift | viol sum | viol num | obj value 210: L | 0.0 | 0 | 3 | 0.00e+00 | 5.84e+05 | 73 | -3.16929351e+03 205: probing 0 0.0 0 0.0 0.000 205: substitution 0 0.0 0 0.0 0.000 205: sparsify 0 0.0 0 0.0 0.000 205: 205: reduced problem: 205: reduced rows: 163 205: reduced columns: 139 205: reduced int. columns: 0 205: reduced cont. columns: 139 205: reduced nonzeros: 2200 205: 205: presolving finished after 0.225 seconds 205: 205: Equilibrium scaling LP (persistent) 205: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 205: Reduced LP has 163 rows 139 columns 2200 nonzeros 205: Equilibrium scaling LP 205: type | time | iters | facts | shift | viol sum | viol num | obj value 205: L | 0.0 | 0 | 3 | 0.00e+00 | 1.01e+05 | 87 | -4.25806009e+06 210: L | 0.0 | 182 | 5 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 210: --- unscaling internal solution 210: --- unsimplifying solution and basis 210: --- unscaling external solution 210: --- verifying computed solution 210: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 210: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 210: --- unscaling external solution 210: --- verifying computed solution 205: L | 0.0 | 121 | 5 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 205: --- unscaling internal solution 205: --- unsimplifying solution and basis 205: --- unscaling external solution 205: --- verifying computed solution 205: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 210: 210: SoPlex status : problem is solved [optimal] 210: Solving time (sec) : 0.00 210: Iterations : 182 210: Objective value : -2.52647061e+01 210: 210: Solution passed validation 210: 210: postsolve finished after 0.000 seconds 210: feasible: true 210: objective value: -25.26470606188 210: 210: violations: 210: bounds: 0 210: constraints: 0 210: integrality: 0 210: 210: validation: SUCCESS 210: Solving time 0.063 seconds 210: 210: solving finished after 0.063 seconds 205: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 205: --- unscaling external solution 205: --- verifying computed solution 208/287 Test #210: d-solve-lotfi.mps-lp_presolvers_without_basis.set .......................................... Passed 0.14 sec test 212 Start 212: r-solve-lotfi.mps-lp_presolvers_without_basis.set 212: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/lotfi.mps" "-o" "-0.2526470606188e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 212: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 212: Test timeout computed to be: 10000000 205: 205: SoPlex status : problem is solved [optimal] 205: Solving time (sec) : 0.02 205: Iterations : 121 205: Objective value : -8.96644822e+05 205: 205: Solution passed validation 205: 205: postsolve finished after 0.069 seconds 205: feasible: true 205: objective value: -896644.821863046 205: 205: violations: 205: bounds: 0 205: constraints: 0 205: integrality: 0 205: 205: validation: SUCCESS 205: Solving time 0.333 seconds 205: 205: solving finished after 0.333 seconds 211: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 211: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 211: 211: External libraries: 211: Boost 1.83.0 (https://www.boost.org/) 211: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 211: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 211: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 211: 211: reading took 0.0164 seconds 211: Numerical Statistics: 211: Matrix range [2e-02,1e+03] 211: Objective range [1e+00,1e+00] 211: Bounds range [0e+00,0e+00] 211: RHS range [1e+00,2e+04] 211: Dynamism Variables: 2e+04 211: Dynamism Rows : 1e+03 211: set presolve.componentsmaxint = -1 211: set presolve.detectlindep = 0 211: set doubletoneq.enabled = 0 211: set dualinfer.enabled = 0 211: set substitution.enabled = 0 211: set sparsify.enabled = 0 211: set calculate_basis_for_dual = 0 211: 211: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/lotfi.mps with dual-postsolve activated 211: rows: 153 211: columns: 308 211: int. columns: 0 211: cont. columns: 308 211: nonzeros: 1078 211: 211: round 0 ( Trivial ): 4 del cols, 9 del rows, 13 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 211: round 1 ( Fast ): 6 del cols, 13 del rows, 219 chg bounds, 0 chg sides, 0 chg coeffs, 406 tsx applied, 0 tsx conflicts 211: round 2 ( Fast ): 8 del cols, 19 del rows, 286 chg bounds, 0 chg sides, 0 chg coeffs, 532 tsx applied, 0 tsx conflicts 211: round 3 ( Fast ): 8 del cols, 19 del rows, 336 chg bounds, 0 chg sides, 0 chg coeffs, 632 tsx applied, 0 tsx conflicts 211: round 4 ( Medium ): 23 del cols, 25 del rows, 347 chg bounds, 9 chg sides, 9 chg coeffs, 669 tsx applied, 46 tsx conflicts 211: round 5 ( Medium ): 30 del cols, 32 del rows, 348 chg bounds, 9 chg sides, 9 chg coeffs, 678 tsx applied, 52 tsx conflicts 211: round 6 ( Medium ): 80 del cols, 36 del rows, 356 chg bounds, 55 chg sides, 55 chg coeffs, 736 tsx applied, 102 tsx conflicts 211: round 7 ( Medium ): 96 del cols, 36 del rows, 366 chg bounds, 71 chg sides, 71 chg coeffs, 762 tsx applied, 150 tsx conflicts 211: round 8 (Exhaustive): 96 del cols, 36 del rows, 382 chg bounds, 71 chg sides, 71 chg coeffs, 778 tsx applied, 150 tsx conflicts 211: round 9 ( Final ): 96 del cols, 36 del rows, 382 chg bounds, 71 chg sides, 71 chg coeffs, 778 tsx applied, 150 tsx conflicts 211: presolved 9 rounds: 96 del cols, 36 del rows, 382 chg bounds, 71 chg sides, 71 chg coeffs, 778 tsx applied, 150 tsx conflicts 211: 211: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 211: colsingleton 9 0.0 0 0.0 0.000 211: coefftightening 0 0.0 0 0.0 0.000 211: propagation 9 55.6 656 100.0 0.015 211: fixcontinuous 3 0.0 0 0.0 0.008 211: simpleprobing 0 0.0 0 0.0 0.000 211: parallelrows 2 0.0 0 0.0 0.003 211: parallelcols 2 0.0 0 0.0 0.001 211: stuffing 5 80.0 236 36.9 0.002 211: dualfix 6 83.3 36 97.2 0.004 211: simplifyineq 0 0.0 0 0.0 0.000 211: doubletoneq 0 0.0 0 0.0 0.000 211: implint 0 0.0 0 0.0 0.000 211: domcol 1 0.0 0 0.0 0.002 211: dualinfer 0 0.0 0 0.0 0.000 211: probing 0 0.0 0 0.0 0.000 211: substitution 0 0.0 0 0.0 0.000 211: sparsify 0 0.0 0 0.0 0.000 211: 211: reduced problem: 211: reduced rows: 117 211: reduced columns: 212 211: reduced int. columns: 0 211: reduced cont. columns: 212 211: reduced nonzeros: 526 211: 211: presolving finished after 0.078 seconds 211: 211: Equilibrium scaling LP (persistent) 211: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 211: Reduced LP has 117 rows 212 columns 526 nonzeros 211: Equilibrium scaling LP 211: type | time | iters | facts | shift | viol sum | viol num | obj value 211: L | 0.0 | 0 | 3 | 0.00e+00 | 5.84e+05 | 73 | -3.16929351e+03 211: L | 0.0 | 179 | 5 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 211: --- unscaling internal solution 211: --- unsimplifying solution and basis 211: --- unscaling external solution 211: --- verifying computed solution 211: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 211: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 211: --- unscaling external solution 211: --- verifying computed solution 209/287 Test #205: q-solve-israel.mps-lp_presolvers_without_basis.set ......................................... Passed 0.54 sec test 213 Start 213: d-solve-recipe.mps-lp_presolvers_without_basis.set 213: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/recipe.mps" "-o" "-0.266616e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 213: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 213: Test timeout computed to be: 10000000 206: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 206: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 206: 206: External libraries: 206: Boost 1.83.0 (https://www.boost.org/) 206: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 206: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 206: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 206: 206: reading took 0.0487 seconds 206: Numerical Statistics: 206: Matrix range [1e-03,2e+03] 206: Objective range [2e-01,3e+03] 206: Bounds range [0e+00,0e+00] 206: RHS range [5e-01,9e+05] 206: Dynamism Variables: 5e+05 206: Dynamism Rows : 1e+04 206: set presolve.componentsmaxint = -1 206: set presolve.detectlindep = 0 206: set doubletoneq.enabled = 0 206: set dualinfer.enabled = 0 206: set substitution.enabled = 0 206: set sparsify.enabled = 0 206: set calculate_basis_for_dual = 0 206: 206: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/israel.mps with dual-postsolve activated 206: rows: 174 206: columns: 142 206: int. columns: 0 206: cont. columns: 142 206: nonzeros: 2269 206: 206: round 0 ( Trivial ): 1 del cols, 11 del rows, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 206: round 1 ( Fast ): 1 del cols, 11 del rows, 298 chg bounds, 0 chg sides, 0 chg coeffs, 1506 tsx applied, 0 tsx conflicts 206: round 2 ( Fast ): 1 del cols, 11 del rows, 407 chg bounds, 0 chg sides, 0 chg coeffs, 1830 tsx applied, 0 tsx conflicts 206: round 3 ( Fast ): 1 del cols, 11 del rows, 439 chg bounds, 0 chg sides, 0 chg coeffs, 1902 tsx applied, 0 tsx conflicts 206: round 4 ( Medium ): 1 del cols, 11 del rows, 457 chg bounds, 0 chg sides, 0 chg coeffs, 1920 tsx applied, 0 tsx conflicts 206: round 5 (Exhaustive): 3 del cols, 11 del rows, 471 chg bounds, 0 chg sides, 0 chg coeffs, 1934 tsx applied, 0 tsx conflicts 206: round 6 (Exhaustive): 3 del cols, 11 del rows, 483 chg bounds, 0 chg sides, 0 chg coeffs, 1946 tsx applied, 0 tsx conflicts 206: round 7 ( Final ): 3 del cols, 11 del rows, 483 chg bounds, 0 chg sides, 0 chg coeffs, 1946 tsx applied, 0 tsx conflicts 206: presolved 7 rounds: 3 del cols, 11 del rows, 483 chg bounds, 0 chg sides, 0 chg coeffs, 1946 tsx applied, 0 tsx conflicts 206: 206: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 206: colsingleton 7 0.0 0 0.0 0.000 206: coefftightening 0 0.0 0 0.0 0.000 206: propagation 7 42.9 1902 100.0 0.086 206: fixcontinuous 2 0.0 0 0.0 0.000 206: simpleprobing 0 0.0 0 0.0 0.000 206: parallelrows 2 0.0 0 0.0 0.033 206: parallelcols 2 0.0 0 0.0 0.021 206: stuffing 2 0.0 0 0.0 0.001 206: dualfix 4 75.0 42 100.0 0.007 206: simplifyineq 0 0.0 0 0.0 0.000 206: doubletoneq 0 0.0 0 0.0 0.000 206: implint 0 0.0 0 0.0 0.000 206: domcol 2 50.0 2 100.0 0.033 206: dualinfer 0 0.0 0 0.0 0.000 206: probing 0 0.0 0 0.0 0.000 206: substitution 0 0.0 0 0.0 0.000 206: sparsify 0 0.0 0 0.0 0.000 206: 206: reduced problem: 206: reduced rows: 163 206: reduced columns: 139 206: reduced int. columns: 0 206: reduced cont. columns: 139 206: reduced nonzeros: 2200 206: 206: presolving finished after 0.387 seconds 206: 206: Equilibrium scaling LP (persistent) 211: 211: SoPlex status : problem is solved [optimal] 211: Solving time (sec) : 0.02 211: Iterations : 179 211: Objective value : -2.52647061e+01 211: 211: Solution passed validation 211: 211: postsolve finished after 0.026 seconds 211: feasible: true 211: objective value: -25.26470606188 211: 211: violations: 211: bounds: 0 211: constraints: 0 211: integrality: 0 211: 211: validation: SUCCESS 211: Solving time 0.120 seconds 211: 211: solving finished after 0.120 seconds 210/287 Test #211: q-solve-lotfi.mps-lp_presolvers_without_basis.set .......................................... Passed 0.20 sec test 214 Start 214: q-solve-recipe.mps-lp_presolvers_without_basis.set 214: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/recipe.mps" "-o" "-0.266616e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 214: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 214: Test timeout computed to be: 10000000 206: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 206: Reduced LP has 163 rows 139 columns 2200 nonzeros 206: Equilibrium scaling LP 206: type | time | iters | facts | shift | viol sum | viol num | obj value 206: L | 0.0 | 0 | 3 | 0.00e+00 | 1.01e+05 | 87 | -4.25806009e+06 206: L | 0.0 | 119 | 5 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 206: --- unscaling internal solution 206: --- unsimplifying solution and basis 206: --- unscaling external solution 206: --- verifying computed solution 206: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 206: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -8.96644822e+05 206: --- unscaling external solution 206: --- verifying computed solution 213: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 213: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 213: 213: External libraries: 213: Boost 1.83.0 (https://www.boost.org/) 213: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 213: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 213: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 213: 213: reading took 0.00467 seconds 213: Numerical Statistics: 213: Matrix range [1e-01,1e+02] 213: Objective range [1e-03,2e+00] 213: Bounds range [2e+00,5e+03] 213: RHS range [0e+00,0e+00] 213: Dynamism Variables: 1e+02 213: Dynamism Rows : 2e+02 213: set presolve.componentsmaxint = -1 213: set presolve.detectlindep = 0 213: set doubletoneq.enabled = 0 213: set dualinfer.enabled = 0 213: set substitution.enabled = 0 213: set sparsify.enabled = 0 213: set calculate_basis_for_dual = 0 213: 213: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/recipe.mps with dual-postsolve activated 213: rows: 91 213: columns: 180 213: int. columns: 0 213: cont. columns: 180 213: nonzeros: 663 213: 213: round 0 ( Trivial ): 28 del cols, 6 del rows, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 213: round 1 ( Fast ): 33 del cols, 10 del rows, 40 chg bounds, 0 chg sides, 0 chg coeffs, 74 tsx applied, 0 tsx conflicts 213: round 2 ( Fast ): 37 del cols, 12 del rows, 59 chg bounds, 0 chg sides, 0 chg coeffs, 114 tsx applied, 0 tsx conflicts 213: round 3 ( Fast ): 41 del cols, 14 del rows, 69 chg bounds, 0 chg sides, 0 chg coeffs, 134 tsx applied, 0 tsx conflicts 213: round 4 ( Fast ): 43 del cols, 16 del rows, 72 chg bounds, 0 chg sides, 0 chg coeffs, 136 tsx applied, 0 tsx conflicts 213: round 5 ( Medium ): 98 del cols, 28 del rows, 72 chg bounds, 29 chg sides, 16 chg coeffs, 191 tsx applied, 112 tsx conflicts 213: round 6 ( Medium ): 99 del cols, 28 del rows, 72 chg bounds, 30 chg sides, 17 chg coeffs, 192 tsx applied, 115 tsx conflicts 213: round 7 ( Medium ): 101 del cols, 32 del rows, 73 chg bounds, 31 chg sides, 17 chg coeffs, 194 tsx applied, 117 tsx conflicts 213: round 8 ( Medium ): 102 del cols, 32 del rows, 73 chg bounds, 32 chg sides, 18 chg coeffs, 195 tsx applied, 120 tsx conflicts 213: round 9 ( Medium ): 103 del cols, 33 del rows, 73 chg bounds, 33 chg sides, 18 chg coeffs, 196 tsx applied, 122 tsx conflicts 213: round 10 ( Medium ): 105 del cols, 34 del rows, 73 chg bounds, 34 chg sides, 18 chg coeffs, 197 tsx applied, 125 tsx conflicts 213: round 11 (Exhaustive): 113 del cols, 40 del rows, 81 chg bounds, 34 chg sides, 18 chg coeffs, 205 tsx applied, 125 tsx conflicts 213: round 12 (Exhaustive): 113 del cols, 40 del rows, 87 chg bounds, 34 chg sides, 18 chg coeffs, 217 tsx applied, 125 tsx conflicts 213: round 13 ( Medium ): 121 del cols, 44 del rows, 90 chg bounds, 38 chg sides, 20 chg coeffs, 229 tsx applied, 137 tsx conflicts 213: round 14 (Exhaustive): 122 del cols, 45 del rows, 91 chg bounds, 38 chg sides, 20 chg coeffs, 230 tsx applied, 137 tsx conflicts 213: round 15 ( Fast ): 122 del cols, 46 del rows, 93 chg bounds, 38 chg sides, 20 chg coeffs, 234 tsx applied, 137 tsx conflicts 213: round 16 (Exhaustive): 122 del cols, 46 del rows, 93 chg bounds, 38 chg sides, 20 chg coeffs, 234 tsx applied, 137 tsx conflicts 213: round 17 ( Medium ): 123 del cols, 46 del rows, 93 chg bounds, 40 chg sides, 21 chg coeffs, 235 tsx applied, 146 tsx conflicts 213: round 18 ( Medium ): 125 del cols, 47 del rows, 93 chg bounds, 41 chg sides, 21 chg coeffs, 236 tsx applied, 153 tsx conflicts 213: round 19 (Exhaustive): 125 del cols, 47 del rows, 93 chg bounds, 41 chg sides, 21 chg coeffs, 236 tsx applied, 153 tsx conflicts 213: round 20 ( Final ): Unchanged 213: presolved 20 rounds: 125 del cols, 47 del rows, 93 chg bounds, 41 chg sides, 21 chg coeffs, 236 tsx applied, 153 tsx conflicts 213: 213: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 213: colsingleton 20 0.0 0 0.0 0.000 213: coefftightening 0 0.0 0 0.0 0.000 213: propagation 20 35.0 158 100.0 0.000 213: fixcontinuous 5 0.0 0 0.0 0.000 213: simpleprobing 0 0.0 0 0.0 0.000 213: parallelrows 3 0.0 0 0.0 0.000 213: parallelcols 4 25.0 27 100.0 0.001 213: stuffing 12 75.0 194 21.1 0.000 213: dualfix 6 16.7 1 100.0 0.000 213: simplifyineq 0 0.0 0 0.0 0.000 213: doubletoneq 0 0.0 0 0.0 0.000 213: implint 0 0.0 0 0.0 0.000 213: domcol 3 66.7 9 100.0 0.004 213: dualinfer 0 0.0 0 0.0 0.000 213: probing 0 0.0 0 0.0 0.000 213: substitution 0 0.0 0 0.0 0.000 213: sparsify 0 0.0 0 0.0 0.000 213: 213: reduced problem: 213: reduced rows: 44 213: reduced columns: 55 213: reduced int. columns: 0 213: reduced cont. columns: 55 213: reduced nonzeros: 344 213: 213: presolving finished after 0.013 seconds 213: 213: Equilibrium scaling LP (persistent) 213: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 213: Reduced LP has 44 rows 55 columns 344 nonzeros 213: Equilibrium scaling LP 213: type | time | iters | facts | shift | viol sum | viol num | obj value 213: L | 0.0 | 0 | 3 | 0.00e+00 | 1.05e+02 | 8 | -3.52556000e+02 213: L | 0.0 | 8 | 4 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 213: --- unscaling internal solution 213: --- unsimplifying solution and basis 213: --- unscaling external solution 213: --- verifying computed solution 213: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 213: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 213: --- unscaling external solution 213: --- verifying computed solution 213: 213: SoPlex status : problem is solved [optimal] 213: Solving time (sec) : 0.00 213: Iterations : 8 213: Objective value : -2.66616000e+02 213: 213: Solution passed validation 213: 213: postsolve finished after 0.015 seconds 213: feasible: true 213: objective value: -266.616 213: 213: violations: 213: bounds: 0 213: constraints: 0 213: integrality: 0 213: 213: validation: SUCCESS 213: Solving time 0.030 seconds 213: 213: solving finished after 0.030 seconds 211/287 Test #213: d-solve-recipe.mps-lp_presolvers_without_basis.set ......................................... Passed 0.08 sec test 215 Start 215: r-solve-recipe.mps-lp_presolvers_without_basis.set 215: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/recipe.mps" "-o" "-0.266616e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 215: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 215: Test timeout computed to be: 10000000 215: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 215: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 215: 215: External libraries: 215: Boost 1.83.0 (https://www.boost.org/) 215: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 215: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 215: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 215: 215: reading took 0.00843 seconds 215: Numerical Statistics: 215: Matrix range [1e-01,1e+02] 215: Objective range [1e-03,2e+00] 215: Bounds range [2e+00,5e+03] 215: RHS range [0e+00,0e+00] 215: Dynamism Variables: 1e+02 215: Dynamism Rows : 2e+02 215: set presolve.componentsmaxint = -1 215: set presolve.detectlindep = 0 215: set doubletoneq.enabled = 0 215: set dualinfer.enabled = 0 215: set substitution.enabled = 0 215: set sparsify.enabled = 0 215: set calculate_basis_for_dual = 0 215: 215: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/recipe.mps with dual-postsolve activated 215: rows: 91 215: columns: 180 215: int. columns: 0 215: cont. columns: 180 215: nonzeros: 663 215: 215: round 0 ( Trivial ): 28 del cols, 6 del rows, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 215: round 1 ( Fast ): 33 del cols, 10 del rows, 40 chg bounds, 0 chg sides, 0 chg coeffs, 74 tsx applied, 0 tsx conflicts 215: round 2 ( Fast ): 37 del cols, 12 del rows, 59 chg bounds, 0 chg sides, 0 chg coeffs, 114 tsx applied, 0 tsx conflicts 215: round 3 ( Fast ): 41 del cols, 14 del rows, 69 chg bounds, 0 chg sides, 0 chg coeffs, 134 tsx applied, 0 tsx conflicts 215: round 4 ( Fast ): 43 del cols, 16 del rows, 72 chg bounds, 0 chg sides, 0 chg coeffs, 136 tsx applied, 0 tsx conflicts 215: round 5 ( Medium ): 98 del cols, 28 del rows, 72 chg bounds, 29 chg sides, 16 chg coeffs, 191 tsx applied, 112 tsx conflicts 215: round 6 ( Medium ): 99 del cols, 28 del rows, 72 chg bounds, 30 chg sides, 17 chg coeffs, 192 tsx applied, 115 tsx conflicts 215: round 7 ( Medium ): 101 del cols, 32 del rows, 73 chg bounds, 31 chg sides, 17 chg coeffs, 194 tsx applied, 117 tsx conflicts 215: round 8 ( Medium ): 102 del cols, 32 del rows, 73 chg bounds, 32 chg sides, 18 chg coeffs, 195 tsx applied, 120 tsx conflicts 215: round 9 ( Medium ): 103 del cols, 33 del rows, 73 chg bounds, 33 chg sides, 18 chg coeffs, 196 tsx applied, 122 tsx conflicts 215: round 10 ( Medium ): 105 del cols, 34 del rows, 73 chg bounds, 34 chg sides, 18 chg coeffs, 197 tsx applied, 125 tsx conflicts 215: round 11 (Exhaustive): 113 del cols, 40 del rows, 81 chg bounds, 34 chg sides, 18 chg coeffs, 205 tsx applied, 125 tsx conflicts 215: round 12 (Exhaustive): 113 del cols, 40 del rows, 87 chg bounds, 34 chg sides, 18 chg coeffs, 217 tsx applied, 125 tsx conflicts 215: round 13 ( Medium ): 121 del cols, 44 del rows, 90 chg bounds, 38 chg sides, 20 chg coeffs, 229 tsx applied, 137 tsx conflicts 215: round 14 (Exhaustive): 122 del cols, 45 del rows, 91 chg bounds, 38 chg sides, 20 chg coeffs, 230 tsx applied, 137 tsx conflicts 215: round 15 ( Fast ): 122 del cols, 46 del rows, 93 chg bounds, 38 chg sides, 20 chg coeffs, 234 tsx applied, 137 tsx conflicts 215: round 16 (Exhaustive): 122 del cols, 46 del rows, 93 chg bounds, 38 chg sides, 20 chg coeffs, 234 tsx applied, 137 tsx conflicts 215: round 17 ( Medium ): 123 del cols, 46 del rows, 93 chg bounds, 40 chg sides, 21 chg coeffs, 235 tsx applied, 146 tsx conflicts 215: round 18 ( Medium ): 125 del cols, 47 del rows, 93 chg bounds, 41 chg sides, 21 chg coeffs, 236 tsx applied, 153 tsx conflicts 215: round 19 (Exhaustive): 125 del cols, 47 del rows, 93 chg bounds, 41 chg sides, 21 chg coeffs, 236 tsx applied, 153 tsx conflicts 215: round 20 ( Final ): Unchanged 215: presolved 20 rounds: 125 del cols, 47 del rows, 93 chg bounds, 41 chg sides, 21 chg coeffs, 236 tsx applied, 153 tsx conflicts 215: 215: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 215: colsingleton 20 0.0 0 0.0 0.000 215: coefftightening 0 0.0 0 0.0 0.000 215: propagation 20 35.0 158 100.0 0.007 215: fixcontinuous 5 0.0 0 0.0 0.000 215: simpleprobing 0 0.0 0 0.0 0.000 215: parallelrows 3 0.0 0 0.0 0.004 215: parallelcols 4 25.0 27 100.0 0.006 215: stuffing 12 75.0 194 21.1 0.002 215: dualfix 6 16.7 1 100.0 0.002 215: simplifyineq 0 0.0 0 0.0 0.000 215: doubletoneq 0 0.0 0 0.0 0.000 215: implint 0 0.0 0 0.0 0.000 215: domcol 3 66.7 9 100.0 0.005 215: dualinfer 0 0.0 0 0.0 0.000 215: probing 0 0.0 0 0.0 0.000 215: substitution 0 0.0 0 0.0 0.000 215: sparsify 0 0.0 0 0.0 0.000 215: 215: reduced problem: 215: reduced rows: 44 215: reduced columns: 55 215: reduced int. columns: 0 215: reduced cont. columns: 55 215: reduced nonzeros: 344 215: 215: presolving finished after 0.054 seconds 215: 215: Equilibrium scaling LP (persistent) 215: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 215: Reduced LP has 44 rows 55 columns 344 nonzeros 215: Equilibrium scaling LP 215: type | time | iters | facts | shift | viol sum | viol num | obj value 215: L | 0.0 | 0 | 3 | 0.00e+00 | 1.05e+02 | 8 | -3.52556000e+02 215: L | 0.0 | 8 | 4 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 215: --- unscaling internal solution 215: --- unsimplifying solution and basis 215: --- unscaling external solution 215: --- verifying computed solution 214: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 214: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 214: 214: External libraries: 214: Boost 1.83.0 (https://www.boost.org/) 214: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 214: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 214: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 214: 214: reading took 0.0147 seconds 214: Numerical Statistics: 214: Matrix range [1e-01,1e+02] 214: Objective range [1e-03,2e+00] 214: Bounds range [2e+00,5e+03] 214: RHS range [0e+00,0e+00] 214: Dynamism Variables: 1e+02 214: Dynamism Rows : 2e+02 214: set presolve.componentsmaxint = -1 214: set presolve.detectlindep = 0 214: set doubletoneq.enabled = 0 214: set dualinfer.enabled = 0 214: set substitution.enabled = 0 214: set sparsify.enabled = 0 214: set calculate_basis_for_dual = 0 214: 214: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/recipe.mps with dual-postsolve activated 214: rows: 91 214: columns: 180 214: int. columns: 0 214: cont. columns: 180 214: nonzeros: 663 214: 214: round 0 ( Trivial ): 28 del cols, 6 del rows, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 214: round 1 ( Fast ): 33 del cols, 10 del rows, 40 chg bounds, 0 chg sides, 0 chg coeffs, 74 tsx applied, 0 tsx conflicts 214: round 2 ( Fast ): 37 del cols, 12 del rows, 59 chg bounds, 0 chg sides, 0 chg coeffs, 114 tsx applied, 0 tsx conflicts 214: round 3 ( Fast ): 41 del cols, 14 del rows, 69 chg bounds, 0 chg sides, 0 chg coeffs, 134 tsx applied, 0 tsx conflicts 214: round 4 ( Fast ): 43 del cols, 16 del rows, 72 chg bounds, 0 chg sides, 0 chg coeffs, 136 tsx applied, 0 tsx conflicts 214: round 5 ( Medium ): 98 del cols, 28 del rows, 72 chg bounds, 29 chg sides, 16 chg coeffs, 191 tsx applied, 112 tsx conflicts 214: round 6 ( Medium ): 99 del cols, 28 del rows, 72 chg bounds, 30 chg sides, 17 chg coeffs, 192 tsx applied, 115 tsx conflicts 214: round 7 ( Medium ): 101 del cols, 32 del rows, 73 chg bounds, 31 chg sides, 17 chg coeffs, 194 tsx applied, 117 tsx conflicts 214: round 8 ( Medium ): 102 del cols, 32 del rows, 73 chg bounds, 32 chg sides, 18 chg coeffs, 195 tsx applied, 120 tsx conflicts 214: round 9 ( Medium ): 103 del cols, 33 del rows, 73 chg bounds, 33 chg sides, 18 chg coeffs, 196 tsx applied, 122 tsx conflicts 214: round 10 ( Medium ): 105 del cols, 34 del rows, 73 chg bounds, 34 chg sides, 18 chg coeffs, 197 tsx applied, 125 tsx conflicts 214: round 11 (Exhaustive): 113 del cols, 40 del rows, 81 chg bounds, 34 chg sides, 18 chg coeffs, 205 tsx applied, 125 tsx conflicts 214: round 12 (Exhaustive): 113 del cols, 40 del rows, 87 chg bounds, 34 chg sides, 18 chg coeffs, 217 tsx applied, 125 tsx conflicts 214: round 13 ( Medium ): 121 del cols, 44 del rows, 90 chg bounds, 38 chg sides, 20 chg coeffs, 229 tsx applied, 137 tsx conflicts 214: round 14 (Exhaustive): 122 del cols, 45 del rows, 91 chg bounds, 38 chg sides, 20 chg coeffs, 230 tsx applied, 137 tsx conflicts 214: round 15 ( Fast ): 122 del cols, 46 del rows, 93 chg bounds, 38 chg sides, 20 chg coeffs, 234 tsx applied, 137 tsx conflicts 214: round 16 (Exhaustive): 122 del cols, 46 del rows, 93 chg bounds, 38 chg sides, 20 chg coeffs, 234 tsx applied, 137 tsx conflicts 214: round 17 ( Medium ): 123 del cols, 46 del rows, 93 chg bounds, 40 chg sides, 21 chg coeffs, 235 tsx applied, 146 tsx conflicts 214: round 18 ( Medium ): 125 del cols, 47 del rows, 93 chg bounds, 41 chg sides, 21 chg coeffs, 236 tsx applied, 153 tsx conflicts 214: round 19 (Exhaustive): 125 del cols, 47 del rows, 93 chg bounds, 41 chg sides, 21 chg coeffs, 236 tsx applied, 153 tsx conflicts 214: round 20 ( Final ): Unchanged 214: presolved 20 rounds: 125 del cols, 47 del rows, 93 chg bounds, 41 chg sides, 21 chg coeffs, 236 tsx applied, 153 tsx conflicts 214: 214: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 214: colsingleton 20 0.0 0 0.0 0.000 214: coefftightening 0 0.0 0 0.0 0.000 214: propagation 20 35.0 158 100.0 0.002 214: fixcontinuous 5 0.0 0 0.0 0.000 214: simpleprobing 0 0.0 0 0.0 0.000 214: parallelrows 3 0.0 0 0.0 0.001 214: parallelcols 4 25.0 27 100.0 0.014 214: stuffing 12 75.0 194 21.1 0.002 214: dualfix 6 16.7 1 100.0 0.001 214: simplifyineq 0 0.0 0 0.0 0.000 214: doubletoneq 0 0.0 0 0.0 0.000 214: implint 0 0.0 0 0.0 0.000 214: domcol 3 66.7 9 100.0 0.019 214: dualinfer 0 0.0 0 0.0 0.000 214: probing 0 0.0 0 0.0 0.000 214: substitution 0 0.0 0 0.0 0.000 214: sparsify 0 0.0 0 0.0 0.000 214: 214: reduced problem: 214: reduced rows: 44 214: reduced columns: 55 214: reduced int. columns: 0 214: reduced cont. columns: 55 214: reduced nonzeros: 344 214: 214: presolving finished after 0.078 seconds 214: 214: Equilibrium scaling LP (persistent) 214: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 214: Reduced LP has 44 rows 55 columns 344 nonzeros 214: Equilibrium scaling LP 214: type | time | iters | facts | shift | viol sum | viol num | obj value 214: L | 0.0 | 0 | 3 | 0.00e+00 | 1.05e+02 | 8 | -3.52556000e+02 214: L | 0.0 | 8 | 4 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 214: --- unscaling internal solution 214: --- unsimplifying solution and basis 212: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 212: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 212: 212: External libraries: 212: Boost 1.83.0 (https://www.boost.org/) 212: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 212: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 212: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 212: 212: reading took 0.0251 seconds 212: Numerical Statistics: 212: Matrix range [2e-02,1e+03] 212: Objective range [1e+00,1e+00] 212: Bounds range [0e+00,0e+00] 212: RHS range [1e+00,2e+04] 212: Dynamism Variables: 2e+04 212: Dynamism Rows : 1e+03 212: set presolve.componentsmaxint = -1 212: set presolve.detectlindep = 0 212: set doubletoneq.enabled = 0 212: set dualinfer.enabled = 0 212: set substitution.enabled = 0 212: set sparsify.enabled = 0 212: set calculate_basis_for_dual = 0 212: 212: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/lotfi.mps with dual-postsolve activated 212: rows: 153 212: columns: 308 212: int. columns: 0 212: cont. columns: 308 212: nonzeros: 1078 212: 212: round 0 ( Trivial ): 4 del cols, 9 del rows, 13 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 212: round 1 ( Fast ): 6 del cols, 13 del rows, 219 chg bounds, 0 chg sides, 0 chg coeffs, 406 tsx applied, 0 tsx conflicts 212: round 2 ( Fast ): 8 del cols, 19 del rows, 286 chg bounds, 0 chg sides, 0 chg coeffs, 532 tsx applied, 0 tsx conflicts 212: round 3 ( Fast ): 8 del cols, 19 del rows, 336 chg bounds, 0 chg sides, 0 chg coeffs, 632 tsx applied, 0 tsx conflicts 212: round 4 ( Medium ): 23 del cols, 25 del rows, 347 chg bounds, 9 chg sides, 9 chg coeffs, 669 tsx applied, 46 tsx conflicts 212: round 5 ( Medium ): 30 del cols, 32 del rows, 348 chg bounds, 9 chg sides, 9 chg coeffs, 678 tsx applied, 52 tsx conflicts 212: round 6 ( Medium ): 80 del cols, 36 del rows, 356 chg bounds, 55 chg sides, 55 chg coeffs, 736 tsx applied, 102 tsx conflicts 212: round 7 ( Medium ): 96 del cols, 36 del rows, 366 chg bounds, 71 chg sides, 71 chg coeffs, 762 tsx applied, 150 tsx conflicts 212: round 8 (Exhaustive): 96 del cols, 36 del rows, 382 chg bounds, 71 chg sides, 71 chg coeffs, 778 tsx applied, 150 tsx conflicts 212: round 9 ( Final ): 96 del cols, 36 del rows, 382 chg bounds, 71 chg sides, 71 chg coeffs, 778 tsx applied, 150 tsx conflicts 212: presolved 9 rounds: 96 del cols, 36 del rows, 382 chg bounds, 71 chg sides, 71 chg coeffs, 778 tsx applied, 150 tsx conflicts 212: 212: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 212: colsingleton 9 0.0 0 0.0 0.000 212: coefftightening 0 0.0 0 0.0 0.000 212: propagation 9 55.6 656 100.0 0.030 212: fixcontinuous 3 0.0 0 0.0 0.001 212: simpleprobing 0 0.0 0 0.0 0.000 212: parallelrows 2 0.0 0 0.0 0.004 212: parallelcols 2 0.0 0 0.0 0.011 212: stuffing 5 80.0 236 36.9 0.004 212: dualfix 6 83.3 36 97.2 0.026 212: simplifyineq 0 0.0 0 0.0 0.000 212: doubletoneq 0 0.0 0 0.0 0.000 212: implint 0 0.0 0 0.0 0.000 212: domcol 1 0.0 0 0.0 0.009 212: dualinfer 0 0.0 0 0.0 0.000 212: probing 0 0.0 0 0.0 0.000 212: substitution 0 0.0 0 0.0 0.000 212: sparsify 0 0.0 0 0.0 0.000 212: 212: reduced problem: 212: reduced rows: 117 212: reduced columns: 212 212: reduced int. columns: 0 212: reduced cont. columns: 212 212: reduced nonzeros: 526 212: 212: presolving finished after 0.222 seconds 212: 212: Equilibrium scaling LP (persistent) 212: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 212: Reduced LP has 117 rows 212 columns 526 nonzeros 212: Equilibrium scaling LP 212: type | time | iters | facts | shift | viol sum | viol num | obj value 212: L | 0.0 | 0 | 3 | 0.00e+00 | 5.84e+05 | 73 | -3.16929351e+03 214: --- unscaling external solution 214: --- verifying computed solution 214: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 214: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 214: --- unscaling external solution 214: --- verifying computed solution 214: 214: SoPlex status : problem is solved [optimal] 214: Solving time (sec) : 0.00 214: Iterations : 8 214: Objective value : -2.66616000e+02 214: 214: Solution passed validation 214: 214: postsolve finished after 0.010 seconds 214: feasible: true 214: objective value: -266.616 214: 214: violations: 214: bounds: 0 214: constraints: 0 214: integrality: 0 214: 214: validation: SUCCESS 214: Solving time 0.092 seconds 214: 214: solving finished after 0.092 seconds 212: L | 0.0 | 183 | 5 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 212: --- unscaling internal solution 212: --- unsimplifying solution and basis 212: --- unscaling external solution 212: --- verifying computed solution 212: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 212: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.52647061e+01 212: --- unscaling external solution 212: --- verifying computed solution 215: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 215: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.66616000e+02 215: --- unscaling external solution 215: --- verifying computed solution 212/287 Test #214: q-solve-recipe.mps-lp_presolvers_without_basis.set ......................................... Passed 0.20 sec test 216 Start 216: d-solve-sc105.mps-lp_presolvers_without_basis.set 216: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc105.mps" "-o" "-0.52202061211707248062628010857689e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 216: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 216: Test timeout computed to be: 10000000 215: 215: SoPlex status : problem is solved [optimal] 215: Solving time (sec) : 0.02 215: Iterations : 8 215: Objective value : -2.66616000e+02 215: 215: Solution passed validation 215: 215: postsolve finished after 0.036 seconds 215: feasible: true 215: objective value: -266.616 215: 215: violations: 215: bounds: 0 215: constraints: 0 215: integrality: 0 215: 215: validation: SUCCESS 215: Solving time 0.121 seconds 215: 215: solving finished after 0.121 seconds 213/287 Test #215: r-solve-recipe.mps-lp_presolvers_without_basis.set ......................................... Passed 0.17 sec test 217 Start 217: q-solve-sc105.mps-lp_presolvers_without_basis.set 217: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc105.mps" "-o" "-0.52202061211707248062628010857689e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 217: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 217: Test timeout computed to be: 10000000 212: 212: SoPlex status : problem is solved [optimal] 212: Solving time (sec) : 0.00 212: Iterations : 183 212: Objective value : -2.52647061e+01 212: 212: Solution passed validation 212: 212: postsolve finished after 0.018 seconds 212: feasible: true 212: objective value: -25.26470606188 212: 212: violations: 212: bounds: 0 212: constraints: 0 212: integrality: 0 212: 212: validation: SUCCESS 212: Solving time 0.269 seconds 212: 212: solving finished after 0.269 seconds 214/287 Test #212: r-solve-lotfi.mps-lp_presolvers_without_basis.set .......................................... Passed 0.39 sec test 218 Start 218: r-solve-sc105.mps-lp_presolvers_without_basis.set 218: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc105.mps" "-o" "-0.52202061211707248062628010857689e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 218: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 218: Test timeout computed to be: 10000000 216: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 216: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 216: 216: External libraries: 216: Boost 1.83.0 (https://www.boost.org/) 216: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 216: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 216: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 216: 216: reading took 0.0017 seconds 216: Numerical Statistics: 216: Matrix range [0e+00,2e+00] 216: Objective range [1e+00,1e+00] 216: Bounds range [0e+00,0e+00] 216: RHS range [1e+02,2e+02] 216: Dynamism Variables: 2e+01 216: Dynamism Rows : 8e+00 216: set presolve.componentsmaxint = -1 216: set presolve.detectlindep = 0 216: set doubletoneq.enabled = 0 216: set dualinfer.enabled = 0 216: set substitution.enabled = 0 216: set sparsify.enabled = 0 216: set calculate_basis_for_dual = 0 216: 216: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc105.mps with dual-postsolve activated 216: rows: 105 216: columns: 103 216: int. columns: 0 216: cont. columns: 103 216: nonzeros: 280 216: 216: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 216: round 1 ( Final ): Unchanged 216: presolved 1 rounds: 0 del cols, 0 del rows, 5 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 216: 216: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 216: colsingleton 1 0.0 0 0.0 0.000 216: coefftightening 0 0.0 0 0.0 0.000 216: propagation 1 100.0 12 100.0 0.000 216: fixcontinuous 1 0.0 0 0.0 0.000 216: simpleprobing 0 0.0 0 0.0 0.000 216: parallelrows 1 0.0 0 0.0 0.000 216: parallelcols 1 0.0 0 0.0 0.000 216: stuffing 1 0.0 0 0.0 0.000 216: dualfix 1 0.0 0 0.0 0.000 216: simplifyineq 0 0.0 0 0.0 0.000 216: doubletoneq 0 0.0 0 0.0 0.000 216: implint 0 0.0 0 0.0 0.000 216: domcol 1 0.0 0 0.0 0.000 216: dualinfer 0 0.0 0 0.0 0.000 216: probing 0 0.0 0 0.0 0.000 216: substitution 0 0.0 0 0.0 0.000 216: sparsify 0 0.0 0 0.0 0.000 216: 216: reduced problem: 216: reduced rows: 104 216: reduced columns: 103 216: reduced int. columns: 0 216: reduced cont. columns: 103 216: reduced nonzeros: 280 216: 216: presolving finished after 0.001 seconds 216: 216: Equilibrium scaling LP (persistent) 216: Simplifier removed 13 rows, 13 columns, 27 nonzeros, 0 col bounds, 46 row bounds 216: Reduced LP has 91 rows 90 columns 253 nonzeros 216: Equilibrium scaling LP 216: type | time | iters | facts | shift | viol sum | viol num | obj value 216: L | 0.0 | 0 | 3 | 4.24e-01 | 0.00e+00 | 0 | 0.00000000e+00 216: E | 0.0 | 0 | 3 | 0.00e+00 | 4.24e-01 | 1 | 0.00000000e+00 216: E | 0.0 | 85 | 7 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 216: --- unscaling internal solution 216: --- unsimplifying solution and basis 216: --- unscaling external solution 216: --- verifying computed solution 216: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 216: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 216: --- unscaling external solution 216: --- verifying computed solution 216: 216: SoPlex status : problem is solved [optimal] 216: Solving time (sec) : 0.02 216: Iterations : 85 216: Objective value : -5.22020612e+01 216: 216: Solution passed validation 216: 216: postsolve finished after 0.000 seconds 216: feasible: true 216: objective value: -52.2020612117072 216: 216: violations: 216: bounds: 0 216: constraints: 0 216: integrality: 0 216: 216: validation: SUCCESS 216: Solving time 0.012 seconds 216: 216: solving finished after 0.012 seconds 206: 206: SoPlex status : problem is solved [optimal] 206: Solving time (sec) : 0.02 206: Iterations : 119 206: Objective value : -8.96644822e+05 206: 206: Solution passed validation 206: 206: postsolve finished after 0.169 seconds 206: feasible: true 206: objective value: -896644.821863046 206: 206: violations: 206: bounds: 0 206: constraints: 0 206: integrality: 0 206: 206: validation: SUCCESS 206: Solving time 0.608 seconds 206: 206: solving finished after 0.608 seconds 215/287 Test #206: r-solve-israel.mps-lp_presolvers_without_basis.set ......................................... Passed 0.78 sec test 219 Start 219: d-solve-sc205.mps-lp_presolvers_without_basis.set 219: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc205.mps" "-o" "-0.52202061211707248062628010857689e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 219: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 219: Test timeout computed to be: 10000000 217: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 217: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 217: 217: External libraries: 217: Boost 1.83.0 (https://www.boost.org/) 217: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 217: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 217: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 217: 217: reading took 0.00677 seconds 217: Numerical Statistics: 217: Matrix range [0e+00,2e+00] 217: Objective range [1e+00,1e+00] 217: Bounds range [0e+00,0e+00] 217: RHS range [1e+02,2e+02] 217: Dynamism Variables: 2e+01 217: Dynamism Rows : 8e+00 217: set presolve.componentsmaxint = -1 217: set presolve.detectlindep = 0 217: set doubletoneq.enabled = 0 217: set dualinfer.enabled = 0 217: set substitution.enabled = 0 217: set sparsify.enabled = 0 217: set calculate_basis_for_dual = 0 217: 217: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc105.mps with dual-postsolve activated 217: rows: 105 217: columns: 103 217: int. columns: 0 217: cont. columns: 103 217: nonzeros: 280 217: 217: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 217: round 1 ( Final ): Unchanged 217: presolved 1 rounds: 0 del cols, 0 del rows, 5 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 217: 217: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 217: colsingleton 1 0.0 0 0.0 0.000 217: coefftightening 0 0.0 0 0.0 0.000 217: propagation 1 100.0 12 100.0 0.000 217: fixcontinuous 1 0.0 0 0.0 0.000 217: simpleprobing 0 0.0 0 0.0 0.000 217: parallelrows 1 0.0 0 0.0 0.000 217: parallelcols 1 0.0 0 0.0 0.000 217: stuffing 1 0.0 0 0.0 0.000 217: dualfix 1 0.0 0 0.0 0.000 217: simplifyineq 0 0.0 0 0.0 0.000 217: doubletoneq 0 0.0 0 0.0 0.000 217: implint 0 0.0 0 0.0 0.000 217: domcol 1 0.0 0 0.0 0.000 217: dualinfer 0 0.0 0 0.0 0.000 217: probing 0 0.0 0 0.0 0.000 217: substitution 0 0.0 0 0.0 0.000 217: sparsify 0 0.0 0 0.0 0.000 217: 217: reduced problem: 217: reduced rows: 104 217: reduced columns: 103 217: reduced int. columns: 0 217: reduced cont. columns: 103 217: reduced nonzeros: 280 217: 217: presolving finished after 0.013 seconds 217: 217: Equilibrium scaling LP (persistent) 217: Simplifier removed 13 rows, 13 columns, 27 nonzeros, 0 col bounds, 46 row bounds 217: Reduced LP has 91 rows 90 columns 253 nonzeros 217: Equilibrium scaling LP 217: type | time | iters | facts | shift | viol sum | viol num | obj value 217: L | 0.0 | 0 | 3 | 4.24e-01 | 0.00e+00 | 0 | 0.00000000e+00 217: E | 0.0 | 0 | 3 | 0.00e+00 | 4.24e-01 | 1 | 0.00000000e+00 216/287 Test #216: d-solve-sc105.mps-lp_presolvers_without_basis.set .......................................... Passed 0.08 sec test 220 Start 220: q-solve-sc205.mps-lp_presolvers_without_basis.set 220: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc205.mps" "-o" "-0.52202061211707248062628010857689e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 220: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 220: Test timeout computed to be: 10000000 217: E | 0.0 | 85 | 7 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 217: --- unscaling internal solution 217: --- unsimplifying solution and basis 217: --- unscaling external solution 217: --- verifying computed solution 217: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 217: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 217: --- unscaling external solution 217: --- verifying computed solution 217: 217: SoPlex status : problem is solved [optimal] 217: Solving time (sec) : 0.00 217: Iterations : 85 217: Objective value : -5.22020612e+01 217: 217: Solution passed validation 217: 217: postsolve finished after 0.007 seconds 217: feasible: true 217: objective value: -52.2020612117073 217: 217: violations: 217: bounds: 0 217: constraints: 0 217: integrality: 0 217: 217: validation: SUCCESS 217: Solving time 0.032 seconds 217: 217: solving finished after 0.032 seconds 217/287 Test #217: q-solve-sc105.mps-lp_presolvers_without_basis.set .......................................... Passed 0.09 sec test 221 Start 221: r-solve-sc205.mps-lp_presolvers_without_basis.set 221: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc205.mps" "-o" "-0.52202061211707248062628010857689e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 221: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 221: Test timeout computed to be: 10000000 218: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 218: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 218: 218: External libraries: 218: Boost 1.83.0 (https://www.boost.org/) 218: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 218: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 218: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 218: 218: reading took 0.00759 seconds 218: Numerical Statistics: 218: Matrix range [0e+00,2e+00] 218: Objective range [1e+00,1e+00] 218: Bounds range [0e+00,0e+00] 218: RHS range [1e+02,2e+02] 218: Dynamism Variables: 2e+01 218: Dynamism Rows : 8e+00 218: set presolve.componentsmaxint = -1 218: set presolve.detectlindep = 0 218: set doubletoneq.enabled = 0 218: set dualinfer.enabled = 0 218: set substitution.enabled = 0 218: set sparsify.enabled = 0 218: set calculate_basis_for_dual = 0 218: 218: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc105.mps with dual-postsolve activated 218: rows: 105 218: columns: 103 218: int. columns: 0 218: cont. columns: 103 218: nonzeros: 280 218: 218: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 218: round 1 ( Final ): Unchanged 218: presolved 1 rounds: 0 del cols, 0 del rows, 5 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 218: 218: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 218: colsingleton 1 0.0 0 0.0 0.000 218: coefftightening 0 0.0 0 0.0 0.000 218: propagation 1 100.0 12 100.0 0.001 218: fixcontinuous 1 0.0 0 0.0 0.000 218: simpleprobing 0 0.0 0 0.0 0.000 218: parallelrows 1 0.0 0 0.0 0.001 218: parallelcols 1 0.0 0 0.0 0.001 218: stuffing 1 0.0 0 0.0 0.000 218: dualfix 1 0.0 0 0.0 0.005 218: simplifyineq 0 0.0 0 0.0 0.000 218: doubletoneq 0 0.0 0 0.0 0.000 218: implint 0 0.0 0 0.0 0.000 218: domcol 1 0.0 0 0.0 0.001 218: dualinfer 0 0.0 0 0.0 0.000 218: probing 0 0.0 0 0.0 0.000 218: substitution 0 0.0 0 0.0 0.000 218: sparsify 0 0.0 0 0.0 0.000 218: 218: reduced problem: 218: reduced rows: 104 218: reduced columns: 103 218: reduced int. columns: 0 218: reduced cont. columns: 103 218: reduced nonzeros: 280 218: 218: presolving finished after 0.015 seconds 218: 218: Equilibrium scaling LP (persistent) 218: Simplifier removed 13 rows, 13 columns, 27 nonzeros, 0 col bounds, 46 row bounds 218: Reduced LP has 91 rows 90 columns 253 nonzeros 218: Equilibrium scaling LP 218: type | time | iters | facts | shift | viol sum | viol num | obj value 218: L | 0.0 | 0 | 3 | 4.24e-01 | 0.00e+00 | 0 | 0.00000000e+00 218: E | 0.0 | 0 | 3 | 0.00e+00 | 4.24e-01 | 1 | 0.00000000e+00 218: E | 0.0 | 85 | 7 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 218: --- unscaling internal solution 218: --- unsimplifying solution and basis 218: --- unscaling external solution 218: --- verifying computed solution 218: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 218: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 218: --- unscaling external solution 218: --- verifying computed solution 219: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 219: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 219: 219: External libraries: 219: Boost 1.83.0 (https://www.boost.org/) 219: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 219: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 219: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 219: 219: reading took 0.00293 seconds 219: Numerical Statistics: 219: Matrix range [0e+00,2e+00] 219: Objective range [1e+00,1e+00] 219: Bounds range [0e+00,0e+00] 219: RHS range [1e+02,2e+02] 219: Dynamism Variables: 2e+01 219: Dynamism Rows : 8e+00 219: set presolve.componentsmaxint = -1 219: set presolve.detectlindep = 0 219: set doubletoneq.enabled = 0 219: set dualinfer.enabled = 0 219: set substitution.enabled = 0 219: set sparsify.enabled = 0 219: set calculate_basis_for_dual = 0 219: 219: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc205.mps with dual-postsolve activated 219: rows: 205 219: columns: 203 219: int. columns: 0 219: cont. columns: 203 219: nonzeros: 551 219: 219: round 0 ( Trivial ): 1 del cols, 1 del rows, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 219: round 1 ( Final ): Unchanged 219: presolved 1 rounds: 1 del cols, 1 del rows, 6 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 219: 219: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 219: colsingleton 1 0.0 0 0.0 0.000 219: coefftightening 0 0.0 0 0.0 0.000 219: propagation 1 100.0 12 100.0 0.000 219: fixcontinuous 1 0.0 0 0.0 0.000 219: simpleprobing 0 0.0 0 0.0 0.000 219: parallelrows 1 0.0 0 0.0 0.000 219: parallelcols 1 0.0 0 0.0 0.000 219: stuffing 1 0.0 0 0.0 0.000 219: dualfix 1 0.0 0 0.0 0.000 219: simplifyineq 0 0.0 0 0.0 0.000 219: doubletoneq 0 0.0 0 0.0 0.000 219: implint 0 0.0 0 0.0 0.000 219: domcol 1 0.0 0 0.0 0.000 219: dualinfer 0 0.0 0 0.0 0.000 219: probing 0 0.0 0 0.0 0.000 219: substitution 0 0.0 0 0.0 0.000 219: sparsify 0 0.0 0 0.0 0.000 219: 219: reduced problem: 219: reduced rows: 203 219: reduced columns: 202 219: reduced int. columns: 0 219: reduced cont. columns: 202 219: reduced nonzeros: 550 219: 219: presolving finished after 0.002 seconds 219: 219: Equilibrium scaling LP (persistent) 218: 218: SoPlex status : problem is solved [optimal] 218: Solving time (sec) : 0.00 218: Iterations : 85 218: Objective value : -5.22020612e+01 218: 218: Solution passed validation 218: 218: postsolve finished after 0.008 seconds 218: feasible: true 218: objective value: -52.2020612117072 218: 218: violations: 218: bounds: 0 218: constraints: 0 218: integrality: 0 218: 218: validation: SUCCESS 218: Solving time 0.039 seconds 218: 218: solving finished after 0.039 seconds 218/287 Test #218: r-solve-sc105.mps-lp_presolvers_without_basis.set .......................................... Passed 0.11 sec test 222 Start 222: d-solve-sc50a.mps-lp_presolvers_without_basis.set 222: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50a.mps" "-o" "-0.64575077058564509026860413914575e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 222: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 222: Test timeout computed to be: 10000000 219: Simplifier removed 22 rows, 22 columns, 45 nonzeros, 0 col bounds, 82 row bounds 219: Reduced LP has 181 rows 180 columns 505 nonzeros 219: Equilibrium scaling LP 219: type | time | iters | facts | shift | viol sum | viol num | obj value 219: L | 0.0 | 0 | 3 | 1.80e-01 | 0.00e+00 | 0 | 0.00000000e+00 219: E | 0.0 | 0 | 3 | 0.00e+00 | 1.80e-01 | 1 | 0.00000000e+00 219: E | 0.0 | 197 | 5 | 0.00e+00 | 3.75e+00 | 22 | -5.07174503e+01 220: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 220: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 220: 220: External libraries: 220: Boost 1.83.0 (https://www.boost.org/) 220: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 220: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 220: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 220: 220: reading took 0.0165 seconds 220: Numerical Statistics: 220: Matrix range [0e+00,2e+00] 220: Objective range [1e+00,1e+00] 220: Bounds range [0e+00,0e+00] 220: RHS range [1e+02,2e+02] 220: Dynamism Variables: 2e+01 220: Dynamism Rows : 8e+00 220: set presolve.componentsmaxint = -1 220: set presolve.detectlindep = 0 220: set doubletoneq.enabled = 0 220: set dualinfer.enabled = 0 220: set substitution.enabled = 0 220: set sparsify.enabled = 0 220: set calculate_basis_for_dual = 0 220: 220: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc205.mps with dual-postsolve activated 220: rows: 205 220: columns: 203 220: int. columns: 0 220: cont. columns: 203 220: nonzeros: 551 220: 220: round 0 ( Trivial ): 1 del cols, 1 del rows, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 220: round 1 ( Final ): Unchanged 220: presolved 1 rounds: 1 del cols, 1 del rows, 6 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 220: 220: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 220: colsingleton 1 0.0 0 0.0 0.000 220: coefftightening 0 0.0 0 0.0 0.000 220: propagation 1 100.0 12 100.0 0.001 220: fixcontinuous 1 0.0 0 0.0 0.000 220: simpleprobing 0 0.0 0 0.0 0.000 220: parallelrows 1 0.0 0 0.0 0.000 220: parallelcols 1 0.0 0 0.0 0.000 220: stuffing 1 0.0 0 0.0 0.000 220: dualfix 1 0.0 0 0.0 0.000 220: simplifyineq 0 0.0 0 0.0 0.000 220: doubletoneq 0 0.0 0 0.0 0.000 220: implint 0 0.0 0 0.0 0.000 220: domcol 1 0.0 0 0.0 0.001 220: dualinfer 0 0.0 0 0.0 0.000 220: probing 0 0.0 0 0.0 0.000 220: substitution 0 0.0 0 0.0 0.000 220: sparsify 0 0.0 0 0.0 0.000 220: 220: reduced problem: 220: reduced rows: 203 220: reduced columns: 202 220: reduced int. columns: 0 220: reduced cont. columns: 202 220: reduced nonzeros: 550 220: 220: presolving finished after 0.006 seconds 220: 220: Equilibrium scaling LP (persistent) 220: Simplifier removed 22 rows, 22 columns, 45 nonzeros, 0 col bounds, 82 row bounds 220: Reduced LP has 181 rows 180 columns 505 nonzeros 220: Equilibrium scaling LP 220: type | time | iters | facts | shift | viol sum | viol num | obj value 220: L | 0.0 | 0 | 3 | 1.80e-01 | 0.00e+00 | 0 | 0.00000000e+00 220: E | 0.0 | 0 | 3 | 0.00e+00 | 1.80e-01 | 1 | 0.00000000e+00 219: E | 0.0 | 208 | 8 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 219: --- unscaling internal solution 219: --- unsimplifying solution and basis 219: --- unscaling external solution 219: --- verifying computed solution 219: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 219: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 219: --- unscaling external solution 219: --- verifying computed solution 219: 219: SoPlex status : problem is solved [optimal] 219: Solving time (sec) : 0.02 219: Iterations : 208 219: Objective value : -5.22020612e+01 219: 219: Solution passed validation 219: 219: postsolve finished after 0.000 seconds 219: feasible: true 219: objective value: -52.2020612117072 219: 219: violations: 219: bounds: 0 219: constraints: 0 219: integrality: 0 219: 219: validation: SUCCESS 219: Solving time 0.051 seconds 219: 219: solving finished after 0.051 seconds 219/287 Test #219: d-solve-sc205.mps-lp_presolvers_without_basis.set .......................................... Passed 0.13 sec test 223 Start 223: q-solve-sc50a.mps-lp_presolvers_without_basis.set 223: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50a.mps" "-o" "-0.64575077058564509026860413914575e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 223: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 223: Test timeout computed to be: 10000000 221: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 221: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 221: 221: External libraries: 221: Boost 1.83.0 (https://www.boost.org/) 221: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 221: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 221: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 221: 221: reading took 0.015 seconds 221: Numerical Statistics: 221: Matrix range [0e+00,2e+00] 221: Objective range [1e+00,1e+00] 221: Bounds range [0e+00,0e+00] 221: RHS range [1e+02,2e+02] 221: Dynamism Variables: 2e+01 221: Dynamism Rows : 8e+00 221: set presolve.componentsmaxint = -1 221: set presolve.detectlindep = 0 221: set doubletoneq.enabled = 0 221: set dualinfer.enabled = 0 221: set substitution.enabled = 0 221: set sparsify.enabled = 0 221: set calculate_basis_for_dual = 0 221: 221: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc205.mps with dual-postsolve activated 221: rows: 205 221: columns: 203 221: int. columns: 0 221: cont. columns: 203 221: nonzeros: 551 221: 221: round 0 ( Trivial ): 1 del cols, 1 del rows, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 221: round 1 ( Final ): Unchanged 221: presolved 1 rounds: 1 del cols, 1 del rows, 6 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 221: 221: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 221: colsingleton 1 0.0 0 0.0 0.000 221: coefftightening 0 0.0 0 0.0 0.000 221: propagation 1 100.0 12 100.0 0.001 221: fixcontinuous 1 0.0 0 0.0 0.000 221: simpleprobing 0 0.0 0 0.0 0.000 221: parallelrows 1 0.0 0 0.0 0.006 221: parallelcols 1 0.0 0 0.0 0.008 221: stuffing 1 0.0 0 0.0 0.000 221: dualfix 1 0.0 0 0.0 0.001 221: simplifyineq 0 0.0 0 0.0 0.000 221: doubletoneq 0 0.0 0 0.0 0.000 221: implint 0 0.0 0 0.0 0.000 221: domcol 1 0.0 0 0.0 0.001 221: dualinfer 0 0.0 0 0.0 0.000 221: probing 0 0.0 0 0.0 0.000 221: substitution 0 0.0 0 0.0 0.000 221: sparsify 0 0.0 0 0.0 0.000 221: 221: reduced problem: 221: reduced rows: 203 221: reduced columns: 202 221: reduced int. columns: 0 221: reduced cont. columns: 202 221: reduced nonzeros: 550 221: 221: presolving finished after 0.024 seconds 221: 221: Equilibrium scaling LP (persistent) 221: Simplifier removed 22 rows, 22 columns, 45 nonzeros, 0 col bounds, 82 row bounds 221: Reduced LP has 181 rows 180 columns 505 nonzeros 221: Equilibrium scaling LP 221: type | time | iters | facts | shift | viol sum | viol num | obj value 221: L | 0.0 | 0 | 3 | 1.80e-01 | 0.00e+00 | 0 | 0.00000000e+00 221: E | 0.0 | 0 | 3 | 0.00e+00 | 1.80e-01 | 1 | 0.00000000e+00 222: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 222: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 222: 222: External libraries: 222: Boost 1.83.0 (https://www.boost.org/) 222: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 222: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 222: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 222: 222: reading took 0.000892 seconds 222: Numerical Statistics: 222: Matrix range [0e+00,2e+00] 222: Objective range [1e+00,1e+00] 222: Bounds range [0e+00,0e+00] 222: RHS range [1e+02,2e+02] 222: Dynamism Variables: 2e+01 222: Dynamism Rows : 8e+00 222: set presolve.componentsmaxint = -1 222: set presolve.detectlindep = 0 222: set doubletoneq.enabled = 0 222: set dualinfer.enabled = 0 222: set substitution.enabled = 0 222: set sparsify.enabled = 0 222: set calculate_basis_for_dual = 0 222: 222: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50a.mps with dual-postsolve activated 222: rows: 50 222: columns: 48 222: int. columns: 0 222: cont. columns: 48 222: nonzeros: 130 222: 222: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 222: round 1 ( Fast ): 0 del cols, 0 del rows, 5 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 222: round 2 (Exhaustive): 0 del cols, 0 del rows, 8 chg bounds, 0 chg sides, 0 chg coeffs, 18 tsx applied, 0 tsx conflicts 222: round 3 ( Final ): 0 del cols, 0 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 24 tsx applied, 0 tsx conflicts 222: presolved 3 rounds: 0 del cols, 0 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 24 tsx applied, 0 tsx conflicts 222: 222: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 222: colsingleton 3 0.0 0 0.0 0.000 222: coefftightening 0 0.0 0 0.0 0.000 222: propagation 3 100.0 24 100.0 0.000 222: fixcontinuous 1 0.0 0 0.0 0.000 222: simpleprobing 0 0.0 0 0.0 0.000 222: parallelrows 1 0.0 0 0.0 0.000 222: parallelcols 1 0.0 0 0.0 0.000 222: stuffing 1 0.0 0 0.0 0.000 222: dualfix 1 0.0 0 0.0 0.000 222: simplifyineq 0 0.0 0 0.0 0.000 222: doubletoneq 0 0.0 0 0.0 0.000 222: implint 0 0.0 0 0.0 0.000 222: domcol 1 0.0 0 0.0 0.004 222: dualinfer 0 0.0 0 0.0 0.000 222: probing 0 0.0 0 0.0 0.000 222: substitution 0 0.0 0 0.0 0.000 222: sparsify 0 0.0 0 0.0 0.000 222: 222: reduced problem: 222: reduced rows: 49 222: reduced columns: 48 222: reduced int. columns: 0 222: reduced cont. columns: 48 222: reduced nonzeros: 130 222: 222: presolving finished after 0.005 seconds 222: 222: Equilibrium scaling LP (persistent) 222: Simplifier removed 8 rows, 8 columns, 17 nonzeros, 0 col bounds, 26 row bounds 222: Reduced LP has 41 rows 40 columns 113 nonzeros 222: Equilibrium scaling LP 222: type | time | iters | facts | shift | viol sum | viol num | obj value 222: L | 0.0 | 0 | 3 | 6.83e-01 | 0.00e+00 | 0 | 0.00000000e+00 222: E | 0.0 | 0 | 3 | 0.00e+00 | 6.83e-01 | 1 | 0.00000000e+00 222: E | 0.0 | 39 | 4 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 222: --- unscaling internal solution 222: --- unsimplifying solution and basis 222: --- unscaling external solution 222: --- verifying computed solution 222: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 222: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 222: --- unscaling external solution 222: --- verifying computed solution 222: 222: SoPlex status : problem is solved [optimal] 222: Solving time (sec) : 0.00 222: Iterations : 39 222: Objective value : -6.45750771e+01 222: 222: Solution passed validation 222: 222: postsolve finished after 0.000 seconds 222: feasible: true 222: objective value: -64.5750770585645 222: 222: violations: 222: bounds: 0 222: constraints: 0 222: integrality: 0 222: 222: validation: SUCCESS 222: Solving time 0.008 seconds 222: 222: solving finished after 0.008 seconds 220: E | 0.0 | 197 | 5 | 0.00e+00 | 1.15e+00 | 27 | -5.19655224e+01 220: E | 0.0 | 199 | 7 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 220: --- unscaling internal solution 220: --- unsimplifying solution and basis 220: --- unscaling external solution 220: --- verifying computed solution 220: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 220: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 220: --- unscaling external solution 220: --- verifying computed solution 220/287 Test #222: d-solve-sc50a.mps-lp_presolvers_without_basis.set .......................................... Passed 0.07 sec test 224 Start 224: r-solve-sc50a.mps-lp_presolvers_without_basis.set 224: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50a.mps" "-o" "-0.64575077058564509026860413914575e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 224: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 224: Test timeout computed to be: 10000000 221: E | 0.0 | 197 | 5 | 0.00e+00 | 3.75e+00 | 22 | -5.07174503e+01 221: E | 0.0 | 208 | 8 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 221: --- unscaling internal solution 221: --- unsimplifying solution and basis 221: --- unscaling external solution 221: --- verifying computed solution 221: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 221: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | -5.22020612e+01 221: --- unscaling external solution 221: --- verifying computed solution 220: 220: SoPlex status : problem is solved [optimal] 220: Solving time (sec) : 0.02 220: Iterations : 199 220: Objective value : -5.22020612e+01 220: 220: Solution passed validation 220: 220: postsolve finished after 0.006 seconds 220: feasible: true 220: objective value: -52.2020612117073 220: 220: violations: 220: bounds: 0 220: constraints: 0 220: integrality: 0 220: 220: validation: SUCCESS 220: Solving time 0.078 seconds 220: 220: solving finished after 0.078 seconds 221/287 Test #220: q-solve-sc205.mps-lp_presolvers_without_basis.set .......................................... Passed 0.16 sec test 225 Start 225: d-solve-sc50b.mps-lp_presolvers_without_basis.set 225: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50b.mps" "-o" "-0.7e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 225: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 225: Test timeout computed to be: 10000000 223: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 223: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 223: 223: External libraries: 223: Boost 1.83.0 (https://www.boost.org/) 223: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 223: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 223: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 223: 223: reading took 0.0014 seconds 223: Numerical Statistics: 223: Matrix range [0e+00,2e+00] 223: Objective range [1e+00,1e+00] 223: Bounds range [0e+00,0e+00] 223: RHS range [1e+02,2e+02] 223: Dynamism Variables: 2e+01 223: Dynamism Rows : 8e+00 223: set presolve.componentsmaxint = -1 223: set presolve.detectlindep = 0 223: set doubletoneq.enabled = 0 223: set dualinfer.enabled = 0 223: set substitution.enabled = 0 223: set sparsify.enabled = 0 223: set calculate_basis_for_dual = 0 223: 223: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50a.mps with dual-postsolve activated 223: rows: 50 223: columns: 48 223: int. columns: 0 223: cont. columns: 48 223: nonzeros: 130 223: 223: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 223: round 1 ( Fast ): 0 del cols, 0 del rows, 5 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 223: round 2 (Exhaustive): 0 del cols, 0 del rows, 8 chg bounds, 0 chg sides, 0 chg coeffs, 18 tsx applied, 0 tsx conflicts 223: round 3 ( Final ): 0 del cols, 0 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 24 tsx applied, 0 tsx conflicts 223: presolved 3 rounds: 0 del cols, 0 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 24 tsx applied, 0 tsx conflicts 223: 223: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 223: colsingleton 3 0.0 0 0.0 0.000 223: coefftightening 0 0.0 0 0.0 0.000 223: propagation 3 100.0 24 100.0 0.000 223: fixcontinuous 1 0.0 0 0.0 0.000 223: simpleprobing 0 0.0 0 0.0 0.000 223: parallelrows 1 0.0 0 0.0 0.000 223: parallelcols 1 0.0 0 0.0 0.000 223: stuffing 1 0.0 0 0.0 0.000 223: dualfix 1 0.0 0 0.0 0.000 223: simplifyineq 0 0.0 0 0.0 0.000 223: doubletoneq 0 0.0 0 0.0 0.000 223: implint 0 0.0 0 0.0 0.000 223: domcol 1 0.0 0 0.0 0.000 223: dualinfer 0 0.0 0 0.0 0.000 223: probing 0 0.0 0 0.0 0.000 223: substitution 0 0.0 0 0.0 0.000 223: sparsify 0 0.0 0 0.0 0.000 223: 223: reduced problem: 223: reduced rows: 49 223: reduced columns: 48 223: reduced int. columns: 0 223: reduced cont. columns: 48 223: reduced nonzeros: 130 223: 223: presolving finished after 0.011 seconds 223: 223: Equilibrium scaling LP (persistent) 223: Simplifier removed 8 rows, 8 columns, 17 nonzeros, 0 col bounds, 26 row bounds 223: Reduced LP has 41 rows 40 columns 113 nonzeros 223: Equilibrium scaling LP 223: type | time | iters | facts | shift | viol sum | viol num | obj value 223: L | 0.0 | 0 | 3 | 6.83e-01 | 0.00e+00 | 0 | 0.00000000e+00 223: E | 0.0 | 0 | 3 | 0.00e+00 | 6.83e-01 | 1 | 0.00000000e+00 223: E | 0.0 | 39 | 4 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 223: --- unscaling internal solution 223: --- unsimplifying solution and basis 223: --- unscaling external solution 223: --- verifying computed solution 223: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 223: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 223: --- unscaling external solution 223: --- verifying computed solution 223: 223: SoPlex status : problem is solved [optimal] 223: Solving time (sec) : 0.00 223: Iterations : 39 223: Objective value : -6.45750771e+01 223: 223: Solution passed validation 223: 223: postsolve finished after 0.001 seconds 223: feasible: true 223: objective value: -64.5750770585645 223: 223: violations: 223: bounds: 0 223: constraints: 0 223: integrality: 0 223: 223: validation: SUCCESS 223: Solving time 0.020 seconds 223: 223: solving finished after 0.020 seconds 222/287 Test #223: q-solve-sc50a.mps-lp_presolvers_without_basis.set .......................................... Passed 0.09 sec 221: 221: SoPlex status : problem is solved [optimal] 221: Solving time (sec) : 0.02 221: Iterations : 208 221: Objective value : -5.22020612e+01 221: 221: Solution passed validation 221: 221: postsolve finished after 0.016 seconds 221: feasible: true 221: objective value: -52.2020612117072 221: 221: violations: 221: bounds: 0 221: constraints: 0 221: integrality: 0 221: 221: validation: SUCCESS 221: Solving time 0.096 seconds 221: 221: solving finished after 0.096 seconds 223/287 Test #221: r-solve-sc205.mps-lp_presolvers_without_basis.set .......................................... Passed 0.18 sec test 226 Start 226: q-solve-sc50b.mps-lp_presolvers_without_basis.set 226: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50b.mps" "-o" "-0.7e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 226: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 226: Test timeout computed to be: 10000000 test 227 Start 227: r-solve-sc50b.mps-lp_presolvers_without_basis.set 227: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50b.mps" "-o" "-0.7e2" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 227: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 227: Test timeout computed to be: 10000000 225: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 225: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 225: 225: External libraries: 225: Boost 1.83.0 (https://www.boost.org/) 225: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 225: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 225: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 225: 225: reading took 0.00498 seconds 225: Numerical Statistics: 225: Matrix range [0e+00,3e+00] 225: Objective range [1e+00,1e+00] 225: Bounds range [0e+00,0e+00] 225: RHS range [3e+02,3e+02] 225: Dynamism Variables: 1e+01 225: Dynamism Rows : 3e+00 225: set presolve.componentsmaxint = -1 225: set presolve.detectlindep = 0 225: set doubletoneq.enabled = 0 225: set dualinfer.enabled = 0 225: set substitution.enabled = 0 225: set sparsify.enabled = 0 225: set calculate_basis_for_dual = 0 225: 225: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50b.mps with dual-postsolve activated 225: rows: 50 225: columns: 48 225: int. columns: 0 225: cont. columns: 48 225: nonzeros: 118 225: 225: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 225: round 1 ( Final ): Unchanged 225: presolved 1 rounds: 0 del cols, 0 del rows, 3 chg bounds, 0 chg sides, 0 chg coeffs, 6 tsx applied, 0 tsx conflicts 225: 225: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 225: colsingleton 1 0.0 0 0.0 0.000 225: coefftightening 0 0.0 0 0.0 0.000 225: propagation 1 100.0 6 100.0 0.000 225: fixcontinuous 1 0.0 0 0.0 0.000 225: simpleprobing 0 0.0 0 0.0 0.000 225: parallelrows 1 0.0 0 0.0 0.000 225: parallelcols 1 0.0 0 0.0 0.000 225: stuffing 1 0.0 0 0.0 0.000 225: dualfix 1 0.0 0 0.0 0.000 225: simplifyineq 0 0.0 0 0.0 0.000 225: doubletoneq 0 0.0 0 0.0 0.000 225: implint 0 0.0 0 0.0 0.000 225: domcol 1 0.0 0 0.0 0.000 225: dualinfer 0 0.0 0 0.0 0.000 225: probing 0 0.0 0 0.0 0.000 225: substitution 0 0.0 0 0.0 0.000 225: sparsify 0 0.0 0 0.0 0.000 225: 225: reduced problem: 225: reduced rows: 48 225: reduced columns: 48 225: reduced int. columns: 0 225: reduced cont. columns: 48 225: reduced nonzeros: 118 225: 225: presolving finished after 0.001 seconds 225: 225: Equilibrium scaling LP (persistent) 225: Simplifier removed 8 rows, 8 columns, 17 nonzeros, 0 col bounds, 27 row bounds 225: Reduced LP has 40 rows 40 columns 101 nonzeros 225: Equilibrium scaling LP 225: type | time | iters | facts | shift | viol sum | viol num | obj value 225: L | 0.0 | 0 | 3 | 6.83e-01 | 0.00e+00 | 0 | 0.00000000e+00 225: E | 0.0 | 0 | 3 | 0.00e+00 | 6.83e-01 | 1 | 0.00000000e+00 224: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 224: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 224: 224: External libraries: 224: Boost 1.83.0 (https://www.boost.org/) 224: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 224: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 224: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 224: 224: reading took 0.0133 seconds 224: Numerical Statistics: 224: Matrix range [0e+00,2e+00] 224: Objective range [1e+00,1e+00] 224: Bounds range [0e+00,0e+00] 224: RHS range [1e+02,2e+02] 224: Dynamism Variables: 2e+01 224: Dynamism Rows : 8e+00 224: set presolve.componentsmaxint = -1 224: set presolve.detectlindep = 0 224: set doubletoneq.enabled = 0 224: set dualinfer.enabled = 0 224: set substitution.enabled = 0 224: set sparsify.enabled = 0 224: set calculate_basis_for_dual = 0 224: 224: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50a.mps with dual-postsolve activated 224: rows: 50 224: columns: 48 224: int. columns: 0 224: cont. columns: 48 224: nonzeros: 130 224: 224: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 224: round 1 ( Fast ): 0 del cols, 0 del rows, 5 chg bounds, 0 chg sides, 0 chg coeffs, 12 tsx applied, 0 tsx conflicts 224: round 2 (Exhaustive): 0 del cols, 0 del rows, 8 chg bounds, 0 chg sides, 0 chg coeffs, 18 tsx applied, 0 tsx conflicts 224: round 3 ( Final ): 0 del cols, 0 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 24 tsx applied, 0 tsx conflicts 224: presolved 3 rounds: 0 del cols, 0 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 24 tsx applied, 0 tsx conflicts 224: 224: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 224: colsingleton 3 0.0 0 0.0 0.000 224: coefftightening 0 0.0 0 0.0 0.000 224: propagation 3 100.0 24 100.0 0.007 224: fixcontinuous 1 0.0 0 0.0 0.000 224: simpleprobing 0 0.0 0 0.0 0.000 224: parallelrows 1 0.0 0 0.0 0.000 224: parallelcols 1 0.0 0 0.0 0.000 224: stuffing 1 0.0 0 0.0 0.000 224: dualfix 1 0.0 0 0.0 0.000 224: simplifyineq 0 0.0 0 0.0 0.000 224: doubletoneq 0 0.0 0 0.0 0.000 224: implint 0 0.0 0 0.0 0.000 224: domcol 1 0.0 0 0.0 0.001 224: dualinfer 0 0.0 0 0.0 0.000 224: probing 0 0.0 0 0.0 0.000 224: substitution 0 0.0 0 0.0 0.000 224: sparsify 0 0.0 0 0.0 0.000 224: 224: reduced problem: 224: reduced rows: 49 224: reduced columns: 48 224: reduced int. columns: 0 224: reduced cont. columns: 48 224: reduced nonzeros: 130 224: 224: presolving finished after 0.019 seconds 224: 224: Equilibrium scaling LP (persistent) 224: Simplifier removed 8 rows, 8 columns, 17 nonzeros, 0 col bounds, 26 row bounds 224: Reduced LP has 41 rows 40 columns 113 nonzeros 224: Equilibrium scaling LP 224: type | time | iters | facts | shift | viol sum | viol num | obj value 224: L | 0.0 | 0 | 3 | 6.83e-01 | 0.00e+00 | 0 | 0.00000000e+00 224: E | 0.0 | 0 | 3 | 0.00e+00 | 6.83e-01 | 1 | 0.00000000e+00 225: E | 0.0 | 41 | 4 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 225: --- unscaling internal solution 225: --- unsimplifying solution and basis 225: --- unscaling external solution 225: --- verifying computed solution 225: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 225: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 225: --- unscaling external solution 225: --- verifying computed solution 225: 225: SoPlex status : problem is solved [optimal] 225: Solving time (sec) : 0.00 225: Iterations : 41 225: Objective value : -7.00000000e+01 225: 225: Solution passed validation 225: 225: postsolve finished after 0.000 seconds 225: feasible: true 225: objective value: -70 225: 225: violations: 225: bounds: 0 225: constraints: 0 225: integrality: 0 225: 225: validation: SUCCESS 225: Solving time 0.015 seconds 225: 225: solving finished after 0.015 seconds 224: E | 0.0 | 39 | 4 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 224: --- unscaling internal solution 224: --- unsimplifying solution and basis 224: --- unscaling external solution 224: --- verifying computed solution 224: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 224: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -6.45750771e+01 224: --- unscaling external solution 224: --- verifying computed solution 224/287 Test #225: d-solve-sc50b.mps-lp_presolvers_without_basis.set .......................................... Passed 0.08 sec test 228 Start 228: d-solve-scagr7.mps-lp_presolvers_without_basis.set 228: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr7.mps" "-o" "-0.2331389824330984e7" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 228: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 228: Test timeout computed to be: 10000000 224: 224: SoPlex status : problem is solved [optimal] 224: Solving time (sec) : 0.02 224: Iterations : 39 224: Objective value : -6.45750771e+01 224: 224: Solution passed validation 224: 224: postsolve finished after 0.002 seconds 224: feasible: true 224: objective value: -64.5750770585645 224: 224: violations: 224: bounds: 0 224: constraints: 0 224: integrality: 0 224: 224: validation: SUCCESS 224: Solving time 0.033 seconds 224: 224: solving finished after 0.033 seconds 225/287 Test #224: r-solve-sc50a.mps-lp_presolvers_without_basis.set .......................................... Passed 0.12 sec test 229 Start 229: q-solve-scagr7.mps-lp_presolvers_without_basis.set 229: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr7.mps" "-o" "-0.2331389824330984e7" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 229: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 229: Test timeout computed to be: 10000000 226: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 226: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 226: 226: External libraries: 226: Boost 1.83.0 (https://www.boost.org/) 226: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 226: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 226: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 226: 226: reading took 0.00136 seconds 226: Numerical Statistics: 226: Matrix range [0e+00,3e+00] 226: Objective range [1e+00,1e+00] 226: Bounds range [0e+00,0e+00] 226: RHS range [3e+02,3e+02] 226: Dynamism Variables: 1e+01 226: Dynamism Rows : 3e+00 226: set presolve.componentsmaxint = -1 226: set presolve.detectlindep = 0 226: set doubletoneq.enabled = 0 226: set dualinfer.enabled = 0 226: set substitution.enabled = 0 226: set sparsify.enabled = 0 226: set calculate_basis_for_dual = 0 226: 226: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50b.mps with dual-postsolve activated 226: rows: 50 226: columns: 48 226: int. columns: 0 226: cont. columns: 48 226: nonzeros: 118 226: 226: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 226: round 1 ( Final ): Unchanged 226: presolved 1 rounds: 0 del cols, 0 del rows, 3 chg bounds, 0 chg sides, 0 chg coeffs, 6 tsx applied, 0 tsx conflicts 226: 226: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 226: colsingleton 1 0.0 0 0.0 0.000 226: coefftightening 0 0.0 0 0.0 0.000 226: propagation 1 100.0 6 100.0 0.000 226: fixcontinuous 1 0.0 0 0.0 0.000 226: simpleprobing 0 0.0 0 0.0 0.000 226: parallelrows 1 0.0 0 0.0 0.000 226: parallelcols 1 0.0 0 0.0 0.000 226: stuffing 1 0.0 0 0.0 0.000 226: dualfix 1 0.0 0 0.0 0.000 226: simplifyineq 0 0.0 0 0.0 0.000 226: doubletoneq 0 0.0 0 0.0 0.000 226: implint 0 0.0 0 0.0 0.000 226: domcol 1 0.0 0 0.0 0.000 226: dualinfer 0 0.0 0 0.0 0.000 226: probing 0 0.0 0 0.0 0.000 226: substitution 0 0.0 0 0.0 0.000 226: sparsify 0 0.0 0 0.0 0.000 226: 226: reduced problem: 226: reduced rows: 48 226: reduced columns: 48 226: reduced int. columns: 0 226: reduced cont. columns: 48 226: reduced nonzeros: 118 226: 226: presolving finished after 0.011 seconds 226: 226: Equilibrium scaling LP (persistent) 226: Simplifier removed 8 rows, 8 columns, 17 nonzeros, 0 col bounds, 27 row bounds 226: Reduced LP has 40 rows 40 columns 101 nonzeros 226: Equilibrium scaling LP 226: type | time | iters | facts | shift | viol sum | viol num | obj value 226: L | 0.0 | 0 | 3 | 6.83e-01 | 0.00e+00 | 0 | 0.00000000e+00 226: E | 0.0 | 0 | 3 | 0.00e+00 | 6.83e-01 | 1 | 0.00000000e+00 226: E | 0.0 | 42 | 4 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 226: --- unscaling internal solution 226: --- unsimplifying solution and basis 226: --- unscaling external solution 226: --- verifying computed solution 226: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 226: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 226: --- unscaling external solution 226: --- verifying computed solution 226: 226: SoPlex status : problem is solved [optimal] 226: Solving time (sec) : 0.00 226: Iterations : 42 226: Objective value : -7.00000000e+01 226: 226: Solution passed validation 226: 226: postsolve finished after 0.009 seconds 226: feasible: true 226: objective value: -70 226: 226: violations: 226: bounds: 0 226: constraints: 0 226: integrality: 0 226: 226: validation: SUCCESS 226: Solving time 0.023 seconds 226: 226: solving finished after 0.023 seconds 226/287 Test #226: q-solve-sc50b.mps-lp_presolvers_without_basis.set .......................................... Passed 0.10 sec test 230 Start 230: r-solve-scagr7.mps-lp_presolvers_without_basis.set 230: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr7.mps" "-o" "-0.2331389824330984e7" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 230: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 230: Test timeout computed to be: 10000000 227: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 227: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 227: 227: External libraries: 227: Boost 1.83.0 (https://www.boost.org/) 227: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 227: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 227: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 227: 227: reading took 0.00154 seconds 227: Numerical Statistics: 227: Matrix range [0e+00,3e+00] 227: Objective range [1e+00,1e+00] 227: Bounds range [0e+00,0e+00] 227: RHS range [3e+02,3e+02] 227: Dynamism Variables: 1e+01 227: Dynamism Rows : 3e+00 227: set presolve.componentsmaxint = -1 227: set presolve.detectlindep = 0 227: set doubletoneq.enabled = 0 227: set dualinfer.enabled = 0 227: set substitution.enabled = 0 227: set sparsify.enabled = 0 227: set calculate_basis_for_dual = 0 227: 227: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/sc50b.mps with dual-postsolve activated 227: rows: 50 227: columns: 48 227: int. columns: 0 227: cont. columns: 48 227: nonzeros: 118 227: 227: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 227: round 1 ( Final ): Unchanged 227: presolved 1 rounds: 0 del cols, 0 del rows, 3 chg bounds, 0 chg sides, 0 chg coeffs, 6 tsx applied, 0 tsx conflicts 227: 227: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 227: colsingleton 1 0.0 0 0.0 0.000 227: coefftightening 0 0.0 0 0.0 0.000 227: propagation 1 100.0 6 100.0 0.000 227: fixcontinuous 1 0.0 0 0.0 0.000 227: simpleprobing 0 0.0 0 0.0 0.000 227: parallelrows 1 0.0 0 0.0 0.000 227: parallelcols 1 0.0 0 0.0 0.010 227: stuffing 1 0.0 0 0.0 0.000 227: dualfix 1 0.0 0 0.0 0.000 227: simplifyineq 0 0.0 0 0.0 0.000 227: doubletoneq 0 0.0 0 0.0 0.000 227: implint 0 0.0 0 0.0 0.000 227: domcol 1 0.0 0 0.0 0.000 227: dualinfer 0 0.0 0 0.0 0.000 227: probing 0 0.0 0 0.0 0.000 227: substitution 0 0.0 0 0.0 0.000 227: sparsify 0 0.0 0 0.0 0.000 227: 227: reduced problem: 227: reduced rows: 48 227: reduced columns: 48 227: reduced int. columns: 0 227: reduced cont. columns: 48 227: reduced nonzeros: 118 227: 227: presolving finished after 0.012 seconds 227: 227: Equilibrium scaling LP (persistent) 227: Simplifier removed 8 rows, 8 columns, 17 nonzeros, 0 col bounds, 27 row bounds 227: Reduced LP has 40 rows 40 columns 101 nonzeros 227: Equilibrium scaling LP 227: type | time | iters | facts | shift | viol sum | viol num | obj value 227: L | 0.0 | 0 | 3 | 6.83e-01 | 0.00e+00 | 0 | 0.00000000e+00 227: E | 0.0 | 0 | 3 | 0.00e+00 | 6.83e-01 | 1 | 0.00000000e+00 227: E | 0.0 | 41 | 4 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 227: --- unscaling internal solution 227: --- unsimplifying solution and basis 227: --- unscaling external solution 227: --- verifying computed solution 227: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 227: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.00000000e+01 227: --- unscaling external solution 227: --- verifying computed solution 227: 227: SoPlex status : problem is solved [optimal] 227: Solving time (sec) : 0.02 227: Iterations : 41 227: Objective value : -7.00000000e+01 227: 227: Solution passed validation 227: 227: postsolve finished after 0.003 seconds 227: feasible: true 227: objective value: -70 227: 227: violations: 227: bounds: 0 227: constraints: 0 227: integrality: 0 227: 227: validation: SUCCESS 227: Solving time 0.028 seconds 227: 227: solving finished after 0.028 seconds 228: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 228: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 228: 228: External libraries: 228: Boost 1.83.0 (https://www.boost.org/) 228: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 228: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 228: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 228: 228: reading took 0.00285 seconds 228: Numerical Statistics: 228: Matrix range [2e-01,9e+00] 228: Objective range [4e-01,7e+02] 228: Bounds range [0e+00,0e+00] 228: RHS range [9e+01,7e+03] 228: Dynamism Variables: 2e+01 228: Dynamism Rows : 2e+01 228: set presolve.componentsmaxint = -1 228: set presolve.detectlindep = 0 228: set doubletoneq.enabled = 0 228: set dualinfer.enabled = 0 228: set substitution.enabled = 0 228: set sparsify.enabled = 0 228: set calculate_basis_for_dual = 0 228: 228: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr7.mps with dual-postsolve activated 228: rows: 129 228: columns: 140 228: int. columns: 0 228: cont. columns: 140 228: nonzeros: 420 228: 228: round 0 ( Trivial ): 1 del cols, 34 del rows, 35 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 228: round 1 ( Fast ): 1 del cols, 34 del rows, 70 chg bounds, 0 chg sides, 0 chg coeffs, 70 tsx applied, 0 tsx conflicts 228: round 2 ( Fast ): 1 del cols, 34 del rows, 112 chg bounds, 0 chg sides, 0 chg coeffs, 172 tsx applied, 0 tsx conflicts 228: round 3 ( Fast ): 1 del cols, 34 del rows, 164 chg bounds, 0 chg sides, 0 chg coeffs, 306 tsx applied, 0 tsx conflicts 228: round 4 ( Fast ): 1 del cols, 34 del rows, 194 chg bounds, 0 chg sides, 0 chg coeffs, 370 tsx applied, 0 tsx conflicts 228: round 5 ( Fast ): 1 del cols, 34 del rows, 236 chg bounds, 0 chg sides, 0 chg coeffs, 454 tsx applied, 0 tsx conflicts 228: round 6 ( Fast ): 1 del cols, 34 del rows, 261 chg bounds, 0 chg sides, 0 chg coeffs, 504 tsx applied, 0 tsx conflicts 228: round 7 ( Fast ): 1 del cols, 34 del rows, 283 chg bounds, 0 chg sides, 0 chg coeffs, 548 tsx applied, 0 tsx conflicts 228: round 8 ( Fast ): 1 del cols, 34 del rows, 303 chg bounds, 0 chg sides, 0 chg coeffs, 588 tsx applied, 0 tsx conflicts 228: round 9 ( Fast ): 1 del cols, 34 del rows, 324 chg bounds, 0 chg sides, 0 chg coeffs, 630 tsx applied, 0 tsx conflicts 228: round 10 ( Fast ): 1 del cols, 34 del rows, 342 chg bounds, 0 chg sides, 0 chg coeffs, 666 tsx applied, 0 tsx conflicts 228: round 11 ( Fast ): 1 del cols, 34 del rows, 361 chg bounds, 0 chg sides, 0 chg coeffs, 704 tsx applied, 0 tsx conflicts 228: round 12 ( Medium ): 40 del cols, 39 del rows, 372 chg bounds, 34 chg sides, 34 chg coeffs, 765 tsx applied, 455 tsx conflicts 228: round 13 ( Medium ): 41 del cols, 40 del rows, 380 chg bounds, 34 chg sides, 34 chg coeffs, 790 tsx applied, 455 tsx conflicts 228: round 14 (Exhaustive): 41 del cols, 40 del rows, 383 chg bounds, 34 chg sides, 34 chg coeffs, 795 tsx applied, 455 tsx conflicts 228: round 15 ( Final ): 41 del cols, 40 del rows, 383 chg bounds, 34 chg sides, 34 chg coeffs, 795 tsx applied, 455 tsx conflicts 228: presolved 15 rounds: 41 del cols, 40 del rows, 383 chg bounds, 34 chg sides, 34 chg coeffs, 795 tsx applied, 455 tsx conflicts 228: 228: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 228: colsingleton 15 0.0 0 0.0 0.000 228: coefftightening 0 0.0 0 0.0 0.000 228: propagation 15 93.3 738 100.0 0.001 228: fixcontinuous 2 0.0 0 0.0 0.000 228: simpleprobing 0 0.0 0 0.0 0.000 228: parallelrows 2 0.0 0 0.0 0.000 228: parallelcols 2 0.0 0 0.0 0.000 228: stuffing 3 66.7 505 10.3 0.000 228: dualfix 4 75.0 7 71.4 0.000 228: simplifyineq 0 0.0 0 0.0 0.000 228: doubletoneq 0 0.0 0 0.0 0.000 228: implint 0 0.0 0 0.0 0.000 228: domcol 1 0.0 0 0.0 0.000 228: dualinfer 0 0.0 0 0.0 0.000 228: probing 0 0.0 0 0.0 0.000 228: substitution 0 0.0 0 0.0 0.000 228: sparsify 0 0.0 0 0.0 0.000 228: 228: reduced problem: 228: reduced rows: 89 228: reduced columns: 99 228: reduced int. columns: 0 228: reduced cont. columns: 99 228: reduced nonzeros: 333 228: 228: presolving finished after 0.009 seconds 228: 228: Equilibrium scaling LP (persistent) 228: Simplifier removed 22 rows, 22 columns, 72 nonzeros, 6 col bounds, 63 row bounds 228: Reduced LP has 67 rows 77 columns 261 nonzeros 228: Equilibrium scaling LP 228: type | time | iters | facts | shift | viol sum | viol num | obj value 228: L | 0.0 | 0 | 3 | 3.00e+00 | 3.02e+04 | 38 | -3.53874348e+06 228: E | 0.0 | 70 | 4 | 0.00e+00 | 6.00e-01 | 1 | -2.33099908e+06 228: E | 0.0 | 73 | 5 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 228: --- unscaling internal solution 228: --- unsimplifying solution and basis 228: --- unscaling external solution 228: --- verifying computed solution 228: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 228: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 228: --- unscaling external solution 228: --- verifying computed solution 228: 228: SoPlex status : problem is solved [optimal] 228: Solving time (sec) : 0.00 228: Iterations : 73 228: Objective value : -2.33138982e+06 228: 228: Solution passed validation 228: 228: postsolve finished after 0.000 seconds 228: feasible: true 228: objective value: -2331389.82433098 228: 228: violations: 228: bounds: 5.6843418860808e-14 228: constraints: 0 228: integrality: 0 228: 228: validation: SUCCESS 228: Solving time 0.025 seconds 228: 228: solving finished after 0.025 seconds 227/287 Test #227: r-solve-sc50b.mps-lp_presolvers_without_basis.set .......................................... Passed 0.13 sec 228/287 Test #228: d-solve-scagr7.mps-lp_presolvers_without_basis.set ......................................... Passed 0.10 sec test 231 Start 231: d-solve-scagr25.mps-lp_presolvers_without_basis.set 231: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr25.mps" "-o" "-0.14753433060768523167790925075974e8" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 231: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 231: Test timeout computed to be: 10000000 test 232 Start 232: q-solve-scagr25.mps-lp_presolvers_without_basis.set 232: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr25.mps" "-o" "-0.14753433060768523167790925075974e8" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 232: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 232: Test timeout computed to be: 10000000 229: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 229: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 229: 229: External libraries: 229: Boost 1.83.0 (https://www.boost.org/) 229: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 229: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 229: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 229: 229: reading took 0.00877 seconds 229: Numerical Statistics: 229: Matrix range [2e-01,9e+00] 229: Objective range [4e-01,7e+02] 229: Bounds range [0e+00,0e+00] 229: RHS range [9e+01,7e+03] 229: Dynamism Variables: 2e+01 229: Dynamism Rows : 2e+01 229: set presolve.componentsmaxint = -1 229: set presolve.detectlindep = 0 229: set doubletoneq.enabled = 0 229: set dualinfer.enabled = 0 229: set substitution.enabled = 0 229: set sparsify.enabled = 0 229: set calculate_basis_for_dual = 0 229: 229: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr7.mps with dual-postsolve activated 229: rows: 129 229: columns: 140 229: int. columns: 0 229: cont. columns: 140 229: nonzeros: 420 229: 229: round 0 ( Trivial ): 1 del cols, 34 del rows, 35 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 229: round 1 ( Fast ): 1 del cols, 34 del rows, 70 chg bounds, 0 chg sides, 0 chg coeffs, 70 tsx applied, 0 tsx conflicts 229: round 2 ( Fast ): 1 del cols, 34 del rows, 112 chg bounds, 0 chg sides, 0 chg coeffs, 172 tsx applied, 0 tsx conflicts 229: round 3 ( Fast ): 1 del cols, 34 del rows, 164 chg bounds, 0 chg sides, 0 chg coeffs, 306 tsx applied, 0 tsx conflicts 229: round 4 ( Fast ): 1 del cols, 34 del rows, 194 chg bounds, 0 chg sides, 0 chg coeffs, 370 tsx applied, 0 tsx conflicts 229: round 5 ( Fast ): 1 del cols, 34 del rows, 236 chg bounds, 0 chg sides, 0 chg coeffs, 454 tsx applied, 0 tsx conflicts 229: round 6 ( Fast ): 1 del cols, 34 del rows, 261 chg bounds, 0 chg sides, 0 chg coeffs, 504 tsx applied, 0 tsx conflicts 229: round 7 ( Fast ): 1 del cols, 34 del rows, 283 chg bounds, 0 chg sides, 0 chg coeffs, 548 tsx applied, 0 tsx conflicts 229: round 8 ( Fast ): 1 del cols, 34 del rows, 303 chg bounds, 0 chg sides, 0 chg coeffs, 588 tsx applied, 0 tsx conflicts 229: round 9 ( Fast ): 1 del cols, 34 del rows, 324 chg bounds, 0 chg sides, 0 chg coeffs, 630 tsx applied, 0 tsx conflicts 229: round 10 ( Fast ): 1 del cols, 34 del rows, 342 chg bounds, 0 chg sides, 0 chg coeffs, 666 tsx applied, 0 tsx conflicts 229: round 11 ( Fast ): 1 del cols, 34 del rows, 361 chg bounds, 0 chg sides, 0 chg coeffs, 704 tsx applied, 0 tsx conflicts 229: round 12 ( Medium ): 40 del cols, 39 del rows, 372 chg bounds, 34 chg sides, 34 chg coeffs, 765 tsx applied, 455 tsx conflicts 229: round 13 ( Medium ): 41 del cols, 40 del rows, 380 chg bounds, 34 chg sides, 34 chg coeffs, 790 tsx applied, 455 tsx conflicts 229: round 14 (Exhaustive): 41 del cols, 40 del rows, 383 chg bounds, 34 chg sides, 34 chg coeffs, 795 tsx applied, 455 tsx conflicts 229: round 15 ( Final ): 41 del cols, 40 del rows, 383 chg bounds, 34 chg sides, 34 chg coeffs, 795 tsx applied, 455 tsx conflicts 229: presolved 15 rounds: 41 del cols, 40 del rows, 383 chg bounds, 34 chg sides, 34 chg coeffs, 795 tsx applied, 455 tsx conflicts 229: 229: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 229: colsingleton 15 0.0 0 0.0 0.000 229: coefftightening 0 0.0 0 0.0 0.000 229: propagation 15 93.3 738 100.0 0.025 229: fixcontinuous 2 0.0 0 0.0 0.000 229: simpleprobing 0 0.0 0 0.0 0.000 229: parallelrows 2 0.0 0 0.0 0.000 229: parallelcols 2 0.0 0 0.0 0.000 229: stuffing 3 66.7 505 10.3 0.005 229: dualfix 4 75.0 7 71.4 0.001 229: simplifyineq 0 0.0 0 0.0 0.000 229: doubletoneq 0 0.0 0 0.0 0.000 229: implint 0 0.0 0 0.0 0.000 229: domcol 1 0.0 0 0.0 0.000 229: dualinfer 0 0.0 0 0.0 0.000 229: probing 0 0.0 0 0.0 0.000 229: substitution 0 0.0 0 0.0 0.000 229: sparsify 0 0.0 0 0.0 0.000 229: 229: reduced problem: 229: reduced rows: 89 229: reduced columns: 99 229: reduced int. columns: 0 229: reduced cont. columns: 99 229: reduced nonzeros: 333 229: 229: presolving finished after 0.084 seconds 229: 229: Equilibrium scaling LP (persistent) 229: Simplifier removed 22 rows, 22 columns, 72 nonzeros, 4 col bounds, 63 row bounds 229: Reduced LP has 67 rows 77 columns 261 nonzeros 229: Equilibrium scaling LP 229: type | time | iters | facts | shift | viol sum | viol num | obj value 229: L | 0.0 | 0 | 3 | 0.00e+00 | 3.02e+04 | 38 | -3.53869938e+06 229: L | 0.0 | 71 | 4 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 229: --- unscaling internal solution 229: --- unsimplifying solution and basis 229: --- unscaling external solution 229: --- verifying computed solution 229: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 229: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 229: --- unscaling external solution 229: --- verifying computed solution 229: 229: SoPlex status : problem is solved [optimal] 229: Solving time (sec) : 0.00 229: Iterations : 71 229: Objective value : -2.33138982e+06 229: 229: Solution passed validation 229: 229: postsolve finished after 0.017 seconds 229: feasible: true 229: objective value: -2331389.82433098 229: 229: violations: 229: bounds: 8.5265128291212e-14 229: constraints: 0 229: integrality: 0 229: 229: validation: SUCCESS 229: Solving time 0.108 seconds 229: 229: solving finished after 0.108 seconds 229/287 Test #229: q-solve-scagr7.mps-lp_presolvers_without_basis.set ......................................... Passed 0.18 sec test 233 Start 233: r-solve-scagr25.mps-lp_presolvers_without_basis.set 233: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr25.mps" "-o" "-0.14753433060768523167790925075974e8" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 233: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 233: Test timeout computed to be: 10000000 231: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 231: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 231: 231: External libraries: 231: Boost 1.83.0 (https://www.boost.org/) 231: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 231: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 231: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 231: 231: reading took 0.0275 seconds 231: Numerical Statistics: 231: Matrix range [2e-01,9e+00] 231: Objective range [4e-01,7e+02] 231: Bounds range [0e+00,0e+00] 231: RHS range [9e+01,7e+03] 231: Dynamism Variables: 2e+01 231: Dynamism Rows : 2e+01 231: set presolve.componentsmaxint = -1 231: set presolve.detectlindep = 0 231: set doubletoneq.enabled = 0 231: set dualinfer.enabled = 0 231: set substitution.enabled = 0 231: set sparsify.enabled = 0 231: set calculate_basis_for_dual = 0 231: 231: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr25.mps with dual-postsolve activated 231: rows: 471 231: columns: 500 231: int. columns: 0 231: cont. columns: 500 231: nonzeros: 1554 231: 231: round 0 ( Trivial ): 1 del cols, 124 del rows, 125 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 231: round 1 ( Fast ): 1 del cols, 124 del rows, 214 chg bounds, 0 chg sides, 0 chg coeffs, 178 tsx applied, 0 tsx conflicts 231: round 2 ( Fast ): 1 del cols, 124 del rows, 364 chg bounds, 0 chg sides, 0 chg coeffs, 532 tsx applied, 0 tsx conflicts 231: round 3 ( Fast ): 1 del cols, 124 del rows, 542 chg bounds, 0 chg sides, 0 chg coeffs, 990 tsx applied, 0 tsx conflicts 231: round 4 ( Fast ): 1 del cols, 124 del rows, 644 chg bounds, 0 chg sides, 0 chg coeffs, 1234 tsx applied, 0 tsx conflicts 231: round 5 ( Fast ): 1 del cols, 124 del rows, 776 chg bounds, 0 chg sides, 0 chg coeffs, 1498 tsx applied, 0 tsx conflicts 231: round 6 ( Medium ): 130 del cols, 129 del rows, 817 chg bounds, 124 chg sides, 124 chg coeffs, 1709 tsx applied, 662 tsx conflicts 231: round 7 (Exhaustive): 131 del cols, 130 del rows, 838 chg bounds, 124 chg sides, 124 chg coeffs, 1754 tsx applied, 662 tsx conflicts 231: round 8 ( Final ): 131 del cols, 130 del rows, 852 chg bounds, 124 chg sides, 124 chg coeffs, 1781 tsx applied, 662 tsx conflicts 231: presolved 8 rounds: 131 del cols, 130 del rows, 852 chg bounds, 124 chg sides, 124 chg coeffs, 1781 tsx applied, 662 tsx conflicts 231: 231: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 231: colsingleton 8 0.0 0 0.0 0.000 231: coefftightening 0 0.0 0 0.0 0.000 231: propagation 8 100.0 1640 100.0 0.001 231: fixcontinuous 2 0.0 0 0.0 0.000 231: simpleprobing 0 0.0 0 0.0 0.000 231: parallelrows 1 0.0 0 0.0 0.000 231: parallelcols 1 0.0 0 0.0 0.000 231: stuffing 3 66.7 793 17.2 0.000 231: dualfix 3 100.0 10 50.0 0.000 231: simplifyineq 0 0.0 0 0.0 0.000 231: doubletoneq 0 0.0 0 0.0 0.000 231: implint 0 0.0 0 0.0 0.000 231: domcol 1 0.0 0 0.0 0.000 231: dualinfer 0 0.0 0 0.0 0.000 231: probing 0 0.0 0 0.0 0.000 231: substitution 0 0.0 0 0.0 0.000 231: sparsify 0 0.0 0 0.0 0.000 231: 231: reduced problem: 231: reduced rows: 341 231: reduced columns: 369 231: reduced int. columns: 0 231: reduced cont. columns: 369 231: reduced nonzeros: 1287 231: 231: presolving finished after 0.026 seconds 231: 231: Equilibrium scaling LP (persistent) 231: Simplifier removed 76 rows, 76 columns, 252 nonzeros, 8 col bounds, 225 row bounds 231: Reduced LP has 265 rows 293 columns 1035 nonzeros 231: Equilibrium scaling LP 231: type | time | iters | facts | shift | viol sum | viol num | obj value 231: L | 0.0 | 0 | 3 | 3.00e+00 | 4.49e+05 | 147 | -1.04100015e+08 231: L | 0.0 | 199 | 4 | 3.00e+00 | 8.19e+05 | 89 | -2.99639798e+07 231: E | 0.0 | 369 | 6 | 0.00e+00 | 1.32e-01 | 1 | -1.47531344e+07 231: E | 0.0 | 370 | 7 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 231: --- unscaling internal solution 231: --- unsimplifying solution and basis 231: --- unscaling external solution 231: --- verifying computed solution 231: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 231: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 231: --- unscaling external solution 231: --- verifying computed solution 231: 231: SoPlex status : problem is solved [optimal] 231: Solving time (sec) : 0.06 231: Iterations : 370 231: Objective value : -1.47534331e+07 231: 231: Solution passed validation 231: 231: postsolve finished after 0.001 seconds 231: feasible: true 231: objective value: -14753433.0607685 231: 231: violations: 231: bounds: 5.6843418860808e-14 231: constraints: 0 231: integrality: 0 231: 231: validation: SUCCESS 231: Solving time 0.119 seconds 231: 231: solving finished after 0.119 seconds 230/287 Test #231: d-solve-scagr25.mps-lp_presolvers_without_basis.set ........................................ Passed 0.22 sec test 234 Start 234: d-solve-scfxm1.mps-lp_presolvers_without_basis.set 234: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scfxm1.mps" "-o" "0.18416759028348943683579089143655e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 234: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 234: Test timeout computed to be: 10000000 230: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 230: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 230: 230: External libraries: 230: Boost 1.83.0 (https://www.boost.org/) 230: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 230: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 230: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 230: 230: reading took 0.0147 seconds 230: Numerical Statistics: 230: Matrix range [2e-01,9e+00] 230: Objective range [4e-01,7e+02] 230: Bounds range [0e+00,0e+00] 230: RHS range [9e+01,7e+03] 230: Dynamism Variables: 2e+01 230: Dynamism Rows : 2e+01 230: set presolve.componentsmaxint = -1 230: set presolve.detectlindep = 0 230: set doubletoneq.enabled = 0 230: set dualinfer.enabled = 0 230: set substitution.enabled = 0 230: set sparsify.enabled = 0 230: set calculate_basis_for_dual = 0 230: 230: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr7.mps with dual-postsolve activated 230: rows: 129 230: columns: 140 230: int. columns: 0 230: cont. columns: 140 230: nonzeros: 420 230: 230: round 0 ( Trivial ): 1 del cols, 34 del rows, 35 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 230: round 1 ( Fast ): 1 del cols, 34 del rows, 70 chg bounds, 0 chg sides, 0 chg coeffs, 70 tsx applied, 0 tsx conflicts 230: round 2 ( Fast ): 1 del cols, 34 del rows, 112 chg bounds, 0 chg sides, 0 chg coeffs, 172 tsx applied, 0 tsx conflicts 230: round 3 ( Fast ): 1 del cols, 34 del rows, 164 chg bounds, 0 chg sides, 0 chg coeffs, 306 tsx applied, 0 tsx conflicts 230: round 4 ( Fast ): 1 del cols, 34 del rows, 194 chg bounds, 0 chg sides, 0 chg coeffs, 370 tsx applied, 0 tsx conflicts 230: round 5 ( Fast ): 1 del cols, 34 del rows, 236 chg bounds, 0 chg sides, 0 chg coeffs, 454 tsx applied, 0 tsx conflicts 230: round 6 ( Fast ): 1 del cols, 34 del rows, 261 chg bounds, 0 chg sides, 0 chg coeffs, 504 tsx applied, 0 tsx conflicts 230: round 7 ( Fast ): 1 del cols, 34 del rows, 283 chg bounds, 0 chg sides, 0 chg coeffs, 548 tsx applied, 0 tsx conflicts 230: round 8 ( Fast ): 1 del cols, 34 del rows, 303 chg bounds, 0 chg sides, 0 chg coeffs, 588 tsx applied, 0 tsx conflicts 230: round 9 ( Fast ): 1 del cols, 34 del rows, 324 chg bounds, 0 chg sides, 0 chg coeffs, 630 tsx applied, 0 tsx conflicts 230: round 10 ( Fast ): 1 del cols, 34 del rows, 342 chg bounds, 0 chg sides, 0 chg coeffs, 666 tsx applied, 0 tsx conflicts 230: round 11 ( Fast ): 1 del cols, 34 del rows, 361 chg bounds, 0 chg sides, 0 chg coeffs, 704 tsx applied, 0 tsx conflicts 230: round 12 ( Medium ): 40 del cols, 39 del rows, 372 chg bounds, 34 chg sides, 34 chg coeffs, 765 tsx applied, 455 tsx conflicts 230: round 13 ( Medium ): 41 del cols, 40 del rows, 380 chg bounds, 34 chg sides, 34 chg coeffs, 790 tsx applied, 455 tsx conflicts 230: round 14 (Exhaustive): 41 del cols, 40 del rows, 383 chg bounds, 34 chg sides, 34 chg coeffs, 795 tsx applied, 455 tsx conflicts 230: round 15 ( Final ): 41 del cols, 40 del rows, 383 chg bounds, 34 chg sides, 34 chg coeffs, 795 tsx applied, 455 tsx conflicts 230: presolved 15 rounds: 41 del cols, 40 del rows, 383 chg bounds, 34 chg sides, 34 chg coeffs, 795 tsx applied, 455 tsx conflicts 230: 230: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 230: colsingleton 15 0.0 0 0.0 0.000 230: coefftightening 0 0.0 0 0.0 0.000 230: propagation 15 93.3 738 100.0 0.076 230: fixcontinuous 2 0.0 0 0.0 0.012 230: simpleprobing 0 0.0 0 0.0 0.000 230: parallelrows 2 0.0 0 0.0 0.002 230: parallelcols 2 0.0 0 0.0 0.003 230: stuffing 3 66.7 505 10.3 0.021 230: dualfix 4 75.0 7 71.4 0.011 230: simplifyineq 0 0.0 0 0.0 0.000 230: doubletoneq 0 0.0 0 0.0 0.000 230: implint 0 0.0 0 0.0 0.000 230: domcol 1 0.0 0 0.0 0.002 230: dualinfer 0 0.0 0 0.0 0.000 230: probing 0 0.0 0 0.0 0.000 230: substitution 0 0.0 0 0.0 0.000 230: sparsify 0 0.0 0 0.0 0.000 230: 230: reduced problem: 230: reduced rows: 89 230: reduced columns: 99 230: reduced int. columns: 0 230: reduced cont. columns: 99 230: reduced nonzeros: 333 230: 230: presolving finished after 0.209 seconds 230: 230: Equilibrium scaling LP (persistent) 230: Simplifier removed 22 rows, 22 columns, 72 nonzeros, 6 col bounds, 63 row bounds 230: Reduced LP has 67 rows 77 columns 261 nonzeros 230: Equilibrium scaling LP 230: type | time | iters | facts | shift | viol sum | viol num | obj value 230: L | 0.0 | 0 | 3 | 3.00e+00 | 3.02e+04 | 38 | -3.53874348e+06 230: E | 0.0 | 70 | 4 | 0.00e+00 | 6.00e-01 | 1 | -2.33099908e+06 230: E | 0.0 | 73 | 5 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 230: --- unscaling internal solution 230: --- unsimplifying solution and basis 230: --- unscaling external solution 230: --- verifying computed solution 230: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 230: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -2.33138982e+06 230: --- unscaling external solution 230: --- verifying computed solution 234: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 234: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 234: 234: External libraries: 234: Boost 1.83.0 (https://www.boost.org/) 234: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 234: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 234: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 234: 234: reading took 0.0133 seconds 234: Numerical Statistics: 234: Matrix range [5e-04,1e+02] 234: Objective range [1e+00,1e+01] 234: Bounds range [0e+00,0e+00] 234: RHS range [8e-01,2e+03] 234: Dynamism Variables: 1e+05 234: Dynamism Rows : 9e+03 234: set presolve.componentsmaxint = -1 234: set presolve.detectlindep = 0 234: set doubletoneq.enabled = 0 234: set dualinfer.enabled = 0 234: set substitution.enabled = 0 234: set sparsify.enabled = 0 234: set calculate_basis_for_dual = 0 234: 234: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scfxm1.mps with dual-postsolve activated 234: rows: 330 234: columns: 457 234: int. columns: 0 234: cont. columns: 457 234: nonzeros: 2589 234: 234: round 0 ( Trivial ): 9 del cols, 43 del rows, 48 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 234: round 1 ( Fast ): 18 del cols, 48 del rows, 335 chg bounds, 0 chg sides, 0 chg coeffs, 656 tsx applied, 0 tsx conflicts 234: round 2 ( Fast ): 18 del cols, 48 del rows, 458 chg bounds, 0 chg sides, 0 chg coeffs, 944 tsx applied, 0 tsx conflicts 234: round 3 ( Fast ): 18 del cols, 49 del rows, 551 chg bounds, 0 chg sides, 0 chg coeffs, 1140 tsx applied, 0 tsx conflicts 234: round 4 ( Fast ): 18 del cols, 49 del rows, 607 chg bounds, 0 chg sides, 0 chg coeffs, 1258 tsx applied, 0 tsx conflicts 234: round 5 ( Medium ): 53 del cols, 58 del rows, 645 chg bounds, 22 chg sides, 22 chg coeffs, 1367 tsx applied, 125 tsx conflicts 234: round 6 ( Medium ): 60 del cols, 61 del rows, 672 chg bounds, 28 chg sides, 25 chg coeffs, 1424 tsx applied, 131 tsx conflicts 234: round 7 (Exhaustive): 60 del cols, 61 del rows, 696 chg bounds, 28 chg sides, 25 chg coeffs, 1468 tsx applied, 131 tsx conflicts 234: round 8 ( Final ): 60 del cols, 61 del rows, 721 chg bounds, 28 chg sides, 25 chg coeffs, 1527 tsx applied, 131 tsx conflicts 234: presolved 8 rounds: 60 del cols, 61 del rows, 721 chg bounds, 28 chg sides, 25 chg coeffs, 1527 tsx applied, 131 tsx conflicts 234: 234: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 234: colsingleton 8 0.0 0 0.0 0.000 234: coefftightening 0 0.0 0 0.0 0.000 234: propagation 8 100.0 1470 100.0 0.001 234: fixcontinuous 2 0.0 0 0.0 0.000 234: simpleprobing 0 0.0 0 0.0 0.000 234: parallelrows 2 0.0 0 0.0 0.001 234: parallelcols 2 50.0 4 100.0 0.001 234: stuffing 3 66.7 167 22.2 0.000 234: dualfix 4 100.0 17 94.1 0.001 234: simplifyineq 0 0.0 0 0.0 0.000 234: doubletoneq 0 0.0 0 0.0 0.000 234: implint 0 0.0 0 0.0 0.000 234: domcol 1 0.0 0 0.0 0.001 234: dualinfer 0 0.0 0 0.0 0.000 234: probing 0 0.0 0 0.0 0.000 234: substitution 0 0.0 0 0.0 0.000 234: sparsify 0 0.0 0 0.0 0.000 234: 234: reduced problem: 234: reduced rows: 269 234: reduced columns: 397 234: reduced int. columns: 0 234: reduced cont. columns: 397 234: reduced nonzeros: 2230 234: 234: presolving finished after 0.022 seconds 234: 234: Equilibrium scaling LP (persistent) 230: 230: SoPlex status : problem is solved [optimal] 230: Solving time (sec) : 0.02 230: Iterations : 73 230: Objective value : -2.33138982e+06 230: 230: Solution passed validation 230: 230: postsolve finished after 0.037 seconds 230: feasible: true 230: objective value: -2331389.82433098 230: 230: violations: 230: bounds: 1.13686837721616e-13 230: constraints: 0 230: integrality: 0 230: 230: validation: SUCCESS 230: Solving time 0.271 seconds 230: 230: solving finished after 0.271 seconds 234: Simplifier removed 11 rows, 11 columns, 27 nonzeros, 13 col bounds, 54 row bounds 234: Reduced LP has 258 rows 386 columns 2203 nonzeros 234: Equilibrium scaling LP 231/287 Test #230: r-solve-scagr7.mps-lp_presolvers_without_basis.set ......................................... Passed 0.37 sec test 235 Start 235: q-solve-scfxm1.mps-lp_presolvers_without_basis.set 235: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scfxm1.mps" "-o" "0.18416759028348943683579089143655e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 235: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 235: Test timeout computed to be: 10000000 234: type | time | iters | facts | shift | viol sum | viol num | obj value 234: L | 0.0 | 0 | 3 | 1.44e+00 | 1.39e+04 | 110 | -4.94714362e+03 234: L | 0.0 | 199 | 4 | 1.44e+00 | 1.23e+05 | 112 | 8.80822943e+03 232: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 232: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 232: 232: External libraries: 232: Boost 1.83.0 (https://www.boost.org/) 232: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 232: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 232: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 232: 232: reading took 0.0614 seconds 232: Numerical Statistics: 232: Matrix range [2e-01,9e+00] 232: Objective range [4e-01,7e+02] 232: Bounds range [0e+00,0e+00] 232: RHS range [9e+01,7e+03] 232: Dynamism Variables: 2e+01 232: Dynamism Rows : 2e+01 232: set presolve.componentsmaxint = -1 232: set presolve.detectlindep = 0 232: set doubletoneq.enabled = 0 232: set dualinfer.enabled = 0 232: set substitution.enabled = 0 232: set sparsify.enabled = 0 232: set calculate_basis_for_dual = 0 232: 232: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr25.mps with dual-postsolve activated 232: rows: 471 232: columns: 500 232: int. columns: 0 232: cont. columns: 500 232: nonzeros: 1554 232: 232: round 0 ( Trivial ): 1 del cols, 124 del rows, 125 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 232: round 1 ( Fast ): 1 del cols, 124 del rows, 214 chg bounds, 0 chg sides, 0 chg coeffs, 178 tsx applied, 0 tsx conflicts 232: round 2 ( Fast ): 1 del cols, 124 del rows, 364 chg bounds, 0 chg sides, 0 chg coeffs, 532 tsx applied, 0 tsx conflicts 232: round 3 ( Fast ): 1 del cols, 124 del rows, 542 chg bounds, 0 chg sides, 0 chg coeffs, 990 tsx applied, 0 tsx conflicts 232: round 4 ( Fast ): 1 del cols, 124 del rows, 644 chg bounds, 0 chg sides, 0 chg coeffs, 1234 tsx applied, 0 tsx conflicts 232: round 5 ( Fast ): 1 del cols, 124 del rows, 776 chg bounds, 0 chg sides, 0 chg coeffs, 1498 tsx applied, 0 tsx conflicts 232: round 6 ( Medium ): 130 del cols, 129 del rows, 817 chg bounds, 124 chg sides, 124 chg coeffs, 1709 tsx applied, 662 tsx conflicts 232: round 7 (Exhaustive): 131 del cols, 130 del rows, 838 chg bounds, 124 chg sides, 124 chg coeffs, 1754 tsx applied, 662 tsx conflicts 232: round 8 ( Final ): 131 del cols, 130 del rows, 852 chg bounds, 124 chg sides, 124 chg coeffs, 1781 tsx applied, 662 tsx conflicts 232: presolved 8 rounds: 131 del cols, 130 del rows, 852 chg bounds, 124 chg sides, 124 chg coeffs, 1781 tsx applied, 662 tsx conflicts 232: 232: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 232: colsingleton 8 0.0 0 0.0 0.000 232: coefftightening 0 0.0 0 0.0 0.000 232: propagation 8 100.0 1640 100.0 0.062 232: fixcontinuous 2 0.0 0 0.0 0.000 232: simpleprobing 0 0.0 0 0.0 0.000 232: parallelrows 1 0.0 0 0.0 0.001 232: parallelcols 1 0.0 0 0.0 0.001 232: stuffing 3 66.7 793 17.2 0.016 232: dualfix 3 100.0 10 50.0 0.003 232: simplifyineq 0 0.0 0 0.0 0.000 232: doubletoneq 0 0.0 0 0.0 0.000 232: implint 0 0.0 0 0.0 0.000 232: domcol 1 0.0 0 0.0 0.005 232: dualinfer 0 0.0 0 0.0 0.000 232: probing 0 0.0 0 0.0 0.000 232: substitution 0 0.0 0 0.0 0.000 232: sparsify 0 0.0 0 0.0 0.000 232: 232: reduced problem: 232: reduced rows: 341 232: reduced columns: 369 232: reduced int. columns: 0 232: reduced cont. columns: 369 232: reduced nonzeros: 1287 232: 232: presolving finished after 0.196 seconds 232: 232: Equilibrium scaling LP (persistent) 234: L | 0.0 | 399 | 5 | 1.44e+00 | 4.49e+03 | 54 | 1.75331605e+04 232: Simplifier removed 76 rows, 76 columns, 252 nonzeros, 6 col bounds, 225 row bounds 232: Reduced LP has 265 rows 293 columns 1035 nonzeros 232: Equilibrium scaling LP 232: type | time | iters | facts | shift | viol sum | viol num | obj value 232: L | 0.0 | 0 | 3 | 0.00e+00 | 4.49e+05 | 147 | -1.04099971e+08 234: E | 0.0 | 504 | 6 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 234: E | 0.0 | 504 | 6 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 234: --- unscaling internal solution 234: --- unsimplifying solution and basis 234: --- unscaling external solution 234: --- verifying computed solution 234: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 234: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 234: --- unscaling external solution 234: --- verifying computed solution 234: 234: SoPlex status : problem is solved [optimal] 234: Solving time (sec) : 0.04 234: Iterations : 504 234: Objective value : 1.84167590e+04 234: 234: Solution passed validation 234: 234: postsolve finished after 0.001 seconds 234: feasible: true 234: objective value: 18416.7590283489 234: 234: violations: 234: bounds: 3.97199514658308e-13 234: constraints: 0 234: integrality: 0 234: 234: validation: SUCCESS 234: Solving time 0.113 seconds 234: 234: solving finished after 0.113 seconds 232/287 Test #234: d-solve-scfxm1.mps-lp_presolvers_without_basis.set ......................................... Passed 0.18 sec test 236 Start 236: r-solve-scfxm1.mps-lp_presolvers_without_basis.set 236: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scfxm1.mps" "-o" "0.18416759028348943683579089143655e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 236: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 236: Test timeout computed to be: 10000000 232: L | 0.0 | 199 | 4 | 0.00e+00 | 5.53e+05 | 93 | -3.01456742e+07 232: L | 0.0 | 379 | 6 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 232: --- unscaling internal solution 232: --- unsimplifying solution and basis 232: --- unscaling external solution 232: --- verifying computed solution 232: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 232: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 232: --- unscaling external solution 232: --- verifying computed solution 233: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 233: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 233: 233: External libraries: 233: Boost 1.83.0 (https://www.boost.org/) 233: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 233: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 233: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 233: 233: reading took 0.0698 seconds 233: Numerical Statistics: 233: Matrix range [2e-01,9e+00] 233: Objective range [4e-01,7e+02] 233: Bounds range [0e+00,0e+00] 233: RHS range [9e+01,7e+03] 233: Dynamism Variables: 2e+01 233: Dynamism Rows : 2e+01 233: set presolve.componentsmaxint = -1 233: set presolve.detectlindep = 0 233: set doubletoneq.enabled = 0 233: set dualinfer.enabled = 0 233: set substitution.enabled = 0 233: set sparsify.enabled = 0 233: set calculate_basis_for_dual = 0 233: 233: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scagr25.mps with dual-postsolve activated 233: rows: 471 233: columns: 500 233: int. columns: 0 233: cont. columns: 500 233: nonzeros: 1554 233: 233: round 0 ( Trivial ): 1 del cols, 124 del rows, 125 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 233: round 1 ( Fast ): 1 del cols, 124 del rows, 214 chg bounds, 0 chg sides, 0 chg coeffs, 178 tsx applied, 0 tsx conflicts 233: round 2 ( Fast ): 1 del cols, 124 del rows, 364 chg bounds, 0 chg sides, 0 chg coeffs, 532 tsx applied, 0 tsx conflicts 233: round 3 ( Fast ): 1 del cols, 124 del rows, 542 chg bounds, 0 chg sides, 0 chg coeffs, 990 tsx applied, 0 tsx conflicts 233: round 4 ( Fast ): 1 del cols, 124 del rows, 644 chg bounds, 0 chg sides, 0 chg coeffs, 1234 tsx applied, 0 tsx conflicts 233: round 5 ( Fast ): 1 del cols, 124 del rows, 776 chg bounds, 0 chg sides, 0 chg coeffs, 1498 tsx applied, 0 tsx conflicts 233: round 6 ( Medium ): 130 del cols, 129 del rows, 817 chg bounds, 124 chg sides, 124 chg coeffs, 1709 tsx applied, 662 tsx conflicts 233: round 7 (Exhaustive): 131 del cols, 130 del rows, 838 chg bounds, 124 chg sides, 124 chg coeffs, 1754 tsx applied, 662 tsx conflicts 233: round 8 ( Final ): 131 del cols, 130 del rows, 852 chg bounds, 124 chg sides, 124 chg coeffs, 1781 tsx applied, 662 tsx conflicts 233: presolved 8 rounds: 131 del cols, 130 del rows, 852 chg bounds, 124 chg sides, 124 chg coeffs, 1781 tsx applied, 662 tsx conflicts 233: 233: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 233: colsingleton 8 0.0 0 0.0 0.000 233: coefftightening 0 0.0 0 0.0 0.000 233: propagation 8 100.0 1640 100.0 0.085 233: fixcontinuous 2 0.0 0 0.0 0.001 233: simpleprobing 0 0.0 0 0.0 0.000 233: parallelrows 1 0.0 0 0.0 0.004 233: parallelcols 1 0.0 0 0.0 0.004 233: stuffing 3 66.7 793 17.2 0.024 233: dualfix 3 100.0 10 50.0 0.007 233: simplifyineq 0 0.0 0 0.0 0.000 233: doubletoneq 0 0.0 0 0.0 0.000 233: implint 0 0.0 0 0.0 0.000 233: domcol 1 0.0 0 0.0 0.018 233: dualinfer 0 0.0 0 0.0 0.000 233: probing 0 0.0 0 0.0 0.000 233: substitution 0 0.0 0 0.0 0.000 233: sparsify 0 0.0 0 0.0 0.000 233: 233: reduced problem: 233: reduced rows: 341 233: reduced columns: 369 233: reduced int. columns: 0 233: reduced cont. columns: 369 233: reduced nonzeros: 1287 233: 233: presolving finished after 0.294 seconds 233: 233: Equilibrium scaling LP (persistent) 232: 232: SoPlex status : problem is solved [optimal] 232: Solving time (sec) : 0.04 232: Iterations : 379 232: Objective value : -1.47534331e+07 232: 232: Solution passed validation 232: 232: postsolve finished after 0.071 seconds 232: feasible: true 232: objective value: -14753433.0607685 232: 232: violations: 232: bounds: 0 232: constraints: 0 232: integrality: 0 232: 232: validation: SUCCESS 232: Solving time 0.360 seconds 232: 232: solving finished after 0.360 seconds 233/287 Test #232: q-solve-scagr25.mps-lp_presolvers_without_basis.set ........................................ Passed 0.53 sec test 237 Start 237: d-solve-scorpion.mps-lp_presolvers_without_basis.set 237: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scorpion.mps" "-o" "0.18781248227381066296479411763586e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 237: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 237: Test timeout computed to be: 10000000 233: Simplifier removed 76 rows, 76 columns, 252 nonzeros, 8 col bounds, 225 row bounds 233: Reduced LP has 265 rows 293 columns 1035 nonzeros 233: Equilibrium scaling LP 233: type | time | iters | facts | shift | viol sum | viol num | obj value 233: L | 0.0 | 0 | 3 | 3.00e+00 | 4.49e+05 | 147 | -1.04100015e+08 233: L | 0.0 | 199 | 4 | 3.00e+00 | 8.19e+05 | 89 | -2.99639798e+07 235: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 235: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 235: 235: External libraries: 235: Boost 1.83.0 (https://www.boost.org/) 235: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 235: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 235: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 235: 235: reading took 0.0591 seconds 235: Numerical Statistics: 235: Matrix range [5e-04,1e+02] 235: Objective range [1e+00,1e+01] 235: Bounds range [0e+00,0e+00] 235: RHS range [8e-01,2e+03] 235: Dynamism Variables: 1e+05 235: Dynamism Rows : 9e+03 235: set presolve.componentsmaxint = -1 235: set presolve.detectlindep = 0 235: set doubletoneq.enabled = 0 235: set dualinfer.enabled = 0 235: set substitution.enabled = 0 235: set sparsify.enabled = 0 235: set calculate_basis_for_dual = 0 235: 235: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scfxm1.mps with dual-postsolve activated 235: rows: 330 235: columns: 457 235: int. columns: 0 235: cont. columns: 457 235: nonzeros: 2589 235: 235: round 0 ( Trivial ): 9 del cols, 43 del rows, 48 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 235: round 1 ( Fast ): 18 del cols, 48 del rows, 335 chg bounds, 0 chg sides, 0 chg coeffs, 656 tsx applied, 0 tsx conflicts 235: round 2 ( Fast ): 18 del cols, 48 del rows, 458 chg bounds, 0 chg sides, 0 chg coeffs, 944 tsx applied, 0 tsx conflicts 235: round 3 ( Fast ): 18 del cols, 49 del rows, 551 chg bounds, 0 chg sides, 0 chg coeffs, 1140 tsx applied, 0 tsx conflicts 235: round 4 ( Fast ): 18 del cols, 49 del rows, 607 chg bounds, 0 chg sides, 0 chg coeffs, 1258 tsx applied, 0 tsx conflicts 235: round 5 ( Medium ): 53 del cols, 58 del rows, 645 chg bounds, 22 chg sides, 22 chg coeffs, 1367 tsx applied, 125 tsx conflicts 235: round 6 ( Medium ): 60 del cols, 61 del rows, 672 chg bounds, 28 chg sides, 25 chg coeffs, 1424 tsx applied, 131 tsx conflicts 235: round 7 (Exhaustive): 60 del cols, 61 del rows, 696 chg bounds, 28 chg sides, 25 chg coeffs, 1468 tsx applied, 131 tsx conflicts 235: round 8 ( Final ): 60 del cols, 61 del rows, 721 chg bounds, 28 chg sides, 25 chg coeffs, 1527 tsx applied, 131 tsx conflicts 235: presolved 8 rounds: 60 del cols, 61 del rows, 721 chg bounds, 28 chg sides, 25 chg coeffs, 1527 tsx applied, 131 tsx conflicts 235: 235: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 235: colsingleton 8 0.0 0 0.0 0.000 235: coefftightening 0 0.0 0 0.0 0.000 235: propagation 8 100.0 1470 100.0 0.035 235: fixcontinuous 2 0.0 0 0.0 0.000 235: simpleprobing 0 0.0 0 0.0 0.000 235: parallelrows 2 0.0 0 0.0 0.007 235: parallelcols 2 50.0 4 100.0 0.008 235: stuffing 3 66.7 167 22.2 0.002 235: dualfix 4 100.0 17 94.1 0.005 235: simplifyineq 0 0.0 0 0.0 0.000 235: doubletoneq 0 0.0 0 0.0 0.000 235: implint 0 0.0 0 0.0 0.000 235: domcol 1 0.0 0 0.0 0.011 235: dualinfer 0 0.0 0 0.0 0.000 235: probing 0 0.0 0 0.0 0.000 235: substitution 0 0.0 0 0.0 0.000 235: sparsify 0 0.0 0 0.0 0.000 235: 235: reduced problem: 235: reduced rows: 269 235: reduced columns: 397 235: reduced int. columns: 0 235: reduced cont. columns: 397 235: reduced nonzeros: 2230 235: 235: presolving finished after 0.150 seconds 235: 235: Equilibrium scaling LP (persistent) 235: Simplifier removed 11 rows, 11 columns, 27 nonzeros, 13 col bounds, 54 row bounds 235: Reduced LP has 258 rows 386 columns 2203 nonzeros 235: Equilibrium scaling LP 235: type | time | iters | facts | shift | viol sum | viol num | obj value 235: L | 0.0 | 0 | 3 | 1.44e+00 | 1.39e+04 | 110 | -4.94714362e+03 233: E | 0.0 | 369 | 6 | 0.00e+00 | 1.32e-01 | 1 | -1.47531344e+07 233: E | 0.0 | 370 | 7 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 233: --- unscaling internal solution 233: --- unsimplifying solution and basis 233: --- unscaling external solution 235: L | 0.0 | 199 | 4 | 1.44e+00 | 3.43e+04 | 109 | 8.34457153e+03 233: --- verifying computed solution 233: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 233: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -1.47534331e+07 233: --- unscaling external solution 233: --- verifying computed solution 237: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 237: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 237: 237: External libraries: 237: Boost 1.83.0 (https://www.boost.org/) 237: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 237: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 237: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 237: 237: reading took 0.0256 seconds 237: Numerical Statistics: 237: Matrix range [1e-02,1e+00] 237: Objective range [6e-02,2e+02] 237: Bounds range [0e+00,0e+00] 237: RHS range [2e-03,1e+00] 237: Dynamism Variables: 1e+02 237: Dynamism Rows : 1e+02 237: set presolve.componentsmaxint = -1 237: set presolve.detectlindep = 0 237: set doubletoneq.enabled = 0 237: set dualinfer.enabled = 0 237: set substitution.enabled = 0 237: set sparsify.enabled = 0 237: set calculate_basis_for_dual = 0 237: 237: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scorpion.mps with dual-postsolve activated 237: rows: 388 237: columns: 358 237: int. columns: 0 237: cont. columns: 358 237: nonzeros: 1426 237: 237: round 0 ( Trivial ): 23 del cols, 91 del rows, 84 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 237: round 1 ( Fast ): 27 del cols, 96 del rows, 149 chg bounds, 0 chg sides, 0 chg coeffs, 130 tsx applied, 0 tsx conflicts 237: round 2 ( Medium ): 84 del cols, 135 del rows, 159 chg bounds, 45 chg sides, 24 chg coeffs, 213 tsx applied, 69 tsx conflicts 237: round 3 ( Medium ): 111 del cols, 144 del rows, 184 chg bounds, 57 chg sides, 30 chg coeffs, 278 tsx applied, 102 tsx conflicts 237: round 4 ( Fast ): 111 del cols, 150 del rows, 195 chg bounds, 57 chg sides, 30 chg coeffs, 288 tsx applied, 102 tsx conflicts 237: round 5 ( Medium ): 135 del cols, 150 del rows, 213 chg bounds, 69 chg sides, 36 chg coeffs, 378 tsx applied, 108 tsx conflicts 237: round 6 ( Medium ): 141 del cols, 156 del rows, 219 chg bounds, 81 chg sides, 42 chg coeffs, 384 tsx applied, 108 tsx conflicts 237: round 7 (Exhaustive): 141 del cols, 156 del rows, 219 chg bounds, 81 chg sides, 42 chg coeffs, 384 tsx applied, 108 tsx conflicts 237: round 8 ( Final ): Unchanged 237: presolved 8 rounds: 141 del cols, 156 del rows, 219 chg bounds, 81 chg sides, 42 chg coeffs, 384 tsx applied, 108 tsx conflicts 237: 237: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 237: colsingleton 8 0.0 0 0.0 0.000 237: coefftightening 0 0.0 0 0.0 0.000 237: propagation 8 50.0 174 100.0 0.000 237: fixcontinuous 3 0.0 0 0.0 0.000 237: simpleprobing 0 0.0 0 0.0 0.000 237: parallelrows 2 50.0 6 100.0 0.000 237: parallelcols 2 0.0 0 0.0 0.001 237: stuffing 5 80.0 294 63.3 0.000 237: dualfix 4 25.0 18 100.0 0.000 237: simplifyineq 0 0.0 0 0.0 0.000 237: doubletoneq 0 0.0 0 0.0 0.000 237: implint 0 0.0 0 0.0 0.000 237: domcol 1 0.0 0 0.0 0.000 237: dualinfer 0 0.0 0 0.0 0.000 237: probing 0 0.0 0 0.0 0.000 237: substitution 0 0.0 0 0.0 0.000 237: sparsify 0 0.0 0 0.0 0.000 237: 237: reduced problem: 237: reduced rows: 232 237: reduced columns: 217 237: reduced int. columns: 0 237: reduced cont. columns: 217 237: reduced nonzeros: 1036 237: 237: presolving finished after 0.026 seconds 237: 237: Equilibrium scaling LP (persistent) 235: L | 0.0 | 399 | 5 | 1.44e+00 | 3.46e+03 | 60 | 1.70144017e+04 237: Simplifier removed 26 rows, 26 columns, 58 nonzeros, 0 col bounds, 58 row bounds 237: Reduced LP has 206 rows 191 columns 978 nonzeros 237: Equilibrium scaling LP 237: type | time | iters | facts | shift | viol sum | viol num | obj value 237: L | 0.0 | 0 | 3 | 0.00e+00 | 9.89e+00 | 24 | 1.54181186e+02 237: L | 0.0 | 199 | 5 | 0.00e+00 | 3.29e-02 | 51 | 1.87430791e+03 237: L | 0.0 | 207 | 6 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 237: --- unscaling internal solution 237: --- unsimplifying solution and basis 237: --- unscaling external solution 237: --- verifying computed solution 237: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 237: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 237: --- unscaling external solution 237: --- verifying computed solution 237: 237: SoPlex status : problem is solved [optimal] 237: Solving time (sec) : 0.00 237: Iterations : 207 237: Objective value : 1.87812482e+03 237: 237: Solution passed validation 237: 237: postsolve finished after 0.001 seconds 237: feasible: true 237: objective value: 1878.12482273811 237: 237: violations: 237: bounds: 1.00147757991134e-16 237: constraints: 0 237: integrality: 0 237: 237: validation: SUCCESS 237: Solving time 0.060 seconds 237: 237: solving finished after 0.060 seconds 235: E | 0.0 | 557 | 8 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 234/287 Test #237: d-solve-scorpion.mps-lp_presolvers_without_basis.set ....................................... Passed 0.18 sec test 238 Start 238: q-solve-scorpion.mps-lp_presolvers_without_basis.set 238: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scorpion.mps" "-o" "0.18781248227381066296479411763586e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 238: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 238: Test timeout computed to be: 10000000 235: E | 0.1 | 557 | 8 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 235: --- unscaling internal solution 235: --- unsimplifying solution and basis 235: --- unscaling external solution 235: --- verifying computed solution 235: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 235: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 235: --- unscaling external solution 235: --- verifying computed solution 233: 233: SoPlex status : problem is solved [optimal] 233: Solving time (sec) : 0.02 233: Iterations : 370 233: Objective value : -1.47534331e+07 233: 233: Solution passed validation 233: 233: postsolve finished after 0.110 seconds 233: feasible: true 233: objective value: -14753433.0607685 233: 233: violations: 233: bounds: 5.6843418860808e-14 233: constraints: 0 233: integrality: 0 233: 233: validation: SUCCESS 233: Solving time 0.558 seconds 233: 233: solving finished after 0.558 seconds 235/287 Test #233: r-solve-scagr25.mps-lp_presolvers_without_basis.set ........................................ Passed 0.71 sec test 239 Start 239: r-solve-scorpion.mps-lp_presolvers_without_basis.set 239: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scorpion.mps" "-o" "0.18781248227381066296479411763586e4" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 239: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 239: Test timeout computed to be: 10000000 235: 235: SoPlex status : problem is solved [optimal] 235: Solving time (sec) : 0.06 235: Iterations : 557 235: Objective value : 1.84167590e+04 235: 235: Solution passed validation 235: 235: postsolve finished after 0.063 seconds 235: feasible: true 235: objective value: 18416.7590283489 235: 235: violations: 235: bounds: 0 235: constraints: 0 235: integrality: 0 235: 235: validation: SUCCESS 235: Solving time 0.357 seconds 235: 235: solving finished after 0.357 seconds 236/287 Test #235: q-solve-scfxm1.mps-lp_presolvers_without_basis.set ......................................... Passed 0.52 sec test 240 Start 240: d-solve-scrs8.mps-lp_presolvers_without_basis.set 240: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scrs8.mps" "-o" "0.90429695380079143579923107948844e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 240: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 240: Test timeout computed to be: 10000000 236: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 236: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 236: 236: External libraries: 236: Boost 1.83.0 (https://www.boost.org/) 236: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 236: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 236: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 236: 236: reading took 0.0851 seconds 236: Numerical Statistics: 236: Matrix range [5e-04,1e+02] 236: Objective range [1e+00,1e+01] 236: Bounds range [0e+00,0e+00] 236: RHS range [8e-01,2e+03] 236: Dynamism Variables: 1e+05 236: Dynamism Rows : 9e+03 236: set presolve.componentsmaxint = -1 236: set presolve.detectlindep = 0 236: set doubletoneq.enabled = 0 236: set dualinfer.enabled = 0 236: set substitution.enabled = 0 236: set sparsify.enabled = 0 236: set calculate_basis_for_dual = 0 236: 236: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scfxm1.mps with dual-postsolve activated 236: rows: 330 236: columns: 457 236: int. columns: 0 236: cont. columns: 457 236: nonzeros: 2589 236: 236: round 0 ( Trivial ): 9 del cols, 43 del rows, 48 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 236: round 1 ( Fast ): 18 del cols, 48 del rows, 335 chg bounds, 0 chg sides, 0 chg coeffs, 656 tsx applied, 0 tsx conflicts 236: round 2 ( Fast ): 18 del cols, 48 del rows, 458 chg bounds, 0 chg sides, 0 chg coeffs, 944 tsx applied, 0 tsx conflicts 236: round 3 ( Fast ): 18 del cols, 49 del rows, 551 chg bounds, 0 chg sides, 0 chg coeffs, 1140 tsx applied, 0 tsx conflicts 236: round 4 ( Fast ): 18 del cols, 49 del rows, 607 chg bounds, 0 chg sides, 0 chg coeffs, 1258 tsx applied, 0 tsx conflicts 236: round 5 ( Medium ): 53 del cols, 58 del rows, 645 chg bounds, 22 chg sides, 22 chg coeffs, 1367 tsx applied, 125 tsx conflicts 236: round 6 ( Medium ): 60 del cols, 61 del rows, 672 chg bounds, 28 chg sides, 25 chg coeffs, 1424 tsx applied, 131 tsx conflicts 236: round 7 (Exhaustive): 60 del cols, 61 del rows, 696 chg bounds, 28 chg sides, 25 chg coeffs, 1468 tsx applied, 131 tsx conflicts 236: round 8 ( Final ): 60 del cols, 61 del rows, 721 chg bounds, 28 chg sides, 25 chg coeffs, 1527 tsx applied, 131 tsx conflicts 236: presolved 8 rounds: 60 del cols, 61 del rows, 721 chg bounds, 28 chg sides, 25 chg coeffs, 1527 tsx applied, 131 tsx conflicts 236: 236: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 236: colsingleton 8 0.0 0 0.0 0.000 236: coefftightening 0 0.0 0 0.0 0.000 236: propagation 8 100.0 1470 100.0 0.063 236: fixcontinuous 2 0.0 0 0.0 0.001 236: simpleprobing 0 0.0 0 0.0 0.000 236: parallelrows 2 0.0 0 0.0 0.026 236: parallelcols 2 50.0 4 100.0 0.018 236: stuffing 3 66.7 167 22.2 0.003 236: dualfix 4 100.0 17 94.1 0.019 236: simplifyineq 0 0.0 0 0.0 0.000 236: doubletoneq 0 0.0 0 0.0 0.000 236: implint 0 0.0 0 0.0 0.000 236: domcol 1 0.0 0 0.0 0.017 238: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 238: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 238: 238: External libraries: 238: Boost 1.83.0 (https://www.boost.org/) 238: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 238: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 238: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 238: 238: reading took 0.0386 seconds 238: Numerical Statistics: 238: Matrix range [1e-02,1e+00] 238: Objective range [6e-02,2e+02] 238: Bounds range [0e+00,0e+00] 238: RHS range [2e-03,1e+00] 238: Dynamism Variables: 1e+02 238: Dynamism Rows : 1e+02 238: set presolve.componentsmaxint = -1 238: set presolve.detectlindep = 0 238: set doubletoneq.enabled = 0 238: set dualinfer.enabled = 0 238: set substitution.enabled = 0 238: set sparsify.enabled = 0 238: set calculate_basis_for_dual = 0 238: 238: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scorpion.mps with dual-postsolve activated 238: rows: 388 238: columns: 358 238: int. columns: 0 238: cont. columns: 358 238: nonzeros: 1426 238: 238: round 0 ( Trivial ): 23 del cols, 91 del rows, 84 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 238: round 1 ( Fast ): 27 del cols, 96 del rows, 149 chg bounds, 0 chg sides, 0 chg coeffs, 130 tsx applied, 0 tsx conflicts 238: round 2 ( Medium ): 84 del cols, 135 del rows, 159 chg bounds, 45 chg sides, 24 chg coeffs, 213 tsx applied, 69 tsx conflicts 238: round 3 ( Medium ): 111 del cols, 144 del rows, 184 chg bounds, 57 chg sides, 30 chg coeffs, 278 tsx applied, 102 tsx conflicts 238: round 4 ( Fast ): 111 del cols, 150 del rows, 195 chg bounds, 57 chg sides, 30 chg coeffs, 288 tsx applied, 102 tsx conflicts 238: round 5 ( Medium ): 135 del cols, 150 del rows, 213 chg bounds, 69 chg sides, 36 chg coeffs, 378 tsx applied, 108 tsx conflicts 238: round 6 ( Medium ): 141 del cols, 156 del rows, 219 chg bounds, 81 chg sides, 42 chg coeffs, 384 tsx applied, 108 tsx conflicts 238: round 7 (Exhaustive): 141 del cols, 156 del rows, 219 chg bounds, 81 chg sides, 42 chg coeffs, 384 tsx applied, 108 tsx conflicts 238: round 8 ( Final ): Unchanged 238: presolved 8 rounds: 141 del cols, 156 del rows, 219 chg bounds, 81 chg sides, 42 chg coeffs, 384 tsx applied, 108 tsx conflicts 238: 238: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 238: colsingleton 8 0.0 0 0.0 0.000 238: coefftightening 0 0.0 0 0.0 0.000 238: propagation 8 50.0 174 100.0 0.005 238: fixcontinuous 3 0.0 0 0.0 0.000 238: simpleprobing 0 0.0 0 0.0 0.000 238: parallelrows 2 50.0 6 100.0 0.001 238: parallelcols 2 0.0 0 0.0 0.001 238: stuffing 5 80.0 294 63.3 0.002 238: dualfix 4 25.0 18 100.0 0.001 238: simplifyineq 0 0.0 0 0.0 0.000 238: doubletoneq 0 0.0 0 0.0 0.000 238: implint 0 0.0 0 0.0 0.000 238: domcol 1 0.0 0 0.0 0.001 238: dualinfer 0 0.0 0 0.0 0.000 236: dualinfer 0 0.0 0 0.0 0.000 236: probing 0 0.0 0 0.0 0.000 236: substitution 0 0.0 0 0.0 0.000 236: sparsify 0 0.0 0 0.0 0.000 236: 236: reduced problem: 236: reduced rows: 269 236: reduced columns: 397 236: reduced int. columns: 0 236: reduced cont. columns: 397 236: reduced nonzeros: 2230 236: 236: presolving finished after 0.332 seconds 236: 236: Equilibrium scaling LP (persistent) 238: probing 0 0.0 0 0.0 0.000 238: substitution 0 0.0 0 0.0 0.000 238: sparsify 0 0.0 0 0.0 0.000 238: 238: reduced problem: 238: reduced rows: 232 238: reduced columns: 217 238: reduced int. columns: 0 238: reduced cont. columns: 217 238: reduced nonzeros: 1036 238: 238: presolving finished after 0.070 seconds 238: 238: Equilibrium scaling LP (persistent) 238: Simplifier removed 26 rows, 26 columns, 58 nonzeros, 0 col bounds, 58 row bounds 238: Reduced LP has 206 rows 191 columns 978 nonzeros 238: Equilibrium scaling LP 238: type | time | iters | facts | shift | viol sum | viol num | obj value 238: L | 0.0 | 0 | 3 | 0.00e+00 | 9.89e+00 | 24 | 1.54181186e+02 236: Simplifier removed 11 rows, 11 columns, 27 nonzeros, 13 col bounds, 54 row bounds 236: Reduced LP has 258 rows 386 columns 2203 nonzeros 236: Equilibrium scaling LP 236: type | time | iters | facts | shift | viol sum | viol num | obj value 236: L | 0.0 | 0 | 3 | 1.44e+00 | 1.39e+04 | 110 | -4.94714362e+03 238: L | 0.0 | 199 | 4 | 0.00e+00 | 3.36e-02 | 46 | 1.87426267e+03 238: L | 0.0 | 208 | 6 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 238: --- unscaling internal solution 238: --- unsimplifying solution and basis 238: --- unscaling external solution 238: --- verifying computed solution 238: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 238: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 238: --- unscaling external solution 238: --- verifying computed solution 236: L | 0.0 | 199 | 4 | 1.44e+00 | 3.43e+04 | 109 | 8.34457153e+03 240: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 240: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 240: 240: External libraries: 240: Boost 1.83.0 (https://www.boost.org/) 240: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 240: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 240: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 240: 240: reading took 0.0411 seconds 240: Numerical Statistics: 240: Matrix range [1e-03,4e+02] 240: Objective range [2e-04,5e+03] 240: Bounds range [0e+00,0e+00] 240: RHS range [1e-02,4e+01] 240: Dynamism Variables: 4e+03 240: Dynamism Rows : 4e+02 240: set presolve.componentsmaxint = -1 240: set presolve.detectlindep = 0 240: set doubletoneq.enabled = 0 240: set dualinfer.enabled = 0 240: set substitution.enabled = 0 240: set sparsify.enabled = 0 240: set calculate_basis_for_dual = 0 240: 240: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scrs8.mps with dual-postsolve activated 240: rows: 490 240: columns: 1169 240: int. columns: 0 240: cont. columns: 1169 240: nonzeros: 3182 240: 240: round 0 ( Trivial ): 10 del cols, 16 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 240: round 1 ( Fast ): 17 del cols, 23 del rows, 566 chg bounds, 0 chg sides, 0 chg coeffs, 1100 tsx applied, 0 tsx conflicts 240: round 2 ( Fast ): 31 del cols, 36 del rows, 631 chg bounds, 0 chg sides, 0 chg coeffs, 1208 tsx applied, 0 tsx conflicts 240: round 3 ( Medium ): 112 del cols, 55 del rows, 658 chg bounds, 63 chg sides, 62 chg coeffs, 1333 tsx applied, 156 tsx conflicts 240: round 4 ( Medium ): 125 del cols, 59 del rows, 681 chg bounds, 73 chg sides, 72 chg coeffs, 1394 tsx applied, 168 tsx conflicts 240: round 5 (Exhaustive): 127 del cols, 62 del rows, 703 chg bounds, 73 chg sides, 72 chg coeffs, 1442 tsx applied, 170 tsx conflicts 240: round 6 ( Final ): 129 del cols, 65 del rows, 725 chg bounds, 73 chg sides, 72 chg coeffs, 1490 tsx applied, 172 tsx conflicts 240: presolved 6 rounds: 129 del cols, 65 del rows, 725 chg bounds, 73 chg sides, 72 chg coeffs, 1490 tsx applied, 172 tsx conflicts 240: 240: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 240: colsingleton 6 0.0 0 0.0 0.000 240: coefftightening 0 0.0 0 0.0 0.000 240: propagation 6 100.0 1394 100.0 0.001 240: fixcontinuous 2 0.0 0 0.0 0.000 240: simpleprobing 0 0.0 0 0.0 0.000 240: parallelrows 2 0.0 0 0.0 0.001 240: parallelcols 2 0.0 0 0.0 0.002 240: stuffing 4 100.0 259 35.5 0.000 240: dualfix 4 100.0 9 44.4 0.001 240: simplifyineq 0 0.0 0 0.0 0.000 240: doubletoneq 0 0.0 0 0.0 0.000 240: implint 0 0.0 0 0.0 0.000 240: domcol 1 0.0 0 0.0 0.002 240: dualinfer 0 0.0 0 0.0 0.000 240: probing 0 0.0 0 0.0 0.000 240: substitution 0 0.0 0 0.0 0.000 240: sparsify 0 0.0 0 0.0 0.000 240: 240: reduced problem: 240: reduced rows: 425 240: reduced columns: 1040 240: reduced int. columns: 0 240: reduced cont. columns: 1040 240: reduced nonzeros: 2889 240: 240: presolving finished after 0.032 seconds 240: 240: Equilibrium scaling LP (persistent) 238: 238: SoPlex status : problem is solved [optimal] 238: Solving time (sec) : 0.02 238: Iterations : 208 238: Objective value : 1.87812482e+03 238: 238: Solution passed validation 238: 238: postsolve finished after 0.034 seconds 238: feasible: true 238: objective value: 1878.12482273811 238: 238: violations: 238: bounds: 0 238: constraints: 0 238: integrality: 0 238: 238: validation: SUCCESS 238: Solving time 0.144 seconds 238: 238: solving finished after 0.144 seconds 237/287 Test #238: q-solve-scorpion.mps-lp_presolvers_without_basis.set ....................................... Passed 0.26 sec test 241 Start 241: q-solve-scrs8.mps-lp_presolvers_without_basis.set 241: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scrs8.mps" "-o" "0.90429695380079143579923107948844e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 241: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 241: Test timeout computed to be: 10000000 236: L | 0.0 | 399 | 5 | 1.44e+00 | 2.85e+03 | 70 | 1.70601926e+04 240: Simplifier removed 43 rows, 32 columns, 30 nonzeros, 18 col bounds, 16 row bounds 240: Reduced LP has 382 rows 1008 columns 2743 nonzeros 240: Equilibrium scaling LP 240: type | time | iters | facts | shift | viol sum | viol num | obj value 240: L | 0.0 | 0 | 3 | 4.73e+03 | 5.16e+02 | 49 | -6.42519385e+02 240: L | 0.0 | 199 | 3 | 4.73e+03 | 1.12e+02 | 49 | 2.91235969e+02 236: E | 0.0 | 566 | 8 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 236: E | 0.0 | 566 | 8 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 236: --- unscaling internal solution 236: --- unsimplifying solution and basis 236: --- unscaling external solution 236: --- verifying computed solution 236: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 236: L | 0.0 | 0 | 2 | 0.00e+00 | 0.00e+00 | 0 | 1.84167590e+04 236: --- unscaling external solution 236: --- verifying computed solution 239: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 239: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 239: 239: External libraries: 239: Boost 1.83.0 (https://www.boost.org/) 239: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 239: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 239: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 239: 239: reading took 0.0615 seconds 239: Numerical Statistics: 239: Matrix range [1e-02,1e+00] 239: Objective range [6e-02,2e+02] 239: Bounds range [0e+00,0e+00] 239: RHS range [2e-03,1e+00] 239: Dynamism Variables: 1e+02 239: Dynamism Rows : 1e+02 239: set presolve.componentsmaxint = -1 239: set presolve.detectlindep = 0 239: set doubletoneq.enabled = 0 239: set dualinfer.enabled = 0 239: set substitution.enabled = 0 239: set sparsify.enabled = 0 239: set calculate_basis_for_dual = 0 239: 239: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scorpion.mps with dual-postsolve activated 239: rows: 388 239: columns: 358 239: int. columns: 0 239: cont. columns: 358 239: nonzeros: 1426 239: 239: round 0 ( Trivial ): 23 del cols, 91 del rows, 84 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 239: round 1 ( Fast ): 27 del cols, 96 del rows, 149 chg bounds, 0 chg sides, 0 chg coeffs, 130 tsx applied, 0 tsx conflicts 239: round 2 ( Medium ): 84 del cols, 135 del rows, 159 chg bounds, 45 chg sides, 24 chg coeffs, 213 tsx applied, 69 tsx conflicts 239: round 3 ( Medium ): 111 del cols, 144 del rows, 184 chg bounds, 57 chg sides, 30 chg coeffs, 278 tsx applied, 102 tsx conflicts 239: round 4 ( Fast ): 111 del cols, 150 del rows, 195 chg bounds, 57 chg sides, 30 chg coeffs, 288 tsx applied, 102 tsx conflicts 239: round 5 ( Medium ): 135 del cols, 150 del rows, 213 chg bounds, 69 chg sides, 36 chg coeffs, 378 tsx applied, 108 tsx conflicts 239: round 6 ( Medium ): 141 del cols, 156 del rows, 219 chg bounds, 81 chg sides, 42 chg coeffs, 384 tsx applied, 108 tsx conflicts 239: round 7 (Exhaustive): 141 del cols, 156 del rows, 219 chg bounds, 81 chg sides, 42 chg coeffs, 384 tsx applied, 108 tsx conflicts 239: round 8 ( Final ): Unchanged 239: presolved 8 rounds: 141 del cols, 156 del rows, 219 chg bounds, 81 chg sides, 42 chg coeffs, 384 tsx applied, 108 tsx conflicts 239: 239: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 239: colsingleton 8 0.0 0 0.0 0.000 239: coefftightening 0 0.0 0 0.0 0.000 239: propagation 8 50.0 174 100.0 0.009 239: fixcontinuous 3 0.0 0 0.0 0.000 239: simpleprobing 0 0.0 0 0.0 0.000 239: parallelrows 2 50.0 6 100.0 0.013 239: parallelcols 2 0.0 0 0.0 0.010 239: stuffing 5 80.0 294 63.3 0.003 239: dualfix 4 25.0 18 100.0 0.003 239: simplifyineq 0 0.0 0 0.0 0.000 239: doubletoneq 0 0.0 0 0.0 0.000 239: implint 0 0.0 0 0.0 0.000 239: domcol 1 0.0 0 0.0 0.011 239: dualinfer 0 0.0 0 0.0 0.000 239: probing 0 0.0 0 0.0 0.000 239: substitution 0 0.0 0 0.0 0.000 239: sparsify 0 0.0 0 0.0 0.000 239: 239: reduced problem: 239: reduced rows: 232 239: reduced columns: 217 239: reduced int. columns: 0 239: reduced cont. columns: 217 239: reduced nonzeros: 1036 239: 239: presolving finished after 0.119 seconds 239: 239: Equilibrium scaling LP (persistent) 239: Simplifier removed 26 rows, 26 columns, 58 nonzeros, 0 col bounds, 58 row bounds 239: Reduced LP has 206 rows 191 columns 978 nonzeros 239: Equilibrium scaling LP 239: type | time | iters | facts | shift | viol sum | viol num | obj value 239: L | 0.0 | 0 | 3 | 0.00e+00 | 9.89e+00 | 24 | 1.54181186e+02 240: L | 0.0 | 399 | 4 | 4.73e+03 | 7.03e+01 | 68 | 4.98638373e+02 239: L | 0.0 | 199 | 4 | 0.00e+00 | 1.02e-02 | 45 | 1.87726641e+03 239: L | 0.0 | 205 | 6 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 239: --- unscaling internal solution 239: --- unsimplifying solution and basis 239: --- unscaling external solution 239: --- verifying computed solution 239: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 239: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.87812482e+03 239: --- unscaling external solution 239: --- verifying computed solution 240: L | 0.1 | 599 | 6 | 4.73e+03 | 2.00e+02 | 68 | 7.06630452e+02 236: 236: SoPlex status : problem is solved [optimal] 236: Solving time (sec) : 0.06 236: Iterations : 566 236: Objective value : 1.84167590e+04 236: 236: Solution passed validation 236: 236: postsolve finished after 0.077 seconds 236: feasible: true 236: objective value: 18416.7590283489 236: 236: violations: 236: bounds: 0 236: constraints: 0 236: integrality: 0 236: 236: validation: SUCCESS 236: Solving time 0.575 seconds 236: 236: solving finished after 0.575 seconds 239: 239: SoPlex status : problem is solved [optimal] 239: Solving time (sec) : 0.00 239: Iterations : 205 239: Objective value : 1.87812482e+03 239: 239: Solution passed validation 239: 239: postsolve finished after 0.047 seconds 239: feasible: true 239: objective value: 1878.12482273811 239: 239: violations: 239: bounds: 0 239: constraints: 0 239: integrality: 0 239: 239: validation: SUCCESS 239: Solving time 0.209 seconds 239: 239: solving finished after 0.209 seconds 238/287 Test #236: r-solve-scfxm1.mps-lp_presolvers_without_basis.set ......................................... Passed 0.77 sec 239/287 Test #239: r-solve-scorpion.mps-lp_presolvers_without_basis.set ....................................... Passed 0.36 sec test 242 Start 242: r-solve-scrs8.mps-lp_presolvers_without_basis.set 242: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scrs8.mps" "-o" "0.90429695380079143579923107948844e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 242: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 242: Test timeout computed to be: 10000000 test 243 Start 243: d-solve-scsd1.mps-lp_presolvers_without_basis.set 243: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scsd1.mps" "-o" "0.86666666743333647292533502995263e1" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 243: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 243: Test timeout computed to be: 10000000 240: L | 0.1 | 799 | 8 | 4.73e+03 | 5.51e+02 | 55 | 7.98306225e+02 240: L | 0.1 | 999 | 9 | 4.73e+03 | 1.54e+02 | 50 | 8.42678377e+02 241: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 241: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 241: 241: External libraries: 241: Boost 1.83.0 (https://www.boost.org/) 241: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 241: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 241: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 241: 241: reading took 0.0664 seconds 241: Numerical Statistics: 241: Matrix range [1e-03,4e+02] 241: Objective range [2e-04,5e+03] 241: Bounds range [0e+00,0e+00] 241: RHS range [1e-02,4e+01] 241: Dynamism Variables: 4e+03 241: Dynamism Rows : 4e+02 241: set presolve.componentsmaxint = -1 241: set presolve.detectlindep = 0 241: set doubletoneq.enabled = 0 241: set dualinfer.enabled = 0 241: set substitution.enabled = 0 241: set sparsify.enabled = 0 241: set calculate_basis_for_dual = 0 241: 241: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scrs8.mps with dual-postsolve activated 241: rows: 490 241: columns: 1169 241: int. columns: 0 241: cont. columns: 1169 241: nonzeros: 3182 241: 241: round 0 ( Trivial ): 10 del cols, 16 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 241: round 1 ( Fast ): 17 del cols, 23 del rows, 566 chg bounds, 0 chg sides, 0 chg coeffs, 1100 tsx applied, 0 tsx conflicts 241: round 2 ( Fast ): 31 del cols, 36 del rows, 631 chg bounds, 0 chg sides, 0 chg coeffs, 1208 tsx applied, 0 tsx conflicts 241: round 3 ( Medium ): 112 del cols, 55 del rows, 658 chg bounds, 63 chg sides, 62 chg coeffs, 1333 tsx applied, 156 tsx conflicts 241: round 4 ( Medium ): 125 del cols, 59 del rows, 681 chg bounds, 73 chg sides, 72 chg coeffs, 1394 tsx applied, 168 tsx conflicts 241: round 5 (Exhaustive): 127 del cols, 62 del rows, 703 chg bounds, 73 chg sides, 72 chg coeffs, 1442 tsx applied, 170 tsx conflicts 241: round 6 ( Final ): 129 del cols, 65 del rows, 725 chg bounds, 73 chg sides, 72 chg coeffs, 1490 tsx applied, 172 tsx conflicts 241: presolved 6 rounds: 129 del cols, 65 del rows, 725 chg bounds, 73 chg sides, 72 chg coeffs, 1490 tsx applied, 172 tsx conflicts 241: 241: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 241: colsingleton 6 0.0 0 0.0 0.000 241: coefftightening 0 0.0 0 0.0 0.000 241: propagation 6 100.0 1394 100.0 0.025 241: fixcontinuous 2 0.0 0 0.0 0.000 241: simpleprobing 0 0.0 0 0.0 0.000 241: parallelrows 2 0.0 0 0.0 0.003 241: parallelcols 2 0.0 0 0.0 0.017 241: stuffing 4 100.0 259 35.5 0.002 241: dualfix 4 100.0 9 44.4 0.012 241: simplifyineq 0 0.0 0 0.0 0.000 241: doubletoneq 0 0.0 0 0.0 0.000 241: implint 0 0.0 0 0.0 0.000 241: domcol 1 0.0 0 0.0 0.033 241: dualinfer 0 0.0 0 0.0 0.000 241: probing 0 0.0 0 0.0 0.000 241: substitution 0 0.0 0 0.0 0.000 241: sparsify 0 0.0 0 0.0 0.000 241: 241: reduced problem: 241: reduced rows: 425 241: reduced columns: 1040 241: reduced int. columns: 0 241: reduced cont. columns: 1040 241: reduced nonzeros: 2889 241: 241: presolving finished after 0.181 seconds 241: 241: Equilibrium scaling LP (persistent) 243: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 243: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 243: 243: External libraries: 243: Boost 1.83.0 (https://www.boost.org/) 243: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 243: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 243: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 243: 243: reading took 0.039 seconds 243: Numerical Statistics: 243: Matrix range [2e-01,1e+00] 243: Objective range [1e+00,5e+00] 243: Bounds range [0e+00,0e+00] 243: RHS range [1e+00,1e+00] 243: Dynamism Variables: 4e+00 243: Dynamism Rows : 4e+00 243: set presolve.componentsmaxint = -1 243: set presolve.detectlindep = 0 243: set doubletoneq.enabled = 0 243: set dualinfer.enabled = 0 243: set substitution.enabled = 0 243: set sparsify.enabled = 0 243: set calculate_basis_for_dual = 0 243: 243: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scsd1.mps with dual-postsolve activated 243: rows: 77 243: columns: 760 243: int. columns: 0 243: cont. columns: 760 243: nonzeros: 2388 243: 243: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 243: round 1 ( Medium ): 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 243: round 2 (Exhaustive): 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 243: round 3 ( Final ): Unchanged 243: presolved 3 rounds: 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 243: 243: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 243: colsingleton 3 0.0 0 0.0 0.000 243: coefftightening 0 0.0 0 0.0 0.000 243: propagation 3 0.0 0 0.0 0.000 243: fixcontinuous 2 0.0 0 0.0 0.000 243: simpleprobing 0 0.0 0 0.0 0.000 243: parallelrows 1 0.0 0 0.0 0.000 243: parallelcols 1 0.0 0 0.0 0.009 243: stuffing 2 50.0 20 50.0 0.000 243: dualfix 2 0.0 0 0.0 0.000 243: simplifyineq 0 0.0 0 0.0 0.000 243: doubletoneq 0 0.0 0 0.0 0.000 243: implint 0 0.0 0 0.0 0.000 243: domcol 1 0.0 0 0.0 0.001 243: dualinfer 0 0.0 0 0.0 0.000 243: probing 0 0.0 0 0.0 0.000 243: substitution 0 0.0 0 0.0 0.000 243: sparsify 0 0.0 0 0.0 0.000 243: 243: reduced problem: 243: reduced rows: 77 243: reduced columns: 750 243: reduced int. columns: 0 243: reduced cont. columns: 750 243: reduced nonzeros: 2378 243: 243: presolving finished after 0.012 seconds 243: 243: Equilibrium scaling LP (persistent) 243: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 243: Reduced LP has 77 rows 750 columns 2378 nonzeros 243: Equilibrium scaling LP 243: type | time | iters | facts | shift | viol sum | viol num | obj value 243: L | 0.0 | 0 | 3 | 1.52e+01 | 1.00e+00 | 1 | 0.00000000e+00 241: Simplifier removed 43 rows, 32 columns, 30 nonzeros, 18 col bounds, 16 row bounds 241: Reduced LP has 382 rows 1008 columns 2743 nonzeros 241: Equilibrium scaling LP 241: type | time | iters | facts | shift | viol sum | viol num | obj value 241: L | 0.0 | 0 | 3 | 4.73e+03 | 5.16e+02 | 49 | -6.42519385e+02 240: L | 0.1 | 1199 | 10 | 4.73e+03 | 7.57e-01 | 44 | 9.06616901e+02 241: L | 0.0 | 199 | 3 | 4.73e+03 | 1.12e+02 | 49 | 2.91235969e+02 243: E | 0.0 | 106 | 5 | 0.00e+00 | 2.58e+00 | 7 | 8.66666667e+00 240: E | 0.1 | 1211 | 12 | 0.00e+00 | 1.77e+01 | 4 | 9.04883324e+02 240: E | 0.1 | 1225 | 13 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 240: --- unscaling internal solution 240: --- unsimplifying solution and basis 240: --- unscaling external solution 240: --- verifying computed solution 243: E | 0.0 | 109 | 6 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 243: --- unscaling internal solution 243: --- unsimplifying solution and basis 243: --- unscaling external solution 243: --- verifying computed solution 243: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 243: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 243: --- unscaling external solution 243: --- verifying computed solution 240: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 240: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 240: --- unscaling external solution 240: --- verifying computed solution 243: 243: SoPlex status : problem is solved [optimal] 243: Solving time (sec) : 0.00 243: Iterations : 109 243: Objective value : 8.66666667e+00 243: 243: Solution passed validation 243: 243: postsolve finished after 0.000 seconds 243: feasible: true 243: objective value: 8.66666667433336 243: 243: violations: 243: bounds: 1.86190061582642e-16 243: constraints: 0 243: integrality: 0 243: 243: validation: SUCCESS 243: Solving time 0.085 seconds 243: 243: solving finished after 0.085 seconds 240/287 Test #243: d-solve-scsd1.mps-lp_presolvers_without_basis.set .......................................... Passed 0.21 sec test 244 Start 244: q-solve-scsd1.mps-lp_presolvers_without_basis.set 244: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scsd1.mps" "-o" "0.86666666743333647292533502995263e1" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 244: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 244: Test timeout computed to be: 10000000 240: 240: SoPlex status : problem is solved [optimal] 240: Solving time (sec) : 0.14 240: Iterations : 1225 240: Objective value : 9.04296954e+02 240: 240: Solution passed validation 240: 240: postsolve finished after 0.001 seconds 240: feasible: true 240: objective value: 904.296953800791 240: 240: violations: 240: bounds: 0 240: constraints: 3.5527136788005e-15 240: integrality: 0 240: 240: validation: SUCCESS 240: Solving time 0.468 seconds 240: 240: solving finished after 0.468 seconds 241/287 Test #240: d-solve-scrs8.mps-lp_presolvers_without_basis.set .......................................... Passed 0.58 sec test 245 Start 245: r-solve-scsd1.mps-lp_presolvers_without_basis.set 245: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scsd1.mps" "-o" "0.86666666743333647292533502995263e1" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 245: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 245: Test timeout computed to be: 10000000 241: L | 0.0 | 399 | 4 | 4.73e+03 | 7.02e+01 | 68 | 4.98638373e+02 241: L | 0.1 | 599 | 6 | 4.73e+03 | 1.80e+03 | 64 | 7.38127107e+02 241: L | 0.1 | 799 | 7 | 4.73e+03 | 1.79e+02 | 68 | 7.97013532e+02 244: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 244: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 244: 244: External libraries: 244: Boost 1.83.0 (https://www.boost.org/) 244: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 244: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 244: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 244: 244: reading took 0.0733 seconds 244: Numerical Statistics: 244: Matrix range [2e-01,1e+00] 244: Objective range [1e+00,5e+00] 244: Bounds range [0e+00,0e+00] 244: RHS range [1e+00,1e+00] 244: Dynamism Variables: 4e+00 244: Dynamism Rows : 4e+00 244: set presolve.componentsmaxint = -1 244: set presolve.detectlindep = 0 244: set doubletoneq.enabled = 0 244: set dualinfer.enabled = 0 244: set substitution.enabled = 0 244: set sparsify.enabled = 0 244: set calculate_basis_for_dual = 0 244: 244: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scsd1.mps with dual-postsolve activated 244: rows: 77 244: columns: 760 244: int. columns: 0 244: cont. columns: 760 244: nonzeros: 2388 244: 244: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 244: round 1 ( Medium ): 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 244: round 2 (Exhaustive): 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 244: round 3 ( Final ): Unchanged 244: presolved 3 rounds: 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 244: 244: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 244: colsingleton 3 0.0 0 0.0 0.000 244: coefftightening 0 0.0 0 0.0 0.000 244: propagation 3 0.0 0 0.0 0.000 244: fixcontinuous 2 0.0 0 0.0 0.000 244: simpleprobing 0 0.0 0 0.0 0.000 244: parallelrows 1 0.0 0 0.0 0.001 244: parallelcols 1 0.0 0 0.0 0.014 244: stuffing 2 50.0 20 50.0 0.000 244: dualfix 2 0.0 0 0.0 0.001 244: simplifyineq 0 0.0 0 0.0 0.000 244: doubletoneq 0 0.0 0 0.0 0.000 244: implint 0 0.0 0 0.0 0.000 244: domcol 1 0.0 0 0.0 0.034 244: dualinfer 0 0.0 0 0.0 0.000 244: probing 0 0.0 0 0.0 0.000 244: substitution 0 0.0 0 0.0 0.000 244: sparsify 0 0.0 0 0.0 0.000 244: 244: reduced problem: 244: reduced rows: 77 244: reduced columns: 750 244: reduced int. columns: 0 244: reduced cont. columns: 750 244: reduced nonzeros: 2378 244: 244: presolving finished after 0.081 seconds 244: 244: Equilibrium scaling LP (persistent) 244: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 244: Reduced LP has 77 rows 750 columns 2378 nonzeros 244: Equilibrium scaling LP 244: type | time | iters | facts | shift | viol sum | viol num | obj value 244: L | 0.0 | 0 | 3 | 1.52e+01 | 1.00e+00 | 1 | 0.00000000e+00 245: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 245: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 245: 245: External libraries: 245: Boost 1.83.0 (https://www.boost.org/) 245: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 245: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 245: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 245: 245: reading took 0.0774 seconds 245: Numerical Statistics: 245: Matrix range [2e-01,1e+00] 245: Objective range [1e+00,5e+00] 245: Bounds range [0e+00,0e+00] 245: RHS range [1e+00,1e+00] 245: Dynamism Variables: 4e+00 245: Dynamism Rows : 4e+00 245: set presolve.componentsmaxint = -1 245: set presolve.detectlindep = 0 245: set doubletoneq.enabled = 0 245: set dualinfer.enabled = 0 245: set substitution.enabled = 0 245: set sparsify.enabled = 0 245: set calculate_basis_for_dual = 0 245: 245: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scsd1.mps with dual-postsolve activated 245: rows: 77 245: columns: 760 245: int. columns: 0 245: cont. columns: 760 245: nonzeros: 2388 245: 245: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 245: round 1 ( Medium ): 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 245: round 2 (Exhaustive): 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 245: round 3 ( Final ): Unchanged 245: presolved 3 rounds: 10 del cols, 0 del rows, 0 chg bounds, 10 chg sides, 10 chg coeffs, 10 tsx applied, 10 tsx conflicts 245: 245: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 245: colsingleton 3 0.0 0 0.0 0.000 245: coefftightening 0 0.0 0 0.0 0.000 245: propagation 3 0.0 0 0.0 0.000 245: fixcontinuous 2 0.0 0 0.0 0.000 245: simpleprobing 0 0.0 0 0.0 0.000 245: parallelrows 1 0.0 0 0.0 0.025 245: parallelcols 1 0.0 0 0.0 0.015 245: stuffing 2 50.0 20 50.0 0.001 245: dualfix 2 0.0 0 0.0 0.003 245: simplifyineq 0 0.0 0 0.0 0.000 245: doubletoneq 0 0.0 0 0.0 0.000 245: implint 0 0.0 0 0.0 0.000 245: domcol 1 0.0 0 0.0 0.037 245: dualinfer 0 0.0 0 0.0 0.000 245: probing 0 0.0 0 0.0 0.000 245: substitution 0 0.0 0 0.0 0.000 245: sparsify 0 0.0 0 0.0 0.000 245: 245: reduced problem: 245: reduced rows: 77 245: reduced columns: 750 245: reduced int. columns: 0 245: reduced cont. columns: 750 245: reduced nonzeros: 2378 245: 245: presolving finished after 0.104 seconds 245: 245: Equilibrium scaling LP (persistent) 242: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 242: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 242: 242: External libraries: 242: Boost 1.83.0 (https://www.boost.org/) 242: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 242: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 242: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 242: 242: reading took 0.0936 seconds 242: Numerical Statistics: 242: Matrix range [1e-03,4e+02] 242: Objective range [2e-04,5e+03] 242: Bounds range [0e+00,0e+00] 242: RHS range [1e-02,4e+01] 242: Dynamism Variables: 4e+03 242: Dynamism Rows : 4e+02 242: set presolve.componentsmaxint = -1 242: set presolve.detectlindep = 0 242: set doubletoneq.enabled = 0 242: set dualinfer.enabled = 0 242: set substitution.enabled = 0 242: set sparsify.enabled = 0 242: set calculate_basis_for_dual = 0 242: 242: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/scrs8.mps with dual-postsolve activated 242: rows: 490 242: columns: 1169 242: int. columns: 0 242: cont. columns: 1169 242: nonzeros: 3182 242: 242: round 0 ( Trivial ): 10 del cols, 16 del rows, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 242: round 1 ( Fast ): 17 del cols, 23 del rows, 566 chg bounds, 0 chg sides, 0 chg coeffs, 1100 tsx applied, 0 tsx conflicts 242: round 2 ( Fast ): 31 del cols, 36 del rows, 631 chg bounds, 0 chg sides, 0 chg coeffs, 1208 tsx applied, 0 tsx conflicts 242: round 3 ( Medium ): 112 del cols, 55 del rows, 658 chg bounds, 63 chg sides, 62 chg coeffs, 1333 tsx applied, 156 tsx conflicts 242: round 4 ( Medium ): 125 del cols, 59 del rows, 681 chg bounds, 73 chg sides, 72 chg coeffs, 1394 tsx applied, 168 tsx conflicts 242: round 5 (Exhaustive): 127 del cols, 62 del rows, 703 chg bounds, 73 chg sides, 72 chg coeffs, 1442 tsx applied, 170 tsx conflicts 242: round 6 ( Final ): 129 del cols, 65 del rows, 725 chg bounds, 73 chg sides, 72 chg coeffs, 1490 tsx applied, 172 tsx conflicts 242: presolved 6 rounds: 129 del cols, 65 del rows, 725 chg bounds, 73 chg sides, 72 chg coeffs, 1490 tsx applied, 172 tsx conflicts 242: 242: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 242: colsingleton 6 0.0 0 0.0 0.000 242: coefftightening 0 0.0 0 0.0 0.000 242: propagation 6 100.0 1394 100.0 0.031 242: fixcontinuous 2 0.0 0 0.0 0.001 242: simpleprobing 0 0.0 0 0.0 0.000 242: parallelrows 2 0.0 0 0.0 0.031 242: parallelcols 2 0.0 0 0.0 0.045 242: stuffing 4 100.0 259 35.5 0.002 242: dualfix 4 100.0 9 44.4 0.048 242: simplifyineq 0 0.0 0 0.0 0.000 242: doubletoneq 0 0.0 0 0.0 0.000 242: implint 0 0.0 0 0.0 0.000 242: domcol 1 0.0 0 0.0 0.085 242: dualinfer 0 0.0 0 0.0 0.000 242: probing 0 0.0 0 0.0 0.000 241: L | 0.1 | 999 | 9 | 4.73e+03 | 2.14e+02 | 30 | 8.81444029e+02 244: E | 0.0 | 106 | 6 | 0.00e+00 | 3.32e+00 | 8 | 8.66666667e+00 244: E | 0.0 | 109 | 7 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 244: --- unscaling internal solution 244: --- unsimplifying solution and basis 244: --- unscaling external solution 244: --- verifying computed solution 244: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 244: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 244: --- unscaling external solution 244: --- verifying computed solution 241: E | 0.1 | 1113 | 11 | 0.00e+00 | 1.77e+01 | 4 | 9.04883324e+02 245: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 245: Reduced LP has 77 rows 750 columns 2378 nonzeros 245: Equilibrium scaling LP 245: type | time | iters | facts | shift | viol sum | viol num | obj value 245: L | 0.0 | 0 | 3 | 1.52e+01 | 1.00e+00 | 1 | 0.00000000e+00 242: substitution 0 0.0 0 0.0 0.000 242: sparsify 0 0.0 0 0.0 0.000 242: 242: reduced problem: 242: reduced rows: 425 242: reduced columns: 1040 242: reduced int. columns: 0 242: reduced cont. columns: 1040 242: reduced nonzeros: 2889 242: 242: presolving finished after 0.342 seconds 242: 242: Equilibrium scaling LP (persistent) 241: E | 0.1 | 1126 | 12 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 241: --- unscaling internal solution 241: --- unsimplifying solution and basis 241: --- unscaling external solution 241: --- verifying computed solution 241: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 241: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 241: --- unscaling external solution 241: --- verifying computed solution 245: E | 0.0 | 107 | 5 | 0.00e+00 | 2.58e+00 | 7 | 8.66666667e+00 245: E | 0.0 | 110 | 6 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 245: --- unscaling internal solution 245: --- unsimplifying solution and basis 245: --- unscaling external solution 245: --- verifying computed solution 245: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 245: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 8.66666667e+00 245: --- unscaling external solution 245: --- verifying computed solution 244: 244: SoPlex status : problem is solved [optimal] 244: Solving time (sec) : 0.02 244: Iterations : 109 244: Objective value : 8.66666667e+00 244: 244: Solution passed validation 244: 244: postsolve finished after 0.033 seconds 244: feasible: true 244: objective value: 8.66666667433337 244: 244: violations: 244: bounds: 0 244: constraints: 0 244: integrality: 0 244: 244: validation: SUCCESS 244: Solving time 0.185 seconds 244: 244: solving finished after 0.185 seconds 242: Simplifier removed 43 rows, 32 columns, 30 nonzeros, 18 col bounds, 16 row bounds 242: Reduced LP has 382 rows 1008 columns 2743 nonzeros 242: Equilibrium scaling LP 242/287 Test #244: q-solve-scsd1.mps-lp_presolvers_without_basis.set .......................................... Passed 0.35 sec test 246 Start 246: d-solve-seba.mps-lp_presolvers_without_basis.set 246: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/seba.mps" "-o" "0.157116e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 246: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 246: Test timeout computed to be: 10000000 242: type | time | iters | facts | shift | viol sum | viol num | obj value 242: L | 0.0 | 0 | 3 | 4.73e+03 | 5.16e+02 | 49 | -6.42519385e+02 242: L | 0.0 | 199 | 3 | 4.73e+03 | 1.12e+02 | 49 | 2.91235969e+02 245: 245: SoPlex status : problem is solved [optimal] 245: Solving time (sec) : 0.02 245: Iterations : 110 245: Objective value : 8.66666667e+00 245: 245: Solution passed validation 245: 245: postsolve finished after 0.048 seconds 245: feasible: true 245: objective value: 8.66666667433336 245: 245: violations: 245: bounds: 0 245: constraints: 0 245: integrality: 0 245: 245: validation: SUCCESS 245: Solving time 0.225 seconds 245: 245: solving finished after 0.225 seconds 243/287 Test #245: r-solve-scsd1.mps-lp_presolvers_without_basis.set .......................................... Passed 0.39 sec test 247 Start 247: q-solve-seba.mps-lp_presolvers_without_basis.set 247: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/seba.mps" "-o" "0.157116e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 247: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 247: Test timeout computed to be: 10000000 242: L | 0.0 | 399 | 4 | 4.73e+03 | 7.03e+01 | 68 | 4.98638373e+02 241: 241: SoPlex status : problem is solved [optimal] 241: Solving time (sec) : 0.16 241: Iterations : 1126 241: Objective value : 9.04296954e+02 241: 241: Solution passed validation 241: 241: postsolve finished after 0.081 seconds 241: feasible: true 241: objective value: 904.296953800791 241: 241: violations: 241: bounds: 0 241: constraints: 7.32747196252603e-15 241: integrality: 0 241: 241: validation: SUCCESS 241: Solving time 0.685 seconds 241: 241: solving finished after 0.685 seconds 244/287 Test #241: q-solve-scrs8.mps-lp_presolvers_without_basis.set .......................................... Passed 0.85 sec test 248 Start 248: r-solve-seba.mps-lp_presolvers_without_basis.set 248: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/seba.mps" "-o" "0.157116e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 248: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 248: Test timeout computed to be: 10000000 242: L | 0.1 | 599 | 6 | 4.73e+03 | 2.00e+02 | 68 | 7.06630452e+02 246: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 246: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 246: 246: External libraries: 246: Boost 1.83.0 (https://www.boost.org/) 246: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 246: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 246: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 246: 246: reading took 0.0639 seconds 246: Numerical Statistics: 246: Matrix range [1e+00,2e+02] 246: Objective range [2e-03,5e+02] 246: Bounds range [3e-02,1e+03] 246: RHS range [2e+00,9e+01] 246: Dynamism Variables: 2e+02 246: Dynamism Rows : 2e+02 246: set presolve.componentsmaxint = -1 246: set presolve.detectlindep = 0 246: set doubletoneq.enabled = 0 246: set dualinfer.enabled = 0 246: set substitution.enabled = 0 246: set sparsify.enabled = 0 246: set calculate_basis_for_dual = 0 246: 246: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/seba.mps with dual-postsolve activated 246: rows: 515 246: columns: 1028 246: int. columns: 0 246: cont. columns: 1028 246: nonzeros: 4352 246: 246: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 246: round 1 ( Fast ): 104 del cols, 52 del rows, 135 chg bounds, 0 chg sides, 0 chg coeffs, 270 tsx applied, 0 tsx conflicts 246: round 2 ( Fast ): 130 del cols, 65 del rows, 491 chg bounds, 0 chg sides, 0 chg coeffs, 982 tsx applied, 0 tsx conflicts 246: round 3 ( Fast ): 132 del cols, 66 del rows, 584 chg bounds, 0 chg sides, 0 chg coeffs, 1168 tsx applied, 0 tsx conflicts 246: round 4 ( Medium ): 465 del cols, 67 del rows, 602 chg bounds, 331 chg sides, 331 chg coeffs, 1536 tsx applied, 1002 tsx conflicts 246: round 5 ( Medium ): 796 del cols, 398 del rows, 933 chg bounds, 331 chg sides, 331 chg coeffs, 3522 tsx applied, 1002 tsx conflicts 246: round 6 ( Medium ): 882 del cols, 398 del rows, 933 chg bounds, 417 chg sides, 417 chg coeffs, 3608 tsx applied, 1088 tsx conflicts 246: round 7 ( Medium ): 968 del cols, 484 del rows, 1019 chg bounds, 417 chg sides, 417 chg coeffs, 4210 tsx applied, 1088 tsx conflicts 246: round 8 ( Medium ): 986 del cols, 484 del rows, 1019 chg bounds, 435 chg sides, 435 chg coeffs, 4228 tsx applied, 1106 tsx conflicts 246: round 9 ( Medium ): 1004 del cols, 502 del rows, 1037 chg bounds, 435 chg sides, 435 chg coeffs, 4390 tsx applied, 1106 tsx conflicts 246: round 10 ( Medium ): 1008 del cols, 502 del rows, 1037 chg bounds, 439 chg sides, 439 chg coeffs, 4394 tsx applied, 1110 tsx conflicts 246: round 11 ( Medium ): 1012 del cols, 506 del rows, 1041 chg bounds, 439 chg sides, 439 chg coeffs, 4442 tsx applied, 1110 tsx conflicts 246: round 12 (Exhaustive): 1020 del cols, 506 del rows, 1049 chg bounds, 439 chg sides, 439 chg coeffs, 4450 tsx applied, 1110 tsx conflicts 246: round 13 ( Fast ): 1020 del cols, 513 del rows, 1057 chg bounds, 439 chg sides, 439 chg coeffs, 4454 tsx applied, 1110 tsx conflicts 246: round 14 (Exhaustive): 1020 del cols, 513 del rows, 1057 chg bounds, 439 chg sides, 439 chg coeffs, 4454 tsx applied, 1110 tsx conflicts 246: round 15 ( Final ): Unchanged 246: presolved 15 rounds: 1020 del cols, 513 del rows, 1057 chg bounds, 439 chg sides, 439 chg coeffs, 4454 tsx applied, 1110 tsx conflicts 246: 246: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 246: colsingleton 15 0.0 0 0.0 0.000 246: coefftightening 0 0.0 0 0.0 0.000 246: propagation 15 33.3 1208 100.0 0.002 246: fixcontinuous 4 0.0 0 0.0 0.000 246: simpleprobing 0 0.0 0 0.0 0.000 246: parallelrows 3 0.0 0 0.0 0.001 246: parallelcols 3 0.0 0 0.0 0.001 246: stuffing 10 80.0 4011 72.4 0.005 246: dualfix 7 42.9 337 99.4 0.000 246: simplifyineq 0 0.0 0 0.0 0.000 246: doubletoneq 0 0.0 0 0.0 0.000 246: implint 0 0.0 0 0.0 0.000 246: domcol 2 50.0 8 100.0 0.000 246: dualinfer 0 0.0 0 0.0 0.000 246: probing 0 0.0 0 0.0 0.000 246: substitution 0 0.0 0 0.0 0.000 246: sparsify 0 0.0 0 0.0 0.000 246: 246: reduced problem: 246: reduced rows: 2 246: reduced columns: 8 246: reduced int. columns: 0 246: reduced cont. columns: 8 246: reduced nonzeros: 11 246: 246: presolving finished after 0.037 seconds 246: 246: Equilibrium scaling LP (persistent) 246: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 246: Reduced LP has 2 rows 8 columns 11 nonzeros 246: Equilibrium scaling LP 246: type | time | iters | facts | shift | viol sum | viol num | obj value 246: L | 0.0 | 0 | 3 | 0.00e+00 | 4.75e+01 | 2 | 1.09411000e+04 246: L | 0.0 | 1 | 4 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 246: --- unscaling internal solution 246: --- unsimplifying solution and basis 246: --- unscaling external solution 246: --- verifying computed solution 246: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 246: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 246: --- unscaling external solution 246: --- verifying computed solution 246: 246: SoPlex status : problem is solved [optimal] 246: Solving time (sec) : 0.00 246: Iterations : 1 246: Objective value : 1.57116000e+04 246: 246: Solution passed validation 246: 246: postsolve finished after 0.001 seconds 246: feasible: true 246: objective value: 15711.6 246: 246: violations: 246: bounds: 0 246: constraints: 0 246: integrality: 0 246: 246: validation: SUCCESS 246: Solving time 0.040 seconds 246: 246: solving finished after 0.040 seconds 245/287 Test #246: d-solve-seba.mps-lp_presolvers_without_basis.set ........................................... Passed 0.16 sec test 249 Start 249: d-solve-share1b.mps-lp_presolvers_without_basis.set 249: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share1b.mps" "-o" "-0.7658931857918568112797274346007e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 249: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 249: Test timeout computed to be: 10000000 242: L | 0.1 | 799 | 8 | 4.73e+03 | 5.51e+02 | 55 | 7.98306225e+02 249: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 249: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 249: 249: External libraries: 249: Boost 1.83.0 (https://www.boost.org/) 249: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 249: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 249: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 249: 249: reading took 0.00939 seconds 249: Numerical Statistics: 249: Matrix range [1e-01,1e+03] 249: Objective range [2e-03,1e+02] 249: Bounds range [0e+00,0e+00] 249: RHS range [1e-04,3e+03] 249: Dynamism Variables: 1e+03 249: Dynamism Rows : 2e+02 249: set presolve.componentsmaxint = -1 249: set presolve.detectlindep = 0 249: set doubletoneq.enabled = 0 249: set dualinfer.enabled = 0 249: set substitution.enabled = 0 249: set sparsify.enabled = 0 249: set calculate_basis_for_dual = 0 249: 249: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share1b.mps with dual-postsolve activated 249: rows: 117 249: columns: 225 249: int. columns: 0 249: cont. columns: 225 249: nonzeros: 1151 249: 249: round 0 ( Trivial ): 5 del cols, 7 del rows, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 249: round 1 ( Fast ): 5 del cols, 7 del rows, 158 chg bounds, 0 chg sides, 0 chg coeffs, 394 tsx applied, 0 tsx conflicts 249: round 2 ( Medium ): 22 del cols, 10 del rows, 160 chg bounds, 14 chg sides, 14 chg coeffs, 415 tsx applied, 17 tsx conflicts 249: round 3 (Exhaustive): 22 del cols, 10 del rows, 160 chg bounds, 14 chg sides, 14 chg coeffs, 415 tsx applied, 17 tsx conflicts 249: round 4 ( Final ): Unchanged 249: presolved 4 rounds: 22 del cols, 10 del rows, 161 chg bounds, 14 chg sides, 14 chg coeffs, 416 tsx applied, 17 tsx conflicts 249: 249: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 249: colsingleton 4 0.0 0 0.0 0.000 249: coefftightening 0 0.0 0 0.0 0.000 249: propagation 4 50.0 398 100.0 0.000 249: fixcontinuous 2 0.0 0 0.0 0.000 249: simpleprobing 0 0.0 0 0.0 0.000 249: parallelrows 1 0.0 0 0.0 0.000 249: parallelcols 1 0.0 0 0.0 0.000 249: stuffing 2 50.0 34 50.0 0.000 249: dualfix 2 50.0 1 100.0 0.000 249: simplifyineq 0 0.0 0 0.0 0.000 249: doubletoneq 0 0.0 0 0.0 0.000 249: implint 0 0.0 0 0.0 0.000 249: domcol 1 0.0 0 0.0 0.000 249: dualinfer 0 0.0 0 0.0 0.000 249: probing 0 0.0 0 0.0 0.000 249: substitution 0 0.0 0 0.0 0.000 249: sparsify 0 0.0 0 0.0 0.000 249: 249: reduced problem: 249: reduced rows: 107 249: reduced columns: 203 249: reduced int. columns: 0 249: reduced cont. columns: 203 249: reduced nonzeros: 1098 249: 249: presolving finished after 0.007 seconds 249: 249: Equilibrium scaling LP (persistent) 249: Simplifier removed 11 rows, 9 columns, 53 nonzeros, 20 col bounds, 117 row bounds 249: Reduced LP has 96 rows 194 columns 1045 nonzeros 249: Equilibrium scaling LP 249: type | time | iters | facts | shift | viol sum | viol num | obj value 249: L | 0.0 | 0 | 3 | 1.25e+02 | 3.09e+04 | 74 | 9.61323388e+03 249: E | 0.0 | 155 | 5 | 0.00e+00 | 7.34e+02 | 55 | -3.46200132e+04 249: E | 0.0 | 196 | 5 | 0.00e+00 | 5.04e+03 | 55 | -6.86925255e+04 249: E | 0.0 | 228 | 6 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 249: --- unscaling internal solution 249: --- unsimplifying solution and basis 249: --- unscaling external solution 249: --- verifying computed solution 249: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 249: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 249: --- unscaling external solution 249: --- verifying computed solution 249: 249: SoPlex status : problem is solved [optimal] 249: Solving time (sec) : 0.02 249: Iterations : 228 249: Objective value : -7.65893186e+04 249: 249: Solution passed validation 249: 249: postsolve finished after 0.000 seconds 249: feasible: true 249: objective value: -76589.3185791856 249: 249: violations: 249: bounds: 0 249: constraints: 0 249: integrality: 0 249: 249: validation: SUCCESS 249: Solving time 0.039 seconds 249: 249: solving finished after 0.039 seconds 246/287 Test #249: d-solve-share1b.mps-lp_presolvers_without_basis.set ........................................ Passed 0.10 sec test 250 Start 250: q-solve-share1b.mps-lp_presolvers_without_basis.set 250: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share1b.mps" "-o" "-0.7658931857918568112797274346007e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 250: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 250: Test timeout computed to be: 10000000 242: L | 0.1 | 999 | 9 | 4.73e+03 | 1.54e+02 | 50 | 8.42678377e+02 250: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 250: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 250: 250: External libraries: 250: Boost 1.83.0 (https://www.boost.org/) 250: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 250: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 250: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 250: 250: reading took 0.0122 seconds 250: Numerical Statistics: 250: Matrix range [1e-01,1e+03] 250: Objective range [2e-03,1e+02] 250: Bounds range [0e+00,0e+00] 250: RHS range [1e-04,3e+03] 250: Dynamism Variables: 1e+03 250: Dynamism Rows : 2e+02 250: set presolve.componentsmaxint = -1 250: set presolve.detectlindep = 0 250: set doubletoneq.enabled = 0 250: set dualinfer.enabled = 0 250: set substitution.enabled = 0 250: set sparsify.enabled = 0 250: set calculate_basis_for_dual = 0 250: 250: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share1b.mps with dual-postsolve activated 250: rows: 117 250: columns: 225 250: int. columns: 0 250: cont. columns: 225 250: nonzeros: 1151 250: 250: round 0 ( Trivial ): 5 del cols, 7 del rows, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 250: round 1 ( Fast ): 5 del cols, 7 del rows, 158 chg bounds, 0 chg sides, 0 chg coeffs, 394 tsx applied, 0 tsx conflicts 250: round 2 ( Medium ): 22 del cols, 10 del rows, 160 chg bounds, 14 chg sides, 14 chg coeffs, 415 tsx applied, 17 tsx conflicts 250: round 3 (Exhaustive): 22 del cols, 10 del rows, 160 chg bounds, 14 chg sides, 14 chg coeffs, 415 tsx applied, 17 tsx conflicts 250: round 4 ( Final ): Unchanged 250: presolved 4 rounds: 22 del cols, 10 del rows, 161 chg bounds, 14 chg sides, 14 chg coeffs, 416 tsx applied, 17 tsx conflicts 250: 250: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 250: colsingleton 4 0.0 0 0.0 0.000 250: coefftightening 0 0.0 0 0.0 0.000 250: propagation 4 50.0 398 100.0 0.004 250: fixcontinuous 2 0.0 0 0.0 0.000 250: simpleprobing 0 0.0 0 0.0 0.000 250: parallelrows 1 0.0 0 0.0 0.001 250: parallelcols 1 0.0 0 0.0 0.001 250: stuffing 2 50.0 34 50.0 0.000 250: dualfix 2 50.0 1 100.0 0.001 250: simplifyineq 0 0.0 0 0.0 0.000 250: doubletoneq 0 0.0 0 0.0 0.000 250: implint 0 0.0 0 0.0 0.000 250: domcol 1 0.0 0 0.0 0.005 250: dualinfer 0 0.0 0 0.0 0.000 250: probing 0 0.0 0 0.0 0.000 250: substitution 0 0.0 0 0.0 0.000 250: sparsify 0 0.0 0 0.0 0.000 250: 250: reduced problem: 250: reduced rows: 107 250: reduced columns: 203 250: reduced int. columns: 0 250: reduced cont. columns: 203 250: reduced nonzeros: 1098 250: 250: presolving finished after 0.023 seconds 250: 250: Equilibrium scaling LP (persistent) 250: Simplifier removed 11 rows, 9 columns, 53 nonzeros, 20 col bounds, 117 row bounds 250: Reduced LP has 96 rows 194 columns 1045 nonzeros 250: Equilibrium scaling LP 250: type | time | iters | facts | shift | viol sum | viol num | obj value 250: L | 0.0 | 0 | 3 | 1.25e+02 | 3.09e+04 | 74 | 9.61323388e+03 242: L | 0.1 | 1199 | 10 | 4.73e+03 | 7.57e-01 | 44 | 9.06616901e+02 250: E | 0.0 | 155 | 5 | 0.00e+00 | 7.34e+02 | 55 | -3.46200132e+04 250: E | 0.0 | 197 | 5 | 0.00e+00 | 4.41e+03 | 55 | -6.68365516e+04 242: E | 0.1 | 1211 | 12 | 0.00e+00 | 1.77e+01 | 4 | 9.04883324e+02 250: E | 0.0 | 232 | 6 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 250: --- unscaling internal solution 250: --- unsimplifying solution and basis 250: --- unscaling external solution 250: --- verifying computed solution 250: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 250: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 250: --- unscaling external solution 250: --- verifying computed solution 242: E | 0.1 | 1225 | 13 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 242: --- unscaling internal solution 242: --- unsimplifying solution and basis 242: --- unscaling external solution 242: --- verifying computed solution 242: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 242: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 9.04296954e+02 242: --- unscaling external solution 242: --- verifying computed solution 250: 250: SoPlex status : problem is solved [optimal] 250: Solving time (sec) : 0.02 250: Iterations : 232 250: Objective value : -7.65893186e+04 250: 250: Solution passed validation 250: 250: postsolve finished after 0.018 seconds 250: feasible: true 250: objective value: -76589.3185791856 250: 250: violations: 250: bounds: 0 250: constraints: 0 250: integrality: 0 250: 250: validation: SUCCESS 250: Solving time 0.083 seconds 250: 250: solving finished after 0.083 seconds 247/287 Test #250: q-solve-share1b.mps-lp_presolvers_without_basis.set ........................................ Passed 0.13 sec test 251 Start 251: r-solve-share1b.mps-lp_presolvers_without_basis.set 251: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share1b.mps" "-o" "-0.7658931857918568112797274346007e5" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 251: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 251: Test timeout computed to be: 10000000 247: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 247: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 247: 247: External libraries: 247: Boost 1.83.0 (https://www.boost.org/) 247: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 247: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 247: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 247: 247: reading took 0.0958 seconds 247: Numerical Statistics: 247: Matrix range [1e+00,2e+02] 247: Objective range [2e-03,5e+02] 247: Bounds range [3e-02,1e+03] 247: RHS range [2e+00,9e+01] 247: Dynamism Variables: 2e+02 247: Dynamism Rows : 2e+02 247: set presolve.componentsmaxint = -1 247: set presolve.detectlindep = 0 247: set doubletoneq.enabled = 0 247: set dualinfer.enabled = 0 247: set substitution.enabled = 0 247: set sparsify.enabled = 0 247: set calculate_basis_for_dual = 0 247: 247: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/seba.mps with dual-postsolve activated 247: rows: 515 247: columns: 1028 247: int. columns: 0 247: cont. columns: 1028 247: nonzeros: 4352 247: 247: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 247: round 1 ( Fast ): 104 del cols, 52 del rows, 135 chg bounds, 0 chg sides, 0 chg coeffs, 270 tsx applied, 0 tsx conflicts 247: round 2 ( Fast ): 130 del cols, 65 del rows, 491 chg bounds, 0 chg sides, 0 chg coeffs, 982 tsx applied, 0 tsx conflicts 247: round 3 ( Fast ): 132 del cols, 66 del rows, 584 chg bounds, 0 chg sides, 0 chg coeffs, 1168 tsx applied, 0 tsx conflicts 247: round 4 ( Medium ): 465 del cols, 67 del rows, 602 chg bounds, 331 chg sides, 331 chg coeffs, 1536 tsx applied, 1002 tsx conflicts 247: round 5 ( Medium ): 796 del cols, 398 del rows, 933 chg bounds, 331 chg sides, 331 chg coeffs, 3522 tsx applied, 1002 tsx conflicts 247: round 6 ( Medium ): 882 del cols, 398 del rows, 933 chg bounds, 417 chg sides, 417 chg coeffs, 3608 tsx applied, 1088 tsx conflicts 247: round 7 ( Medium ): 968 del cols, 484 del rows, 1019 chg bounds, 417 chg sides, 417 chg coeffs, 4210 tsx applied, 1088 tsx conflicts 247: round 8 ( Medium ): 986 del cols, 484 del rows, 1019 chg bounds, 435 chg sides, 435 chg coeffs, 4228 tsx applied, 1106 tsx conflicts 247: round 9 ( Medium ): 1004 del cols, 502 del rows, 1037 chg bounds, 435 chg sides, 435 chg coeffs, 4390 tsx applied, 1106 tsx conflicts 247: round 10 ( Medium ): 1008 del cols, 502 del rows, 1037 chg bounds, 439 chg sides, 439 chg coeffs, 4394 tsx applied, 1110 tsx conflicts 247: round 11 ( Medium ): 1012 del cols, 506 del rows, 1041 chg bounds, 439 chg sides, 439 chg coeffs, 4442 tsx applied, 1110 tsx conflicts 247: round 12 (Exhaustive): 1020 del cols, 506 del rows, 1049 chg bounds, 439 chg sides, 439 chg coeffs, 4450 tsx applied, 1110 tsx conflicts 247: round 13 ( Fast ): 1020 del cols, 513 del rows, 1057 chg bounds, 439 chg sides, 439 chg coeffs, 4454 tsx applied, 1110 tsx conflicts 247: round 14 (Exhaustive): 1020 del cols, 513 del rows, 1057 chg bounds, 439 chg sides, 439 chg coeffs, 4454 tsx applied, 1110 tsx conflicts 247: round 15 ( Final ): Unchanged 247: presolved 15 rounds: 1020 del cols, 513 del rows, 1057 chg bounds, 439 chg sides, 439 chg coeffs, 4454 tsx applied, 1110 tsx conflicts 247: 247: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 247: colsingleton 15 0.0 0 0.0 0.000 247: coefftightening 0 0.0 0 0.0 0.000 247: propagation 15 33.3 1208 100.0 0.063 247: fixcontinuous 4 0.0 0 0.0 0.000 247: simpleprobing 0 0.0 0 0.0 0.000 247: parallelrows 3 0.0 0 0.0 0.002 247: parallelcols 3 0.0 0 0.0 0.012 247: stuffing 10 80.0 4011 72.4 0.088 247: dualfix 7 42.9 337 99.4 0.005 247: simplifyineq 0 0.0 0 0.0 0.000 247: doubletoneq 0 0.0 0 0.0 0.000 247: implint 0 0.0 0 0.0 0.000 247: domcol 2 50.0 8 100.0 0.001 247: dualinfer 0 0.0 0 0.0 0.000 247: probing 0 0.0 0 0.0 0.000 247: substitution 0 0.0 0 0.0 0.000 247: sparsify 0 0.0 0 0.0 0.000 247: 247: reduced problem: 247: reduced rows: 2 247: reduced columns: 8 247: reduced int. columns: 0 247: reduced cont. columns: 8 247: reduced nonzeros: 11 247: 247: presolving finished after 0.369 seconds 247: 247: Equilibrium scaling LP (persistent) 247: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 247: Reduced LP has 2 rows 8 columns 11 nonzeros 247: Equilibrium scaling LP 247: type | time | iters | facts | shift | viol sum | viol num | obj value 247: L | 0.0 | 0 | 3 | 0.00e+00 | 4.75e+01 | 2 | 1.09411000e+04 247: L | 0.0 | 1 | 4 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 247: --- unscaling internal solution 247: --- unsimplifying solution and basis 247: --- unscaling external solution 247: --- verifying computed solution 247: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 247: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 247: --- unscaling external solution 247: --- verifying computed solution 251: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 251: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 251: 251: External libraries: 251: Boost 1.83.0 (https://www.boost.org/) 251: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 251: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 251: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 251: 251: reading took 0.028 seconds 251: Numerical Statistics: 251: Matrix range [1e-01,1e+03] 251: Objective range [2e-03,1e+02] 251: Bounds range [0e+00,0e+00] 251: RHS range [1e-04,3e+03] 251: Dynamism Variables: 1e+03 251: Dynamism Rows : 2e+02 251: set presolve.componentsmaxint = -1 251: set presolve.detectlindep = 0 251: set doubletoneq.enabled = 0 251: set dualinfer.enabled = 0 251: set substitution.enabled = 0 251: set sparsify.enabled = 0 251: set calculate_basis_for_dual = 0 251: 251: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share1b.mps with dual-postsolve activated 251: rows: 117 251: columns: 225 251: int. columns: 0 251: cont. columns: 225 251: nonzeros: 1151 251: 251: round 0 ( Trivial ): 5 del cols, 7 del rows, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 251: round 1 ( Fast ): 5 del cols, 7 del rows, 158 chg bounds, 0 chg sides, 0 chg coeffs, 394 tsx applied, 0 tsx conflicts 251: round 2 ( Medium ): 22 del cols, 10 del rows, 160 chg bounds, 14 chg sides, 14 chg coeffs, 415 tsx applied, 17 tsx conflicts 251: round 3 (Exhaustive): 22 del cols, 10 del rows, 160 chg bounds, 14 chg sides, 14 chg coeffs, 415 tsx applied, 17 tsx conflicts 251: round 4 ( Final ): Unchanged 251: presolved 4 rounds: 22 del cols, 10 del rows, 161 chg bounds, 14 chg sides, 14 chg coeffs, 416 tsx applied, 17 tsx conflicts 251: 251: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 251: colsingleton 4 0.0 0 0.0 0.016 251: coefftightening 0 0.0 0 0.0 0.000 251: propagation 4 50.0 398 100.0 0.013 251: fixcontinuous 2 0.0 0 0.0 0.000 251: simpleprobing 0 0.0 0 0.0 0.000 251: parallelrows 1 0.0 0 0.0 0.008 251: parallelcols 1 0.0 0 0.0 0.003 251: stuffing 2 50.0 34 50.0 0.001 251: dualfix 2 50.0 1 100.0 0.002 251: simplifyineq 0 0.0 0 0.0 0.000 251: doubletoneq 0 0.0 0 0.0 0.000 251: implint 0 0.0 0 0.0 0.000 251: domcol 1 0.0 0 0.0 0.016 251: dualinfer 0 0.0 0 0.0 0.000 251: probing 0 0.0 0 0.0 0.000 251: substitution 0 0.0 0 0.0 0.000 251: sparsify 0 0.0 0 0.0 0.000 251: 251: reduced problem: 251: reduced rows: 107 251: reduced columns: 203 251: reduced int. columns: 0 251: reduced cont. columns: 203 251: reduced nonzeros: 1098 251: 251: presolving finished after 0.089 seconds 251: 251: Equilibrium scaling LP (persistent) 251: Simplifier removed 11 rows, 9 columns, 53 nonzeros, 20 col bounds, 117 row bounds 251: Reduced LP has 96 rows 194 columns 1045 nonzeros 251: Equilibrium scaling LP 251: type | time | iters | facts | shift | viol sum | viol num | obj value 251: L | 0.0 | 0 | 3 | 1.25e+02 | 3.09e+04 | 74 | 9.61323388e+03 251: E | 0.0 | 155 | 5 | 0.00e+00 | 7.34e+02 | 55 | -3.46200132e+04 251: E | 0.0 | 196 | 5 | 0.00e+00 | 5.04e+03 | 55 | -6.86925255e+04 251: E | 0.0 | 229 | 6 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 251: --- unscaling internal solution 251: --- unsimplifying solution and basis 251: --- unscaling external solution 251: --- verifying computed solution 251: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 251: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -7.65893186e+04 242: 242: SoPlex status : problem is solved [optimal] 242: Solving time (sec) : 0.16 242: Iterations : 1225 242: Objective value : 9.04296954e+02 242: 242: Solution passed validation 242: 242: postsolve finished after 0.158 seconds 242: feasible: true 242: objective value: 904.296953800791 242: 242: violations: 242: bounds: 0 242: constraints: 4.77395900588817e-15 242: integrality: 0 242: 242: validation: SUCCESS 242: Solving time 0.969 seconds 242: 242: solving finished after 0.969 seconds 248/287 Test #242: r-solve-scrs8.mps-lp_presolvers_without_basis.set .......................................... Passed 1.20 sec 251: --- unscaling external solution 251: --- verifying computed solution test 252 Start 252: d-solve-share2b.mps-lp_presolvers_without_basis.set 252: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share2b.mps" "-o" "-0.41573224074141948654519910873841e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 252: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 252: Test timeout computed to be: 10000000 251: 251: SoPlex status : problem is solved [optimal] 251: Solving time (sec) : 0.00 251: Iterations : 229 251: Objective value : -7.65893186e+04 251: 251: Solution passed validation 251: 251: postsolve finished after 0.013 seconds 251: feasible: true 251: objective value: -76589.3185791856 251: 251: violations: 251: bounds: 0 251: constraints: 0 251: integrality: 0 251: 251: validation: SUCCESS 251: Solving time 0.133 seconds 251: 251: solving finished after 0.133 seconds 249/287 Test #251: r-solve-share1b.mps-lp_presolvers_without_basis.set ........................................ Passed 0.25 sec test 253 Start 253: q-solve-share2b.mps-lp_presolvers_without_basis.set 253: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share2b.mps" "-o" "-0.41573224074141948654519910873841e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 253: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 253: Test timeout computed to be: 10000000 252: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 252: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 252: 252: External libraries: 252: Boost 1.83.0 (https://www.boost.org/) 252: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 252: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 252: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 252: 252: reading took 0.0114 seconds 252: Numerical Statistics: 252: Matrix range [1e-02,1e+02] 252: Objective range [3e-02,4e+00] 252: Bounds range [0e+00,0e+00] 252: RHS range [1e+00,2e+01] 252: Dynamism Variables: 9e+03 252: Dynamism Rows : 1e+02 252: set presolve.componentsmaxint = -1 252: set presolve.detectlindep = 0 252: set doubletoneq.enabled = 0 252: set dualinfer.enabled = 0 252: set substitution.enabled = 0 252: set sparsify.enabled = 0 252: set calculate_basis_for_dual = 0 252: 252: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share2b.mps with dual-postsolve activated 252: rows: 96 252: columns: 79 252: int. columns: 0 252: cont. columns: 79 252: nonzeros: 694 252: 252: round 0 ( Trivial ): 0 del cols, 3 del rows, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 252: round 1 ( Fast ): 0 del cols, 3 del rows, 59 chg bounds, 0 chg sides, 0 chg coeffs, 112 tsx applied, 0 tsx conflicts 252: round 2 ( Fast ): 0 del cols, 3 del rows, 70 chg bounds, 0 chg sides, 0 chg coeffs, 142 tsx applied, 0 tsx conflicts 252: round 3 ( Fast ): 0 del cols, 3 del rows, 79 chg bounds, 0 chg sides, 0 chg coeffs, 168 tsx applied, 0 tsx conflicts 252: round 4 (Exhaustive): 0 del cols, 3 del rows, 86 chg bounds, 0 chg sides, 0 chg coeffs, 190 tsx applied, 0 tsx conflicts 252: round 5 ( Final ): 0 del cols, 3 del rows, 91 chg bounds, 0 chg sides, 0 chg coeffs, 204 tsx applied, 0 tsx conflicts 252: presolved 5 rounds: 0 del cols, 3 del rows, 91 chg bounds, 0 chg sides, 0 chg coeffs, 204 tsx applied, 0 tsx conflicts 252: 252: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 252: colsingleton 5 0.0 0 0.0 0.000 252: coefftightening 0 0.0 0 0.0 0.000 252: propagation 5 100.0 204 100.0 0.000 252: fixcontinuous 1 0.0 0 0.0 0.000 252: simpleprobing 0 0.0 0 0.0 0.000 252: parallelrows 1 0.0 0 0.0 0.000 252: parallelcols 1 0.0 0 0.0 0.000 252: stuffing 1 0.0 0 0.0 0.000 252: dualfix 1 0.0 0 0.0 0.000 252: simplifyineq 0 0.0 0 0.0 0.000 252: doubletoneq 0 0.0 0 0.0 0.000 252: implint 0 0.0 0 0.0 0.000 252: domcol 1 0.0 0 0.0 0.000 252: dualinfer 0 0.0 0 0.0 0.000 252: probing 0 0.0 0 0.0 0.000 252: substitution 0 0.0 0 0.0 0.000 252: sparsify 0 0.0 0 0.0 0.000 252: 252: reduced problem: 252: reduced rows: 93 252: reduced columns: 79 252: reduced int. columns: 0 252: reduced cont. columns: 79 252: reduced nonzeros: 691 252: 252: presolving finished after 0.011 seconds 252: 252: Equilibrium scaling LP (persistent) 252: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 2 col bounds, 0 row bounds 252: Reduced LP has 93 rows 79 columns 691 nonzeros 252: Equilibrium scaling LP 252: type | time | iters | facts | shift | viol sum | viol num | obj value 252: L | 0.0 | 0 | 3 | 5.70e+00 | 1.01e+03 | 41 | -9.47526172e+02 252: E | 0.0 | 95 | 4 | 0.00e+00 | 2.70e+00 | 1 | -3.74522624e+02 252: E | 0.0 | 129 | 5 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 252: --- unscaling internal solution 252: --- unsimplifying solution and basis 252: --- unscaling external solution 252: --- verifying computed solution 252: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 252: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 252: --- unscaling external solution 252: --- verifying computed solution 252: 252: SoPlex status : problem is solved [optimal] 252: Solving time (sec) : 0.00 252: Iterations : 129 252: Objective value : -4.15732241e+02 252: 252: Solution passed validation 252: 252: postsolve finished after 0.000 seconds 252: feasible: true 252: objective value: -415.732240741417 252: 252: violations: 252: bounds: 8.07434927000114e-16 252: constraints: 0 252: integrality: 0 252: 252: validation: SUCCESS 252: Solving time 0.038 seconds 252: 252: solving finished after 0.038 seconds 250/287 Test #252: d-solve-share2b.mps-lp_presolvers_without_basis.set ........................................ Passed 0.10 sec test 254 Start 254: r-solve-share2b.mps-lp_presolvers_without_basis.set 254: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share2b.mps" "-o" "-0.41573224074141948654519910873841e3" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 254: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 254: Test timeout computed to be: 10000000 247: 247: SoPlex status : problem is solved [optimal] 247: Solving time (sec) : 0.00 247: Iterations : 1 247: Objective value : 1.57116000e+04 247: 247: Solution passed validation 247: 247: postsolve finished after 0.125 seconds 247: feasible: true 247: objective value: 15711.6 247: 247: violations: 247: bounds: 0 247: constraints: 0 247: integrality: 0 247: 247: validation: SUCCESS 247: Solving time 0.517 seconds 247: 247: solving finished after 0.517 seconds 251/287 Test #247: q-solve-seba.mps-lp_presolvers_without_basis.set ........................................... Passed 0.72 sec test 255 Start 255: d-solve-shell.mps-lp_presolvers_without_basis.set 255: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/shell.mps" "-o" "0.1208825346e10" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 255: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 255: Test timeout computed to be: 10000000 253: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 253: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 253: 253: External libraries: 253: Boost 1.83.0 (https://www.boost.org/) 253: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 253: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 253: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 253: 253: reading took 0.0377 seconds 253: Numerical Statistics: 253: Matrix range [1e-02,1e+02] 253: Objective range [3e-02,4e+00] 253: Bounds range [0e+00,0e+00] 253: RHS range [1e+00,2e+01] 253: Dynamism Variables: 9e+03 253: Dynamism Rows : 1e+02 253: set presolve.componentsmaxint = -1 253: set presolve.detectlindep = 0 253: set doubletoneq.enabled = 0 253: set dualinfer.enabled = 0 253: set substitution.enabled = 0 253: set sparsify.enabled = 0 253: set calculate_basis_for_dual = 0 253: 253: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share2b.mps with dual-postsolve activated 253: rows: 96 253: columns: 79 253: int. columns: 0 253: cont. columns: 79 253: nonzeros: 694 253: 253: round 0 ( Trivial ): 0 del cols, 3 del rows, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 253: round 1 ( Fast ): 0 del cols, 3 del rows, 59 chg bounds, 0 chg sides, 0 chg coeffs, 112 tsx applied, 0 tsx conflicts 253: round 2 ( Fast ): 0 del cols, 3 del rows, 70 chg bounds, 0 chg sides, 0 chg coeffs, 142 tsx applied, 0 tsx conflicts 253: round 3 ( Fast ): 0 del cols, 3 del rows, 79 chg bounds, 0 chg sides, 0 chg coeffs, 168 tsx applied, 0 tsx conflicts 253: round 4 (Exhaustive): 0 del cols, 3 del rows, 86 chg bounds, 0 chg sides, 0 chg coeffs, 190 tsx applied, 0 tsx conflicts 253: round 5 ( Final ): 0 del cols, 3 del rows, 91 chg bounds, 0 chg sides, 0 chg coeffs, 204 tsx applied, 0 tsx conflicts 253: presolved 5 rounds: 0 del cols, 3 del rows, 91 chg bounds, 0 chg sides, 0 chg coeffs, 204 tsx applied, 0 tsx conflicts 253: 253: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 253: colsingleton 5 0.0 0 0.0 0.000 253: coefftightening 0 0.0 0 0.0 0.000 253: propagation 5 100.0 204 100.0 0.003 253: fixcontinuous 1 0.0 0 0.0 0.000 253: simpleprobing 0 0.0 0 0.0 0.000 253: parallelrows 1 0.0 0 0.0 0.000 253: parallelcols 1 0.0 0 0.0 0.000 253: stuffing 1 0.0 0 0.0 0.000 253: dualfix 1 0.0 0 0.0 0.000 253: simplifyineq 0 0.0 0 0.0 0.000 253: doubletoneq 0 0.0 0 0.0 0.000 253: implint 0 0.0 0 0.0 0.000 253: domcol 1 0.0 0 0.0 0.003 253: dualinfer 0 0.0 0 0.0 0.000 253: probing 0 0.0 0 0.0 0.000 253: substitution 0 0.0 0 0.0 0.000 253: sparsify 0 0.0 0 0.0 0.000 253: 253: reduced problem: 253: reduced rows: 93 253: reduced columns: 79 253: reduced int. columns: 0 253: reduced cont. columns: 79 253: reduced nonzeros: 691 253: 253: presolving finished after 0.038 seconds 253: 253: Equilibrium scaling LP (persistent) 253: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 2 col bounds, 0 row bounds 253: Reduced LP has 93 rows 79 columns 691 nonzeros 253: Equilibrium scaling LP 253: type | time | iters | facts | shift | viol sum | viol num | obj value 253: L | 0.0 | 0 | 3 | 5.70e+00 | 1.01e+03 | 41 | -9.47526172e+02 253: E | 0.0 | 99 | 4 | 0.00e+00 | 2.70e+00 | 1 | -3.74522624e+02 253: E | 0.0 | 120 | 5 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 253: --- unscaling internal solution 253: --- unsimplifying solution and basis 253: --- unscaling external solution 253: --- verifying computed solution 253: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 253: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 253: --- unscaling external solution 253: --- verifying computed solution 253: 253: SoPlex status : problem is solved [optimal] 253: Solving time (sec) : 0.00 253: Iterations : 120 253: Objective value : -4.15732241e+02 253: 253: Solution passed validation 253: 253: postsolve finished after 0.009 seconds 253: feasible: true 253: objective value: -415.732240741419 253: 253: violations: 253: bounds: 0 253: constraints: 0 253: integrality: 0 253: 253: validation: SUCCESS 253: Solving time 0.072 seconds 253: 253: solving finished after 0.072 seconds 252/287 Test #253: q-solve-share2b.mps-lp_presolvers_without_basis.set ........................................ Passed 0.17 sec test 256 Start 256: q-solve-shell.mps-lp_presolvers_without_basis.set 256: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/shell.mps" "-o" "0.1208825346e10" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 256: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 256: Test timeout computed to be: 10000000 254: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 254: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 254: 254: External libraries: 254: Boost 1.83.0 (https://www.boost.org/) 254: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 254: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 254: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 254: 254: reading took 0.02 seconds 254: Numerical Statistics: 254: Matrix range [1e-02,1e+02] 254: Objective range [3e-02,4e+00] 254: Bounds range [0e+00,0e+00] 254: RHS range [1e+00,2e+01] 254: Dynamism Variables: 9e+03 254: Dynamism Rows : 1e+02 254: set presolve.componentsmaxint = -1 254: set presolve.detectlindep = 0 254: set doubletoneq.enabled = 0 254: set dualinfer.enabled = 0 254: set substitution.enabled = 0 254: set sparsify.enabled = 0 254: set calculate_basis_for_dual = 0 254: 254: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/share2b.mps with dual-postsolve activated 254: rows: 96 254: columns: 79 254: int. columns: 0 254: cont. columns: 79 254: nonzeros: 694 254: 254: round 0 ( Trivial ): 0 del cols, 3 del rows, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 254: round 1 ( Fast ): 0 del cols, 3 del rows, 59 chg bounds, 0 chg sides, 0 chg coeffs, 112 tsx applied, 0 tsx conflicts 254: round 2 ( Fast ): 0 del cols, 3 del rows, 70 chg bounds, 0 chg sides, 0 chg coeffs, 142 tsx applied, 0 tsx conflicts 254: round 3 ( Fast ): 0 del cols, 3 del rows, 79 chg bounds, 0 chg sides, 0 chg coeffs, 168 tsx applied, 0 tsx conflicts 254: round 4 (Exhaustive): 0 del cols, 3 del rows, 86 chg bounds, 0 chg sides, 0 chg coeffs, 190 tsx applied, 0 tsx conflicts 254: round 5 ( Final ): 0 del cols, 3 del rows, 91 chg bounds, 0 chg sides, 0 chg coeffs, 204 tsx applied, 0 tsx conflicts 254: presolved 5 rounds: 0 del cols, 3 del rows, 91 chg bounds, 0 chg sides, 0 chg coeffs, 204 tsx applied, 0 tsx conflicts 254: 254: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 254: colsingleton 5 0.0 0 0.0 0.000 254: coefftightening 0 0.0 0 0.0 0.000 254: propagation 5 100.0 204 100.0 0.004 254: fixcontinuous 1 0.0 0 0.0 0.000 254: simpleprobing 0 0.0 0 0.0 0.000 254: parallelrows 1 0.0 0 0.0 0.002 254: parallelcols 1 0.0 0 0.0 0.005 254: stuffing 1 0.0 0 0.0 0.000 254: dualfix 1 0.0 0 0.0 0.001 254: simplifyineq 0 0.0 0 0.0 0.000 254: doubletoneq 0 0.0 0 0.0 0.000 254: implint 0 0.0 0 0.0 0.000 254: domcol 1 0.0 0 0.0 0.002 254: dualinfer 0 0.0 0 0.0 0.000 254: probing 0 0.0 0 0.0 0.000 254: substitution 0 0.0 0 0.0 0.000 254: sparsify 0 0.0 0 0.0 0.000 254: 254: reduced problem: 254: reduced rows: 93 254: reduced columns: 79 254: reduced int. columns: 0 254: reduced cont. columns: 79 254: reduced nonzeros: 691 254: 254: presolving finished after 0.063 seconds 254: 254: Equilibrium scaling LP (persistent) 254: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 2 col bounds, 0 row bounds 254: Reduced LP has 93 rows 79 columns 691 nonzeros 254: Equilibrium scaling LP 254: type | time | iters | facts | shift | viol sum | viol num | obj value 254: L | 0.0 | 0 | 3 | 5.70e+00 | 1.01e+03 | 41 | -9.47526172e+02 254: E | 0.0 | 95 | 4 | 0.00e+00 | 2.70e+00 | 1 | -3.74522624e+02 254: E | 0.0 | 129 | 5 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 254: --- unscaling internal solution 254: --- unsimplifying solution and basis 254: --- unscaling external solution 254: --- verifying computed solution 254: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 254: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | -4.15732241e+02 254: --- unscaling external solution 254: --- verifying computed solution 255: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 255: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 255: 255: External libraries: 255: Boost 1.83.0 (https://www.boost.org/) 255: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 255: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 255: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 255: 255: reading took 0.0324 seconds 255: Numerical Statistics: 255: Matrix range [1e+00,1e+00] 255: Objective range [1e+00,4e+03] 255: Bounds range [6e+00,5e+05] 255: RHS range [4e+04,5e+04] 255: Dynamism Variables: 1e+00 255: Dynamism Rows : 1e+00 255: set presolve.componentsmaxint = -1 255: set presolve.detectlindep = 0 255: set doubletoneq.enabled = 0 255: set dualinfer.enabled = 0 255: set substitution.enabled = 0 255: set sparsify.enabled = 0 255: set calculate_basis_for_dual = 0 255: 255: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/shell.mps with dual-postsolve activated 255: rows: 536 255: columns: 1775 255: int. columns: 0 255: cont. columns: 1775 255: nonzeros: 3556 255: 255: round 0 ( Trivial ): 290 del cols, 40 del rows, 80 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 255: round 1 ( Fast ): 297 del cols, 47 del rows, 977 chg bounds, 0 chg sides, 0 chg coeffs, 1832 tsx applied, 0 tsx conflicts 255: round 2 ( Fast ): 299 del cols, 49 del rows, 1109 chg bounds, 0 chg sides, 0 chg coeffs, 2090 tsx applied, 0 tsx conflicts 255: round 3 (Exhaustive): 327 del cols, 49 del rows, 1215 chg bounds, 0 chg sides, 0 chg coeffs, 2279 tsx applied, 0 tsx conflicts 255: round 4 (Exhaustive): 327 del cols, 49 del rows, 1272 chg bounds, 0 chg sides, 0 chg coeffs, 2393 tsx applied, 0 tsx conflicts 255: round 5 ( Final ): 327 del cols, 49 del rows, 1312 chg bounds, 0 chg sides, 0 chg coeffs, 2473 tsx applied, 0 tsx conflicts 255: presolved 5 rounds: 327 del cols, 49 del rows, 1312 chg bounds, 0 chg sides, 0 chg coeffs, 2473 tsx applied, 0 tsx conflicts 255: 255: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 255: colsingleton 5 0.0 0 0.0 0.000 255: coefftightening 0 0.0 0 0.0 0.000 255: propagation 5 100.0 2444 100.0 0.001 255: fixcontinuous 2 0.0 0 0.0 0.000 255: simpleprobing 0 0.0 0 0.0 0.000 255: parallelrows 1 0.0 0 0.0 0.001 255: parallelcols 2 50.0 3 100.0 0.006 255: stuffing 2 0.0 0 0.0 0.000 255: dualfix 2 50.0 1 100.0 0.000 255: simplifyineq 0 0.0 0 0.0 0.000 255: doubletoneq 0 0.0 0 0.0 0.000 255: implint 0 0.0 0 0.0 0.000 255: domcol 2 50.0 25 100.0 0.005 255: dualinfer 0 0.0 0 0.0 0.000 255: probing 0 0.0 0 0.0 0.000 255: substitution 0 0.0 0 0.0 0.000 248: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 248: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 248: 248: External libraries: 248: Boost 1.83.0 (https://www.boost.org/) 248: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 248: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 248: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 248: 248: reading took 0.128 seconds 248: Numerical Statistics: 248: Matrix range [1e+00,2e+02] 248: Objective range [2e-03,5e+02] 248: Bounds range [3e-02,1e+03] 248: RHS range [2e+00,9e+01] 248: Dynamism Variables: 2e+02 248: Dynamism Rows : 2e+02 248: set presolve.componentsmaxint = -1 248: set presolve.detectlindep = 0 248: set doubletoneq.enabled = 0 248: set dualinfer.enabled = 0 248: set substitution.enabled = 0 248: set sparsify.enabled = 0 248: set calculate_basis_for_dual = 0 248: 248: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/seba.mps with dual-postsolve activated 248: rows: 515 248: columns: 1028 248: int. columns: 0 248: cont. columns: 1028 248: nonzeros: 4352 248: 248: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 248: round 1 ( Fast ): 104 del cols, 52 del rows, 135 chg bounds, 0 chg sides, 0 chg coeffs, 270 tsx applied, 0 tsx conflicts 248: round 2 ( Fast ): 130 del cols, 65 del rows, 491 chg bounds, 0 chg sides, 0 chg coeffs, 982 tsx applied, 0 tsx conflicts 248: round 3 ( Fast ): 132 del cols, 66 del rows, 584 chg bounds, 0 chg sides, 0 chg coeffs, 1168 tsx applied, 0 tsx conflicts 248: round 4 ( Medium ): 465 del cols, 67 del rows, 602 chg bounds, 331 chg sides, 331 chg coeffs, 1536 tsx applied, 1002 tsx conflicts 248: round 5 ( Medium ): 796 del cols, 398 del rows, 933 chg bounds, 331 chg sides, 331 chg coeffs, 3522 tsx applied, 1002 tsx conflicts 248: round 6 ( Medium ): 882 del cols, 398 del rows, 933 chg bounds, 417 chg sides, 417 chg coeffs, 3608 tsx applied, 1088 tsx conflicts 248: round 7 ( Medium ): 968 del cols, 484 del rows, 1019 chg bounds, 417 chg sides, 417 chg coeffs, 4210 tsx applied, 1088 tsx conflicts 248: round 8 ( Medium ): 986 del cols, 484 del rows, 1019 chg bounds, 435 chg sides, 435 chg coeffs, 4228 tsx applied, 1106 tsx conflicts 248: round 9 ( Medium ): 1004 del cols, 502 del rows, 1037 chg bounds, 435 chg sides, 435 chg coeffs, 4390 tsx applied, 1106 tsx conflicts 248: round 10 ( Medium ): 1008 del cols, 502 del rows, 1037 chg bounds, 439 chg sides, 439 chg coeffs, 4394 tsx applied, 1110 tsx conflicts 248: round 11 ( Medium ): 1012 del cols, 506 del rows, 1041 chg bounds, 439 chg sides, 439 chg coeffs, 4442 tsx applied, 1110 tsx conflicts 248: round 12 (Exhaustive): 1020 del cols, 506 del rows, 1049 chg bounds, 439 chg sides, 439 chg coeffs, 4450 tsx applied, 1110 tsx conflicts 248: round 13 ( Fast ): 1020 del cols, 513 del rows, 1057 chg bounds, 439 chg sides, 439 chg coeffs, 4454 tsx applied, 1110 tsx conflicts 248: round 14 (Exhaustive): 1020 del cols, 513 del rows, 1057 chg bounds, 439 chg sides, 439 chg coeffs, 4454 tsx applied, 1110 tsx conflicts 248: round 15 ( Final ): Unchanged 248: presolved 15 rounds: 1020 del cols, 513 del rows, 1057 chg bounds, 439 chg sides, 439 chg coeffs, 4454 tsx applied, 1110 tsx conflicts 248: 248: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 248: colsingleton 15 0.0 0 0.0 0.000 248: coefftightening 0 0.0 0 0.0 0.000 248: propagation 15 33.3 1208 100.0 0.067 248: fixcontinuous 4 0.0 0 0.0 0.001 248: simpleprobing 0 0.0 0 0.0 0.000 248: parallelrows 3 0.0 0 0.0 0.024 248: parallelcols 3 0.0 0 0.0 0.029 248: stuffing 10 80.0 4011 72.4 0.167 248: dualfix 7 42.9 337 99.4 0.022 248: simplifyineq 0 0.0 0 0.0 0.000 248: doubletoneq 0 0.0 0 0.0 0.000 248: implint 0 0.0 0 0.0 0.000 248: domcol 2 50.0 8 100.0 0.006 248: dualinfer 0 0.0 0 0.0 0.000 248: probing 0 0.0 0 0.0 0.000 248: substitution 0 0.0 0 0.0 0.000 248: sparsify 0 0.0 0 0.0 0.000 248: 248: reduced problem: 248: reduced rows: 2 248: reduced columns: 8 248: reduced int. columns: 0 248: reduced cont. columns: 8 248: reduced nonzeros: 11 248: 248: presolving finished after 0.555 seconds 248: 248: Equilibrium scaling LP (persistent) 248: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 248: Reduced LP has 2 rows 8 columns 11 nonzeros 248: Equilibrium scaling LP 248: type | time | iters | facts | shift | viol sum | viol num | obj value 248: L | 0.0 | 0 | 3 | 0.00e+00 | 4.75e+01 | 2 | 1.09411000e+04 248: L | 0.0 | 1 | 4 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 248: --- unscaling internal solution 248: --- unsimplifying solution and basis 248: --- unscaling external solution 248: --- verifying computed solution 248: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 248: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.57116000e+04 248: --- unscaling external solution 248: --- verifying computed solution 255: sparsify 0 0.0 0 0.0 0.000 255: 255: reduced problem: 255: reduced rows: 487 255: reduced columns: 1448 255: reduced int. columns: 0 255: reduced cont. columns: 1448 255: reduced nonzeros: 2902 255: 255: presolving finished after 0.033 seconds 255: 255: Equilibrium scaling LP (persistent) 254: 254: SoPlex status : problem is solved [optimal] 254: Solving time (sec) : 0.00 254: Iterations : 129 254: Objective value : -4.15732241e+02 254: 254: Solution passed validation 254: 254: postsolve finished after 0.037 seconds 254: feasible: true 254: objective value: -415.732240741418 254: 254: violations: 254: bounds: 0 254: constraints: 0 254: integrality: 0 254: 254: validation: SUCCESS 254: Solving time 0.132 seconds 254: 254: solving finished after 0.132 seconds 253/287 Test #254: r-solve-share2b.mps-lp_presolvers_without_basis.set ........................................ Passed 0.21 sec 255: Simplifier removed 124 rows, 124 columns, 248 nonzeros, 134 col bounds, 250 row bounds 255: Reduced LP has 363 rows 1324 columns 2654 nonzeros 255: Equilibrium scaling LP test 257 Start 257: r-solve-shell.mps-lp_presolvers_without_basis.set 257: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/shell.mps" "-o" "0.1208825346e10" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 257: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 257: Test timeout computed to be: 10000000 255: type | time | iters | facts | shift | viol sum | viol num | obj value 255: L | 0.0 | 0 | 3 | 3.52e+02 | 9.64e+05 | 165 | 7.00034600e+06 255: L | 0.0 | 199 | 3 | 3.52e+02 | 1.83e+05 | 165 | 1.19658275e+09 255: L | 0.0 | 399 | 4 | 3.52e+02 | 3.06e+04 | 110 | 1.20674362e+09 255: E | 0.0 | 491 | 6 | 0.00e+00 | 1.25e+02 | 1 | 1.20882535e+09 255: E | 0.1 | 492 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 255: --- unscaling internal solution 255: --- unsimplifying solution and basis 255: --- unscaling external solution 255: --- verifying computed solution 255: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 255: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 255: --- unscaling external solution 255: --- verifying computed solution 255: 255: SoPlex status : problem is solved [optimal] 255: Solving time (sec) : 0.08 255: Iterations : 492 255: Objective value : 1.20882535e+09 255: 255: Solution passed validation 255: 255: postsolve finished after 0.001 seconds 255: feasible: true 255: objective value: 1208825346 255: 255: violations: 255: bounds: 0 255: constraints: 0 255: integrality: 0 255: 255: validation: SUCCESS 255: Solving time 0.179 seconds 255: 255: solving finished after 0.179 seconds 254/287 Test #255: d-solve-shell.mps-lp_presolvers_without_basis.set .......................................... Passed 0.28 sec test 258 Start 258: d-solve-vtp-base.mps-lp_presolvers_without_basis.set 258: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/vtp-base.mps" "-o" "0.1298314624613613657395984384889e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 258: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 258: Test timeout computed to be: 10000000 248: 248: SoPlex status : problem is solved [optimal] 248: Solving time (sec) : 0.00 248: Iterations : 1 248: Objective value : 1.57116000e+04 248: 248: Solution passed validation 248: 248: postsolve finished after 0.129 seconds 248: feasible: true 248: objective value: 15711.6 248: 248: violations: 248: bounds: 0 248: constraints: 0 248: integrality: 0 248: 248: validation: SUCCESS 248: Solving time 0.698 seconds 248: 248: solving finished after 0.698 seconds 255/287 Test #248: r-solve-seba.mps-lp_presolvers_without_basis.set ........................................... Passed 0.97 sec test 259 Start 259: q-solve-vtp-base.mps-lp_presolvers_without_basis.set 259: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/vtp-base.mps" "-o" "0.1298314624613613657395984384889e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 259: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 259: Test timeout computed to be: 10000000 256: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 256: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 256: 256: External libraries: 256: Boost 1.83.0 (https://www.boost.org/) 256: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 256: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 256: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 256: 256: reading took 0.0817 seconds 256: Numerical Statistics: 256: Matrix range [1e+00,1e+00] 256: Objective range [1e+00,4e+03] 256: Bounds range [6e+00,5e+05] 256: RHS range [4e+04,5e+04] 256: Dynamism Variables: 1e+00 256: Dynamism Rows : 1e+00 256: set presolve.componentsmaxint = -1 256: set presolve.detectlindep = 0 256: set doubletoneq.enabled = 0 256: set dualinfer.enabled = 0 256: set substitution.enabled = 0 256: set sparsify.enabled = 0 256: set calculate_basis_for_dual = 0 256: 256: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/shell.mps with dual-postsolve activated 256: rows: 536 256: columns: 1775 256: int. columns: 0 256: cont. columns: 1775 256: nonzeros: 3556 256: 256: round 0 ( Trivial ): 290 del cols, 40 del rows, 80 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 256: round 1 ( Fast ): 297 del cols, 47 del rows, 977 chg bounds, 0 chg sides, 0 chg coeffs, 1832 tsx applied, 0 tsx conflicts 256: round 2 ( Fast ): 299 del cols, 49 del rows, 1109 chg bounds, 0 chg sides, 0 chg coeffs, 2090 tsx applied, 0 tsx conflicts 256: round 3 (Exhaustive): 327 del cols, 49 del rows, 1215 chg bounds, 0 chg sides, 0 chg coeffs, 2279 tsx applied, 0 tsx conflicts 256: round 4 (Exhaustive): 327 del cols, 49 del rows, 1272 chg bounds, 0 chg sides, 0 chg coeffs, 2393 tsx applied, 0 tsx conflicts 256: round 5 ( Final ): 327 del cols, 49 del rows, 1312 chg bounds, 0 chg sides, 0 chg coeffs, 2473 tsx applied, 0 tsx conflicts 256: presolved 5 rounds: 327 del cols, 49 del rows, 1312 chg bounds, 0 chg sides, 0 chg coeffs, 2473 tsx applied, 0 tsx conflicts 256: 256: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 256: colsingleton 5 0.0 0 0.0 0.000 256: coefftightening 0 0.0 0 0.0 0.000 256: propagation 5 100.0 2444 100.0 0.015 256: fixcontinuous 2 0.0 0 0.0 0.001 256: simpleprobing 0 0.0 0 0.0 0.000 256: parallelrows 1 0.0 0 0.0 0.001 256: parallelcols 2 50.0 3 100.0 0.007 256: stuffing 2 0.0 0 0.0 0.000 256: dualfix 2 50.0 1 100.0 0.004 256: simplifyineq 0 0.0 0 0.0 0.000 256: doubletoneq 0 0.0 0 0.0 0.000 256: implint 0 0.0 0 0.0 0.000 256: domcol 2 50.0 25 100.0 0.030 256: dualinfer 0 0.0 0 0.0 0.000 256: probing 0 0.0 0 0.0 0.000 256: substitution 0 0.0 0 0.0 0.000 256: sparsify 0 0.0 0 0.0 0.000 256: 256: reduced problem: 256: reduced rows: 487 256: reduced columns: 1448 256: reduced int. columns: 0 256: reduced cont. columns: 1448 256: reduced nonzeros: 2902 256: 256: presolving finished after 0.136 seconds 256: 256: Equilibrium scaling LP (persistent) 258: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 258: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 258: 258: External libraries: 258: Boost 1.83.0 (https://www.boost.org/) 258: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 258: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 258: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 258: 258: reading took 0.0253 seconds 258: Numerical Statistics: 258: Matrix range [1e-01,4e+03] 258: Objective range [1e+00,1e+00] 258: Bounds range [1e+00,1e+03] 258: RHS range [1e+00,4e+03] 258: Dynamism Variables: 4e+03 258: Dynamism Rows : 4e+03 258: set presolve.componentsmaxint = -1 258: set presolve.detectlindep = 0 258: set doubletoneq.enabled = 0 258: set dualinfer.enabled = 0 258: set substitution.enabled = 0 258: set sparsify.enabled = 0 258: set calculate_basis_for_dual = 0 258: 258: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/vtp-base.mps with dual-postsolve activated 258: rows: 198 258: columns: 203 258: int. columns: 0 258: cont. columns: 203 258: nonzeros: 908 258: 258: round 0 ( Trivial ): 21 del cols, 32 del rows, 24 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 258: round 1 ( Fast ): 53 del cols, 112 del rows, 127 chg bounds, 0 chg sides, 0 chg coeffs, 214 tsx applied, 0 tsx conflicts 258: round 2 ( Fast ): 85 del cols, 144 del rows, 178 chg bounds, 0 chg sides, 0 chg coeffs, 296 tsx applied, 0 tsx conflicts 258: round 3 ( Fast ): 85 del cols, 144 del rows, 194 chg bounds, 0 chg sides, 0 chg coeffs, 332 tsx applied, 0 tsx conflicts 258: round 4 ( Fast ): 85 del cols, 144 del rows, 209 chg bounds, 0 chg sides, 0 chg coeffs, 362 tsx applied, 0 tsx conflicts 258: round 5 ( Fast ): 85 del cols, 144 del rows, 227 chg bounds, 0 chg sides, 0 chg coeffs, 398 tsx applied, 0 tsx conflicts 258: round 6 ( Fast ): 85 del cols, 144 del rows, 247 chg bounds, 0 chg sides, 0 chg coeffs, 438 tsx applied, 0 tsx conflicts 258: round 7 ( Fast ): 85 del cols, 144 del rows, 263 chg bounds, 0 chg sides, 0 chg coeffs, 470 tsx applied, 0 tsx conflicts 258: round 8 ( Fast ): 85 del cols, 144 del rows, 281 chg bounds, 0 chg sides, 0 chg coeffs, 506 tsx applied, 0 tsx conflicts 258: round 9 ( Fast ): 85 del cols, 144 del rows, 297 chg bounds, 0 chg sides, 0 chg coeffs, 538 tsx applied, 0 tsx conflicts 258: round 10 ( Fast ): 85 del cols, 144 del rows, 311 chg bounds, 0 chg sides, 0 chg coeffs, 566 tsx applied, 0 tsx conflicts 258: round 11 ( Medium ): 125 del cols, 149 del rows, 319 chg bounds, 0 chg sides, 0 chg coeffs, 587 tsx applied, 436 tsx conflicts 258: round 12 (Exhaustive): 125 del cols, 149 del rows, 324 chg bounds, 0 chg sides, 0 chg coeffs, 597 tsx applied, 436 tsx conflicts 258: round 13 ( Final ): 125 del cols, 149 del rows, 325 chg bounds, 0 chg sides, 0 chg coeffs, 599 tsx applied, 436 tsx conflicts 258: presolved 13 rounds: 125 del cols, 149 del rows, 325 chg bounds, 0 chg sides, 0 chg coeffs, 599 tsx applied, 436 tsx conflicts 258: 258: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 258: colsingleton 13 0.0 0 0.0 0.000 258: coefftightening 0 0.0 0 0.0 0.000 258: propagation 13 100.0 594 100.0 0.001 258: fixcontinuous 2 0.0 0 0.0 0.000 258: simpleprobing 0 0.0 0 0.0 0.000 258: parallelrows 1 0.0 0 0.0 0.000 258: parallelcols 1 0.0 0 0.0 0.000 258: stuffing 2 50.0 440 1.1 0.000 258: dualfix 2 50.0 1 0.0 0.000 258: simplifyineq 0 0.0 0 0.0 0.000 258: doubletoneq 0 0.0 0 0.0 0.000 258: implint 0 0.0 0 0.0 0.000 258: domcol 1 0.0 0 0.0 0.000 258: dualinfer 0 0.0 0 0.0 0.000 258: probing 0 0.0 0 0.0 0.000 258: substitution 0 0.0 0 0.0 0.000 258: sparsify 0 0.0 0 0.0 0.000 258: 258: reduced problem: 258: reduced rows: 49 258: reduced columns: 78 258: reduced int. columns: 0 258: reduced cont. columns: 78 258: reduced nonzeros: 227 258: 258: presolving finished after 0.019 seconds 258: 258: Equilibrium scaling LP (persistent) 258: Simplifier removed 1 rows, 1 columns, 3 nonzeros, 10 col bounds, 2 row bounds 258: Reduced LP has 48 rows 77 columns 224 nonzeros 258: Equilibrium scaling LP 258: type | time | iters | facts | shift | viol sum | viol num | obj value 258: L | 0.0 | 0 | 3 | 3.55e+02 | 2.20e+03 | 43 | 4.59773965e+04 258: E | 0.0 | 49 | 4 | 0.00e+00 | 3.66e-01 | 1 | 1.29874307e+05 258: E | 0.0 | 50 | 5 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 258: --- unscaling internal solution 258: --- unsimplifying solution and basis 258: --- unscaling external solution 258: --- verifying computed solution 258: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 258: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 258: --- unscaling external solution 258: --- verifying computed solution 256: Simplifier removed 124 rows, 124 columns, 248 nonzeros, 134 col bounds, 250 row bounds 256: Reduced LP has 363 rows 1324 columns 2654 nonzeros 256: Equilibrium scaling LP 256: type | time | iters | facts | shift | viol sum | viol num | obj value 256: L | 0.0 | 0 | 3 | 3.52e+02 | 9.64e+05 | 165 | 7.00034600e+06 258: 258: SoPlex status : problem is solved [optimal] 258: Solving time (sec) : 0.00 258: Iterations : 50 258: Objective value : 1.29831462e+05 258: 258: Solution passed validation 258: 258: postsolve finished after 0.000 seconds 258: feasible: true 258: objective value: 129831.462461361 258: 258: violations: 258: bounds: 0 258: constraints: 0 258: integrality: 0 258: 258: validation: SUCCESS 258: Solving time 0.023 seconds 258: 258: solving finished after 0.023 seconds 256/287 Test #258: d-solve-vtp-base.mps-lp_presolvers_without_basis.set ....................................... Passed 0.13 sec test 260 Start 260: r-solve-vtp-base.mps-lp_presolvers_without_basis.set 260: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/vtp-base.mps" "-o" "0.1298314624613613657395984384889e6" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_without_basis.set" 260: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 260: Test timeout computed to be: 10000000 256: L | 0.0 | 199 | 3 | 3.52e+02 | 1.83e+05 | 165 | 1.19658275e+09 256: L | 0.0 | 399 | 4 | 3.52e+02 | 3.06e+04 | 110 | 1.20674362e+09 256: E | 0.0 | 491 | 6 | 0.00e+00 | 1.25e+02 | 1 | 1.20882535e+09 256: E | 0.0 | 492 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 256: --- unscaling internal solution 256: --- unsimplifying solution and basis 256: --- unscaling external solution 256: --- verifying computed solution 256: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 256: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 256: --- unscaling external solution 256: --- verifying computed solution 259: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 259: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 259: 259: External libraries: 259: Boost 1.83.0 (https://www.boost.org/) 259: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 259: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 259: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 259: 259: reading took 0.0383 seconds 259: Numerical Statistics: 259: Matrix range [1e-01,4e+03] 259: Objective range [1e+00,1e+00] 259: Bounds range [1e+00,1e+03] 259: RHS range [1e+00,4e+03] 259: Dynamism Variables: 4e+03 259: Dynamism Rows : 4e+03 259: set presolve.componentsmaxint = -1 259: set presolve.detectlindep = 0 259: set doubletoneq.enabled = 0 259: set dualinfer.enabled = 0 259: set substitution.enabled = 0 259: set sparsify.enabled = 0 259: set calculate_basis_for_dual = 0 259: 259: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/vtp-base.mps with dual-postsolve activated 259: rows: 198 259: columns: 203 259: int. columns: 0 259: cont. columns: 203 259: nonzeros: 908 259: 259: round 0 ( Trivial ): 21 del cols, 32 del rows, 24 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 259: round 1 ( Fast ): 53 del cols, 112 del rows, 127 chg bounds, 0 chg sides, 0 chg coeffs, 214 tsx applied, 0 tsx conflicts 259: round 2 ( Fast ): 85 del cols, 144 del rows, 178 chg bounds, 0 chg sides, 0 chg coeffs, 296 tsx applied, 0 tsx conflicts 259: round 3 ( Fast ): 85 del cols, 144 del rows, 194 chg bounds, 0 chg sides, 0 chg coeffs, 332 tsx applied, 0 tsx conflicts 259: round 4 ( Fast ): 85 del cols, 144 del rows, 209 chg bounds, 0 chg sides, 0 chg coeffs, 362 tsx applied, 0 tsx conflicts 259: round 5 ( Fast ): 85 del cols, 144 del rows, 227 chg bounds, 0 chg sides, 0 chg coeffs, 398 tsx applied, 0 tsx conflicts 259: round 6 ( Fast ): 85 del cols, 144 del rows, 247 chg bounds, 0 chg sides, 0 chg coeffs, 438 tsx applied, 0 tsx conflicts 259: round 7 ( Fast ): 85 del cols, 144 del rows, 263 chg bounds, 0 chg sides, 0 chg coeffs, 470 tsx applied, 0 tsx conflicts 259: round 8 ( Fast ): 85 del cols, 144 del rows, 281 chg bounds, 0 chg sides, 0 chg coeffs, 506 tsx applied, 0 tsx conflicts 259: round 9 ( Fast ): 85 del cols, 144 del rows, 297 chg bounds, 0 chg sides, 0 chg coeffs, 538 tsx applied, 0 tsx conflicts 259: round 10 ( Fast ): 85 del cols, 144 del rows, 311 chg bounds, 0 chg sides, 0 chg coeffs, 566 tsx applied, 0 tsx conflicts 259: round 11 ( Medium ): 125 del cols, 149 del rows, 319 chg bounds, 0 chg sides, 0 chg coeffs, 587 tsx applied, 436 tsx conflicts 259: round 12 (Exhaustive): 125 del cols, 149 del rows, 324 chg bounds, 0 chg sides, 0 chg coeffs, 597 tsx applied, 436 tsx conflicts 259: round 13 ( Final ): 125 del cols, 149 del rows, 325 chg bounds, 0 chg sides, 0 chg coeffs, 599 tsx applied, 436 tsx conflicts 259: presolved 13 rounds: 125 del cols, 149 del rows, 325 chg bounds, 0 chg sides, 0 chg coeffs, 599 tsx applied, 436 tsx conflicts 259: 259: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 259: colsingleton 13 0.0 0 0.0 0.000 259: coefftightening 0 0.0 0 0.0 0.000 259: propagation 13 100.0 594 100.0 0.026 259: fixcontinuous 2 0.0 0 0.0 0.000 259: simpleprobing 0 0.0 0 0.0 0.000 259: parallelrows 1 0.0 0 0.0 0.000 259: parallelcols 1 0.0 0 0.0 0.000 259: stuffing 2 50.0 440 1.1 0.011 259: dualfix 2 50.0 1 0.0 0.001 259: simplifyineq 0 0.0 0 0.0 0.000 259: doubletoneq 0 0.0 0 0.0 0.000 259: implint 0 0.0 0 0.0 0.000 259: domcol 1 0.0 0 0.0 0.001 259: dualinfer 0 0.0 0 0.0 0.000 259: probing 0 0.0 0 0.0 0.000 259: substitution 0 0.0 0 0.0 0.000 259: sparsify 0 0.0 0 0.0 0.000 259: 259: reduced problem: 259: reduced rows: 49 259: reduced columns: 78 259: reduced int. columns: 0 259: reduced cont. columns: 78 259: reduced nonzeros: 227 259: 259: presolving finished after 0.078 seconds 259: 259: Equilibrium scaling LP (persistent) 259: Simplifier removed 1 rows, 1 columns, 3 nonzeros, 10 col bounds, 2 row bounds 259: Reduced LP has 48 rows 77 columns 224 nonzeros 259: Equilibrium scaling LP 259: type | time | iters | facts | shift | viol sum | viol num | obj value 259: L | 0.0 | 0 | 3 | 3.55e+02 | 2.20e+03 | 43 | 4.59773965e+04 259: E | 0.0 | 49 | 4 | 0.00e+00 | 3.66e-01 | 1 | 1.29874307e+05 259: E | 0.0 | 50 | 5 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 259: --- unscaling internal solution 259: --- unsimplifying solution and basis 259: --- unscaling external solution 259: --- verifying computed solution 259: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 259: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 259: --- unscaling external solution 259: --- verifying computed solution 259: 259: SoPlex status : problem is solved [optimal] 259: Solving time (sec) : 0.00 259: Iterations : 50 259: Objective value : 1.29831462e+05 259: 259: Solution passed validation 259: 259: postsolve finished after 0.014 seconds 259: feasible: true 259: objective value: 129831.462461361 259: 259: violations: 259: bounds: 0 259: constraints: 0 259: integrality: 0 259: 259: validation: SUCCESS 259: Solving time 0.107 seconds 259: 259: solving finished after 0.107 seconds 257/287 Test #259: q-solve-vtp-base.mps-lp_presolvers_without_basis.set ....................................... Passed 0.23 sec test 261 Start 261: d-infeas-LP/bgetam.mps 261: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bgetam.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 261: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 261: Test timeout computed to be: 10000000 256: 256: SoPlex status : problem is solved [optimal] 256: Solving time (sec) : 0.08 256: Iterations : 492 256: Objective value : 1.20882535e+09 256: 256: Solution passed validation 256: 256: postsolve finished after 0.059 seconds 256: feasible: true 256: objective value: 1208825346 256: 256: violations: 256: bounds: 0 256: constraints: 0 256: integrality: 0 256: 256: validation: SUCCESS 256: Solving time 0.313 seconds 256: 256: solving finished after 0.313 seconds 258/287 Test #256: q-solve-shell.mps-lp_presolvers_without_basis.set .......................................... Passed 0.51 sec test 262 Start 262: q-infeas-LP/bgetam.mps 262: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bgetam.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 262: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 262: Test timeout computed to be: 10000000 261: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 261: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 261: 261: External libraries: 261: Boost 1.83.0 (https://www.boost.org/) 261: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 261: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 261: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 261: 261: reading took 0.0423 seconds 261: Numerical Statistics: 261: Matrix range [2e-02,2e+03] 261: Objective range [8e-03,8e+02] 261: Bounds range [3e-02,1e+02] 261: RHS range [1e+00,1e+04] 261: Dynamism Variables: 2e+03 261: Dynamism Rows : 2e+03 261: set presolve.componentsmaxint = -1 261: set presolve.detectlindep = 0 261: set doubletoneq.enabled = 0 261: set dualinfer.enabled = 0 261: set substitution.enabled = 0 261: set sparsify.enabled = 0 261: 261: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bgetam.mps with dual-postsolve activated 261: rows: 400 261: columns: 688 261: int. columns: 0 261: cont. columns: 688 261: nonzeros: 2409 261: 261: round 0 ( Trivial ): 154 del cols, 44 del rows, 79 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 261: round 1 ( Fast ): 166 del cols, 57 del rows, 466 chg bounds, 0 chg sides, 0 chg coeffs, 802 tsx applied, 0 tsx conflicts 261: round 2 ( Fast ): 176 del cols, 67 del rows, 559 chg bounds, 0 chg sides, 0 chg coeffs, 960 tsx applied, 0 tsx conflicts 261: presolving detected infeasible problem after 0.022 seconds 259/287 Test #261: d-infeas-LP/bgetam.mps ..................................................................... Passed 0.12 sec test 263 Start 263: r-infeas-LP/bgetam.mps 263: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bgetam.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 263: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 263: Test timeout computed to be: 10000000 260: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 260: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 260: 260: External libraries: 260: Boost 1.83.0 (https://www.boost.org/) 260: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 260: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 260: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 260: 260: reading took 0.0343 seconds 260: Numerical Statistics: 260: Matrix range [1e-01,4e+03] 260: Objective range [1e+00,1e+00] 260: Bounds range [1e+00,1e+03] 260: RHS range [1e+00,4e+03] 260: Dynamism Variables: 4e+03 260: Dynamism Rows : 4e+03 260: set presolve.componentsmaxint = -1 260: set presolve.detectlindep = 0 260: set doubletoneq.enabled = 0 260: set dualinfer.enabled = 0 260: set substitution.enabled = 0 260: set sparsify.enabled = 0 260: set calculate_basis_for_dual = 0 260: 260: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/vtp-base.mps with dual-postsolve activated 260: rows: 198 260: columns: 203 260: int. columns: 0 260: cont. columns: 203 260: nonzeros: 908 260: 260: round 0 ( Trivial ): 21 del cols, 32 del rows, 24 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 260: round 1 ( Fast ): 53 del cols, 112 del rows, 127 chg bounds, 0 chg sides, 0 chg coeffs, 214 tsx applied, 0 tsx conflicts 260: round 2 ( Fast ): 85 del cols, 144 del rows, 178 chg bounds, 0 chg sides, 0 chg coeffs, 296 tsx applied, 0 tsx conflicts 260: round 3 ( Fast ): 85 del cols, 144 del rows, 194 chg bounds, 0 chg sides, 0 chg coeffs, 332 tsx applied, 0 tsx conflicts 260: round 4 ( Fast ): 85 del cols, 144 del rows, 209 chg bounds, 0 chg sides, 0 chg coeffs, 362 tsx applied, 0 tsx conflicts 260: round 5 ( Fast ): 85 del cols, 144 del rows, 227 chg bounds, 0 chg sides, 0 chg coeffs, 398 tsx applied, 0 tsx conflicts 260: round 6 ( Fast ): 85 del cols, 144 del rows, 247 chg bounds, 0 chg sides, 0 chg coeffs, 438 tsx applied, 0 tsx conflicts 260: round 7 ( Fast ): 85 del cols, 144 del rows, 263 chg bounds, 0 chg sides, 0 chg coeffs, 470 tsx applied, 0 tsx conflicts 260: round 8 ( Fast ): 85 del cols, 144 del rows, 281 chg bounds, 0 chg sides, 0 chg coeffs, 506 tsx applied, 0 tsx conflicts 260: round 9 ( Fast ): 85 del cols, 144 del rows, 297 chg bounds, 0 chg sides, 0 chg coeffs, 538 tsx applied, 0 tsx conflicts 260: round 10 ( Fast ): 85 del cols, 144 del rows, 311 chg bounds, 0 chg sides, 0 chg coeffs, 566 tsx applied, 0 tsx conflicts 260: round 11 ( Medium ): 125 del cols, 149 del rows, 319 chg bounds, 0 chg sides, 0 chg coeffs, 587 tsx applied, 436 tsx conflicts 260: round 12 (Exhaustive): 125 del cols, 149 del rows, 324 chg bounds, 0 chg sides, 0 chg coeffs, 597 tsx applied, 436 tsx conflicts 260: round 13 ( Final ): 125 del cols, 149 del rows, 325 chg bounds, 0 chg sides, 0 chg coeffs, 599 tsx applied, 436 tsx conflicts 260: presolved 13 rounds: 125 del cols, 149 del rows, 325 chg bounds, 0 chg sides, 0 chg coeffs, 599 tsx applied, 436 tsx conflicts 260: 260: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 260: colsingleton 13 0.0 0 0.0 0.000 260: coefftightening 0 0.0 0 0.0 0.000 260: propagation 13 100.0 594 100.0 0.049 260: fixcontinuous 2 0.0 0 0.0 0.000 260: simpleprobing 0 0.0 0 0.0 0.000 260: parallelrows 1 0.0 0 0.0 0.001 260: parallelcols 1 0.0 0 0.0 0.001 260: stuffing 2 50.0 440 1.1 0.004 260: dualfix 2 50.0 1 0.0 0.001 260: simplifyineq 0 0.0 0 0.0 0.000 260: doubletoneq 0 0.0 0 0.0 0.000 260: implint 0 0.0 0 0.0 0.000 260: domcol 1 0.0 0 0.0 0.005 260: dualinfer 0 0.0 0 0.0 0.000 260: probing 0 0.0 0 0.0 0.000 260: substitution 0 0.0 0 0.0 0.000 260: sparsify 0 0.0 0 0.0 0.000 260: 260: reduced problem: 260: reduced rows: 49 260: reduced columns: 78 260: reduced int. columns: 0 260: reduced cont. columns: 78 260: reduced nonzeros: 227 260: 260: presolving finished after 0.132 seconds 260: 260: Equilibrium scaling LP (persistent) 260: Simplifier removed 1 rows, 1 columns, 3 nonzeros, 10 col bounds, 2 row bounds 260: Reduced LP has 48 rows 77 columns 224 nonzeros 260: Equilibrium scaling LP 260: type | time | iters | facts | shift | viol sum | viol num | obj value 260: L | 0.0 | 0 | 3 | 3.55e+02 | 2.20e+03 | 43 | 4.59773965e+04 260: E | 0.0 | 49 | 4 | 0.00e+00 | 3.66e-01 | 1 | 1.29874307e+05 260: E | 0.0 | 50 | 5 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 260: --- unscaling internal solution 260: --- unsimplifying solution and basis 260: --- unscaling external solution 260: --- verifying computed solution 260: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 260: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.29831462e+05 260: --- unscaling external solution 260: --- verifying computed solution 260: 260: SoPlex status : problem is solved [optimal] 260: Solving time (sec) : 0.00 260: Iterations : 50 260: Objective value : 1.29831462e+05 260: 260: Solution passed validation 260: 260: postsolve finished after 0.026 seconds 260: feasible: true 260: objective value: 129831.462461361 260: 260: violations: 260: bounds: 0 260: constraints: 0 260: integrality: 0 260: 260: validation: SUCCESS 260: Solving time 0.164 seconds 260: 260: solving finished after 0.164 seconds 260/287 Test #260: r-solve-vtp-base.mps-lp_presolvers_without_basis.set ....................................... Passed 0.28 sec test 264 Start 264: d-infeas-LP/box1.mps 264: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/box1.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 264: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 264: Test timeout computed to be: 10000000 264: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 264: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 264: 264: External libraries: 264: Boost 1.83.0 (https://www.boost.org/) 264: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 264: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 264: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 264: 264: reading took 0.0106 seconds 264: Numerical Statistics: 264: Matrix range [1e+00,1e+00] 264: Objective range [1e+00,1e+00] 264: Bounds range [1e+00,1e+00] 264: RHS range [0e+00,0e+00] 264: Dynamism Variables: 1e+00 264: Dynamism Rows : 1e+00 264: set presolve.componentsmaxint = -1 264: set presolve.detectlindep = 0 264: set doubletoneq.enabled = 0 264: set dualinfer.enabled = 0 264: set substitution.enabled = 0 264: set sparsify.enabled = 0 264: 264: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/box1.mps with dual-postsolve activated 264: rows: 231 264: columns: 261 264: int. columns: 0 264: cont. columns: 261 264: nonzeros: 651 264: 264: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 264: round 1 ( Final ): Unchanged 264: presolved 1 rounds: 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 264: 264: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 264: colsingleton 1 0.0 0 0.0 0.000 264: coefftightening 0 0.0 0 0.0 0.000 264: propagation 1 0.0 0 0.0 0.000 264: fixcontinuous 1 0.0 0 0.0 0.000 264: simpleprobing 0 0.0 0 0.0 0.000 264: parallelrows 1 0.0 0 0.0 0.000 264: parallelcols 1 0.0 0 0.0 0.000 264: stuffing 1 0.0 0 0.0 0.000 264: dualfix 1 0.0 0 0.0 0.000 264: simplifyineq 0 0.0 0 0.0 0.000 264: doubletoneq 0 0.0 0 0.0 0.000 264: implint 0 0.0 0 0.0 0.000 264: domcol 1 0.0 0 0.0 0.000 264: dualinfer 0 0.0 0 0.0 0.000 264: probing 0 0.0 0 0.0 0.000 264: substitution 0 0.0 0 0.0 0.000 264: sparsify 0 0.0 0 0.0 0.000 264: 264: reduced problem: 264: reduced rows: 231 264: reduced columns: 261 264: reduced int. columns: 0 264: reduced cont. columns: 261 264: reduced nonzeros: 651 264: 264: presolving finished after 0.002 seconds 264: 264: Equilibrium scaling LP (persistent) 257: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 257: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 257: 257: External libraries: 257: Boost 1.83.0 (https://www.boost.org/) 257: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 257: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 257: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 257: 257: reading took 0.124 seconds 257: Numerical Statistics: 257: Matrix range [1e+00,1e+00] 257: Objective range [1e+00,4e+03] 257: Bounds range [6e+00,5e+05] 257: RHS range [4e+04,5e+04] 257: Dynamism Variables: 1e+00 257: Dynamism Rows : 1e+00 257: set presolve.componentsmaxint = -1 257: set presolve.detectlindep = 0 257: set doubletoneq.enabled = 0 257: set dualinfer.enabled = 0 257: set substitution.enabled = 0 257: set sparsify.enabled = 0 257: set calculate_basis_for_dual = 0 257: 257: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/shell.mps with dual-postsolve activated 257: rows: 536 257: columns: 1775 257: int. columns: 0 257: cont. columns: 1775 257: nonzeros: 3556 257: 257: round 0 ( Trivial ): 290 del cols, 40 del rows, 80 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 257: round 1 ( Fast ): 297 del cols, 47 del rows, 977 chg bounds, 0 chg sides, 0 chg coeffs, 1832 tsx applied, 0 tsx conflicts 257: round 2 ( Fast ): 299 del cols, 49 del rows, 1109 chg bounds, 0 chg sides, 0 chg coeffs, 2090 tsx applied, 0 tsx conflicts 257: round 3 (Exhaustive): 327 del cols, 49 del rows, 1215 chg bounds, 0 chg sides, 0 chg coeffs, 2279 tsx applied, 0 tsx conflicts 257: round 4 (Exhaustive): 327 del cols, 49 del rows, 1272 chg bounds, 0 chg sides, 0 chg coeffs, 2393 tsx applied, 0 tsx conflicts 257: round 5 ( Final ): 327 del cols, 49 del rows, 1312 chg bounds, 0 chg sides, 0 chg coeffs, 2473 tsx applied, 0 tsx conflicts 257: presolved 5 rounds: 327 del cols, 49 del rows, 1312 chg bounds, 0 chg sides, 0 chg coeffs, 2473 tsx applied, 0 tsx conflicts 257: 257: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 257: colsingleton 5 0.0 0 0.0 0.000 257: coefftightening 0 0.0 0 0.0 0.000 257: propagation 5 100.0 2444 100.0 0.041 257: fixcontinuous 2 0.0 0 0.0 0.002 257: simpleprobing 0 0.0 0 0.0 0.000 257: parallelrows 1 0.0 0 0.0 0.022 257: parallelcols 2 50.0 3 100.0 0.030 257: stuffing 2 0.0 0 0.0 0.000 257: dualfix 2 50.0 1 100.0 0.028 257: simplifyineq 0 0.0 0 0.0 0.000 257: doubletoneq 0 0.0 0 0.0 0.000 257: implint 0 0.0 0 0.0 0.000 257: domcol 2 50.0 25 100.0 0.089 257: dualinfer 0 0.0 0 0.0 0.000 257: probing 0 0.0 0 0.0 0.000 257: substitution 0 0.0 0 0.0 0.000 264: Simplifier removed 195 rows, 195 columns, 390 nonzeros, 0 col bounds, 1170 row bounds 264: Reduced LP has 36 rows 66 columns 261 nonzeros 264: Equilibrium scaling LP 264: type | time | iters | facts | shift | viol sum | viol num | obj value 264: L | 0.0 | 0 | 3 | 0.00e+00 | 1.00e+00 | 1 | 2.61000000e+02 264: L | 0.0 | 1 | 3 | 0.00e+00 | 3.00e+00 | 1 | 2.65000000e+02 264: --- unscaling internal solution 264: --- unsimplifying solution and basis 264: --- unscaling external solution 264: 264: SoPlex status : problem is solved [infeasible] 264: Solving time (sec) : 0.02 264: Iterations : 1 264: Objective value : 1.00000000e+100 264: 264: Solving time 0.033 seconds 264: 264: solving detected infeasible problem after 0.033 seconds 261/287 Test #264: d-infeas-LP/box1.mps ....................................................................... Passed 0.10 sec test 265 Start 265: q-infeas-LP/box1.mps 265: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/box1.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 265: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 265: Test timeout computed to be: 10000000 262: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 262: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 262: 262: External libraries: 262: Boost 1.83.0 (https://www.boost.org/) 262: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 262: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 262: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 262: 262: reading took 0.0519 seconds 262: Numerical Statistics: 262: Matrix range [2e-02,2e+03] 262: Objective range [8e-03,8e+02] 262: Bounds range [3e-02,1e+02] 262: RHS range [1e+00,1e+04] 262: Dynamism Variables: 2e+03 262: Dynamism Rows : 2e+03 262: set presolve.componentsmaxint = -1 262: set presolve.detectlindep = 0 262: set doubletoneq.enabled = 0 262: set dualinfer.enabled = 0 262: set substitution.enabled = 0 262: set sparsify.enabled = 0 262: 262: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bgetam.mps with dual-postsolve activated 262: rows: 400 262: columns: 688 262: int. columns: 0 262: cont. columns: 688 262: nonzeros: 2409 262: 262: round 0 ( Trivial ): 154 del cols, 44 del rows, 79 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 262: round 1 ( Fast ): 166 del cols, 57 del rows, 466 chg bounds, 0 chg sides, 0 chg coeffs, 802 tsx applied, 0 tsx conflicts 262: round 2 ( Fast ): 176 del cols, 67 del rows, 559 chg bounds, 0 chg sides, 0 chg coeffs, 960 tsx applied, 0 tsx conflicts 262: presolving detected infeasible problem after 0.096 seconds 257: sparsify 0 0.0 0 0.0 0.000 257: 257: reduced problem: 257: reduced rows: 487 257: reduced columns: 1448 257: reduced int. columns: 0 257: reduced cont. columns: 1448 257: reduced nonzeros: 2902 257: 257: presolving finished after 0.397 seconds 257: 257: Equilibrium scaling LP (persistent) 262/287 Test #262: q-infeas-LP/bgetam.mps ..................................................................... Passed 0.26 sec test 266 Start 266: r-infeas-LP/box1.mps 266: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/box1.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 266: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 266: Test timeout computed to be: 10000000 257: Simplifier removed 124 rows, 124 columns, 248 nonzeros, 134 col bounds, 250 row bounds 257: Reduced LP has 363 rows 1324 columns 2654 nonzeros 257: Equilibrium scaling LP 257: type | time | iters | facts | shift | viol sum | viol num | obj value 257: L | 0.0 | 0 | 3 | 3.52e+02 | 9.64e+05 | 165 | 7.00034600e+06 257: L | 0.0 | 199 | 3 | 3.52e+02 | 1.83e+05 | 165 | 1.19658275e+09 265: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 265: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 265: 265: External libraries: 265: Boost 1.83.0 (https://www.boost.org/) 265: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 265: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 265: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 265: 265: reading took 0.0195 seconds 265: Numerical Statistics: 265: Matrix range [1e+00,1e+00] 265: Objective range [1e+00,1e+00] 265: Bounds range [1e+00,1e+00] 265: RHS range [0e+00,0e+00] 265: Dynamism Variables: 1e+00 265: Dynamism Rows : 1e+00 265: set presolve.componentsmaxint = -1 265: set presolve.detectlindep = 0 265: set doubletoneq.enabled = 0 265: set dualinfer.enabled = 0 265: set substitution.enabled = 0 265: set sparsify.enabled = 0 265: 265: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/box1.mps with dual-postsolve activated 265: rows: 231 265: columns: 261 265: int. columns: 0 265: cont. columns: 261 265: nonzeros: 651 265: 265: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 265: round 1 ( Final ): Unchanged 265: presolved 1 rounds: 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 265: 265: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 265: colsingleton 1 0.0 0 0.0 0.000 265: coefftightening 0 0.0 0 0.0 0.000 265: propagation 1 0.0 0 0.0 0.001 265: fixcontinuous 1 0.0 0 0.0 0.000 265: simpleprobing 0 0.0 0 0.0 0.000 265: parallelrows 1 0.0 0 0.0 0.000 265: parallelcols 1 0.0 0 0.0 0.000 265: stuffing 1 0.0 0 0.0 0.000 265: dualfix 1 0.0 0 0.0 0.000 265: simplifyineq 0 0.0 0 0.0 0.000 265: doubletoneq 0 0.0 0 0.0 0.000 265: implint 0 0.0 0 0.0 0.000 265: domcol 1 0.0 0 0.0 0.001 265: dualinfer 0 0.0 0 0.0 0.000 265: probing 0 0.0 0 0.0 0.000 265: substitution 0 0.0 0 0.0 0.000 265: sparsify 0 0.0 0 0.0 0.000 265: 265: reduced problem: 265: reduced rows: 231 265: reduced columns: 261 265: reduced int. columns: 0 265: reduced cont. columns: 261 265: reduced nonzeros: 651 265: 265: presolving finished after 0.013 seconds 265: 265: Equilibrium scaling LP (persistent) 257: L | 0.0 | 399 | 4 | 3.52e+02 | 3.06e+04 | 110 | 1.20674362e+09 257: E | 0.0 | 491 | 6 | 0.00e+00 | 1.25e+02 | 1 | 1.20882535e+09 257: E | 0.0 | 492 | 7 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 257: --- unscaling internal solution 257: --- unsimplifying solution and basis 257: --- unscaling external solution 257: --- verifying computed solution 257: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 257: L | 0.0 | 0 | 1 | 0.00e+00 | 0.00e+00 | 0 | 1.20882535e+09 257: --- unscaling external solution 257: --- verifying computed solution 265: Simplifier removed 195 rows, 195 columns, 390 nonzeros, 0 col bounds, 1170 row bounds 265: Reduced LP has 36 rows 66 columns 261 nonzeros 265: Equilibrium scaling LP 265: type | time | iters | facts | shift | viol sum | viol num | obj value 265: L | 0.0 | 0 | 3 | 0.00e+00 | 1.00e+00 | 1 | 2.61000000e+02 265: L | 0.0 | 1 | 3 | 0.00e+00 | 3.00e+00 | 1 | 2.65000000e+02 265: --- unscaling internal solution 265: --- unsimplifying solution and basis 265: --- unscaling external solution 265: 265: SoPlex status : problem is solved [infeasible] 265: Solving time (sec) : 0.00 265: Iterations : 1 265: Objective value : 1.00000000e+100 265: 265: Solving time 0.040 seconds 265: 265: solving detected infeasible problem after 0.040 seconds 263: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 263: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 263: 263: External libraries: 263: Boost 1.83.0 (https://www.boost.org/) 263: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 263: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 263: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 263: 263: reading took 0.0493 seconds 263: Numerical Statistics: 263: Matrix range [2e-02,2e+03] 263: Objective range [8e-03,8e+02] 263: Bounds range [3e-02,1e+02] 263: RHS range [1e+00,1e+04] 263: Dynamism Variables: 2e+03 263: Dynamism Rows : 2e+03 263: set presolve.componentsmaxint = -1 263: set presolve.detectlindep = 0 263: set doubletoneq.enabled = 0 263: set dualinfer.enabled = 0 263: set substitution.enabled = 0 263: set sparsify.enabled = 0 263: 263: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/bgetam.mps with dual-postsolve activated 263: rows: 400 263: columns: 688 263: int. columns: 0 263: cont. columns: 688 263: nonzeros: 2409 263: 263: round 0 ( Trivial ): 154 del cols, 44 del rows, 79 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 263: round 1 ( Fast ): 166 del cols, 57 del rows, 466 chg bounds, 0 chg sides, 0 chg coeffs, 802 tsx applied, 0 tsx conflicts 263: round 2 ( Fast ): 176 del cols, 67 del rows, 559 chg bounds, 0 chg sides, 0 chg coeffs, 960 tsx applied, 0 tsx conflicts 263: presolving detected infeasible problem after 0.143 seconds 263/287 Test #263: r-infeas-LP/bgetam.mps ..................................................................... Passed 0.28 sec 264/287 Test #265: q-infeas-LP/box1.mps ....................................................................... Passed 0.13 sec test 267 Start 267: d-infeas-LP/galenet.mps 267: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/galenet.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 267: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 267: Test timeout computed to be: 10000000 test 268 Start 268: q-infeas-LP/galenet.mps 268: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/galenet.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 268: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 268: Test timeout computed to be: 10000000 266: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 266: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 266: 266: External libraries: 266: Boost 1.83.0 (https://www.boost.org/) 266: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 266: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 266: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 266: 266: reading took 0.0324 seconds 266: Numerical Statistics: 266: Matrix range [1e+00,1e+00] 266: Objective range [1e+00,1e+00] 266: Bounds range [1e+00,1e+00] 266: RHS range [0e+00,0e+00] 266: Dynamism Variables: 1e+00 266: Dynamism Rows : 1e+00 266: set presolve.componentsmaxint = -1 266: set presolve.detectlindep = 0 266: set doubletoneq.enabled = 0 266: set dualinfer.enabled = 0 266: set substitution.enabled = 0 266: set sparsify.enabled = 0 266: 266: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/box1.mps with dual-postsolve activated 266: rows: 231 266: columns: 261 266: int. columns: 0 266: cont. columns: 261 266: nonzeros: 651 266: 266: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 266: round 1 ( Final ): Unchanged 266: presolved 1 rounds: 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 266: 266: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 266: colsingleton 1 0.0 0 0.0 0.000 266: coefftightening 0 0.0 0 0.0 0.000 266: propagation 1 0.0 0 0.0 0.001 266: fixcontinuous 1 0.0 0 0.0 0.000 266: simpleprobing 0 0.0 0 0.0 0.000 266: parallelrows 1 0.0 0 0.0 0.010 266: parallelcols 1 0.0 0 0.0 0.002 266: stuffing 1 0.0 0 0.0 0.000 266: dualfix 1 0.0 0 0.0 0.001 266: simplifyineq 0 0.0 0 0.0 0.000 266: doubletoneq 0 0.0 0 0.0 0.000 266: implint 0 0.0 0 0.0 0.000 266: domcol 1 0.0 0 0.0 0.005 266: dualinfer 0 0.0 0 0.0 0.000 266: probing 0 0.0 0 0.0 0.000 266: substitution 0 0.0 0 0.0 0.000 266: sparsify 0 0.0 0 0.0 0.000 266: 266: reduced problem: 266: reduced rows: 231 266: reduced columns: 261 266: reduced int. columns: 0 266: reduced cont. columns: 261 266: reduced nonzeros: 651 266: 266: presolving finished after 0.023 seconds 266: 266: Equilibrium scaling LP (persistent) 267: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 267: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 267: 267: External libraries: 267: Boost 1.83.0 (https://www.boost.org/) 267: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 267: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 267: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 267: 267: reading took 0.00424 seconds 267: Numerical Statistics: 267: Matrix range [1e+00,1e+00] 267: Objective range [0e+00,0e+00] 267: Bounds range [2e+00,3e+01] 267: RHS range [1e+01,3e+01] 267: Dynamism Variables: 1e+00 267: Dynamism Rows : 1e+00 267: set presolve.componentsmaxint = -1 267: set presolve.detectlindep = 0 267: set doubletoneq.enabled = 0 267: set dualinfer.enabled = 0 267: set substitution.enabled = 0 267: set sparsify.enabled = 0 267: 267: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/galenet.mps with dual-postsolve activated 267: rows: 8 267: columns: 8 267: int. columns: 0 267: cont. columns: 8 267: nonzeros: 16 267: 267: round 0 ( Trivial ): 2 del cols, 4 del rows, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 267: presolving detected infeasible problem after 0.000 seconds 266: Simplifier removed 195 rows, 195 columns, 390 nonzeros, 0 col bounds, 1170 row bounds 266: Reduced LP has 36 rows 66 columns 261 nonzeros 266: Equilibrium scaling LP 266: type | time | iters | facts | shift | viol sum | viol num | obj value 266: L | 0.0 | 0 | 3 | 0.00e+00 | 1.00e+00 | 1 | 2.61000000e+02 266: L | 0.0 | 1 | 3 | 0.00e+00 | 3.00e+00 | 1 | 2.65000000e+02 266: --- unscaling internal solution 266: --- unsimplifying solution and basis 266: --- unscaling external solution 266: 266: SoPlex status : problem is solved [infeasible] 266: Solving time (sec) : 0.00 266: Iterations : 1 266: Objective value : 1.00000000e+100 266: 266: Solving time 0.048 seconds 266: 266: solving detected infeasible problem after 0.048 seconds 265/287 Test #266: r-infeas-LP/box1.mps ....................................................................... Passed 0.17 sec 266/287 Test #267: d-infeas-LP/galenet.mps .................................................................... Passed 0.06 sec test 269 Start 269: r-infeas-LP/galenet.mps 269: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/galenet.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 269: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 269: Test timeout computed to be: 10000000 test 270 Start 270: d-infeas-LP/gams10am.mps 270: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/gams10am.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 270: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 270: Test timeout computed to be: 10000000 268: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 268: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 268: 268: External libraries: 268: Boost 1.83.0 (https://www.boost.org/) 268: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 268: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 268: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 268: 268: reading took 0.000489 seconds 268: Numerical Statistics: 268: Matrix range [1e+00,1e+00] 268: Objective range [0e+00,0e+00] 268: Bounds range [2e+00,3e+01] 268: RHS range [1e+01,3e+01] 268: Dynamism Variables: 1e+00 268: Dynamism Rows : 1e+00 268: set presolve.componentsmaxint = -1 268: set presolve.detectlindep = 0 268: set doubletoneq.enabled = 0 268: set dualinfer.enabled = 0 268: set substitution.enabled = 0 268: set sparsify.enabled = 0 268: 268: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/galenet.mps with dual-postsolve activated 268: rows: 8 268: columns: 8 268: int. columns: 0 268: cont. columns: 8 268: nonzeros: 16 268: 268: round 0 ( Trivial ): 2 del cols, 4 del rows, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 268: presolving detected infeasible problem after 0.001 seconds 269: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 269: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 269: 269: External libraries: 269: Boost 1.83.0 (https://www.boost.org/) 269: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 269: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 269: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 269: 269: reading took 0.000468 seconds 269: Numerical Statistics: 269: Matrix range [1e+00,1e+00] 269: Objective range [0e+00,0e+00] 269: Bounds range [2e+00,3e+01] 269: RHS range [1e+01,3e+01] 269: Dynamism Variables: 1e+00 269: Dynamism Rows : 1e+00 269: set presolve.componentsmaxint = -1 269: set presolve.detectlindep = 0 269: set doubletoneq.enabled = 0 269: set dualinfer.enabled = 0 269: set substitution.enabled = 0 269: set sparsify.enabled = 0 269: 269: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/galenet.mps with dual-postsolve activated 269: rows: 8 269: columns: 8 269: int. columns: 0 269: cont. columns: 8 269: nonzeros: 16 269: 269: round 0 ( Trivial ): 2 del cols, 4 del rows, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 269: presolving detected infeasible problem after 0.001 seconds 267/287 Test #269: r-infeas-LP/galenet.mps .................................................................... Passed 0.04 sec test 271 Start 271: q-infeas-LP/gams10am.mps 271: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/gams10am.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 271: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 271: Test timeout computed to be: 10000000 268/287 Test #268: q-infeas-LP/galenet.mps .................................................................... Passed 0.11 sec test 272 Start 272: r-infeas-LP/gams10am.mps 272: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/gams10am.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 272: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 272: Test timeout computed to be: 10000000 270: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 270: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 270: 270: External libraries: 270: Boost 1.83.0 (https://www.boost.org/) 270: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 270: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 270: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 270: 270: reading took 0.0071 seconds 270: Numerical Statistics: 270: Matrix range [7e-02,1e+00] 270: Objective range [1e+00,1e+00] 270: Bounds range [3e-01,1e+01] 270: RHS range [7e-01,2e+01] 270: Dynamism Variables: 1e+01 270: Dynamism Rows : 5e+00 270: set presolve.componentsmaxint = -1 270: set presolve.detectlindep = 0 270: set doubletoneq.enabled = 0 270: set dualinfer.enabled = 0 270: set substitution.enabled = 0 270: set sparsify.enabled = 0 270: 270: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/gams10am.mps with dual-postsolve activated 270: rows: 114 270: columns: 61 270: int. columns: 0 270: cont. columns: 61 270: nonzeros: 297 270: 270: round 0 ( Trivial ): 10 del cols, 18 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 270: presolving detected infeasible problem after 0.001 seconds 269/287 Test #270: d-infeas-LP/gams10am.mps ................................................................... Passed 0.07 sec test 273 Start 273: d-infeas-LP/refinery.mps 273: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/refinery.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 273: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 273: Test timeout computed to be: 10000000 271: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 271: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 271: 271: External libraries: 271: Boost 1.83.0 (https://www.boost.org/) 271: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 271: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 271: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 271: 271: reading took 0.00852 seconds 271: Numerical Statistics: 271: Matrix range [7e-02,1e+00] 271: Objective range [1e+00,1e+00] 271: Bounds range [3e-01,1e+01] 271: RHS range [7e-01,2e+01] 271: Dynamism Variables: 1e+01 271: Dynamism Rows : 5e+00 271: set presolve.componentsmaxint = -1 271: set presolve.detectlindep = 0 271: set doubletoneq.enabled = 0 271: set dualinfer.enabled = 0 271: set substitution.enabled = 0 271: set sparsify.enabled = 0 271: 271: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/gams10am.mps with dual-postsolve activated 271: rows: 114 271: columns: 61 271: int. columns: 0 271: cont. columns: 61 271: nonzeros: 297 271: 271: round 0 ( Trivial ): 10 del cols, 18 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 271: presolving detected infeasible problem after 0.002 seconds 257: 257: SoPlex status : problem is solved [optimal] 257: Solving time (sec) : 0.08 257: Iterations : 492 257: Objective value : 1.20882535e+09 257: 257: Solution passed validation 257: 257: postsolve finished after 0.143 seconds 257: feasible: true 257: objective value: 1208825346 257: 257: violations: 257: bounds: 0 257: constraints: 0 257: integrality: 0 257: 257: validation: SUCCESS 257: Solving time 0.659 seconds 257: 257: solving finished after 0.659 seconds 270/287 Test #271: q-infeas-LP/gams10am.mps ................................................................... Passed 0.08 sec test 274 Start 274: q-infeas-LP/refinery.mps 274: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/refinery.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 274: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 274: Test timeout computed to be: 10000000 271/287 Test #257: r-solve-shell.mps-lp_presolvers_without_basis.set .......................................... Passed 0.97 sec test 275 Start 275: r-infeas-LP/refinery.mps 275: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/refinery.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 275: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 275: Test timeout computed to be: 10000000 272: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 272: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 272: 272: External libraries: 272: Boost 1.83.0 (https://www.boost.org/) 272: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 272: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 272: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 272: 272: reading took 0.00963 seconds 272: Numerical Statistics: 272: Matrix range [7e-02,1e+00] 272: Objective range [1e+00,1e+00] 272: Bounds range [3e-01,1e+01] 272: RHS range [7e-01,2e+01] 272: Dynamism Variables: 1e+01 272: Dynamism Rows : 5e+00 272: set presolve.componentsmaxint = -1 272: set presolve.detectlindep = 0 272: set doubletoneq.enabled = 0 272: set dualinfer.enabled = 0 272: set substitution.enabled = 0 272: set sparsify.enabled = 0 272: 272: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/gams10am.mps with dual-postsolve activated 272: rows: 114 272: columns: 61 272: int. columns: 0 272: cont. columns: 61 272: nonzeros: 297 272: 272: round 0 ( Trivial ): 10 del cols, 18 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 272: presolving detected infeasible problem after 0.007 seconds 272/287 Test #272: r-infeas-LP/gams10am.mps ................................................................... Passed 0.09 sec test 276 Start 276: d-infeas-LP/woodinfe.mps 276: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/woodinfe.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 276: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 276: Test timeout computed to be: 10000000 273: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 273: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 273: 273: External libraries: 273: Boost 1.83.0 (https://www.boost.org/) 273: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 273: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 273: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 273: 273: reading took 0.0285 seconds 273: Numerical Statistics: 273: Matrix range [1e-03,1e+04] 273: Objective range [2e-01,5e+01] 273: Bounds range [1e-02,2e+03] 273: RHS range [3e-03,1e+02] 273: Dynamism Variables: 1e+04 273: Dynamism Rows : 9e+05 273: set presolve.componentsmaxint = -1 273: set presolve.detectlindep = 0 273: set doubletoneq.enabled = 0 273: set dualinfer.enabled = 0 273: set substitution.enabled = 0 273: set sparsify.enabled = 0 273: 273: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/refinery.mps with dual-postsolve activated 273: rows: 323 273: columns: 464 273: int. columns: 0 273: cont. columns: 464 273: nonzeros: 1626 273: 273: round 0 ( Trivial ): 15 del cols, 10 del rows, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 273: round 1 ( Fast ): 17 del cols, 12 del rows, 133 chg bounds, 0 chg sides, 0 chg coeffs, 240 tsx applied, 0 tsx conflicts 273: round 2 ( Fast ): 17 del cols, 12 del rows, 201 chg bounds, 0 chg sides, 0 chg coeffs, 582 tsx applied, 0 tsx conflicts 273: round 3 ( Medium ): 153 del cols, 133 del rows, 387 chg bounds, 158 chg sides, 128 chg coeffs, 910 tsx applied, 272 tsx conflicts 273: round 4 ( Fast ): 155 del cols, 134 del rows, 401 chg bounds, 158 chg sides, 128 chg coeffs, 956 tsx applied, 272 tsx conflicts 273: round 5 ( Medium ): 191 del cols, 134 del rows, 401 chg bounds, 217 chg sides, 164 chg coeffs, 992 tsx applied, 344 tsx conflicts 273: round 6 (Exhaustive): 203 del cols, 134 del rows, 413 chg bounds, 217 chg sides, 164 chg coeffs, 1004 tsx applied, 344 tsx conflicts 273: round 7 (Exhaustive): 203 del cols, 135 del rows, 413 chg bounds, 217 chg sides, 164 chg coeffs, 1005 tsx applied, 344 tsx conflicts 273: round 8 ( Final ): 203 del cols, 135 del rows, 413 chg bounds, 217 chg sides, 164 chg coeffs, 1005 tsx applied, 344 tsx conflicts 273: presolved 8 rounds: 203 del cols, 135 del rows, 413 chg bounds, 217 chg sides, 164 chg coeffs, 1005 tsx applied, 344 tsx conflicts 273: 273: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 273: colsingleton 8 0.0 0 0.0 0.000 273: coefftightening 0 0.0 0 0.0 0.000 273: propagation 8 50.0 820 100.0 0.005 273: fixcontinuous 2 0.0 0 0.0 0.000 273: simpleprobing 0 0.0 0 0.0 0.000 273: parallelrows 2 50.0 1 100.0 0.000 273: parallelcols 2 0.0 0 0.0 0.001 273: stuffing 4 50.0 516 33.3 0.000 273: dualfix 2 0.0 0 0.0 0.000 273: simplifyineq 0 0.0 0 0.0 0.000 273: doubletoneq 0 0.0 0 0.0 0.000 273: implint 0 0.0 0 0.0 0.000 273: domcol 2 50.0 12 100.0 0.005 273: dualinfer 0 0.0 0 0.0 0.000 273: probing 0 0.0 0 0.0 0.000 273: substitution 0 0.0 0 0.0 0.000 273: sparsify 0 0.0 0 0.0 0.000 273: 273: reduced problem: 273: reduced rows: 188 273: reduced columns: 261 273: reduced int. columns: 0 273: reduced cont. columns: 261 273: reduced nonzeros: 1229 273: 273: presolving finished after 0.016 seconds 273: 273: Equilibrium scaling LP (persistent) 273: Simplifier removed 2 rows, 2 columns, 4 nonzeros, 0 col bounds, 4 row bounds 273: Reduced LP has 186 rows 259 columns 1225 nonzeros 273: Equilibrium scaling LP 273: type | time | iters | facts | shift | viol sum | viol num | obj value 273: L | 0.0 | 0 | 3 | 0.00e+00 | 3.75e+06 | 113 | -1.68249840e+06 273: L | 0.0 | 199 | 3 | 0.00e+00 | 7.30e+06 | 113 | -1.81393761e+05 276: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 276: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 276: 276: External libraries: 276: Boost 1.83.0 (https://www.boost.org/) 276: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 276: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 276: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 276: 276: reading took 0.00468 seconds 276: Numerical Statistics: 276: Matrix range [1e+00,1e+00] 276: Objective range [5e+00,6e+01] 276: Bounds range [5e+00,2e+02] 276: RHS range [0e+00,0e+00] 276: Dynamism Variables: 1e+00 276: Dynamism Rows : 1e+00 276: set presolve.componentsmaxint = -1 276: set presolve.detectlindep = 0 276: set doubletoneq.enabled = 0 276: set dualinfer.enabled = 0 276: set substitution.enabled = 0 276: set sparsify.enabled = 0 276: 276: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/woodinfe.mps with dual-postsolve activated 276: rows: 35 276: columns: 89 276: int. columns: 0 276: cont. columns: 89 276: nonzeros: 140 276: 276: round 0 ( Trivial ): 0 del cols, 1 del rows, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 276: presolving detected infeasible problem after 0.001 seconds 273/287 Test #276: d-infeas-LP/woodinfe.mps ................................................................... Passed 0.08 sec test 277 Start 277: q-infeas-LP/woodinfe.mps 277: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/woodinfe.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 277: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 277: Test timeout computed to be: 10000000 273: L | 0.0 | 379 | 7 | 0.00e+00 | 5.39e+07 | 70 | 2.96676716e+08 273: --- unscaling internal solution 273: --- unsimplifying solution and basis 273: --- unscaling external solution 273: 273: SoPlex status : problem is solved [infeasible] 273: Solving time (sec) : 0.02 273: Iterations : 379 273: Objective value : 1.00000000e+100 273: 273: Solving time 0.092 seconds 273: 273: solving detected infeasible problem after 0.092 seconds 274/287 Test #273: d-infeas-LP/refinery.mps ................................................................... Passed 0.18 sec test 278 Start 278: r-infeas-LP/woodinfe.mps 278: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/woodinfe.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 278: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 278: Test timeout computed to be: 10000000 277: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 277: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 277: 277: External libraries: 277: Boost 1.83.0 (https://www.boost.org/) 277: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 277: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 277: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 277: 277: reading took 0.00193 seconds 277: Numerical Statistics: 277: Matrix range [1e+00,1e+00] 277: Objective range [5e+00,6e+01] 277: Bounds range [5e+00,2e+02] 277: RHS range [0e+00,0e+00] 277: Dynamism Variables: 1e+00 277: Dynamism Rows : 1e+00 277: set presolve.componentsmaxint = -1 277: set presolve.detectlindep = 0 277: set doubletoneq.enabled = 0 277: set dualinfer.enabled = 0 277: set substitution.enabled = 0 277: set sparsify.enabled = 0 277: 277: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/woodinfe.mps with dual-postsolve activated 277: rows: 35 277: columns: 89 277: int. columns: 0 277: cont. columns: 89 277: nonzeros: 140 277: 277: round 0 ( Trivial ): 0 del cols, 1 del rows, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 277: presolving detected infeasible problem after 0.001 seconds 275/287 Test #277: q-infeas-LP/woodinfe.mps ................................................................... Passed 0.09 sec test 279 Start 279: d-infeas-LP/klein1.mps 279: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/klein1.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 279: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 279: Test timeout computed to be: 10000000 278: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 278: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 278: 278: External libraries: 278: Boost 1.83.0 (https://www.boost.org/) 278: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 278: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 278: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 278: 278: reading took 0.00239 seconds 278: Numerical Statistics: 278: Matrix range [1e+00,1e+00] 278: Objective range [5e+00,6e+01] 278: Bounds range [5e+00,2e+02] 278: RHS range [0e+00,0e+00] 278: Dynamism Variables: 1e+00 278: Dynamism Rows : 1e+00 278: set presolve.componentsmaxint = -1 278: set presolve.detectlindep = 0 278: set doubletoneq.enabled = 0 278: set dualinfer.enabled = 0 278: set substitution.enabled = 0 278: set sparsify.enabled = 0 278: 278: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/woodinfe.mps with dual-postsolve activated 278: rows: 35 278: columns: 89 278: int. columns: 0 278: cont. columns: 89 278: nonzeros: 140 278: 278: round 0 ( Trivial ): 0 del cols, 1 del rows, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 278: presolving detected infeasible problem after 0.001 seconds 276/287 Test #278: r-infeas-LP/woodinfe.mps ................................................................... Passed 0.10 sec test 280 Start 280: q-infeas-LP/klein1.mps 280: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/klein1.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 280: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 280: Test timeout computed to be: 10000000 274: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 274: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 274: 274: External libraries: 274: Boost 1.83.0 (https://www.boost.org/) 274: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 274: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 274: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 274: 274: reading took 0.0546 seconds 274: Numerical Statistics: 274: Matrix range [1e-03,1e+04] 274: Objective range [2e-01,5e+01] 274: Bounds range [1e-02,2e+03] 274: RHS range [2e-03,1e+02] 274: Dynamism Variables: 1e+04 274: Dynamism Rows : 9e+05 274: set presolve.componentsmaxint = -1 274: set presolve.detectlindep = 0 274: set doubletoneq.enabled = 0 274: set dualinfer.enabled = 0 274: set substitution.enabled = 0 274: set sparsify.enabled = 0 274: 274: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/refinery.mps with dual-postsolve activated 274: rows: 323 274: columns: 464 274: int. columns: 0 274: cont. columns: 464 274: nonzeros: 1626 274: 274: round 0 ( Trivial ): 15 del cols, 10 del rows, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 274: round 1 ( Fast ): 17 del cols, 12 del rows, 133 chg bounds, 0 chg sides, 0 chg coeffs, 240 tsx applied, 0 tsx conflicts 274: round 2 ( Fast ): 17 del cols, 12 del rows, 201 chg bounds, 0 chg sides, 0 chg coeffs, 582 tsx applied, 0 tsx conflicts 274: round 3 ( Medium ): 153 del cols, 133 del rows, 387 chg bounds, 158 chg sides, 128 chg coeffs, 910 tsx applied, 272 tsx conflicts 274: round 4 ( Fast ): 155 del cols, 134 del rows, 401 chg bounds, 158 chg sides, 128 chg coeffs, 956 tsx applied, 272 tsx conflicts 274: round 5 ( Medium ): 191 del cols, 134 del rows, 401 chg bounds, 217 chg sides, 164 chg coeffs, 992 tsx applied, 344 tsx conflicts 274: round 6 (Exhaustive): 203 del cols, 134 del rows, 413 chg bounds, 217 chg sides, 164 chg coeffs, 1004 tsx applied, 344 tsx conflicts 274: round 7 (Exhaustive): 203 del cols, 135 del rows, 413 chg bounds, 217 chg sides, 164 chg coeffs, 1005 tsx applied, 344 tsx conflicts 274: round 8 ( Final ): 203 del cols, 135 del rows, 413 chg bounds, 217 chg sides, 164 chg coeffs, 1005 tsx applied, 344 tsx conflicts 274: presolved 8 rounds: 203 del cols, 135 del rows, 413 chg bounds, 217 chg sides, 164 chg coeffs, 1005 tsx applied, 344 tsx conflicts 274: 274: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 274: colsingleton 8 0.0 0 0.0 0.000 274: coefftightening 0 0.0 0 0.0 0.000 274: propagation 8 50.0 820 100.0 0.054 274: fixcontinuous 2 0.0 0 0.0 0.000 274: simpleprobing 0 0.0 0 0.0 0.000 274: parallelrows 2 50.0 1 100.0 0.002 274: parallelcols 2 0.0 0 0.0 0.011 274: stuffing 4 50.0 516 33.3 0.014 274: dualfix 2 0.0 0 0.0 0.000 274: simplifyineq 0 0.0 0 0.0 0.000 274: doubletoneq 0 0.0 0 0.0 0.000 274: implint 0 0.0 0 0.0 0.000 274: domcol 2 50.0 12 100.0 0.028 274: dualinfer 0 0.0 0 0.0 0.000 274: probing 0 0.0 0 0.0 0.000 274: substitution 0 0.0 0 0.0 0.000 274: sparsify 0 0.0 0 0.0 0.000 274: 274: reduced problem: 274: reduced rows: 188 274: reduced columns: 261 274: reduced int. columns: 0 274: reduced cont. columns: 261 274: reduced nonzeros: 1229 274: 274: presolving finished after 0.166 seconds 274: 274: Equilibrium scaling LP (persistent) 274: Simplifier removed 2 rows, 2 columns, 4 nonzeros, 0 col bounds, 4 row bounds 274: Reduced LP has 186 rows 259 columns 1225 nonzeros 274: Equilibrium scaling LP 274: type | time | iters | facts | shift | viol sum | viol num | obj value 274: L | 0.0 | 0 | 3 | 0.00e+00 | 3.75e+06 | 113 | -1.68249840e+06 274: L | 0.0 | 199 | 3 | 0.00e+00 | 7.30e+06 | 113 | -1.81393761e+05 279: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 279: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 279: 279: External libraries: 279: Boost 1.83.0 (https://www.boost.org/) 279: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 279: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 279: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 279: 279: reading took 0.0264 seconds 279: Numerical Statistics: 279: Matrix range [1e+00,2e+03] 279: Objective range [0e+00,0e+00] 279: Bounds range [0e+00,0e+00] 279: RHS range [8e+00,5e+01] 279: Dynamism Variables: 2e+03 279: Dynamism Rows : 2e+03 279: set presolve.componentsmaxint = -1 279: set presolve.detectlindep = 0 279: set doubletoneq.enabled = 0 279: set dualinfer.enabled = 0 279: set substitution.enabled = 0 279: set sparsify.enabled = 0 279: 279: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/klein1.mps with dual-postsolve activated 279: rows: 54 279: columns: 54 279: int. columns: 0 279: cont. columns: 54 279: nonzeros: 696 279: 279: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 279: round 1 ( Final ): Unchanged 279: presolved 1 rounds: 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 279: 279: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 279: colsingleton 1 0.0 0 0.0 0.000 279: coefftightening 0 0.0 0 0.0 0.000 279: propagation 1 0.0 0 0.0 0.000 279: fixcontinuous 1 0.0 0 0.0 0.000 279: simpleprobing 0 0.0 0 0.0 0.000 279: parallelrows 1 0.0 0 0.0 0.000 279: parallelcols 1 0.0 0 0.0 0.000 279: stuffing 1 0.0 0 0.0 0.000 279: dualfix 1 0.0 0 0.0 0.000 279: simplifyineq 0 0.0 0 0.0 0.000 279: doubletoneq 0 0.0 0 0.0 0.000 279: implint 0 0.0 0 0.0 0.000 279: domcol 1 0.0 0 0.0 0.000 279: dualinfer 0 0.0 0 0.0 0.000 279: probing 0 0.0 0 0.0 0.000 279: substitution 0 0.0 0 0.0 0.000 279: sparsify 0 0.0 0 0.0 0.000 279: 279: reduced problem: 279: reduced rows: 54 279: reduced columns: 54 279: reduced int. columns: 0 279: reduced cont. columns: 54 279: reduced nonzeros: 696 279: 279: presolving finished after 0.009 seconds 279: 279: Equilibrium scaling LP (persistent) 279: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 279: Reduced LP has 54 rows 54 columns 696 nonzeros 279: Equilibrium scaling LP 279: type | time | iters | facts | shift | viol sum | viol num | obj value 279: L | 0.0 | 0 | 3 | 0.00e+00 | 8.75e+00 | 2 | 0.00000000e+00 279: ESOLVE29 124: fVec error = 3.50856972e-06 exceeding SOPLEX_DEFAULT_BND_VIOL = 1.00000000e-06 279: L | 0.0 | 124 | 6 | 2.70e-04 | 2.24e+05 | 2 | 1.12361162e+05 279: --- unscaling internal solution 279: --- unsimplifying solution and basis 279: --- unscaling external solution 279: 279: SoPlex status : problem is solved [infeasible] 279: Solving time (sec) : 0.00 279: Iterations : 124 279: Objective value : 1.00000000e+100 279: 279: Solving time 0.046 seconds 279: 279: solving detected infeasible problem after 0.046 seconds 277/287 Test #279: d-infeas-LP/klein1.mps ..................................................................... Passed 0.14 sec test 281 Start 281: r-infeas-LP/klein1.mps 281: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/klein1.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 281: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 281: Test timeout computed to be: 10000000 274: L | 0.0 | 379 | 7 | 0.00e+00 | 5.39e+07 | 70 | 2.96676716e+08 274: --- unscaling internal solution 274: --- unsimplifying solution and basis 274: --- unscaling external solution 280: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 280: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 280: 280: External libraries: 280: Boost 1.83.0 (https://www.boost.org/) 280: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 280: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 280: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 280: 280: reading took 0.0132 seconds 280: Numerical Statistics: 280: Matrix range [1e+00,2e+03] 280: Objective range [0e+00,0e+00] 280: Bounds range [0e+00,0e+00] 280: RHS range [8e+00,5e+01] 280: Dynamism Variables: 2e+03 280: Dynamism Rows : 2e+03 280: set presolve.componentsmaxint = -1 280: set presolve.detectlindep = 0 280: set doubletoneq.enabled = 0 280: set dualinfer.enabled = 0 280: set substitution.enabled = 0 280: set sparsify.enabled = 0 280: 280: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/klein1.mps with dual-postsolve activated 280: rows: 54 280: columns: 54 280: int. columns: 0 280: cont. columns: 54 280: nonzeros: 696 280: 280: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 280: round 1 ( Final ): Unchanged 280: presolved 1 rounds: 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 280: 280: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 280: colsingleton 1 0.0 0 0.0 0.000 280: coefftightening 0 0.0 0 0.0 0.000 280: propagation 1 0.0 0 0.0 0.000 280: fixcontinuous 1 0.0 0 0.0 0.000 280: simpleprobing 0 0.0 0 0.0 0.000 280: parallelrows 1 0.0 0 0.0 0.000 280: parallelcols 1 0.0 0 0.0 0.000 280: stuffing 1 0.0 0 0.0 0.000 280: dualfix 1 0.0 0 0.0 0.000 280: simplifyineq 0 0.0 0 0.0 0.000 280: doubletoneq 0 0.0 0 0.0 0.000 280: implint 0 0.0 0 0.0 0.000 280: domcol 1 0.0 0 0.0 0.001 280: dualinfer 0 0.0 0 0.0 0.000 280: probing 0 0.0 0 0.0 0.000 280: substitution 0 0.0 0 0.0 0.000 280: sparsify 0 0.0 0 0.0 0.000 280: 280: reduced problem: 280: reduced rows: 54 280: reduced columns: 54 280: reduced int. columns: 0 280: reduced cont. columns: 54 280: reduced nonzeros: 696 280: 280: presolving finished after 0.016 seconds 280: 280: Equilibrium scaling LP (persistent) 280: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 280: Reduced LP has 54 rows 54 columns 696 nonzeros 280: Equilibrium scaling LP 280: type | time | iters | facts | shift | viol sum | viol num | obj value 280: L | 0.0 | 0 | 3 | 0.00e+00 | 8.75e+00 | 2 | 0.00000000e+00 275: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 275: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 275: 275: External libraries: 275: Boost 1.83.0 (https://www.boost.org/) 275: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 275: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 275: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 275: 275: reading took 0.048 seconds 275: Numerical Statistics: 275: Matrix range [1e-03,1e+04] 275: Objective range [2e-01,5e+01] 275: Bounds range [1e-02,2e+03] 275: RHS range [3e-03,1e+02] 275: Dynamism Variables: 1e+04 275: Dynamism Rows : 9e+05 275: set presolve.componentsmaxint = -1 275: set presolve.detectlindep = 0 275: set doubletoneq.enabled = 0 275: set dualinfer.enabled = 0 275: set substitution.enabled = 0 275: set sparsify.enabled = 0 275: 275: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/refinery.mps with dual-postsolve activated 275: rows: 323 275: columns: 464 275: int. columns: 0 275: cont. columns: 464 275: nonzeros: 1626 275: 275: round 0 ( Trivial ): 15 del cols, 10 del rows, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 275: round 1 ( Fast ): 17 del cols, 12 del rows, 133 chg bounds, 0 chg sides, 0 chg coeffs, 240 tsx applied, 0 tsx conflicts 275: round 2 ( Fast ): 17 del cols, 12 del rows, 201 chg bounds, 0 chg sides, 0 chg coeffs, 582 tsx applied, 0 tsx conflicts 275: round 3 ( Medium ): 153 del cols, 133 del rows, 387 chg bounds, 158 chg sides, 128 chg coeffs, 910 tsx applied, 272 tsx conflicts 275: round 4 ( Fast ): 155 del cols, 134 del rows, 401 chg bounds, 158 chg sides, 128 chg coeffs, 956 tsx applied, 272 tsx conflicts 275: round 5 ( Medium ): 191 del cols, 134 del rows, 401 chg bounds, 217 chg sides, 164 chg coeffs, 992 tsx applied, 344 tsx conflicts 275: round 6 (Exhaustive): 203 del cols, 134 del rows, 413 chg bounds, 217 chg sides, 164 chg coeffs, 1004 tsx applied, 344 tsx conflicts 275: round 7 (Exhaustive): 203 del cols, 135 del rows, 413 chg bounds, 217 chg sides, 164 chg coeffs, 1005 tsx applied, 344 tsx conflicts 275: round 8 ( Final ): 203 del cols, 135 del rows, 413 chg bounds, 217 chg sides, 164 chg coeffs, 1005 tsx applied, 344 tsx conflicts 275: presolved 8 rounds: 203 del cols, 135 del rows, 413 chg bounds, 217 chg sides, 164 chg coeffs, 1005 tsx applied, 344 tsx conflicts 275: 275: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 275: colsingleton 8 0.0 0 0.0 0.000 275: coefftightening 0 0.0 0 0.0 0.000 275: propagation 8 50.0 820 100.0 0.052 275: fixcontinuous 2 0.0 0 0.0 0.003 275: simpleprobing 0 0.0 0 0.0 0.000 275: parallelrows 2 50.0 1 100.0 0.015 275: parallelcols 2 0.0 0 0.0 0.016 275: stuffing 4 50.0 516 33.3 0.024 275: dualfix 2 0.0 0 0.0 0.001 275: simplifyineq 0 0.0 0 0.0 0.000 275: doubletoneq 0 0.0 0 0.0 0.000 275: implint 0 0.0 0 0.0 0.000 275: domcol 2 50.0 12 100.0 0.033 274: 274: SoPlex status : problem is solved [infeasible] 274: Solving time (sec) : 0.02 274: Iterations : 379 274: Objective value : 1.00000000e+100 274: 274: Solving time 0.250 seconds 274: 274: solving detected infeasible problem after 0.250 seconds 278/287 Test #274: q-infeas-LP/refinery.mps ................................................................... Passed 0.38 sec test 282 Start 282: d-infeas-LP/ex72a.mps 282: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/ex72a.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 282: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 282: Test timeout computed to be: 10000000 275: dualinfer 0 0.0 0 0.0 0.000 275: probing 0 0.0 0 0.0 0.000 275: substitution 0 0.0 0 0.0 0.000 275: sparsify 0 0.0 0 0.0 0.000 275: 275: reduced problem: 275: reduced rows: 188 275: reduced columns: 261 275: reduced int. columns: 0 275: reduced cont. columns: 261 275: reduced nonzeros: 1229 275: 275: presolving finished after 0.278 seconds 275: 275: Equilibrium scaling LP (persistent) 280: ESOLVE29 124: fVec error = 3.50856972e-06 exceeding SOPLEX_DEFAULT_BND_VIOL = 1.00000000e-06 280: L | 0.0 | 124 | 6 | 2.70e-04 | 2.24e+05 | 2 | 1.12361162e+05 280: --- unscaling internal solution 280: --- unsimplifying solution and basis 280: --- unscaling external solution 280: 280: SoPlex status : problem is solved [infeasible] 280: Solving time (sec) : 0.00 280: Iterations : 124 280: Objective value : 1.00000000e+100 280: 280: Solving time 0.050 seconds 280: 280: solving detected infeasible problem after 0.050 seconds 275: Simplifier removed 2 rows, 2 columns, 4 nonzeros, 0 col bounds, 4 row bounds 275: Reduced LP has 186 rows 259 columns 1225 nonzeros 275: Equilibrium scaling LP 275: type | time | iters | facts | shift | viol sum | viol num | obj value 275: L | 0.0 | 0 | 3 | 0.00e+00 | 3.75e+06 | 113 | -1.68249840e+06 279/287 Test #280: q-infeas-LP/klein1.mps ..................................................................... Passed 0.15 sec test 283 Start 283: q-infeas-LP/ex72a.mps 283: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/ex72a.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 283: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 283: Test timeout computed to be: 10000000 275: L | 0.0 | 199 | 3 | 0.00e+00 | 7.30e+06 | 113 | -1.81393761e+05 275: L | 0.0 | 379 | 7 | 0.00e+00 | 5.39e+07 | 70 | 2.96676716e+08 275: --- unscaling internal solution 275: --- unsimplifying solution and basis 275: --- unscaling external solution 282: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 282: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 282: 282: External libraries: 282: Boost 1.83.0 (https://www.boost.org/) 282: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 282: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 282: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 282: 282: reading took 0.0114 seconds 282: Numerical Statistics: 282: Matrix range [1e+00,1e+00] 282: Objective range [1e+00,1e+00] 282: Bounds range [1e+00,1e+00] 282: RHS range [0e+00,0e+00] 282: Dynamism Variables: 1e+00 282: Dynamism Rows : 1e+00 282: set presolve.componentsmaxint = -1 282: set presolve.detectlindep = 0 282: set doubletoneq.enabled = 0 282: set dualinfer.enabled = 0 282: set substitution.enabled = 0 282: set sparsify.enabled = 0 282: 282: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/ex72a.mps with dual-postsolve activated 282: rows: 197 282: columns: 215 282: int. columns: 0 282: cont. columns: 215 282: nonzeros: 467 282: 282: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 282: round 1 ( Final ): Unchanged 282: presolved 1 rounds: 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 282: 282: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 282: colsingleton 1 0.0 0 0.0 0.000 282: coefftightening 0 0.0 0 0.0 0.000 282: propagation 1 0.0 0 0.0 0.000 282: fixcontinuous 1 0.0 0 0.0 0.000 282: simpleprobing 0 0.0 0 0.0 0.000 282: parallelrows 1 0.0 0 0.0 0.000 282: parallelcols 1 0.0 0 0.0 0.000 282: stuffing 1 0.0 0 0.0 0.000 282: dualfix 1 0.0 0 0.0 0.000 282: simplifyineq 0 0.0 0 0.0 0.000 282: doubletoneq 0 0.0 0 0.0 0.000 282: implint 0 0.0 0 0.0 0.000 282: domcol 1 0.0 0 0.0 0.000 282: dualinfer 0 0.0 0 0.0 0.000 282: probing 0 0.0 0 0.0 0.000 282: substitution 0 0.0 0 0.0 0.000 282: sparsify 0 0.0 0 0.0 0.000 282: 282: reduced problem: 282: reduced rows: 197 282: reduced columns: 215 282: reduced int. columns: 0 282: reduced cont. columns: 215 282: reduced nonzeros: 467 282: 282: presolving finished after 0.002 seconds 282: 282: Equilibrium scaling LP (persistent) 282: Simplifier removed 163 rows, 163 columns, 329 nonzeros, 0 col bounds, 552 row bounds 282: Reduced LP has 34 rows 52 columns 135 nonzeros 282: Equilibrium scaling LP 282: type | time | iters | facts | shift | viol sum | viol num | obj value 282: L | 0.0 | 0 | 3 | 0.00e+00 | 2.90e+01 | 25 | 2.15000000e+02 282: L | 0.0 | 24 | 4 | 0.00e+00 | 1.00e+00 | 1 | 3.47000000e+02 282: --- unscaling internal solution 282: --- unsimplifying solution and basis 282: --- unscaling external solution 282: 282: SoPlex status : problem is solved [infeasible] 282: Solving time (sec) : 0.00 282: Iterations : 24 282: Objective value : 1.00000000e+100 282: 282: Solving time 0.013 seconds 282: 282: solving detected infeasible problem after 0.013 seconds 280/287 Test #282: d-infeas-LP/ex72a.mps ...................................................................... Passed 0.08 sec test 284 Start 284: r-infeas-LP/ex72a.mps 284: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/ex72a.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 284: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 284: Test timeout computed to be: 10000000 275: 275: SoPlex status : problem is solved [infeasible] 275: Solving time (sec) : 0.04 275: Iterations : 379 275: Objective value : 1.00000000e+100 275: 275: Solving time 0.331 seconds 275: 275: solving detected infeasible problem after 0.331 seconds 281: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 281: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 281: 281: External libraries: 281: Boost 1.83.0 (https://www.boost.org/) 281: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 281: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 281: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 281: 281: reading took 0.0285 seconds 281: Numerical Statistics: 281: Matrix range [1e+00,2e+03] 281: Objective range [0e+00,0e+00] 281: Bounds range [0e+00,0e+00] 281: RHS range [8e+00,5e+01] 281: Dynamism Variables: 2e+03 281: Dynamism Rows : 2e+03 281: set presolve.componentsmaxint = -1 281: set presolve.detectlindep = 0 281: set doubletoneq.enabled = 0 281: set dualinfer.enabled = 0 281: set substitution.enabled = 0 281: set sparsify.enabled = 0 281: 281: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/klein1.mps with dual-postsolve activated 281: rows: 54 281: columns: 54 281: int. columns: 0 281: cont. columns: 54 281: nonzeros: 696 281: 281: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 281: round 1 ( Final ): Unchanged 281: presolved 1 rounds: 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 281: 281: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 281: colsingleton 1 0.0 0 0.0 0.000 281: coefftightening 0 0.0 0 0.0 0.000 281: propagation 1 0.0 0 0.0 0.000 281: fixcontinuous 1 0.0 0 0.0 0.000 281: simpleprobing 0 0.0 0 0.0 0.000 281: parallelrows 1 0.0 0 0.0 0.006 281: parallelcols 1 0.0 0 0.0 0.002 281: stuffing 1 0.0 0 0.0 0.000 281: dualfix 1 0.0 0 0.0 0.000 281: simplifyineq 0 0.0 0 0.0 0.000 281: doubletoneq 0 0.0 0 0.0 0.000 281: implint 0 0.0 0 0.0 0.000 281: domcol 1 0.0 0 0.0 0.001 281: dualinfer 0 0.0 0 0.0 0.000 281: probing 0 0.0 0 0.0 0.000 281: substitution 0 0.0 0 0.0 0.000 281: sparsify 0 0.0 0 0.0 0.000 281: 281: reduced problem: 281: reduced rows: 54 281: reduced columns: 54 281: reduced int. columns: 0 281: reduced cont. columns: 54 281: reduced nonzeros: 696 281: 281: presolving finished after 0.029 seconds 281: 281: Equilibrium scaling LP (persistent) 281: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 281: Reduced LP has 54 rows 54 columns 696 nonzeros 281: Equilibrium scaling LP 281: type | time | iters | facts | shift | viol sum | viol num | obj value 281: L | 0.0 | 0 | 3 | 0.00e+00 | 8.75e+00 | 2 | 0.00000000e+00 281/287 Test #275: r-infeas-LP/refinery.mps ................................................................... Passed 0.48 sec test 285 Start 285: d-infeas-LP/forest6.mps 285: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "d" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/forest6.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 285: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 285: Test timeout computed to be: 10000000 283: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 283: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 283: 283: External libraries: 283: Boost 1.83.0 (https://www.boost.org/) 283: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 283: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 283: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 283: 283: reading took 0.0088 seconds 283: Numerical Statistics: 283: Matrix range [1e+00,1e+00] 283: Objective range [1e+00,1e+00] 283: Bounds range [1e+00,1e+00] 283: RHS range [0e+00,0e+00] 283: Dynamism Variables: 1e+00 283: Dynamism Rows : 1e+00 283: set presolve.componentsmaxint = -1 283: set presolve.detectlindep = 0 283: set doubletoneq.enabled = 0 283: set dualinfer.enabled = 0 283: set substitution.enabled = 0 283: set sparsify.enabled = 0 283: 283: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/ex72a.mps with dual-postsolve activated 283: rows: 197 283: columns: 215 283: int. columns: 0 283: cont. columns: 215 283: nonzeros: 467 283: 283: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 283: round 1 ( Final ): Unchanged 283: presolved 1 rounds: 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 283: 283: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 283: colsingleton 1 0.0 0 0.0 0.000 283: coefftightening 0 0.0 0 0.0 0.000 283: propagation 1 0.0 0 0.0 0.001 283: fixcontinuous 1 0.0 0 0.0 0.000 283: simpleprobing 0 0.0 0 0.0 0.000 283: parallelrows 1 0.0 0 0.0 0.000 283: parallelcols 1 0.0 0 0.0 0.000 283: stuffing 1 0.0 0 0.0 0.000 283: dualfix 1 0.0 0 0.0 0.000 283: simplifyineq 0 0.0 0 0.0 0.000 283: doubletoneq 0 0.0 0 0.0 0.000 283: implint 0 0.0 0 0.0 0.000 283: domcol 1 0.0 0 0.0 0.001 283: dualinfer 0 0.0 0 0.0 0.000 283: probing 0 0.0 0 0.0 0.000 283: substitution 0 0.0 0 0.0 0.000 283: sparsify 0 0.0 0 0.0 0.000 283: 283: reduced problem: 283: reduced rows: 197 283: reduced columns: 215 283: reduced int. columns: 0 283: reduced cont. columns: 215 283: reduced nonzeros: 467 283: 283: presolving finished after 0.012 seconds 283: 283: Equilibrium scaling LP (persistent) 283: Simplifier removed 163 rows, 163 columns, 329 nonzeros, 0 col bounds, 552 row bounds 283: Reduced LP has 34 rows 52 columns 135 nonzeros 283: Equilibrium scaling LP 283: type | time | iters | facts | shift | viol sum | viol num | obj value 283: L | 0.0 | 0 | 3 | 0.00e+00 | 2.90e+01 | 25 | 2.15000000e+02 283: L | 0.0 | 24 | 4 | 0.00e+00 | 1.00e+00 | 1 | 3.47000000e+02 283: --- unscaling internal solution 283: --- unsimplifying solution and basis 281: ESOLVE29 124: fVec error = 3.50856972e-06 exceeding SOPLEX_DEFAULT_BND_VIOL = 1.00000000e-06 281: L | 0.0 | 124 | 6 | 2.70e-04 | 2.24e+05 | 2 | 1.12361162e+05 281: --- unscaling internal solution 281: --- unsimplifying solution and basis 281: --- unscaling external solution 281: 281: SoPlex status : problem is solved [infeasible] 281: Solving time (sec) : 0.02 281: Iterations : 124 281: Objective value : 1.00000000e+100 281: 281: Solving time 0.046 seconds 281: 281: solving detected infeasible problem after 0.046 seconds 282/287 Test #281: r-infeas-LP/klein1.mps ..................................................................... Passed 0.15 sec test 286 Start 286: q-infeas-LP/forest6.mps 286: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "q" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/forest6.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 286: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 286: Test timeout computed to be: 10000000 283: --- unscaling external solution 283: 283: SoPlex status : problem is solved [infeasible] 283: Solving time (sec) : 0.00 283: Iterations : 24 283: Objective value : 1.00000000e+100 283: 283: Solving time 0.034 seconds 283: 283: solving detected infeasible problem after 0.034 seconds 283/287 Test #283: q-infeas-LP/ex72a.mps ...................................................................... Passed 0.13 sec test 287 Start 287: r-infeas-LP/forest6.mps 287: Test command: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/bin/papilo "solve" "-a" "r" "-f" "/build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/forest6.mps" "-p" "/build/reproducible-path/papilo-2.4.1+ds/settings/lp_presolvers_with_basis.set" 287: Working Directory: /build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf/test 287: Test timeout computed to be: 10000000 285: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 285: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 285: 285: External libraries: 285: Boost 1.83.0 (https://www.boost.org/) 285: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 285: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 285: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 285: 285: reading took 0.00446 seconds 285: Numerical Statistics: 285: Matrix range [2e-01,1e+00] 285: Objective range [1e+00,1e+01] 285: Bounds range [1e+04,5e+04] 285: RHS range [1e+03,1e+03] 285: Dynamism Variables: 5e+00 285: Dynamism Rows : 4e+00 285: set presolve.componentsmaxint = -1 285: set presolve.detectlindep = 0 285: set doubletoneq.enabled = 0 285: set dualinfer.enabled = 0 285: set substitution.enabled = 0 285: set sparsify.enabled = 0 285: 285: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/forest6.mps with dual-postsolve activated 285: rows: 66 285: columns: 95 285: int. columns: 0 285: cont. columns: 95 285: nonzeros: 210 285: 285: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 285: round 1 ( Fast ): 0 del cols, 0 del rows, 15 chg bounds, 0 chg sides, 0 chg coeffs, 30 tsx applied, 0 tsx conflicts 285: round 2 ( Fast ): 0 del cols, 0 del rows, 30 chg bounds, 0 chg sides, 0 chg coeffs, 60 tsx applied, 0 tsx conflicts 285: round 3 ( Fast ): 0 del cols, 0 del rows, 45 chg bounds, 0 chg sides, 0 chg coeffs, 90 tsx applied, 0 tsx conflicts 285: round 4 ( Fast ): 0 del cols, 0 del rows, 60 chg bounds, 0 chg sides, 0 chg coeffs, 120 tsx applied, 0 tsx conflicts 285: round 5 ( Fast ): 0 del cols, 0 del rows, 75 chg bounds, 0 chg sides, 0 chg coeffs, 150 tsx applied, 0 tsx conflicts 285: round 6 ( Fast ): 0 del cols, 0 del rows, 90 chg bounds, 0 chg sides, 0 chg coeffs, 180 tsx applied, 0 tsx conflicts 285: round 7 ( Medium ): 5 del cols, 0 del rows, 90 chg bounds, 5 chg sides, 5 chg coeffs, 185 tsx applied, 30 tsx conflicts 285: round 8 (Exhaustive): 5 del cols, 0 del rows, 90 chg bounds, 5 chg sides, 5 chg coeffs, 185 tsx applied, 30 tsx conflicts 285: round 9 ( Final ): Unchanged 285: presolved 9 rounds: 5 del cols, 0 del rows, 90 chg bounds, 5 chg sides, 5 chg coeffs, 185 tsx applied, 30 tsx conflicts 285: 285: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 285: colsingleton 9 0.0 0 0.0 0.000 285: coefftightening 0 0.0 0 0.0 0.000 285: propagation 9 66.7 180 100.0 0.000 285: fixcontinuous 2 0.0 0 0.0 0.000 285: simpleprobing 0 0.0 0 0.0 0.000 285: parallelrows 1 0.0 0 0.0 0.000 285: parallelcols 1 0.0 0 0.0 0.000 285: stuffing 2 50.0 35 14.3 0.000 285: dualfix 2 0.0 0 0.0 0.000 285: simplifyineq 0 0.0 0 0.0 0.000 285: doubletoneq 0 0.0 0 0.0 0.000 285: implint 0 0.0 0 0.0 0.000 285: domcol 1 0.0 0 0.0 0.000 285: dualinfer 0 0.0 0 0.0 0.000 285: probing 0 0.0 0 0.0 0.000 285: substitution 0 0.0 0 0.0 0.000 285: sparsify 0 0.0 0 0.0 0.000 285: 285: reduced problem: 285: reduced rows: 66 285: reduced columns: 90 285: reduced int. columns: 0 285: reduced cont. columns: 90 285: reduced nonzeros: 205 285: 285: presolving finished after 0.006 seconds 285: 285: Equilibrium scaling LP (persistent) 285: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 285: Reduced LP has 66 rows 90 columns 205 nonzeros 285: Equilibrium scaling LP 285: type | time | iters | facts | shift | viol sum | viol num | obj value 285: L | 0.0 | 0 | 3 | 0.00e+00 | 1.41e+04 | 6 | 0.00000000e+00 285: L | 0.0 | 77 | 4 | 0.00e+00 | 1.24e+05 | 6 | 6.28971310e+05 285: --- unscaling internal solution 285: --- unsimplifying solution and basis 285: --- unscaling external solution 285: 285: SoPlex status : problem is solved [infeasible] 285: Solving time (sec) : 0.00 285: Iterations : 77 285: Objective value : 1.00000000e+100 285: 285: Solving time 0.015 seconds 285: 285: solving detected infeasible problem after 0.015 seconds 284/287 Test #285: d-infeas-LP/forest6.mps .................................................................... Passed 0.08 sec 284: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 284: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 284: 284: External libraries: 284: Boost 1.83.0 (https://www.boost.org/) 284: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 284: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 284: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 284: 284: reading took 0.0175 seconds 284: Numerical Statistics: 284: Matrix range [1e+00,1e+00] 284: Objective range [1e+00,1e+00] 284: Bounds range [1e+00,1e+00] 284: RHS range [0e+00,0e+00] 284: Dynamism Variables: 1e+00 284: Dynamism Rows : 1e+00 284: set presolve.componentsmaxint = -1 284: set presolve.detectlindep = 0 284: set doubletoneq.enabled = 0 284: set dualinfer.enabled = 0 284: set substitution.enabled = 0 284: set sparsify.enabled = 0 284: 284: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/ex72a.mps with dual-postsolve activated 284: rows: 197 284: columns: 215 284: int. columns: 0 284: cont. columns: 215 284: nonzeros: 467 284: 284: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 284: round 1 ( Final ): Unchanged 284: presolved 1 rounds: 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 284: 284: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 284: colsingleton 1 0.0 0 0.0 0.000 284: coefftightening 0 0.0 0 0.0 0.000 284: propagation 1 0.0 0 0.0 0.018 284: fixcontinuous 1 0.0 0 0.0 0.000 284: simpleprobing 0 0.0 0 0.0 0.000 284: parallelrows 1 0.0 0 0.0 0.001 284: parallelcols 1 0.0 0 0.0 0.002 284: stuffing 1 0.0 0 0.0 0.000 284: dualfix 1 0.0 0 0.0 0.005 284: simplifyineq 0 0.0 0 0.0 0.000 284: doubletoneq 0 0.0 0 0.0 0.000 284: implint 0 0.0 0 0.0 0.000 284: domcol 1 0.0 0 0.0 0.001 284: dualinfer 0 0.0 0 0.0 0.000 284: probing 0 0.0 0 0.0 0.000 284: substitution 0 0.0 0 0.0 0.000 284: sparsify 0 0.0 0 0.0 0.000 284: 284: reduced problem: 284: reduced rows: 197 284: reduced columns: 215 284: reduced int. columns: 0 284: reduced cont. columns: 215 284: reduced nonzeros: 467 284: 284: presolving finished after 0.035 seconds 284: 284: Equilibrium scaling LP (persistent) 286: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 286: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 286: 286: External libraries: 286: Boost 1.83.0 (https://www.boost.org/) 286: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 286: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 286: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 286: 286: reading took 0.00241 seconds 286: Numerical Statistics: 286: Matrix range [2e-01,1e+00] 286: Objective range [1e+00,1e+01] 286: Bounds range [1e+04,5e+04] 286: RHS range [1e+03,1e+03] 286: Dynamism Variables: 5e+00 286: Dynamism Rows : 4e+00 286: set presolve.componentsmaxint = -1 286: set presolve.detectlindep = 0 286: set doubletoneq.enabled = 0 286: set dualinfer.enabled = 0 286: set substitution.enabled = 0 286: set sparsify.enabled = 0 286: 286: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/forest6.mps with dual-postsolve activated 286: rows: 66 286: columns: 95 286: int. columns: 0 286: cont. columns: 95 286: nonzeros: 210 286: 286: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 286: round 1 ( Fast ): 0 del cols, 0 del rows, 15 chg bounds, 0 chg sides, 0 chg coeffs, 30 tsx applied, 0 tsx conflicts 286: round 2 ( Fast ): 0 del cols, 0 del rows, 30 chg bounds, 0 chg sides, 0 chg coeffs, 60 tsx applied, 0 tsx conflicts 286: round 3 ( Fast ): 0 del cols, 0 del rows, 45 chg bounds, 0 chg sides, 0 chg coeffs, 90 tsx applied, 0 tsx conflicts 286: round 4 ( Fast ): 0 del cols, 0 del rows, 60 chg bounds, 0 chg sides, 0 chg coeffs, 120 tsx applied, 0 tsx conflicts 286: round 5 ( Fast ): 0 del cols, 0 del rows, 75 chg bounds, 0 chg sides, 0 chg coeffs, 150 tsx applied, 0 tsx conflicts 286: round 6 ( Fast ): 0 del cols, 0 del rows, 90 chg bounds, 0 chg sides, 0 chg coeffs, 180 tsx applied, 0 tsx conflicts 286: round 7 ( Medium ): 5 del cols, 0 del rows, 90 chg bounds, 5 chg sides, 5 chg coeffs, 185 tsx applied, 30 tsx conflicts 286: round 8 (Exhaustive): 5 del cols, 0 del rows, 90 chg bounds, 5 chg sides, 5 chg coeffs, 185 tsx applied, 30 tsx conflicts 286: round 9 ( Final ): Unchanged 286: presolved 9 rounds: 5 del cols, 0 del rows, 90 chg bounds, 5 chg sides, 5 chg coeffs, 185 tsx applied, 30 tsx conflicts 286: 286: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 286: colsingleton 9 0.0 0 0.0 0.000 286: coefftightening 0 0.0 0 0.0 0.000 286: propagation 9 66.7 180 100.0 0.006 286: fixcontinuous 2 0.0 0 0.0 0.000 286: simpleprobing 0 0.0 0 0.0 0.000 286: parallelrows 1 0.0 0 0.0 0.000 286: parallelcols 1 0.0 0 0.0 0.000 286: stuffing 2 50.0 35 14.3 0.008 286: dualfix 2 0.0 0 0.0 0.000 286: simplifyineq 0 0.0 0 0.0 0.000 286: doubletoneq 0 0.0 0 0.0 0.000 286: implint 0 0.0 0 0.0 0.000 286: domcol 1 0.0 0 0.0 0.001 286: dualinfer 0 0.0 0 0.0 0.000 286: probing 0 0.0 0 0.0 0.000 286: substitution 0 0.0 0 0.0 0.000 286: sparsify 0 0.0 0 0.0 0.000 286: 286: reduced problem: 286: reduced rows: 66 286: reduced columns: 90 286: reduced int. columns: 0 286: reduced cont. columns: 90 286: reduced nonzeros: 205 286: 286: presolving finished after 0.026 seconds 286: 286: Equilibrium scaling LP (persistent) 286: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 286: Reduced LP has 66 rows 90 columns 205 nonzeros 286: Equilibrium scaling LP 286: type | time | iters | facts | shift | viol sum | viol num | obj value 286: L | 0.0 | 0 | 3 | 0.00e+00 | 1.41e+04 | 6 | 0.00000000e+00 286: L | 0.0 | 73 | 4 | 0.00e+00 | 9.53e+04 | 8 | 5.38660693e+05 286: --- unscaling internal solution 286: --- unsimplifying solution and basis 286: --- unscaling external solution 286: 286: SoPlex status : problem is solved [infeasible] 286: Solving time (sec) : 0.00 286: Iterations : 73 286: Objective value : 1.00000000e+100 286: 286: Solving time 0.030 seconds 286: 286: solving detected infeasible problem after 0.030 seconds 284: Simplifier removed 163 rows, 163 columns, 329 nonzeros, 0 col bounds, 552 row bounds 284: Reduced LP has 34 rows 52 columns 135 nonzeros 284: Equilibrium scaling LP 284: type | time | iters | facts | shift | viol sum | viol num | obj value 284: L | 0.0 | 0 | 3 | 0.00e+00 | 2.90e+01 | 25 | 2.15000000e+02 284: L | 0.0 | 24 | 4 | 0.00e+00 | 1.00e+00 | 1 | 3.47000000e+02 284: --- unscaling internal solution 284: --- unsimplifying solution and basis 285/287 Test #286: q-infeas-LP/forest6.mps .................................................................... Passed 0.11 sec 287: PaPILO version 2.4.1 [mode: debug][Solvers: SoPlex][GitHash: ] 287: Copyright (C) 2020-2025 Zuse Institute Berlin (ZIB) 287: 287: External libraries: 287: Boost 1.83.0 (https://www.boost.org/) 287: TBB 2022.0 Thread building block https://github.com/oneapi-src/oneTBB developed by Intel 287: GMP 6.3.0 GNU Multiple Precision Arithmetic Library developed by T. Granlund (gmplib.org) 287: SoPlex 7.1.3 Linear Programming Solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: NoGitInfo] 287: 287: reading took 0.00358 seconds 287: Numerical Statistics: 287: Matrix range [2e-01,1e+00] 287: Objective range [1e+00,1e+01] 287: Bounds range [1e+04,5e+04] 287: RHS range [1e+03,1e+03] 287: Dynamism Variables: 5e+00 287: Dynamism Rows : 4e+00 287: set presolve.componentsmaxint = -1 287: set presolve.detectlindep = 0 287: set doubletoneq.enabled = 0 287: set dualinfer.enabled = 0 287: set substitution.enabled = 0 287: set sparsify.enabled = 0 287: 287: starting presolve of problem /build/reproducible-path/papilo-2.4.1+ds/check/instances/LP/forest6.mps with dual-postsolve activated 287: rows: 66 287: columns: 95 287: int. columns: 0 287: cont. columns: 95 287: nonzeros: 210 287: 287: round 0 ( Trivial ): 0 del cols, 0 del rows, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 tsx applied, 0 tsx conflicts 287: round 1 ( Fast ): 0 del cols, 0 del rows, 15 chg bounds, 0 chg sides, 0 chg coeffs, 30 tsx applied, 0 tsx conflicts 287: round 2 ( Fast ): 0 del cols, 0 del rows, 30 chg bounds, 0 chg sides, 0 chg coeffs, 60 tsx applied, 0 tsx conflicts 287: round 3 ( Fast ): 0 del cols, 0 del rows, 45 chg bounds, 0 chg sides, 0 chg coeffs, 90 tsx applied, 0 tsx conflicts 287: round 4 ( Fast ): 0 del cols, 0 del rows, 60 chg bounds, 0 chg sides, 0 chg coeffs, 120 tsx applied, 0 tsx conflicts 287: round 5 ( Fast ): 0 del cols, 0 del rows, 75 chg bounds, 0 chg sides, 0 chg coeffs, 150 tsx applied, 0 tsx conflicts 287: round 6 ( Fast ): 0 del cols, 0 del rows, 90 chg bounds, 0 chg sides, 0 chg coeffs, 180 tsx applied, 0 tsx conflicts 287: round 7 ( Medium ): 5 del cols, 0 del rows, 90 chg bounds, 5 chg sides, 5 chg coeffs, 185 tsx applied, 30 tsx conflicts 287: round 8 (Exhaustive): 5 del cols, 0 del rows, 90 chg bounds, 5 chg sides, 5 chg coeffs, 185 tsx applied, 30 tsx conflicts 287: round 9 ( Final ): Unchanged 287: presolved 9 rounds: 5 del cols, 0 del rows, 90 chg bounds, 5 chg sides, 5 chg coeffs, 185 tsx applied, 30 tsx conflicts 287: 287: presolver nb calls success calls(%) nb transactions tsx applied(%) execution time(s) 287: colsingleton 9 0.0 0 0.0 0.000 287: coefftightening 0 0.0 0 0.0 0.000 287: propagation 9 66.7 180 100.0 0.008 287: fixcontinuous 2 0.0 0 0.0 0.000 287: simpleprobing 0 0.0 0 0.0 0.000 287: parallelrows 1 0.0 0 0.0 0.001 287: parallelcols 1 0.0 0 0.0 0.001 287: stuffing 2 50.0 35 14.3 0.002 287: dualfix 2 0.0 0 0.0 0.000 287: simplifyineq 0 0.0 0 0.0 0.000 287: doubletoneq 0 0.0 0 0.0 0.000 287: implint 0 0.0 0 0.0 0.000 287: domcol 1 0.0 0 0.0 0.006 287: dualinfer 0 0.0 0 0.0 0.000 287: probing 0 0.0 0 0.0 0.000 287: substitution 0 0.0 0 0.0 0.000 287: sparsify 0 0.0 0 0.0 0.000 287: 287: reduced problem: 287: reduced rows: 66 287: reduced columns: 90 287: reduced int. columns: 0 287: reduced cont. columns: 90 287: reduced nonzeros: 205 287: 287: presolving finished after 0.045 seconds 287: 287: Equilibrium scaling LP (persistent) 287: Simplifier removed 0 rows, 0 columns, 0 nonzeros, 0 col bounds, 0 row bounds 287: Reduced LP has 66 rows 90 columns 205 nonzeros 287: Equilibrium scaling LP 287: type | time | iters | facts | shift | viol sum | viol num | obj value 287: L | 0.0 | 0 | 3 | 0.00e+00 | 1.41e+04 | 6 | 0.00000000e+00 287: L | 0.0 | 77 | 4 | 0.00e+00 | 1.24e+05 | 6 | 6.28971310e+05 287: --- unscaling internal solution 287: --- unsimplifying solution and basis 287: --- unscaling external solution 287: 287: SoPlex status : problem is solved [infeasible] 287: Solving time (sec) : 0.00 287: Iterations : 77 287: Objective value : 1.00000000e+100 287: 287: Solving time 0.051 seconds 287: 287: solving detected infeasible problem after 0.051 seconds 284: --- unscaling external solution 284: 284: SoPlex status : problem is solved [infeasible] 284: Solving time (sec) : 0.00 284: Iterations : 24 284: Objective value : 1.00000000e+100 284: 284: Solving time 0.086 seconds 284: 284: solving detected infeasible problem after 0.086 seconds 286/287 Test #284: r-infeas-LP/ex72a.mps ...................................................................... Passed 0.19 sec 287/287 Test #287: r-infeas-LP/forest6.mps .................................................................... Passed 0.12 sec 100% tests passed, 0 tests failed out of 287 Total Test time (real) = 18.06 sec make[2]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' make[1]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds' create-stamp debian/debhelper-build-stamp dh_testroot -O--buildsystem=cmake dh_prep -O--buildsystem=cmake dh_auto_install -O--buildsystem=cmake cd obj-arm-linux-gnueabihf && make -j4 install DESTDIR=/build/reproducible-path/papilo-2.4.1\+ds/debian/tmp AM_UPDATE_INFO_DIR=no "INSTALL=install --strip-program=true" make[1]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' /usr/bin/cmake -S/build/reproducible-path/papilo-2.4.1+ds -B/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf --check-build-system CMakeFiles/Makefile.cmake 0 make -f CMakeFiles/Makefile2 preinstall make[2]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' make[2]: Nothing to be done for 'preinstall'. make[2]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' Install the project... /usr/bin/cmake -P cmake_install.cmake -- Install configuration: "None" -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/CMakeConfig.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/Config.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/lib/arm-linux-gnueabihf/cmake/papilo/papilo-config-version.cmake -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/Components.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/ConstraintMatrix.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/MatrixBuffer.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/Objective.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/Presolve.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/PresolveMethod.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/PresolveOptions.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/ProbingView.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/Problem.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/ProblemBuilder.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/ProblemFlag.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/ProblemUpdate.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/Reductions.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/RowFlags.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/SingleRow.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/Solution.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/SparseStorage.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/Statistics.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/SymmetryStorage.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/VariableDomains.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/postsolve/BoundStorage.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/postsolve/PostsolveStorage.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/postsolve/Postsolve.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/postsolve/PostsolveStatus.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/postsolve/PostsolveType.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/postsolve/ReductionType.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/core/postsolve/SavedRow.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/interfaces/HighsInterface.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/interfaces/GlopInterface.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/interfaces/GurobiInterface.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/interfaces/ScipInterface.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/interfaces/SolverInterface.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/interfaces/SoplexInterface.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/interfaces/RoundingsatInterface.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/io/BoundType.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/io/Message.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/io/MpsParser.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/io/MpsWriter.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/io/OpbParser.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/io/OpbWriter.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/io/ParseKey.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/io/Parser.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/io/SolParser.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/io/SolWriter.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/Alloc.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/Array.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/compress_vector.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/DependentRows.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/Flags.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/fmt.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/Hash.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/MultiPrecision.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/Num.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/NumericalStatistics.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/PrimalDualSolValidation.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/OptionsParser.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/VersionLogger.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/ParameterSet.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/Signature.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/StableSum.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/String.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/tbb.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/Timer.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/Validation.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/Vec.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/VectorUtils.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/Wrappers.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/verification/ArgumentType.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/verification/CertificateInterface.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/verification/EmptyCertificate.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/verification/VeriPb.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/misc/extended_euclidean.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/presolvers/CoefficientStrengthening.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/presolvers/ConstraintPropagation.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/presolvers/DominatedCols.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/presolvers/DualFix.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/presolvers/DualInfer.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/presolvers/FixContinuous.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/presolvers/FreeVarSubstitution.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/presolvers/ImplIntDetection.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/presolvers/ParallelColDetection.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/presolvers/ParallelRowDetection.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/presolvers/Probing.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/presolvers/SimpleProbing.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/presolvers/SimpleSubstitution.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/presolvers/SimplifyInequalities.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/presolvers/SingletonCols.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/presolvers/SingletonStuffing.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/presolvers/Sparsify.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/external/pdqsort/pdqsort.h -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/external/ska/bytell_hash_map.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/external/ska/flat_hash_map.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/external/ska/unordered_map.hpp -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/include/papilo/external/lusol/clusol.h -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/lib/arm-linux-gnueabihf/cmake/papilo/FindGMP.cmake -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/lib/arm-linux-gnueabihf/cmake/papilo/papilo-config.cmake -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/lib/arm-linux-gnueabihf/cmake/papilo/FindTBB.cmake -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/lib/arm-linux-gnueabihf/libpapilo-core.so.0d -- Set non-toolchain portion of runtime path of "/build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/lib/arm-linux-gnueabihf/libpapilo-core.so.0d" to "" -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/lib/arm-linux-gnueabihf/libpapilo-core.so -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/lib/arm-linux-gnueabihf/libpapilo-clusol.so.0d -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/lib/arm-linux-gnueabihf/libpapilo-clusol.so -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/lib/arm-linux-gnueabihf/cmake/papilo/papilo-targets.cmake -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/lib/arm-linux-gnueabihf/cmake/papilo/papilo-targets-none.cmake -- Installing: /build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/bin/papilo -- Set non-toolchain portion of runtime path of "/build/reproducible-path/papilo-2.4.1+ds/debian/tmp/usr/bin/papilo" to "" make[1]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds/obj-arm-linux-gnueabihf' dh_install -O--buildsystem=cmake dh_installdocs -O--buildsystem=cmake dh_installchangelogs -O--buildsystem=cmake debian/rules execute_before_dh_installman make[1]: Entering directory '/build/reproducible-path/papilo-2.4.1+ds' sed -e 's/@VERSION@//g' debian/papilo.1.in > debian/papilo.1 make[1]: Leaving directory '/build/reproducible-path/papilo-2.4.1+ds' dh_installman -O--buildsystem=cmake dh_installsystemduser -O--buildsystem=cmake dh_perl -O--buildsystem=cmake dh_link -O--buildsystem=cmake dh_strip_nondeterminism -O--buildsystem=cmake dh_compress -O--buildsystem=cmake dh_fixperms -O--buildsystem=cmake dh_missing -O--buildsystem=cmake dh_dwz -a -O--buildsystem=cmake dh_strip -a -O--buildsystem=cmake dh_makeshlibs -a -O--buildsystem=cmake dh_shlibdeps -a -O--buildsystem=cmake dpkg-shlibdeps: warning: diversions involved - output may be incorrect diversion by libc6 from: /lib/ld-linux-armhf.so.3 dpkg-shlibdeps: warning: diversions involved - output may be incorrect diversion by libc6 to: /lib/ld-linux-armhf.so.3.usr-is-merged dpkg-shlibdeps: warning: diversions involved - output may be incorrect diversion by libc6 from: /lib/ld-linux-armhf.so.3 dpkg-shlibdeps: warning: diversions involved - output may be incorrect diversion by libc6 to: /lib/ld-linux-armhf.so.3.usr-is-merged dpkg-shlibdeps: warning: diversions involved - output may be incorrect diversion by libc6 from: /lib/ld-linux-armhf.so.3 dpkg-shlibdeps: warning: diversions involved - output may be incorrect diversion by libc6 to: /lib/ld-linux-armhf.so.3.usr-is-merged dpkg-shlibdeps: warning: symbol __aeabi_atexit@CXXABI_ARM_1.3.3 used by debian/libpapilo-core0d/usr/lib/arm-linux-gnueabihf/libpapilo-core.so.0d found in none of the libraries dpkg-shlibdeps: warning: debian/papilo/usr/bin/papilo contains an unresolvable reference to symbol __aeabi_atexit@CXXABI_ARM_1.3.3: it's probably a plugin dh_installdeb -O--buildsystem=cmake dh_gencontrol -O--buildsystem=cmake dh_md5sums -O--buildsystem=cmake dh_builddeb -O--buildsystem=cmake dpkg-deb: building package 'libpapilo-clusol0d' in '../libpapilo-clusol0d_2.4.1+ds-1_armhf.deb'. dpkg-deb: building package 'libpapilo-core0d' in '../libpapilo-core0d_2.4.1+ds-1_armhf.deb'. dpkg-deb: building package 'libpapilo-dev' in '../libpapilo-dev_2.4.1+ds-1_armhf.deb'. dpkg-deb: building package 'papilo' in '../papilo_2.4.1+ds-1_armhf.deb'. dpkg-deb: building package 'libpapilo-clusol0d-dbgsym' in '../libpapilo-clusol0d-dbgsym_2.4.1+ds-1_armhf.deb'. dpkg-deb: building package 'libpapilo-core0d-dbgsym' in '../libpapilo-core0d-dbgsym_2.4.1+ds-1_armhf.deb'. dpkg-deb: building package 'papilo-dbgsym' in '../papilo-dbgsym_2.4.1+ds-1_armhf.deb'. dpkg-genbuildinfo --build=binary -O../papilo_2.4.1+ds-1_armhf.buildinfo dpkg-genchanges --build=binary -O../papilo_2.4.1+ds-1_armhf.changes dpkg-genchanges: info: binary-only upload (no source code included) dpkg-source --after-build . dpkg-buildpackage: info: binary-only upload (no source included) dpkg-genchanges: info: including full source code in upload I: copying local configuration I: user script /srv/workspace/pbuilder/1828/tmp/hooks/B01_cleanup starting I: user script /srv/workspace/pbuilder/1828/tmp/hooks/B01_cleanup finished I: unmounting dev/ptmx filesystem I: unmounting dev/pts filesystem I: unmounting dev/shm filesystem I: unmounting proc filesystem I: unmounting sys filesystem I: cleaning the build env I: removing directory /srv/workspace/pbuilder/1828 and its subdirectories I: Current time: Thu Feb 13 22:05:10 +14 2025 I: pbuilder-time-stamp: 1739433910