Mock Version: 2.15 Mock Version: 2.15 Mock Version: 2.15 ENTER ['do_with_status'](['bash', '--login', '-c', '/usr/bin/rpmbuild -bs --target riscv64 --nodeps /builddir/build/SPECS/python-tdlib.spec'], chrootPath='/var/lib/mock/f41-build-822734-153168/root'env={'TERM': 'vt100', 'SHELL': '/bin/bash', 'HOME': '/builddir', 'HOSTNAME': 'mock', 'PATH': '/usr/bin:/bin:/usr/sbin:/sbin', 'PROMPT_COMMAND': 'printf "\\033]0;\\007"', 'PS1': ' \\s-\\v\\$ ', 'LANG': 'C.UTF-8'}shell=Falselogger=timeout=604800uid=991gid=135user='mockbuild'nspawn_args=[]unshare_net=TrueprintOutput=False) Executing command: ['bash', '--login', '-c', '/usr/bin/rpmbuild -bs --target riscv64 --nodeps /builddir/build/SPECS/python-tdlib.spec'] with env {'TERM': 'vt100', 'SHELL': '/bin/bash', 'HOME': '/builddir', 'HOSTNAME': 'mock', 'PATH': '/usr/bin:/bin:/usr/sbin:/sbin', 'PROMPT_COMMAND': 'printf "\\033]0;\\007"', 'PS1': ' \\s-\\v\\$ ', 'LANG': 'C.UTF-8'} and shell False Building target platforms: riscv64 Building for target riscv64 setting SOURCE_DATE_EPOCH=1721347200 Wrote: /builddir/build/SRPMS/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.src.rpm Child return code was: 0 ENTER ['do_with_status'](['bash', '--login', '-c', '/usr/bin/rpmbuild -bb --target riscv64 --nodeps /builddir/build/SPECS/python-tdlib.spec'], chrootPath='/var/lib/mock/f41-build-822734-153168/root'env={'TERM': 'vt100', 'SHELL': '/bin/bash', 'HOME': '/builddir', 'HOSTNAME': 'mock', 'PATH': '/usr/bin:/bin:/usr/sbin:/sbin', 'PROMPT_COMMAND': 'printf "\\033]0;\\007"', 'PS1': ' \\s-\\v\\$ ', 'LANG': 'C.UTF-8'}shell=Falselogger=timeout=604800uid=991gid=135user='mockbuild'nspawn_args=[]unshare_net=TrueprintOutput=False) Executing command: ['bash', '--login', '-c', '/usr/bin/rpmbuild -bb --target riscv64 --nodeps /builddir/build/SPECS/python-tdlib.spec'] with env {'TERM': 'vt100', 'SHELL': '/bin/bash', 'HOME': '/builddir', 'HOSTNAME': 'mock', 'PATH': '/usr/bin:/bin:/usr/sbin:/sbin', 'PROMPT_COMMAND': 'printf "\\033]0;\\007"', 'PS1': ' \\s-\\v\\$ ', 'LANG': 'C.UTF-8'} and shell False Building target platforms: riscv64 Building for target riscv64 setting SOURCE_DATE_EPOCH=1721347200 Executing(%mkbuilddir): /bin/sh -e /var/tmp/rpm-tmp.SDrNv9 + umask 022 + cd /builddir/build/BUILD/python-tdlib-0.9.2-build + test -d /builddir/build/BUILD/python-tdlib-0.9.2-build + /usr/bin/chmod -Rf a+rX,u+w,g-w,o-w /builddir/build/BUILD/python-tdlib-0.9.2-build + /usr/bin/rm -rf /builddir/build/BUILD/python-tdlib-0.9.2-build + /usr/bin/mkdir -p /builddir/build/BUILD/python-tdlib-0.9.2-build + /usr/bin/mkdir -p /builddir/build/BUILD/python-tdlib-0.9.2-build/SPECPARTS + RPM_EC=0 ++ jobs -p + exit 0 Executing(%prep): /bin/sh -e /var/tmp/rpm-tmp.7sexPD + umask 022 + cd /builddir/build/BUILD/python-tdlib-0.9.2-build + cd /builddir/build/BUILD/python-tdlib-0.9.2-build + rm -rf tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e + /usr/lib/rpm/rpmuncompress -x /builddir/build/SOURCES/tdlib-e8ec911.tar.gz + STATUS=0 + '[' 0 -ne 0 ']' + cd tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e + /usr/bin/chmod -Rf a+rX,u+w,g-w,o-w . + /usr/lib/rpm/rpmuncompress /builddir/build/SOURCES/python-tdlib-python-includes.patch + /usr/bin/patch -p1 -s --fuzz=0 --no-backup-if-mismatch -f + /usr/lib/rpm/rpmuncompress /builddir/build/SOURCES/python-tdlib-32bit.patch + /usr/bin/patch -p1 -s --fuzz=0 --no-backup-if-mismatch -f + sed -i 's/--cplus/-3 &/' cython.am + sed -i s/pythondir/pyexecdir/ tdlib/Makefile.am + sed -i 's/ -Os -march=native//' examples/Makefile.am + autoreconf -fi . libtoolize: putting auxiliary files in '.'. libtoolize: copying file './ltmain.sh' libtoolize: putting macros in AC_CONFIG_MACRO_DIRS, 'm4'. libtoolize: copying file 'm4/libtool.m4' libtoolize: copying file 'm4/ltoptions.m4' libtoolize: copying file 'm4/ltsugar.m4' libtoolize: copying file 'm4/ltversion.m4' libtoolize: copying file 'm4/lt~obsolete.m4' configure.ac:136: warning: The macro 'AC_TRY_CPP' is obsolete. configure.ac:136: You should run autoupdate. ./lib/autoconf/general.m4:2762: AC_TRY_CPP is expanded from... m4/am_check_python_headers.m4:4: AM_CHECK_PYTHON_HEADERS is expanded from... lib/m4sugar/m4sh.m4:697: AS_IF is expanded from... lib/m4sugar/m4sh.m4:697: AS_IF is expanded from... configure.ac:136: the top level configure.ac:10: installing './compile' configure.ac:10: installing './config.guess' configure.ac:10: installing './config.sub' configure.ac:9: installing './install-sh' configure.ac:9: installing './missing' Makefile.am: installing './INSTALL' examples/Makefile.am: installing './depcomp' cython.am:24: warning: '%'-style pattern rules are a GNU make extension tdlib/Makefile.am:1: 'cython.am' included from here cython.am:29: warning: '%'-style pattern rules are a GNU make extension tdlib/Makefile.am:1: 'cython.am' included from here cython.am:34: warning: filter %.py,$(DIST_COMMON: non-POSIX variable name cython.am:34: (probably a GNU make extension) tdlib/Makefile.am:1: 'cython.am' included from here cython.am:41: warning: '%'-style pattern rules are a GNU make extension tdlib/Makefile.am:1: 'cython.am' included from here cython.am:43: warning: '%'-style pattern rules are a GNU make extension tdlib/Makefile.am:1: 'cython.am' included from here tdlib/Makefile.am:6: installing './py-compile' + RPM_EC=0 ++ jobs -p + exit 0 Executing(%build): /bin/sh -e /var/tmp/rpm-tmp.WqyQXE + umask 022 + cd /builddir/build/BUILD/python-tdlib-0.9.2-build + CFLAGS='-O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer ' + export CFLAGS + CXXFLAGS='-O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer ' + export CXXFLAGS + FFLAGS='-O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FFLAGS + FCFLAGS='-O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FCFLAGS + VALAFLAGS=-g + export VALAFLAGS + RUSTFLAGS='-Copt-level=3 -Cdebuginfo=2 -Ccodegen-units=1 -Cstrip=none -Cforce-frame-pointers=yes -Clink-arg=-specs=/usr/lib/rpm/redhat/redhat-package-notes --cap-lints=warn' + export RUSTFLAGS + LDFLAGS='-Wl,-z,relro -Wl,--as-needed -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes ' + export LDFLAGS + LT_SYS_LIBRARY_PATH=/usr/lib64: + export LT_SYS_LIBRARY_PATH + CC=gcc + export CC + CXX=g++ + export CXX + cd tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e + CFLAGS='-O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer ' + export CFLAGS + CXXFLAGS='-O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer ' + export CXXFLAGS + FFLAGS='-O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FFLAGS + FCFLAGS='-O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FCFLAGS + VALAFLAGS=-g + export VALAFLAGS + RUSTFLAGS='-Copt-level=3 -Cdebuginfo=2 -Ccodegen-units=1 -Cstrip=none -Cforce-frame-pointers=yes -Clink-arg=-specs=/usr/lib/rpm/redhat/redhat-package-notes --cap-lints=warn' + export RUSTFLAGS + LDFLAGS='-Wl,-z,relro -Wl,--as-needed -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes ' + export LDFLAGS + LT_SYS_LIBRARY_PATH=/usr/lib64: + export LT_SYS_LIBRARY_PATH + CC=gcc + export CC + CXX=g++ + export CXX + '[' x '!=' x ']' + '[' 1 = 1 ']' +++ dirname ./configure ++ find . -name config.guess -o -name config.sub + for i in $(find $(dirname ./configure) -name config.guess -o -name config.sub) ++ basename ./config.sub + '[' -f /usr/lib/rpm/redhat/config.sub ']' + /usr/bin/rm -f ./config.sub ++ basename ./config.sub + /usr/bin/cp -fv /usr/lib/rpm/redhat/config.sub ./config.sub '/usr/lib/rpm/redhat/config.sub' -> './config.sub' + for i in $(find $(dirname ./configure) -name config.guess -o -name config.sub) ++ basename ./config.guess + '[' -f /usr/lib/rpm/redhat/config.guess ']' + /usr/bin/rm -f ./config.guess ++ basename ./config.guess + /usr/bin/cp -fv /usr/lib/rpm/redhat/config.guess ./config.guess '/usr/lib/rpm/redhat/config.guess' -> './config.guess' + '[' 1 = 1 ']' + '[' x '!=' 'x-Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld' ']' ++ find . -name ltmain.sh + for i in $(find . -name ltmain.sh) + /usr/bin/sed -i.backup -e 's~compiler_flags=$~compiler_flags="-Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld"~' ./ltmain.sh ++ grep -q runstatedir=DIR ./configure ++ echo --runstatedir=/run + ./configure --build=riscv64-redhat-linux-gnu --host=riscv64-redhat-linux-gnu --program-prefix= --disable-dependency-tracking --prefix=/usr --exec-prefix=/usr --bindir=/usr/bin --sbindir=/usr/sbin --sysconfdir=/etc --datadir=/usr/share --includedir=/usr/include --libdir=/usr/lib64 --libexecdir=/usr/libexec --localstatedir=/var --runstatedir=/run --sharedstatedir=/var/lib --mandir=/usr/share/man --infodir=/usr/share/info --disable-static checking for a BSD-compatible install... /usr/bin/install -c checking whether build environment is sane... yes checking for a race-free mkdir -p... /usr/bin/mkdir -p checking for gawk... gawk checking whether make sets $(MAKE)... yes checking whether make supports nested variables... yes checking build system type... riscv64-redhat-linux-gnu checking host system type... riscv64-redhat-linux-gnu checking how to print strings... printf checking whether make supports the include directive... yes (GNU style) checking for riscv64-redhat-linux-gnu-gcc... gcc checking whether the C compiler works... yes checking for C compiler default output file name... a.out checking for suffix of executables... checking whether we are cross compiling... no checking for suffix of object files... o checking whether the compiler supports GNU C... yes checking whether gcc accepts -g... yes checking for gcc option to enable C11 features... none needed checking whether gcc understands -c and -o together... yes checking dependency style of gcc... none checking for a sed that does not truncate output... /usr/bin/sed checking for grep that handles long lines and -e... /usr/bin/grep checking for egrep... /usr/bin/grep -E checking for fgrep... /usr/bin/grep -F checking for ld used by gcc... /usr/bin/ld checking if the linker (/usr/bin/ld) is GNU ld... yes checking for BSD- or MS-compatible name lister (nm)... /usr/bin/nm -B checking the name lister (/usr/bin/nm -B) interface... BSD nm checking whether ln -s works... yes checking the maximum length of command line arguments... 1572864 checking how to convert riscv64-redhat-linux-gnu file names to riscv64-redhat-linux-gnu format... func_convert_file_noop checking how to convert riscv64-redhat-linux-gnu file names to toolchain format... func_convert_file_noop checking for /usr/bin/ld option to reload object files... -r checking for riscv64-redhat-linux-gnu-file... no checking for file... file checking for riscv64-redhat-linux-gnu-objdump... no checking for objdump... objdump checking how to recognize dependent libraries... pass_all checking for riscv64-redhat-linux-gnu-dlltool... no checking for dlltool... no checking how to associate runtime and link libraries... printf %s\n checking for riscv64-redhat-linux-gnu-ar... no checking for ar... ar checking for archiver @FILE support... @ checking for riscv64-redhat-linux-gnu-strip... no checking for strip... strip checking for riscv64-redhat-linux-gnu-ranlib... no checking for ranlib... ranlib checking command to parse /usr/bin/nm -B output from gcc object... ok checking for sysroot... no checking for a working dd... /usr/bin/dd checking how to truncate binary pipes... /usr/bin/dd bs=4096 count=1 checking for riscv64-redhat-linux-gnu-mt... no checking for mt... no checking if : is a manifest tool... no checking for stdio.h... yes checking for stdlib.h... yes checking for string.h... yes checking for inttypes.h... yes checking for stdint.h... yes checking for strings.h... yes checking for sys/stat.h... yes checking for sys/types.h... yes checking for unistd.h... yes checking for dlfcn.h... yes checking for objdir... .libs checking if gcc supports -fno-rtti -fno-exceptions... no checking for gcc option to produce PIC... -fPIC -DPIC checking if gcc PIC flag -fPIC -DPIC works... yes checking if gcc static flag -static works... no checking if gcc supports -c -o file.o... yes checking if gcc supports -c -o file.o... (cached) yes checking whether the gcc linker (/usr/bin/ld) supports shared libraries... yes checking whether -lc should be explicitly linked in... no checking dynamic linker characteristics... GNU/Linux ld.so checking how to hardcode library paths into programs... immediate checking whether stripping libraries is possible... yes checking if libtool supports shared libraries... yes checking whether to build shared libraries... yes checking whether to build static libraries... no checking if debug code should be compiled in... no checking whether the compiler supports GNU C++... yes checking whether g++ accepts -g... yes checking for g++ option to enable C++11 features... none needed checking dependency style of g++... none checking how to run the C++ preprocessor... g++ -E checking for ld used by g++... /usr/bin/ld checking if the linker (/usr/bin/ld) is GNU ld... yes checking whether the g++ linker (/usr/bin/ld) supports shared libraries... yes checking for g++ option to produce PIC... -fPIC -DPIC checking if g++ PIC flag -fPIC -DPIC works... yes checking if g++ static flag -static works... no checking if g++ supports -c -o file.o... yes checking if g++ supports -c -o file.o... (cached) yes checking whether the g++ linker (/usr/bin/ld) supports shared libraries... yes checking dynamic linker characteristics... (cached) GNU/Linux ld.so checking how to hardcode library paths into programs... immediate checking for C++ compiler vendor... gnu checking for a Python interpreter with version >= 2.7... python3 checking for python3... /usr/bin/python3 checking for python3 version... 3.13 checking for python3 platform... linux checking for GNU default python3 prefix... ${prefix} checking for GNU default python3 exec_prefix... ${exec_prefix} checking for python3 script directory (pythondir)... ${PYTHON_PREFIX}/lib/python3.13/site-packages checking for python3 extension module directory (pyexecdir)... ${PYTHON_EXEC_PREFIX}/lib64/python3.13/site-packages checking for cython... /usr/bin/cython checking for /usr/bin/cython >= 0.20.0... 3.0.9 checking for boost/tuple/tuple.hpp... yes checking for main in -lboost_system... yes checking for main in -lboost_thread... yes checking for gala/graph.h... yes checking for tlx/container/btree_set.hpp... yes checking for headers required to compile python extensions... found checking for inline... inline checking that generated files are newer than configure... done configure: creating ./config.status config.status: creating Makefile config.status: creating examples/Makefile config.status: creating examples/gr/Makefile config.status: creating tdlib/Makefile config.status: creating tdlib/tests/Makefile config.status: creating src/Makefile config.status: creating src/bits/Makefile config.status: creating src/applications/Makefile config.status: creating src/impl/Makefile config.status: creating tests/Makefile config.status: creating config.h config.status: executing depfiles commands config.status: executing libtool commands ** Configuration summary for treedec 0.9.2: prefix: /usr PYTHON: /usr/bin/python3 CYTHON: /usr/bin/cython gala: yes CXX: g++ CPPFLAGS: -DNDEBUG CXXFLAGS: -O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -std=c++11 + sed -e 's|^hardcode_libdir_flag_spec=.*|hardcode_libdir_flag_spec=""|g' -e 's|^runpath_var=LD_RUN_PATH|runpath_var=DIE_RPATH_DIE|g' -e 's|CC="\(g..\)"|CC="\1 -Wl,--as-needed"|' -i libtool + /usr/bin/make -O -j4 V=1 VERBOSE=1 /usr/bin/make all-recursive Making all in tests make[2]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tests' ln -sf ../src treedec make[2]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tests' /usr/bin/make all-am make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tests' ln -s ./ref . ln: failed to create symbolic link './ref': File exists make[3]: [Makefile:1572: all-local] Error 1 (ignored) make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tests' Making all in examples make[2]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' ln -s ../src treedec make[2]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' /usr/bin/make all-recursive Making all in gr make[4]: Nothing to be done for 'all'. make[4]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' g++ -DHAVE_CONFIG_H -I. -I.. -I../src -DNDEBUG -O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -std=c++11 -c -o td_validate-td-validate.o `test -f 'td-validate.cc' || echo './'`td-validate.cc make[4]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' make[4]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' /bin/sh ../libtool --tag=CXX --mode=link g++ -O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -std=c++11 -Wl,-z,relro -Wl,--as-needed -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes -o td-validate td_validate-td-validate.o -lboost_thread -lboost_system libtool: link: g++ -O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -std=c++11 -Wl,-z -Wl,relro -Wl,--as-needed -Wl,-z -Wl,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes -o td-validate td_validate-td-validate.o -lboost_thread -lboost_system make[4]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' make[4]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' g++ -DHAVE_CONFIG_H -I. -I.. -I. -DNDEBUG -fprofile-generate -O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -std=c++11 -c -o tdecomp_profile-tdecomp.o `test -f 'tdecomp.cc' || echo './'`tdecomp.cc make[4]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' In file included from twh.h:285, from tdecomp.cc:53: fi_thread.h: In instantiation of ‘void FI_THREAD::do_print_results(std::ostream&) [with G = gala::graph; cfgt = grtd_algo_config; std::ostream = std::basic_ostream]’: fi_thread.h:32:10: required from here 32 | void do_print_results(std::ostream& o) | ^~~~~~~~~~~~~~~~ fi_thread.h:37:26: warning: unused variable ‘numbags’ [-Wunused-variable] 37 | size_t numbags = boost::num_vertices(_work); // ask P?! | ^~~~~~~ fi_thread.h: In instantiation of ‘void FI_THREAD::do_print_results(std::ostream&) [with G = gala::graph; cfgt = grtd_algo_config; std::ostream = std::basic_ostream]’: fi_thread.h:32:10: required from here 32 | void do_print_results(std::ostream& o) | ^~~~~~~~~~~~~~~~ fi_thread.h:37:26: warning: unused variable ‘numbags’ [-Wunused-variable] 37 | size_t numbags = boost::num_vertices(_work); // ask P?! | ^~~~~~~ In file included from ./treedec/printer.hpp:24, from twh.h:101: ./treedec/treedec.hpp: In instantiation of ‘size_t treedec::get_bagsize(const T_t&) [with T_t = boost::adjacency_list, boost::no_property>, boost::no_property, boost::no_property, boost::listS>; size_t = long unsigned int]’: ex17_thread.h:166:42: required from ‘void EX17_THREAD::run() [with G = gala::graph; cfgt = grtd_algo_config]’ 166 | unsigned r = treedec::get_bagsize(_t); // inefficient | ~~~~~~~~~~~~~~~~~~~~^~~~ ex17_thread.h:145:10: required from here 145 | void run() | ^~~ ./treedec/treedec.hpp:232:21: warning: possibly dangling reference to a temporary [-Wdangling-reference] 232 | auto const& b=boost::get(m, *tIt); | ^ ./treedec/treedec.hpp:232:33: note: the temporary was destroyed at the end of the full expression ‘boost::get, no_property>, no_property, no_property, listS>, const adjacency_list, no_property>, no_property, no_property, listS>*, std::set, const std::set&, treedec::bag_t>, const std::set&, long unsigned int>((*(const boost::put_get_helper&, boost::vec_adj_list_vertex_property_map, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, const boost::adjacency_list, boost::no_property>, boost::no_property, boost::no_property, boost::listS>*, std::set, const std::set&, treedec::bag_t> >*)(& m)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& tIt))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 232 | auto const& b=boost::get(m, *tIt); | ~~~~~~~~~~^~~~~~~~~ ./treedec/treedec.hpp: In instantiation of ‘size_t treedec::get_bagsize(const T_t&) [with T_t = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; size_t = long unsigned int]’: fi_thread.h:114:33: required from ‘void SEVERAL_FI_THREAD::run() [with G = gala::graph; A = treedec::comb::PP_MD; cfgt = grtd_algo_config]’ 114 | unsigned r = get_bagsize(_t); | ~~~~~~~~~~~^~~~ fi_thread.h:108:10: required from here 108 | void run() { | ^~~ ./treedec/treedec.hpp:232:21: warning: possibly dangling reference to a temporary [-Wdangling-reference] 232 | auto const& b=boost::get(m, *tIt); | ^ ./treedec/treedec.hpp:232:33: note: the temporary was destroyed at the end of the full expression ‘boost::get >, no_property, no_property, listS>, const adjacency_list >, no_property, no_property, listS>*, std::vector, const std::vector&, treedec::bag_t>, const std::vector&, long unsigned int>((*(const boost::put_get_helper&, boost::vec_adj_list_vertex_property_map >, boost::no_property, boost::no_property, boost::listS>, const boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>*, std::vector, const std::vector&, treedec::bag_t> >*)(& m)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& tIt))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 232 | auto const& b=boost::get(m, *tIt); | ~~~~~~~~~~^~~~~~~~~ ./treedec/treedec.hpp: In instantiation of ‘size_t treedec::get_bagsize(const T_t&) [with T_t = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; size_t = long unsigned int]’: fi_thread.h:114:33: required from ‘void SEVERAL_FI_THREAD::run() [with G = gala::graph; A = treedec::comb::PP_MD; cfgt = grtd_algo_config]’ 114 | unsigned r = get_bagsize(_t); | ~~~~~~~~~~~^~~~ fi_thread.h:108:10: required from here 108 | void run() { | ^~~ ./treedec/treedec.hpp:232:21: warning: possibly dangling reference to a temporary [-Wdangling-reference] 232 | auto const& b=boost::get(m, *tIt); | ^ ./treedec/treedec.hpp:232:33: note: the temporary was destroyed at the end of the full expression ‘boost::get >, no_property, no_property, listS>, const adjacency_list >, no_property, no_property, listS>*, std::vector, const std::vector&, treedec::bag_t>, const std::vector&, long unsigned int>((*(const boost::put_get_helper&, boost::vec_adj_list_vertex_property_map >, boost::no_property, boost::no_property, boost::listS>, const boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>*, std::vector, const std::vector&, treedec::bag_t> >*)(& m)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& tIt))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 232 | auto const& b=boost::get(m, *tIt); | ~~~~~~~~~~^~~~~~~~~ In file included from ./treedec/combinations.hpp:63, from twh.h:102: ./treedec/treedec_copy.hpp: In instantiation of ‘void treedec::obsolete_copy_treedec(const S&, T&) [with S = boost::adjacency_list > >; T = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>]’: ./treedec/combinations.hpp:130:39: required from ‘void treedec::comb::PP_MD::get_tree_decomposition(TT&) const [with TT = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; G = gala::graph; CFGT = grtd_algo_config]’ 130 | treedec::obsolete_copy_treedec(_t, t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~ fi_thread.h:111:28: required from ‘void SEVERAL_FI_THREAD::run() [with G = gala::graph; A = treedec::comb::PP_MD; cfgt = grtd_algo_config]’ 111 | a.get_tree_decomposition(_t); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~ fi_thread.h:108:10: required from here 108 | void run() { | ^~~ ./treedec/treedec_copy.hpp:35:29: warning: possibly dangling reference to a temporary [-Wdangling-reference] 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ^~ ./treedec/treedec_copy.hpp:35:42: note: the temporary was destroyed at the end of the full expression ‘boost::get > >, vecS, vecS, bidirectionalS, property >, no_property, no_property, listS>::config, bidirectional_graph_helper_with_property > >, vecS, vecS, bidirectionalS, property >, no_property, no_property, listS>::config>, treedec::bag_t, long unsigned int>(treedec::bag_t(), (*(const boost::adj_list_helper > >, boost::vecS, boost::vecS, boost::bidirectionalS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config, boost::bidirectional_graph_helper_with_property > >, boost::vecS, boost::vecS, boost::bidirectionalS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config> >*)(& src)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& p.std::pair, boost::range_detail::integer_iterator >::first))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ ./treedec/treedec_copy.hpp: In instantiation of ‘void treedec::obsolete_copy_treedec(const S&, T&) [with S = boost::adjacency_list > >; T = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>]’: ./treedec/combinations.hpp:130:39: required from ‘void treedec::comb::PP_MD::get_tree_decomposition(TT&) const [with TT = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; G = gala::graph; CFGT = grtd_algo_config]’ 130 | treedec::obsolete_copy_treedec(_t, t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~ fi_thread.h:111:28: required from ‘void SEVERAL_FI_THREAD::run() [with G = gala::graph; A = treedec::comb::PP_MD; cfgt = grtd_algo_config]’ 111 | a.get_tree_decomposition(_t); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~ fi_thread.h:108:10: required from here 108 | void run() { | ^~~ ./treedec/treedec_copy.hpp:35:29: warning: possibly dangling reference to a temporary [-Wdangling-reference] 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ^~ ./treedec/treedec_copy.hpp:35:42: note: the temporary was destroyed at the end of the full expression ‘boost::get > >, vecS, vecS, bidirectionalS, property >, no_property, no_property, listS>::config, bidirectional_graph_helper_with_property > >, vecS, vecS, bidirectionalS, property >, no_property, no_property, listS>::config>, treedec::bag_t, long unsigned int>(treedec::bag_t(), (*(const boost::adj_list_helper > >, boost::vecS, boost::vecS, boost::bidirectionalS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config, boost::bidirectional_graph_helper_with_property > >, boost::vecS, boost::vecS, boost::bidirectionalS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config> >*)(& src)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& p.std::pair, boost::range_detail::integer_iterator >::first))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ ./treedec/treedec_copy.hpp: In instantiation of ‘void treedec::obsolete_copy_treedec(const S&, T&) [with S = boost::adjacency_list > >; T = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>]’: ./treedec/combinations.hpp:545:39: required from ‘void treedec::pending::PP_FI_TM::get_tree_decomposition(TT&) const [with TT = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; G = gala::graph; CFGT = grtd_algo_config]’ 545 | treedec::obsolete_copy_treedec(_t, t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~ fi_thread.h:111:28: required from ‘void SEVERAL_FI_THREAD::run() [with G = gala::graph; A = treedec::pending::PP_FI_TM; cfgt = grtd_algo_config]’ 111 | a.get_tree_decomposition(_t); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~ fi_thread.h:108:10: required from here 108 | void run() { | ^~~ ./treedec/treedec_copy.hpp:35:29: warning: possibly dangling reference to a temporary [-Wdangling-reference] 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ^~ ./treedec/treedec_copy.hpp:35:42: note: the temporary was destroyed at the end of the full expression ‘boost::get > >, vecS, vecS, undirectedS, property >, no_property, no_property, listS>::config, undirected_graph_helper > >, vecS, vecS, undirectedS, property >, no_property, no_property, listS>::config>, treedec::bag_t, long unsigned int>(treedec::bag_t(), (*(const boost::adj_list_helper > >, boost::vecS, boost::vecS, boost::undirectedS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config, boost::undirected_graph_helper > >, boost::vecS, boost::vecS, boost::undirectedS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config> >*)(& src)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& p.std::pair, boost::range_detail::integer_iterator >::first))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ ./treedec/treedec_copy.hpp: In instantiation of ‘void treedec::obsolete_copy_treedec(const S&, T&) [with S = boost::adjacency_list > >; T = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>]’: ./treedec/combinations.hpp:545:39: required from ‘void treedec::pending::PP_FI_TM::get_tree_decomposition(TT&) const [with TT = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; G = gala::graph; CFGT = grtd_algo_config]’ 545 | treedec::obsolete_copy_treedec(_t, t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~ fi_thread.h:111:28: required from ‘void SEVERAL_FI_THREAD::run() [with G = gala::graph; A = treedec::pending::PP_FI_TM; cfgt = grtd_algo_config]’ 111 | a.get_tree_decomposition(_t); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~ fi_thread.h:108:10: required from here 108 | void run() { | ^~~ ./treedec/treedec_copy.hpp:35:29: warning: possibly dangling reference to a temporary [-Wdangling-reference] 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ^~ ./treedec/treedec_copy.hpp:35:42: note: the temporary was destroyed at the end of the full expression ‘boost::get > >, vecS, vecS, undirectedS, property >, no_property, no_property, listS>::config, undirected_graph_helper > >, vecS, vecS, undirectedS, property >, no_property, no_property, listS>::config>, treedec::bag_t, long unsigned int>(treedec::bag_t(), (*(const boost::adj_list_helper > >, boost::vecS, boost::vecS, boost::undirectedS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config, boost::undirected_graph_helper > >, boost::vecS, boost::vecS, boost::undirectedS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config> >*)(& src)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& p.std::pair, boost::range_detail::integer_iterator >::first))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ ./treedec/treedec.hpp: In instantiation of ‘size_t treedec::get_bagsize(const T_t&) [with T_t = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; size_t = long unsigned int]’: ./treedec/thorup.hpp:386:30: required from ‘size_t treedec::thorup::get_bagsize() const [with G = gala::graph; config = grtd_algo_config; size_t = long unsigned int]’ 386 | return treedec::get_bagsize(_t); | ~~~~~~~~~~~~~~~~~~~~^~~~ th_thread.h:43:33: required from ‘void TH_THREAD::run() [with G = gala::graph; cfgt = grtd_algo_config]’ 43 | unsigned r = _TH->get_bagsize(); | ~~~~~~~~~~~~~~~~^~ th_thread.h:40:10: required from here 40 | void run() { untested(); | ^~~ ./treedec/treedec.hpp:232:21: warning: possibly dangling reference to a temporary [-Wdangling-reference] 232 | auto const& b=boost::get(m, *tIt); | ^ ./treedec/treedec.hpp:232:33: note: the temporary was destroyed at the end of the full expression ‘boost::get >, no_property, no_property, listS>, const adjacency_list >, no_property, no_property, listS>*, std::set, const std::set&, treedec::bag_t>, const std::set&, long unsigned int>((*(const boost::put_get_helper&, boost::vec_adj_list_vertex_property_map >, boost::no_property, boost::no_property, boost::listS>, const boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>*, std::set, const std::set&, treedec::bag_t> >*)(& m)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& tIt))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 232 | auto const& b=boost::get(m, *tIt); | ~~~~~~~~~~^~~~~~~~~ In file included from th_thread.h:4, from twh.h:217: ./treedec/thorup.hpp: In instantiation of ‘typename boost::graph_traits::vertex_iterator treedec::pkk_thorup::find_bag(const std::set&, const T_t&) [with T_t = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; typename boost::graph_traits::vertex_iterator = boost::range_detail::integer_iterator]’: ./treedec/thorup.hpp:310:15: required from ‘void treedec::pkk_thorup::add_vertices_to_tree_decomposition(T_t&, v_t, v_t, G_t&, std::vector&) [with T_t = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; v_t = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; G_t = boost::adjacency_list]’ 310 | t = find_bag(neighbours, T); | ~~~~~~~~^~~~~~~~~~~~~~~ ./treedec/thorup.hpp:336:37: required from ‘void treedec::pkk_thorup::tree_decomposition_from_elimination_ordering(T_t&, const std::vector&, const G_t&) [with T_t = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; G_t = gala::graph]’ 336 | add_vertices_to_tree_decomposition(T, v, v_end, G_sym, active); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ ./treedec/thorup.hpp:366:59: required from ‘void treedec::thorup::do_it() [with G = gala::graph; config = grtd_algo_config]’ 366 | pkk_thorup::tree_decomposition_from_elimination_ordering( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 367 | _t, _o, _g); | ~~~~~~~~~~~ ./treedec/thorup.hpp:362:7: required from here 362 | void do_it(){ | ^~~~~ ./treedec/thorup.hpp:242:31: warning: possibly dangling reference to a temporary [-Wdangling-reference] 242 | auto const& b=boost::get(treedec::bag_t(), T, *t); | ^ ./treedec/thorup.hpp:242:43: note: the temporary was destroyed at the end of the full expression ‘boost::get >, no_property, no_property, listS>, vecS, setS, undirectedS, property >, no_property, no_property, listS>::config, undirected_graph_helper >, no_property, no_property, listS>, vecS, setS, undirectedS, property >, no_property, no_property, listS>::config>, treedec::bag_t, long unsigned int>(treedec::bag_t(), (*(const boost::adj_list_helper >, boost::no_property, boost::no_property, boost::listS>, boost::vecS, boost::setS, boost::undirectedS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config, boost::undirected_graph_helper >, boost::no_property, boost::no_property, boost::listS>, boost::vecS, boost::setS, boost::undirectedS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config> >*)(& T)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& t))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 242 | auto const& b=boost::get(treedec::bag_t(), T, *t); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from ./treedec/preprocessing.hpp:70, from ./treedec/combinations.hpp:51: ./treedec/treedec_misc.hpp: In instantiation of ‘void treedec::draft::append_decomposition(T_t&, const S_t&&, const G_t&, const M_t&) [with T_t = boost::adjacency_list, boost::no_property>, boost::no_property, boost::no_property, boost::listS>; S_t = boost::adjacency_list, boost::no_property>, boost::no_property, boost::no_property, boost::listS>; G_t = immvecgraph >; M_t = std::vector]’: ./treedec/exact_base.hpp:296:36: required from ‘void treedec::draft::exact_decomposition::do_components(T_t&, unsigned int) [with T_t = boost::adjacency_list, boost::no_property>, boost::no_property, boost::no_property, boost::listS>; G_t = gala::graph; config = treedec::algo::default_config; kernel = treedec::detail::exact_ta_]’ 296 | draft::append_decomposition(t, std::move(T_), G_, vdMap); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ./treedec/exact_base.hpp:372:22: required from ‘void treedec::draft::exact_decomposition::try_it(T_t&, unsigned int) [with T = boost::adjacency_list, boost::no_property>, boost::no_property, boost::no_property, boost::listS>; G_t = gala::graph; config = treedec::algo::default_config; kernel = treedec::detail::exact_ta_]’ 372 | do_components(T, lb_tw+1); | ~~~~~~~~~~~~~^~~~~~~~~~~~ ex17_thread.h:164:19: required from ‘void EX17_THREAD::run() [with G = gala::graph; cfgt = grtd_algo_config]’ 164 | alg.try_it(_t, 0); | ~~~~~~~~~~^~~~~~~ ex17_thread.h:145:10: required from here 145 | void run() | ^~~ ./treedec/treedec_misc.hpp:119:25: warning: possibly dangling reference to a temporary [-Wdangling-reference] 119 | auto const& SB=boost::get(M, *SR.first); | ^~ ./treedec/treedec_misc.hpp:119:38: note: the temporary was destroyed at the end of the full expression ‘boost::get, no_property>, no_property, no_property, listS>, const adjacency_list, no_property>, no_property, no_property, listS>*, std::set, const std::set&, treedec::bag_t>, const std::set&, long unsigned int>((*(const boost::put_get_helper&, boost::vec_adj_list_vertex_property_map, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, const boost::adjacency_list, boost::no_property>, boost::no_property, boost::no_property, boost::listS>*, std::set, const std::set&, treedec::bag_t> >*)(& M)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& SR.std::pair, boost::range_detail::integer_iterator >::first))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 119 | auto const& SB=boost::get(M, *SR.first); | ~~~~~~~~~~^~~~~~~~~~~~~~ ./treedec/treedec_misc.hpp: In instantiation of ‘void treedec::draft::append_decomposition(T_t&, const S_t&&, const G_t&, const M_t&) [with T_t = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; S_t = boost::adjacency_list; G_t = boost::adjacency_list; M_t = std::vector]’: ./treedec/preprocessing.hpp:824:45: required from ‘void treedec::impl::preprocessing::do_components(T&, const G&) const [with T = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; A = treedec::impl::fillIn; G_t = gala::graph; CFGT = treedec::impl::draft::pp_cfg]’ 824 | treedec::draft::append_decomposition(t, std::move(T_), G_, vdMap); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ./treedec/preprocessing.hpp:727:24: required from ‘void treedec::impl::preprocessing::do_the_rest(T&) [with T = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; A = treedec::impl::fillIn; G_t = gala::graph; CFGT = treedec::impl::draft::pp_cfg]’ 727 | do_components(t, g); | ~~~~~~~~~~~~~~~~~~~^~~~~~ ./treedec/combinations.hpp:397:63: required from ‘void treedec::pending::PP_FI::do_it() [with G = gala::graph; CFGT = grtd_algo_config]’ 397 | A.template do_the_rest (_t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~ fi_thread.h:110:11: required from ‘void SEVERAL_FI_THREAD::run() [with G = gala::graph; A = treedec::pending::PP_FI; cfgt = grtd_algo_config]’ 110 | a.do_it(); | ~~~~~~~^~ fi_thread.h:108:10: required from here 108 | void run() { | ^~~ ./treedec/treedec_misc.hpp:105:31: warning: possibly dangling reference to a temporary [-Wdangling-reference] 105 | auto const& M=boost::get(bag_t(), src); | ^ ./treedec/treedec_misc.hpp:105:43: note: the temporary was destroyed at the end of the full expression ‘boost::get(treedec::bag_t(), (* & src))’ 105 | auto const& M=boost::get(bag_t(), src); | ~~~~~~~~~~^~~~~~~~~~~~~~ ./treedec/treedec_misc.hpp: In instantiation of ‘void treedec::draft::append_decomposition(T_t&, const S_t&&, const G_t&, const M_t&) [with T_t = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; S_t = boost::adjacency_list; G_t = boost::adjacency_list; M_t = std::vector]’: ./treedec/preprocessing.hpp:824:45: required from ‘void treedec::impl::preprocessing::do_components(T&, const G&) const [with T = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; A = treedec::impl::fillIn; G_t = gala::graph; CFGT = treedec::impl::draft::pp_cfg]’ 824 | treedec::draft::append_decomposition(t, std::move(T_), G_, vdMap); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ./treedec/preprocessing.hpp:727:24: required from ‘void treedec::impl::preprocessing::do_the_rest(T&) [with T = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; A = treedec::impl::fillIn; G_t = gala::graph; CFGT = treedec::impl::draft::pp_cfg]’ 727 | do_components(t, g); | ~~~~~~~~~~~~~~~~~~~^~~~~~ ./treedec/combinations.hpp:397:63: required from ‘void treedec::pending::PP_FI::do_it() [with G = gala::graph; CFGT = grtd_algo_config]’ 397 | A.template do_the_rest (_t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~ fi_thread.h:110:11: required from ‘void SEVERAL_FI_THREAD::run() [with G = gala::graph; A = treedec::pending::PP_FI; cfgt = grtd_algo_config]’ 110 | a.do_it(); | ~~~~~~~^~ fi_thread.h:108:10: required from here 108 | void run() { | ^~~ ./treedec/treedec_misc.hpp:105:31: warning: possibly dangling reference to a temporary [-Wdangling-reference] 105 | auto const& M=boost::get(bag_t(), src); | ^ ./treedec/treedec_misc.hpp:105:43: note: the temporary was destroyed at the end of the full expression ‘boost::get(treedec::bag_t(), (* & src))’ 105 | auto const& M=boost::get(bag_t(), src); | ~~~~~~~~~~^~~~~~~~~~~~~~ In file included from ./treedec/elimination_orderings.hpp:70, from ./treedec/combinations.hpp:53: ./treedec/impl/greedy_heuristic.hpp: In instantiation of ‘void treedec::impl::minDegree::initialize() [with G_t = boost::adjacency_list; CFG = treedec::algo::default_config]’: ./treedec/impl/greedy_heuristic.hpp:64:10: required from here 64 | void initialize(){ | ^~~~~~~~~~ ./treedec/impl/greedy_heuristic.hpp:65:14: warning: moving a temporary object prevents copy elision [-Wpessimizing-move] 65 | auto zerodegbag1=MOVE(_degs.detach_bag(0)); | ^~~~~~~~~~~ ./treedec/impl/greedy_heuristic.hpp:65:14: note: remove ‘std::move’ call ./treedec/impl/greedy_heuristic.hpp: In instantiation of ‘void treedec::impl::minDegree::postprocessing() [with G_t = boost::adjacency_list; CFG = treedec::algo::default_config]’: ./treedec/impl/greedy_heuristic.hpp:104:10: required from here 104 | void postprocessing(){ | ^~~~~~~~~~~~~~ ./treedec/impl/greedy_heuristic.hpp:105:14: warning: moving a temporary object prevents copy elision [-Wpessimizing-move] 105 | auto zerodegbag=MOVE(_degs.detach_bag(0)); | ^~~~~~~~~~ ./treedec/impl/greedy_heuristic.hpp:105:14: note: remove ‘std::move’ call In file included from twh.h:207: bmd_thread.h: In member function ‘void BMD_THREAD::run() [with G = gala::graph; cfgt = grtd_algo_config]’: bmd_thread.h:114:20: warning: ‘pg16’ may be used uninitialized [-Wmaybe-uninitialized] 114 | _a16 = new treedec::impl::bmdo(g16); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bmd_thread.h:88:19: note: ‘pg16’ was declared here 88 | sg_dvv16* pg16; | ^~~~ bmd_thread.h:119:20: warning: ‘pg32’ may be used uninitialized [-Wmaybe-uninitialized] 119 | _a32 = new treedec::impl::bmdo(g32); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bmd_thread.h:89:19: note: ‘pg32’ was declared here 89 | sg_dvv32* pg32; | ^~~~ bmd_thread.h: In member function ‘void BMD_THREAD::run() [with G = gala::graph; cfgt = grtd_algo_config]’: bmd_thread.h:114:20: warning: ‘pg16’ may be used uninitialized [-Wmaybe-uninitialized] 114 | _a16 = new treedec::impl::bmdo(g16); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bmd_thread.h:88:19: note: ‘pg16’ was declared here 88 | sg_dvv16* pg16; | ^~~~ bmd_thread.h:119:20: warning: ‘pg32’ may be used uninitialized [-Wmaybe-uninitialized] 119 | _a32 = new treedec::impl::bmdo(g32); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bmd_thread.h:89:19: note: ‘pg32’ was declared here 89 | sg_dvv32* pg32; | ^~~~ make[4]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' /bin/sh ../libtool --tag=CXX --mode=link g++ -fprofile-generate -O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -std=c++11 -Wl,-z,relro -Wl,--as-needed -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes -o tdecomp-profile tdecomp_profile-tdecomp.o -lboost_thread -lboost_system -lpthread -lboost_graph -lboost_thread -lboost_system libtool: link: g++ -fprofile-generate -O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -std=c++11 -Wl,-z -Wl,relro -Wl,--as-needed -Wl,-z -Wl,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes -o tdecomp-profile tdecomp_profile-tdecomp.o -lpthread -lboost_graph -lboost_thread -lboost_system make[4]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' make[4]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' rm -f tdecomp_profile-tdecomp.gcda ./tdecomp-profile --ex17 < gr/h.gr > h.gr.td--ex17 & p=$!; sleep 1; kill -TERM $p; ./tdecomp-profile --fi < gr/h.gr > h.gr.td--fi & p=$!; sleep 1; kill -TERM $p; ./tdecomp-profile --ppfi < gr/h.gr > h.gr.td--ppfi & p=$!; sleep 1; kill -TERM $p; ./tdecomp-profile --bmd < gr/h.gr > h.gr.td--bmd & p=$!; sleep 1; kill -TERM $p; ./tdecomp-profile --pp < gr/h.gr > h.gr.td--pp & p=$!; sleep 1; kill -TERM $p; incomplete ../../src/exact_base.hpp:348:try_it incomplete ../../src/bits/trie.hpp:336:TRIE try bagsize = 5 try bagsize = 6 try bagsize = 7 make_td nvt 9 USR1 handler valid USR1 handler c size 16 valid incomplete ../../src/preprocessing.hpp:810:do_components USR1 handler c size 16 valid USR1 handler c size 16 valid USR1 handler valid make[4]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' make[4]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' g++ -DHAVE_CONFIG_H -I. -I.. -I. -DNDEBUG -fprofile-use=. -O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -std=c++11 -c -o tdecomp-tdecomp.o `test -f 'tdecomp.cc' || echo './'`tdecomp.cc In file included from twh.h:285, from tdecomp.cc:53: fi_thread.h: In instantiation of ‘void FI_THREAD::do_print_results(std::ostream&) [with G = gala::graph; cfgt = grtd_algo_config; std::ostream = std::basic_ostream]’: fi_thread.h:32:10: required from here 32 | void do_print_results(std::ostream& o) | ^~~~~~~~~~~~~~~~ fi_thread.h:37:26: warning: unused variable ‘numbags’ [-Wunused-variable] 37 | size_t numbags = boost::num_vertices(_work); // ask P?! | ^~~~~~~ fi_thread.h: In instantiation of ‘void FI_THREAD::do_print_results(std::ostream&) [with G = gala::graph; cfgt = grtd_algo_config; std::ostream = std::basic_ostream]’: fi_thread.h:32:10: required from here 32 | void do_print_results(std::ostream& o) | ^~~~~~~~~~~~~~~~ fi_thread.h:37:26: warning: unused variable ‘numbags’ [-Wunused-variable] 37 | size_t numbags = boost::num_vertices(_work); // ask P?! | ^~~~~~~ In file included from ./treedec/printer.hpp:24, from twh.h:101: ./treedec/treedec.hpp: In instantiation of ‘size_t treedec::get_bagsize(const T_t&) [with T_t = boost::adjacency_list, boost::no_property>, boost::no_property, boost::no_property, boost::listS>; size_t = long unsigned int]’: ex17_thread.h:166:42: required from ‘void EX17_THREAD::run() [with G = gala::graph; cfgt = grtd_algo_config]’ 166 | unsigned r = treedec::get_bagsize(_t); // inefficient | ~~~~~~~~~~~~~~~~~~~~^~~~ ex17_thread.h:145:10: required from here 145 | void run() | ^~~ ./treedec/treedec.hpp:232:21: warning: possibly dangling reference to a temporary [-Wdangling-reference] 232 | auto const& b=boost::get(m, *tIt); | ^ ./treedec/treedec.hpp:232:33: note: the temporary was destroyed at the end of the full expression ‘boost::get, no_property>, no_property, no_property, listS>, const adjacency_list, no_property>, no_property, no_property, listS>*, std::set, const std::set&, treedec::bag_t>, const std::set&, long unsigned int>((*(const boost::put_get_helper&, boost::vec_adj_list_vertex_property_map, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, const boost::adjacency_list, boost::no_property>, boost::no_property, boost::no_property, boost::listS>*, std::set, const std::set&, treedec::bag_t> >*)(& m)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& tIt))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 232 | auto const& b=boost::get(m, *tIt); | ~~~~~~~~~~^~~~~~~~~ ./treedec/treedec.hpp: In instantiation of ‘size_t treedec::get_bagsize(const T_t&) [with T_t = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; size_t = long unsigned int]’: fi_thread.h:114:33: required from ‘void SEVERAL_FI_THREAD::run() [with G = gala::graph; A = treedec::comb::PP_MD; cfgt = grtd_algo_config]’ 114 | unsigned r = get_bagsize(_t); | ~~~~~~~~~~~^~~~ fi_thread.h:108:10: required from here 108 | void run() { | ^~~ ./treedec/treedec.hpp:232:21: warning: possibly dangling reference to a temporary [-Wdangling-reference] 232 | auto const& b=boost::get(m, *tIt); | ^ ./treedec/treedec.hpp:232:33: note: the temporary was destroyed at the end of the full expression ‘boost::get >, no_property, no_property, listS>, const adjacency_list >, no_property, no_property, listS>*, std::vector, const std::vector&, treedec::bag_t>, const std::vector&, long unsigned int>((*(const boost::put_get_helper&, boost::vec_adj_list_vertex_property_map >, boost::no_property, boost::no_property, boost::listS>, const boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>*, std::vector, const std::vector&, treedec::bag_t> >*)(& m)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& tIt))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 232 | auto const& b=boost::get(m, *tIt); | ~~~~~~~~~~^~~~~~~~~ ./treedec/treedec.hpp: In instantiation of ‘size_t treedec::get_bagsize(const T_t&) [with T_t = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; size_t = long unsigned int]’: fi_thread.h:114:33: required from ‘void SEVERAL_FI_THREAD::run() [with G = gala::graph; A = treedec::comb::PP_MD; cfgt = grtd_algo_config]’ 114 | unsigned r = get_bagsize(_t); | ~~~~~~~~~~~^~~~ fi_thread.h:108:10: required from here 108 | void run() { | ^~~ ./treedec/treedec.hpp:232:21: warning: possibly dangling reference to a temporary [-Wdangling-reference] 232 | auto const& b=boost::get(m, *tIt); | ^ ./treedec/treedec.hpp:232:33: note: the temporary was destroyed at the end of the full expression ‘boost::get >, no_property, no_property, listS>, const adjacency_list >, no_property, no_property, listS>*, std::vector, const std::vector&, treedec::bag_t>, const std::vector&, long unsigned int>((*(const boost::put_get_helper&, boost::vec_adj_list_vertex_property_map >, boost::no_property, boost::no_property, boost::listS>, const boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>*, std::vector, const std::vector&, treedec::bag_t> >*)(& m)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& tIt))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 232 | auto const& b=boost::get(m, *tIt); | ~~~~~~~~~~^~~~~~~~~ In file included from ./treedec/combinations.hpp:63, from twh.h:102: ./treedec/treedec_copy.hpp: In instantiation of ‘void treedec::obsolete_copy_treedec(const S&, T&) [with S = boost::adjacency_list > >; T = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>]’: ./treedec/combinations.hpp:130:39: required from ‘void treedec::comb::PP_MD::get_tree_decomposition(TT&) const [with TT = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; G = gala::graph; CFGT = grtd_algo_config]’ 130 | treedec::obsolete_copy_treedec(_t, t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~ fi_thread.h:111:28: required from ‘void SEVERAL_FI_THREAD::run() [with G = gala::graph; A = treedec::comb::PP_MD; cfgt = grtd_algo_config]’ 111 | a.get_tree_decomposition(_t); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~ fi_thread.h:108:10: required from here 108 | void run() { | ^~~ ./treedec/treedec_copy.hpp:35:29: warning: possibly dangling reference to a temporary [-Wdangling-reference] 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ^~ ./treedec/treedec_copy.hpp:35:42: note: the temporary was destroyed at the end of the full expression ‘boost::get > >, vecS, vecS, bidirectionalS, property >, no_property, no_property, listS>::config, bidirectional_graph_helper_with_property > >, vecS, vecS, bidirectionalS, property >, no_property, no_property, listS>::config>, treedec::bag_t, long unsigned int>(treedec::bag_t(), (*(const boost::adj_list_helper > >, boost::vecS, boost::vecS, boost::bidirectionalS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config, boost::bidirectional_graph_helper_with_property > >, boost::vecS, boost::vecS, boost::bidirectionalS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config> >*)(& src)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& p.std::pair, boost::range_detail::integer_iterator >::first))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ ./treedec/treedec_copy.hpp: In instantiation of ‘void treedec::obsolete_copy_treedec(const S&, T&) [with S = boost::adjacency_list > >; T = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>]’: ./treedec/combinations.hpp:130:39: required from ‘void treedec::comb::PP_MD::get_tree_decomposition(TT&) const [with TT = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; G = gala::graph; CFGT = grtd_algo_config]’ 130 | treedec::obsolete_copy_treedec(_t, t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~ fi_thread.h:111:28: required from ‘void SEVERAL_FI_THREAD::run() [with G = gala::graph; A = treedec::comb::PP_MD; cfgt = grtd_algo_config]’ 111 | a.get_tree_decomposition(_t); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~ fi_thread.h:108:10: required from here 108 | void run() { | ^~~ ./treedec/treedec_copy.hpp:35:29: warning: possibly dangling reference to a temporary [-Wdangling-reference] 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ^~ ./treedec/treedec_copy.hpp:35:42: note: the temporary was destroyed at the end of the full expression ‘boost::get > >, vecS, vecS, bidirectionalS, property >, no_property, no_property, listS>::config, bidirectional_graph_helper_with_property > >, vecS, vecS, bidirectionalS, property >, no_property, no_property, listS>::config>, treedec::bag_t, long unsigned int>(treedec::bag_t(), (*(const boost::adj_list_helper > >, boost::vecS, boost::vecS, boost::bidirectionalS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config, boost::bidirectional_graph_helper_with_property > >, boost::vecS, boost::vecS, boost::bidirectionalS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config> >*)(& src)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& p.std::pair, boost::range_detail::integer_iterator >::first))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ ./treedec/treedec_copy.hpp: In instantiation of ‘void treedec::obsolete_copy_treedec(const S&, T&) [with S = boost::adjacency_list > >; T = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>]’: ./treedec/combinations.hpp:545:39: required from ‘void treedec::pending::PP_FI_TM::get_tree_decomposition(TT&) const [with TT = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; G = gala::graph; CFGT = grtd_algo_config]’ 545 | treedec::obsolete_copy_treedec(_t, t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~ fi_thread.h:111:28: required from ‘void SEVERAL_FI_THREAD::run() [with G = gala::graph; A = treedec::pending::PP_FI_TM; cfgt = grtd_algo_config]’ 111 | a.get_tree_decomposition(_t); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~ fi_thread.h:108:10: required from here 108 | void run() { | ^~~ ./treedec/treedec_copy.hpp:35:29: warning: possibly dangling reference to a temporary [-Wdangling-reference] 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ^~ ./treedec/treedec_copy.hpp:35:42: note: the temporary was destroyed at the end of the full expression ‘boost::get > >, vecS, vecS, undirectedS, property >, no_property, no_property, listS>::config, undirected_graph_helper > >, vecS, vecS, undirectedS, property >, no_property, no_property, listS>::config>, treedec::bag_t, long unsigned int>(treedec::bag_t(), (*(const boost::adj_list_helper > >, boost::vecS, boost::vecS, boost::undirectedS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config, boost::undirected_graph_helper > >, boost::vecS, boost::vecS, boost::undirectedS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config> >*)(& src)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& p.std::pair, boost::range_detail::integer_iterator >::first))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ ./treedec/treedec_copy.hpp: In instantiation of ‘void treedec::obsolete_copy_treedec(const S&, T&) [with S = boost::adjacency_list > >; T = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>]’: ./treedec/combinations.hpp:545:39: required from ‘void treedec::pending::PP_FI_TM::get_tree_decomposition(TT&) const [with TT = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; G = gala::graph; CFGT = grtd_algo_config]’ 545 | treedec::obsolete_copy_treedec(_t, t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~ fi_thread.h:111:28: required from ‘void SEVERAL_FI_THREAD::run() [with G = gala::graph; A = treedec::pending::PP_FI_TM; cfgt = grtd_algo_config]’ 111 | a.get_tree_decomposition(_t); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~ fi_thread.h:108:10: required from here 108 | void run() { | ^~~ ./treedec/treedec_copy.hpp:35:29: warning: possibly dangling reference to a temporary [-Wdangling-reference] 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ^~ ./treedec/treedec_copy.hpp:35:42: note: the temporary was destroyed at the end of the full expression ‘boost::get > >, vecS, vecS, undirectedS, property >, no_property, no_property, listS>::config, undirected_graph_helper > >, vecS, vecS, undirectedS, property >, no_property, no_property, listS>::config>, treedec::bag_t, long unsigned int>(treedec::bag_t(), (*(const boost::adj_list_helper > >, boost::vecS, boost::vecS, boost::undirectedS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config, boost::undirected_graph_helper > >, boost::vecS, boost::vecS, boost::undirectedS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config> >*)(& src)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& p.std::pair, boost::range_detail::integer_iterator >::first))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ ./treedec/treedec.hpp: In instantiation of ‘size_t treedec::get_bagsize(const T_t&) [with T_t = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; size_t = long unsigned int]’: ./treedec/thorup.hpp:386:30: required from ‘size_t treedec::thorup::get_bagsize() const [with G = gala::graph; config = grtd_algo_config; size_t = long unsigned int]’ 386 | return treedec::get_bagsize(_t); | ~~~~~~~~~~~~~~~~~~~~^~~~ th_thread.h:43:33: required from ‘void TH_THREAD::run() [with G = gala::graph; cfgt = grtd_algo_config]’ 43 | unsigned r = _TH->get_bagsize(); | ~~~~~~~~~~~~~~~~^~ th_thread.h:40:10: required from here 40 | void run() { untested(); | ^~~ ./treedec/treedec.hpp:232:21: warning: possibly dangling reference to a temporary [-Wdangling-reference] 232 | auto const& b=boost::get(m, *tIt); | ^ ./treedec/treedec.hpp:232:33: note: the temporary was destroyed at the end of the full expression ‘boost::get >, no_property, no_property, listS>, const adjacency_list >, no_property, no_property, listS>*, std::set, const std::set&, treedec::bag_t>, const std::set&, long unsigned int>((*(const boost::put_get_helper&, boost::vec_adj_list_vertex_property_map >, boost::no_property, boost::no_property, boost::listS>, const boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>*, std::set, const std::set&, treedec::bag_t> >*)(& m)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& tIt))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 232 | auto const& b=boost::get(m, *tIt); | ~~~~~~~~~~^~~~~~~~~ In file included from th_thread.h:4, from twh.h:217: ./treedec/thorup.hpp: In instantiation of ‘typename boost::graph_traits::vertex_iterator treedec::pkk_thorup::find_bag(const std::set&, const T_t&) [with T_t = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; typename boost::graph_traits::vertex_iterator = boost::range_detail::integer_iterator]’: ./treedec/thorup.hpp:310:15: required from ‘void treedec::pkk_thorup::add_vertices_to_tree_decomposition(T_t&, v_t, v_t, G_t&, std::vector&) [with T_t = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; v_t = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; G_t = boost::adjacency_list]’ 310 | t = find_bag(neighbours, T); | ~~~~~~~~^~~~~~~~~~~~~~~ ./treedec/thorup.hpp:336:37: required from ‘void treedec::pkk_thorup::tree_decomposition_from_elimination_ordering(T_t&, const std::vector&, const G_t&) [with T_t = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; G_t = gala::graph]’ 336 | add_vertices_to_tree_decomposition(T, v, v_end, G_sym, active); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ ./treedec/thorup.hpp:366:59: required from ‘void treedec::thorup::do_it() [with G = gala::graph; config = grtd_algo_config]’ 366 | pkk_thorup::tree_decomposition_from_elimination_ordering( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 367 | _t, _o, _g); | ~~~~~~~~~~~ ./treedec/thorup.hpp:362:7: required from here 362 | void do_it(){ | ^~~~~ ./treedec/thorup.hpp:242:31: warning: possibly dangling reference to a temporary [-Wdangling-reference] 242 | auto const& b=boost::get(treedec::bag_t(), T, *t); | ^ ./treedec/thorup.hpp:242:43: note: the temporary was destroyed at the end of the full expression ‘boost::get >, no_property, no_property, listS>, vecS, setS, undirectedS, property >, no_property, no_property, listS>::config, undirected_graph_helper >, no_property, no_property, listS>, vecS, setS, undirectedS, property >, no_property, no_property, listS>::config>, treedec::bag_t, long unsigned int>(treedec::bag_t(), (*(const boost::adj_list_helper >, boost::no_property, boost::no_property, boost::listS>, boost::vecS, boost::setS, boost::undirectedS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config, boost::undirected_graph_helper >, boost::no_property, boost::no_property, boost::listS>, boost::vecS, boost::setS, boost::undirectedS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config> >*)(& T)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& t))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 242 | auto const& b=boost::get(treedec::bag_t(), T, *t); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from ./treedec/preprocessing.hpp:70, from ./treedec/combinations.hpp:51: ./treedec/treedec_misc.hpp: In instantiation of ‘void treedec::draft::append_decomposition(T_t&, const S_t&&, const G_t&, const M_t&) [with T_t = boost::adjacency_list, boost::no_property>, boost::no_property, boost::no_property, boost::listS>; S_t = boost::adjacency_list, boost::no_property>, boost::no_property, boost::no_property, boost::listS>; G_t = immvecgraph >; M_t = std::vector]’: ./treedec/exact_base.hpp:296:36: required from ‘void treedec::draft::exact_decomposition::do_components(T_t&, unsigned int) [with T_t = boost::adjacency_list, boost::no_property>, boost::no_property, boost::no_property, boost::listS>; G_t = gala::graph; config = treedec::algo::default_config; kernel = treedec::detail::exact_ta_]’ 296 | draft::append_decomposition(t, std::move(T_), G_, vdMap); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ./treedec/exact_base.hpp:372:22: required from ‘void treedec::draft::exact_decomposition::try_it(T_t&, unsigned int) [with T = boost::adjacency_list, boost::no_property>, boost::no_property, boost::no_property, boost::listS>; G_t = gala::graph; config = treedec::algo::default_config; kernel = treedec::detail::exact_ta_]’ 372 | do_components(T, lb_tw+1); | ~~~~~~~~~~~~~^~~~~~~~~~~~ ex17_thread.h:164:19: required from ‘void EX17_THREAD::run() [with G = gala::graph; cfgt = grtd_algo_config]’ 164 | alg.try_it(_t, 0); | ~~~~~~~~~~^~~~~~~ ex17_thread.h:145:10: required from here 145 | void run() | ^~~ ./treedec/treedec_misc.hpp:119:25: warning: possibly dangling reference to a temporary [-Wdangling-reference] 119 | auto const& SB=boost::get(M, *SR.first); | ^~ ./treedec/treedec_misc.hpp:119:38: note: the temporary was destroyed at the end of the full expression ‘boost::get, no_property>, no_property, no_property, listS>, const adjacency_list, no_property>, no_property, no_property, listS>*, std::set, const std::set&, treedec::bag_t>, const std::set&, long unsigned int>((*(const boost::put_get_helper&, boost::vec_adj_list_vertex_property_map, boost::no_property>, boost::no_property, boost::no_property, boost::listS>, const boost::adjacency_list, boost::no_property>, boost::no_property, boost::no_property, boost::listS>*, std::set, const std::set&, treedec::bag_t> >*)(& M)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& SR.std::pair, boost::range_detail::integer_iterator >::first))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())’ 119 | auto const& SB=boost::get(M, *SR.first); | ~~~~~~~~~~^~~~~~~~~~~~~~ ./treedec/treedec_misc.hpp: In instantiation of ‘void treedec::draft::append_decomposition(T_t&, const S_t&&, const G_t&, const M_t&) [with T_t = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; S_t = boost::adjacency_list; G_t = boost::adjacency_list; M_t = std::vector]’: ./treedec/preprocessing.hpp:824:45: required from ‘void treedec::impl::preprocessing::do_components(T&, const G&) const [with T = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; A = treedec::impl::fillIn; G_t = gala::graph; CFGT = treedec::impl::draft::pp_cfg]’ 824 | treedec::draft::append_decomposition(t, std::move(T_), G_, vdMap); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ./treedec/preprocessing.hpp:727:24: required from ‘void treedec::impl::preprocessing::do_the_rest(T&) [with T = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; A = treedec::impl::fillIn; G_t = gala::graph; CFGT = treedec::impl::draft::pp_cfg]’ 727 | do_components(t, g); | ~~~~~~~~~~~~~~~~~~~^~~~~~ ./treedec/combinations.hpp:397:63: required from ‘void treedec::pending::PP_FI::do_it() [with G = gala::graph; CFGT = grtd_algo_config]’ 397 | A.template do_the_rest (_t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~ fi_thread.h:110:11: required from ‘void SEVERAL_FI_THREAD::run() [with G = gala::graph; A = treedec::pending::PP_FI; cfgt = grtd_algo_config]’ 110 | a.do_it(); | ~~~~~~~^~ fi_thread.h:108:10: required from here 108 | void run() { | ^~~ ./treedec/treedec_misc.hpp:105:31: warning: possibly dangling reference to a temporary [-Wdangling-reference] 105 | auto const& M=boost::get(bag_t(), src); | ^ ./treedec/treedec_misc.hpp:105:43: note: the temporary was destroyed at the end of the full expression ‘boost::get(treedec::bag_t(), (* & src))’ 105 | auto const& M=boost::get(bag_t(), src); | ~~~~~~~~~~^~~~~~~~~~~~~~ ./treedec/treedec_misc.hpp: In instantiation of ‘void treedec::draft::append_decomposition(T_t&, const S_t&&, const G_t&, const M_t&) [with T_t = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; S_t = boost::adjacency_list; G_t = boost::adjacency_list; M_t = std::vector]’: ./treedec/preprocessing.hpp:824:45: required from ‘void treedec::impl::preprocessing::do_components(T&, const G&) const [with T = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; A = treedec::impl::fillIn; G_t = gala::graph; CFGT = treedec::impl::draft::pp_cfg]’ 824 | treedec::draft::append_decomposition(t, std::move(T_), G_, vdMap); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ./treedec/preprocessing.hpp:727:24: required from ‘void treedec::impl::preprocessing::do_the_rest(T&) [with T = boost::adjacency_list >, boost::no_property, boost::no_property, boost::listS>; A = treedec::impl::fillIn; G_t = gala::graph; CFGT = treedec::impl::draft::pp_cfg]’ 727 | do_components(t, g); | ~~~~~~~~~~~~~~~~~~~^~~~~~ ./treedec/combinations.hpp:397:63: required from ‘void treedec::pending::PP_FI::do_it() [with G = gala::graph; CFGT = grtd_algo_config]’ 397 | A.template do_the_rest (_t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~ fi_thread.h:110:11: required from ‘void SEVERAL_FI_THREAD::run() [with G = gala::graph; A = treedec::pending::PP_FI; cfgt = grtd_algo_config]’ 110 | a.do_it(); | ~~~~~~~^~ fi_thread.h:108:10: required from here 108 | void run() { | ^~~ ./treedec/treedec_misc.hpp:105:31: warning: possibly dangling reference to a temporary [-Wdangling-reference] 105 | auto const& M=boost::get(bag_t(), src); | ^ ./treedec/treedec_misc.hpp:105:43: note: the temporary was destroyed at the end of the full expression ‘boost::get(treedec::bag_t(), (* & src))’ 105 | auto const& M=boost::get(bag_t(), src); | ~~~~~~~~~~^~~~~~~~~~~~~~ In file included from ./treedec/elimination_orderings.hpp:70, from ./treedec/combinations.hpp:53: ./treedec/impl/greedy_heuristic.hpp: In instantiation of ‘void treedec::impl::minDegree::initialize() [with G_t = boost::adjacency_list; CFG = treedec::algo::default_config]’: ./treedec/impl/greedy_heuristic.hpp:64:10: required from here 64 | void initialize(){ | ^~~~~~~~~~ ./treedec/impl/greedy_heuristic.hpp:65:14: warning: moving a temporary object prevents copy elision [-Wpessimizing-move] 65 | auto zerodegbag1=MOVE(_degs.detach_bag(0)); | ^~~~~~~~~~~ ./treedec/impl/greedy_heuristic.hpp:65:14: note: remove ‘std::move’ call ./treedec/impl/greedy_heuristic.hpp: In instantiation of ‘void treedec::impl::minDegree::postprocessing() [with G_t = boost::adjacency_list; CFG = treedec::algo::default_config]’: ./treedec/impl/greedy_heuristic.hpp:104:10: required from here 104 | void postprocessing(){ | ^~~~~~~~~~~~~~ ./treedec/impl/greedy_heuristic.hpp:105:14: warning: moving a temporary object prevents copy elision [-Wpessimizing-move] 105 | auto zerodegbag=MOVE(_degs.detach_bag(0)); | ^~~~~~~~~~ ./treedec/impl/greedy_heuristic.hpp:105:14: note: remove ‘std::move’ call tdecomp.cc: In function ‘(static initializers for tdecomp.cc)’: tdecomp.cc:122:1: warning: ‘./#builddir#build#BUILD#python-tdlib-0.9.2-build#tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e#examples#tdecomp-tdecomp.gcda’ profile count data file not found [-Wmissing-profile] 122 | } | ^ In constructor ‘treedec::impl::bmdo::bmdo(G_t&) [with G_t = gala::graph]’, inlined from ‘void BMD_THREAD::run() [with G = gala::graph; cfgt = grtd_algo_config]’ at bmd_thread.h:114:20: ./treedec/elimination_orderings.hpp:539:9: warning: ‘pg16’ may be used uninitialized [-Wmaybe-uninitialized] 539 | : _g(G), | ^~~~~ In file included from twh.h:207: bmd_thread.h: In member function ‘void BMD_THREAD::run() [with G = gala::graph; cfgt = grtd_algo_config]’: bmd_thread.h:88:19: note: ‘pg16’ was declared here 88 | sg_dvv16* pg16; | ^~~~ In constructor ‘treedec::impl::bmdo::bmdo(G_t&) [with G_t = gala::graph]’, inlined from ‘void BMD_THREAD::run() [with G = gala::graph; cfgt = grtd_algo_config]’ at bmd_thread.h:119:20: ./treedec/elimination_orderings.hpp:539:9: warning: ‘pg32’ may be used uninitialized [-Wmaybe-uninitialized] 539 | : _g(G), | ^~~~~ bmd_thread.h: In member function ‘void BMD_THREAD::run() [with G = gala::graph; cfgt = grtd_algo_config]’: bmd_thread.h:89:19: note: ‘pg32’ was declared here 89 | sg_dvv32* pg32; | ^~~~ In constructor ‘treedec::impl::bmdo::bmdo(G_t&) [with G_t = gala::graph]’, inlined from ‘void BMD_THREAD::run() [with G = gala::graph; cfgt = grtd_algo_config]’ at bmd_thread.h:114:20: ./treedec/elimination_orderings.hpp:539:9: warning: ‘pg16’ may be used uninitialized [-Wmaybe-uninitialized] 539 | : _g(G), | ^~~~~ bmd_thread.h: In member function ‘void BMD_THREAD::run() [with G = gala::graph; cfgt = grtd_algo_config]’: bmd_thread.h:88:19: note: ‘pg16’ was declared here 88 | sg_dvv16* pg16; | ^~~~ In constructor ‘treedec::impl::bmdo::bmdo(G_t&) [with G_t = gala::graph]’, inlined from ‘void BMD_THREAD::run() [with G = gala::graph; cfgt = grtd_algo_config]’ at bmd_thread.h:119:20: ./treedec/elimination_orderings.hpp:539:9: warning: ‘pg32’ may be used uninitialized [-Wmaybe-uninitialized] 539 | : _g(G), | ^~~~~ bmd_thread.h: In member function ‘void BMD_THREAD::run() [with G = gala::graph; cfgt = grtd_algo_config]’: bmd_thread.h:89:19: note: ‘pg32’ was declared here 89 | sg_dvv32* pg32; | ^~~~ In file included from /usr/include/boost/graph/detail/adjacency_list.hpp:35, from /usr/include/boost/graph/adjacency_list.hpp:255, from /usr/include/boost/graph/graphviz.hpp:24, from tdecomp.cc:22: In member function ‘bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list]’, inlined from ‘static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list; MutableGraph = boost::adjacency_list; CopyVertex = boost::detail::vertex_copier, boost::adjacency_list >; CopyEdge = boost::detail::edge_copier, boost::adjacency_list >; IndexMap = boost::vec_adj_list_vertex_id_map; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>]’ at /usr/include/boost/graph/copy.hpp:192:59, inlined from ‘void boost::copy_graph(const VertexListGraph&, MutableGraph&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list]’ at /usr/include/boost/graph/copy.hpp:398:21: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: ‘*(boost::detail::stored_edge_property* const*)((char*)&ei_end + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))’ may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from ./treedec/preprocessing.hpp:53: /usr/include/boost/graph/copy.hpp: In function ‘void boost::copy_graph(const VertexListGraph&, MutableGraph&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list]’: /usr/include/boost/graph/copy.hpp:191:63: note: ‘*(boost::detail::stored_edge_property* const*)((char*)&ei_end + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))’ was declared here 191 | typename graph_traits< Graph >::edge_iterator ei, ei_end; | ^~~~~~ In file included from /usr/include/c++/14/string:48, 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/c++/14/fstream:40, from /usr/include/boost/graph/graphviz.hpp:15: In member function ‘__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]’, inlined from ‘R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::vec_adj_list_vertex_id_map; T = long unsigned int; R = long unsigned int&]’ at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from ‘Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>; Reference = long unsigned int&; K = long unsigned int]’ at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from ‘static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list; MutableGraph = boost::adjacency_list; CopyVertex = boost::detail::vertex_copier, boost::adjacency_list >; CopyEdge = boost::detail::edge_copier, boost::adjacency_list >; IndexMap = boost::vec_adj_list_vertex_id_map; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>]’ at /usr/include/boost/graph/copy.hpp:197:35, inlined from ‘void boost::copy_graph(const VertexListGraph&, MutableGraph&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list]’ at /usr/include/boost/graph/copy.hpp:398:21: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: ‘*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src’ may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/copy.hpp: In function ‘void boost::copy_graph(const VertexListGraph&, MutableGraph&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list]’: /usr/include/boost/graph/copy.hpp:191:59: note: ‘*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src’ was declared here 191 | typename graph_traits< Graph >::edge_iterator ei, ei_end; | ^~ In member function ‘boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list]’, inlined from ‘static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list; MutableGraph = boost::adjacency_list; CopyVertex = boost::detail::vertex_copier, boost::adjacency_list >; CopyEdge = boost::detail::edge_copier, boost::adjacency_list >; IndexMap = boost::vec_adj_list_vertex_id_map; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>]’ at /usr/include/boost/graph/copy.hpp:192:70, inlined from ‘void boost::copy_graph(const VertexListGraph&, MutableGraph&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list]’ at /usr/include/boost/graph/copy.hpp:398:21: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: ‘((boost::detail::stored_edge_property* const*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]’ may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/copy.hpp: In function ‘void boost::copy_graph(const VertexListGraph&, MutableGraph&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list]’: /usr/include/boost/graph/copy.hpp:191:59: note: ‘((boost::detail::stored_edge_property* const*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]’ was declared here 191 | typename graph_traits< Graph >::edge_iterator ei, ei_end; | ^~ In file included from /usr/include/c++/14/memory:78, from /usr/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35, from /usr/include/boost/smart_ptr/detail/shared_count.hpp:27, from /usr/include/boost/smart_ptr/shared_ptr.hpp:18, from /usr/include/boost/property_map/vector_property_map.hpp:14, from /usr/include/boost/property_map/property_map.hpp:598, from /usr/include/boost/graph/graphviz.hpp:19: In member function ‘std::__uniq_ptr_impl<_Tp, _Dp>::pointer std::__uniq_ptr_impl<_Tp, _Dp>::_M_ptr() const [with _Tp = boost::no_property; _Dp = std::default_delete]’, inlined from ‘std::unique_ptr<_Tp, _Dp>::pointer std::unique_ptr<_Tp, _Dp>::get() const [with _Tp = boost::no_property; _Dp = std::default_delete]’ at /usr/include/c++/14/bits/unique_ptr.h:464:27, inlined from ‘typename std::add_lvalue_reference<_Tp>::type std::unique_ptr<_Tp, _Dp>::operator*() const [with _Tp = boost::no_property; _Dp = std::default_delete]’ at /usr/include/c++/14/bits/unique_ptr.h:447:2, inlined from ‘Property& boost::detail::stored_edge_property::get_property() [with Vertex = long unsigned int; Property = boost::no_property]’ at /usr/include/boost/graph/detail/adjacency_list.hpp:336:50, inlined from ‘EdgeDescriptor boost::detail::out_edge_iter::dereference() const [with BaseIter = __gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >; VertexDescriptor = long unsigned int; EdgeDescriptor = boost::detail::edge_desc_impl; Difference = long int]’ at /usr/include/boost/graph/detail/adjacency_list.hpp:148:46, inlined from ‘static typename Facade::reference boost::iterators::iterator_core_access::dereference(const Facade&) [with Facade = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ at /usr/include/boost/iterator/iterator_facade.hpp:631:31, inlined from ‘boost::iterators::detail::iterator_facade_base::reference boost::iterators::detail::iterator_facade_base::operator*() const [with Derived = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Value = boost::detail::edge_desc_impl; CategoryOrTraversal = boost::iterators::random_access_traversal_tag; Reference = boost::detail::edge_desc_impl; Difference = long int]’ at /usr/include/boost/iterator/iterator_facade.hpp:737:53, inlined from ‘boost::detail::adj_list_edge_iterator::value_type boost::detail::adj_list_edge_iterator::operator*() const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list]’ at /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:99:20, inlined from ‘static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list; MutableGraph = boost::adjacency_list; CopyVertex = boost::detail::vertex_copier, boost::adjacency_list >; CopyEdge = boost::detail::edge_copier, boost::adjacency_list >; IndexMap = boost::vec_adj_list_vertex_id_map; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>]’ at /usr/include/boost/graph/copy.hpp:197:54, inlined from ‘void boost::copy_graph(const VertexListGraph&, MutableGraph&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list]’ at /usr/include/boost/graph/copy.hpp:398:21: /usr/include/c++/14/bits/unique_ptr.h:193:67: warning: ‘*(__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >::_M_current’ may be used uninitialized [-Wmaybe-uninitialized] 193 | pointer _M_ptr() const noexcept { return std::get<0>(_M_t); } | ^ /usr/include/boost/graph/copy.hpp: In function ‘void boost::copy_graph(const VertexListGraph&, MutableGraph&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list]’: /usr/include/boost/graph/copy.hpp:191:59: note: ‘*(__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >::_M_current’ was declared here 191 | typename graph_traits< Graph >::edge_iterator ei, ei_end; | ^~ make[4]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' make[4]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' /bin/sh ../libtool --tag=CXX --mode=link g++ -fprofile-use=. -O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -std=c++11 -Wl,-z,relro -Wl,--as-needed -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes -o tdecomp tdecomp-tdecomp.o -lboost_thread -lboost_system -lpthread -lboost_graph -lboost_thread -lboost_system libtool: link: g++ -fprofile-use=. -O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -std=c++11 -Wl,-z -Wl,relro -Wl,--as-needed -Wl,-z -Wl,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes -o tdecomp tdecomp-tdecomp.o -lpthread -lboost_graph -lboost_thread -lboost_system make[4]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' Making all in tdlib Making all in . make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' /usr/bin/python3 -c 'import py_compile; py_compile.compile("__init__.py","__init__.pyc","__init__.py")' make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' /usr/bin/python3 -c 'import py_compile; py_compile.compile("graphs.py","graphs.pyc","graphs.py")' make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' /usr/bin/python3 -c 'import py_compile; py_compile.compile("Decomp.py","Decomp.pyc","Decomp.py")' make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' /usr/bin/python3 -c 'import py_compile; py_compile.compile("Graph.py","Graph.pyc","Graph.py")' make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' /usr/bin/python3 -O -c 'import py_compile; py_compile.compile("graphs.py","graphs.pyo","graphs.py")' make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' /usr/bin/python3 -O -c 'import py_compile; py_compile.compile("__init__.py","__init__.pyo","__init__.py")' make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' /usr/bin/python3 -O -c 'import py_compile; py_compile.compile("Graph.py","Graph.pyo","Graph.py")' make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' /usr/bin/python3 -O -c 'import py_compile; py_compile.compile("Decomp.py","Decomp.pyo","Decomp.py")' make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' /usr/bin/cython -3 --cplus -w /builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e /builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib/cytdlib.pyx -o /builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib/cytdlib.cpp make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' /bin/sh ../libtool --tag=CXX --mode=compile g++ -DHAVE_CONFIG_H -I. -I.. -I/usr/include/python3.13 -I/usr/include/python3.13 -I../src -DNDEBUG -pthread -Wl,-O1 -Wl,-Bsymbolic-functions -fno-strict-aliasing -g -fwrapv -O2 -Wall -Wformat -Werror=format-security -O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -std=c++11 -c -o cytdlib.lo cytdlib.cpp libtool: compile: g++ -DHAVE_CONFIG_H -I. -I.. -I/usr/include/python3.13 -I/usr/include/python3.13 -I../src -DNDEBUG -pthread -Wl,-O1 -Wl,-Bsymbolic-functions -fno-strict-aliasing -g -fwrapv -O2 -Wall -Wformat -Werror=format-security -O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -std=c++11 -c cytdlib.cpp -fPIC -DPIC -o .libs/cytdlib.o make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' /bin/sh ../libtool --tag=CXX --mode=compile g++ -DHAVE_CONFIG_H -I. -I.. -I/usr/include/python3.13 -I/usr/include/python3.13 -I../src -DNDEBUG -pthread -Wl,-O1 -Wl,-Bsymbolic-functions -fno-strict-aliasing -g -fwrapv -O2 -Wall -Wformat -Werror=format-security -O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -std=c++11 -c -o python_tdlib.lo python_tdlib.cpp libtool: compile: g++ -DHAVE_CONFIG_H -I. -I.. -I/usr/include/python3.13 -I/usr/include/python3.13 -I../src -DNDEBUG -pthread -Wl,-O1 -Wl,-Bsymbolic-functions -fno-strict-aliasing -g -fwrapv -O2 -Wall -Wformat -Werror=format-security -O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -std=c++11 -c python_tdlib.cpp -fPIC -DPIC -o .libs/python_tdlib.o In file included from python_tdlib.cpp:30: ../src/treedec.hpp: In instantiation of 'size_t treedec::get_bagsize(const T_t&) [with T_t = boost::adjacency_list; size_t = long unsigned int]': python_tdlib.cpp:654:25: required from here 654 | treedec::get_bagsize(T); | ~~~~~~~~~~~~~~~~~~~~^~~ ../src/treedec.hpp:230:22: warning: possibly dangling reference to a temporary [-Wdangling-reference] 230 | auto const& m=boost::get(bag_t(), T); | ^ ../src/treedec.hpp:230:34: note: the temporary was destroyed at the end of the full expression 'boost::get(treedec::bag_t(), (* & T))' 230 | auto const& m=boost::get(bag_t(), T); | ~~~~~~~~~~^~~~~~~~~~~~ In file included from ../src/combinations.hpp:54, from python_tdlib.cpp:40: ../src/postprocessing.hpp: In instantiation of 'void treedec::impl::MSVS::do_it() [with G_t = boost::adjacency_list; T_t = boost::adjacency_list]': ../src/postprocessing.hpp:306:12: required from 'void treedec::MSVS(const G_t&, T_t&) [with G_t = boost::adjacency_list; T_t = boost::adjacency_list]' 306 | A.do_it(); | ~~~~~~~^~ python_tdlib.cpp:820:22: required from here 820 | treedec::MSVS(G, T); | ~~~~~~~~~~~~~^~~~~~ ../src/postprocessing.hpp:163:29: warning: possibly dangling reference to a temporary [-Wdangling-reference] 163 | auto const& b=boost::get(bag_t(), _t, *tIt); | ^ ../src/postprocessing.hpp:163:41: note: the temporary was destroyed at the end of the full expression 'boost::get(treedec::bag_t(), (* &((treedec::impl::MSVS, boost::adjacency_list >*)this)->treedec::impl::MSVS, boost::adjacency_list >::_t), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& tIt))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())' 163 | auto const& b=boost::get(bag_t(), _t, *tIt); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../src/postprocessing.hpp:276:29: warning: possibly dangling reference to a temporary [-Wdangling-reference] 276 | auto const& b=boost::get(bag_t(), _t, oldN[i]); | ^ ../src/postprocessing.hpp:276:41: note: the temporary was destroyed at the end of the full expression 'boost::get(treedec::bag_t(), (* &((treedec::impl::MSVS, boost::adjacency_list >*)this)->treedec::impl::MSVS, boost::adjacency_list >::_t), oldN.std::vector::operator[](((std::vector::size_type)i)))' 276 | auto const& b=boost::get(bag_t(), _t, oldN[i]); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ ../src/postprocessing.hpp:282:33: warning: possibly dangling reference to a temporary [-Wdangling-reference] 282 | auto const& b=boost::get(bag_t(), _t, newN[j]); | ^ ../src/postprocessing.hpp:282:45: note: the temporary was destroyed at the end of the full expression 'boost::get(treedec::bag_t(), (* &((treedec::impl::MSVS, boost::adjacency_list >*)this)->treedec::impl::MSVS, boost::adjacency_list >::_t), newN.std::vector::operator[](((std::vector::size_type)j)))' 282 | auto const& b=boost::get(bag_t(), _t, newN[j]); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ ../src/postprocessing.hpp: In instantiation of 'void treedec::impl::MSVS::do_it() [with G_t = boost::adjacency_list; T_t = boost::adjacency_list]': ../src/postprocessing.hpp:306:12: required from 'void treedec::MSVS(const G_t&, T_t&) [with G_t = boost::adjacency_list; T_t = boost::adjacency_list]' 306 | A.do_it(); | ~~~~~~~^~ python_tdlib.cpp:826:22: required from here 826 | treedec::MSVS(G, T); | ~~~~~~~~~~~~~^~~~~~ ../src/postprocessing.hpp:163:29: warning: possibly dangling reference to a temporary [-Wdangling-reference] 163 | auto const& b=boost::get(bag_t(), _t, *tIt); | ^ ../src/postprocessing.hpp:163:41: note: the temporary was destroyed at the end of the full expression 'boost::get(treedec::bag_t(), (* &((treedec::impl::MSVS, boost::adjacency_list >*)this)->treedec::impl::MSVS, boost::adjacency_list >::_t), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& tIt))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())' 163 | auto const& b=boost::get(bag_t(), _t, *tIt); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../src/postprocessing.hpp:276:29: warning: possibly dangling reference to a temporary [-Wdangling-reference] 276 | auto const& b=boost::get(bag_t(), _t, oldN[i]); | ^ ../src/postprocessing.hpp:276:41: note: the temporary was destroyed at the end of the full expression 'boost::get(treedec::bag_t(), (* &((treedec::impl::MSVS, boost::adjacency_list >*)this)->treedec::impl::MSVS, boost::adjacency_list >::_t), oldN.std::vector::operator[](((std::vector::size_type)i)))' 276 | auto const& b=boost::get(bag_t(), _t, oldN[i]); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ ../src/postprocessing.hpp:282:33: warning: possibly dangling reference to a temporary [-Wdangling-reference] 282 | auto const& b=boost::get(bag_t(), _t, newN[j]); | ^ ../src/postprocessing.hpp:282:45: note: the temporary was destroyed at the end of the full expression 'boost::get(treedec::bag_t(), (* &((treedec::impl::MSVS, boost::adjacency_list >*)this)->treedec::impl::MSVS, boost::adjacency_list >::_t), newN.std::vector::operator[](((std::vector::size_type)j)))' 282 | auto const& b=boost::get(bag_t(), _t, newN[j]); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ In file included from ../src/combinations.hpp:53: ../src/elimination_orderings.hpp: In instantiation of 'void treedec::impl::treedec_to_ordering(T_t&, std::vector::vertex_descriptor>&) [with G_t = boost::adjacency_list; T_t = boost::adjacency_list; typename boost::graph_traits::vertex_descriptor = long unsigned int]': ../src/elimination_orderings.hpp:859:49: required from 'void treedec::treedec_to_ordering(T_t&, std::vector::vertex_descriptor>&) [with G_t = boost::adjacency_list; T_t = boost::adjacency_list; typename boost::graph_traits::vertex_descriptor = long unsigned int]' 859 | treedec::impl::treedec_to_ordering(T, O); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ python_tdlib.cpp:1128:60: required from here 1128 | treedec::treedec_to_ordering(T, elim_ordering_); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ ../src/elimination_orderings.hpp:799:21: warning: possibly dangling reference to a temporary [-Wdangling-reference] 799 | auto const& b=boost::get(bag_t(), T, *tIt); | ^ ../src/elimination_orderings.hpp:799:33: note: the temporary was destroyed at the end of the full expression 'boost::get(treedec::bag_t(), (* & T), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& tIt))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())' 799 | auto const& b=boost::get(bag_t(), T, *tIt); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~ ../src/elimination_orderings.hpp:815:25: warning: possibly dangling reference to a temporary [-Wdangling-reference] 815 | auto const& pb=boost::get(bag_t(), T, parent); | ^~ ../src/elimination_orderings.hpp:815:38: note: the temporary was destroyed at the end of the full expression 'boost::get(treedec::bag_t(), (* & T), parent)' 815 | auto const& pb=boost::get(bag_t(), T, parent); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ ../src/elimination_orderings.hpp:816:25: warning: possibly dangling reference to a temporary [-Wdangling-reference] 816 | auto const& lb=boost::get(bag_t(), T, leaf); | ^~ ../src/elimination_orderings.hpp:816:38: note: the temporary was destroyed at the end of the full expression 'boost::get(treedec::bag_t(), (* & T), leaf)' 816 | auto const& lb=boost::get(bag_t(), T, leaf); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~ In file included from ../src/combinations.hpp:63: ../src/treedec_copy.hpp: In instantiation of 'void treedec::obsolete_copy_treedec(const S&, T&) [with S = boost::adjacency_list > >; T = boost::adjacency_list]': ../src/combinations.hpp:130:39: required from 'void treedec::comb::PP_MD::get_tree_decomposition(TT&) const [with TT = boost::adjacency_list; G = boost::adjacency_list; CFGT = treedec::algo::default_config]' 130 | treedec::obsolete_copy_treedec(_t, t); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~ ../src/combinations.hpp:344:29: required from 'void treedec::PP_MD(G_t&, T_t&, int&) [with G_t = boost::adjacency_list; T_t = boost::adjacency_list]' 344 | a.get_tree_decomposition(T); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~ python_tdlib.cpp:229:23: required from here 229 | treedec::PP_MD(G, T, lb); | ~~~~~~~~~~~~~~^~~~~~~~~~ ../src/treedec_copy.hpp:35:29: warning: possibly dangling reference to a temporary [-Wdangling-reference] 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ^~ ../src/treedec_copy.hpp:35:42: note: the temporary was destroyed at the end of the full expression 'boost::get > >, vecS, vecS, bidirectionalS, property >, no_property, no_property, listS>::config, bidirectional_graph_helper_with_property > >, vecS, vecS, bidirectionalS, property >, no_property, no_property, listS>::config>, treedec::bag_t, long unsigned int>(treedec::bag_t(), (*(const boost::adj_list_helper > >, boost::vecS, boost::vecS, boost::bidirectionalS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config, boost::bidirectional_graph_helper_with_property > >, boost::vecS, boost::vecS, boost::bidirectionalS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config> >*)(& src)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& p.std::pair, boost::range_detail::integer_iterator >::first))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())' 35 | auto const& bs=boost::get(bag_t(), src, *p.first); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ In file included from ../src/combinations.hpp:57: ../src/separator_algorithm.hpp: In instantiation of 'void treedec::sep_glue_bag(typename treedec_traits::bag_type&, typename treedec_traits::bag_type&, T_t&) [with T_t = boost::adjacency_list; typename treedec_traits::bag_type = std::set]': ../src/separator_algorithm.hpp:325:30: required from 'bool treedec::sep_decomp(const G_t&, T_t&, W_t&, const P_t&, V_t&, std::vector&, unsigned int&, unsigned int, digraph_t*) [with G_t = boost::adjacency_list; T_t = boost::adjacency_list; W_t = std::set, std::allocator >; P_t = std::set, std::allocator >; V_t = std::set, std::allocator >; digraph_t = impl::disjoint_ways >]' 325 | treedec::sep_glue_bag(B1, B2, T); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ ../src/separator_algorithm.hpp:418:30: required from 'void treedec::separator_algorithm(const G_t&, T_t&) [with G_t = boost::adjacency_list; T_t = boost::adjacency_list]' 418 | finished = sep_decomp(G, T, emptySet, parent, vertices, disabled, num_dis, k, &dw); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ python_tdlib.cpp:583:37: required from here 583 | treedec::separator_algorithm(G, T); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~ ../src/separator_algorithm.hpp:285:21: warning: possibly dangling reference to a temporary [-Wdangling-reference] 285 | auto const& vb=boost::get(bag_t(), T, *vertexIt); | ^~ ../src/separator_algorithm.hpp:285:34: note: the temporary was destroyed at the end of the full expression 'boost::get(treedec::bag_t(), (* & T), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& vertexIt))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())' 285 | auto const& vb=boost::get(bag_t(), T, *vertexIt); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~ In file included from ../src/preprocessing.hpp:70, from python_tdlib.cpp:39: ../src/treedec_misc.hpp: In instantiation of 'void treedec::draft::append_decomposition(T_t&, const S_t&&, const G_t&, const M_t&) [with T_t = boost::adjacency_list; S_t = boost::adjacency_list; G_t = boost::adjacency_list; M_t = std::vector]': ../src/exact_base.hpp:296:36: required from 'void treedec::draft::exact_decomposition::do_components(T_t&, unsigned int) [with T_t = boost::adjacency_list; G_t = boost::adjacency_list; config = treedec::algo::default_config; kernel = treedec::exact_ta]' 296 | draft::append_decomposition(t, std::move(T_), G_, vdMap); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../src/exact_base.hpp:372:22: required from 'void treedec::draft::exact_decomposition::try_it(T_t&, unsigned int) [with T = boost::adjacency_list; G_t = boost::adjacency_list; config = treedec::algo::default_config; kernel = treedec::exact_ta]' 372 | do_components(T, lb_tw+1); | ~~~~~~~~~~~~~^~~~~~~~~~~~ ../src/combinations.hpp:599:22: required from 'void treedec::exact_decomposition_ex17(G_t&, T_t&, int) [with G_t = boost::adjacency_list; T_t = boost::adjacency_list]' 599 | return alg.try_it(T, lb_tw+1); | ~~~~~~~~~~^~~~~~~~~~~~ python_tdlib.cpp:462:38: required from here 462 | treedec::exact_decomposition_ex17(G, T, lb); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ ../src/treedec_misc.hpp:105:31: warning: possibly dangling reference to a temporary [-Wdangling-reference] 105 | auto const& M=boost::get(bag_t(), src); | ^ ../src/treedec_misc.hpp:105:43: note: the temporary was destroyed at the end of the full expression 'boost::get(treedec::bag_t(), (* & src))' 105 | auto const& M=boost::get(bag_t(), src); | ~~~~~~~~~~^~~~~~~~~~~~~~ In file included from ../src/combinations.hpp:56: ../src/exact_cutset.hpp: In instantiation of 'void treedec::draft::exact_cutset::get_tree_decomposition(T_t&) const [with T_t = boost::adjacency_list; G_t = boost::adjacency_list; config = treedec::algo::default_config]': ../src/exact_cutset.hpp:966:41: required from 'void treedec::draft::exact_cutset::get_tree_decomposition(T&) [with T = boost::adjacency_list; G_t = boost::adjacency_list; config = treedec::algo::default_config]' 966 | return c->get_tree_decomposition(t); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ ../src/exact_cutset.hpp:1150:33: required from 'bool treedec::exact_cutset(const G_t&, T_t&, int) [with G_t = boost::adjacency_list; T_t = boost::adjacency_list]' 1150 | a.get_tree_decomposition(T); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~ ../src/combinations.hpp:653:37: required from 'void treedec::exact_decomposition_cutset(G_t&, T_t&, int) [with G_t = boost::adjacency_list; T_t = boost::adjacency_list]' 653 | while(!treedec::exact_cutset(G_, T_, lb)){ | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ python_tdlib.cpp:488:44: required from here 488 | treedec::exact_decomposition_cutset(G, T, lb); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ ../src/exact_cutset.hpp:1101:25: warning: possibly dangling reference to a temporary [-Wdangling-reference] 1101 | auto const& parentB=boost::get(bag_t(), T, pos); | ^~~~~~~ ../src/exact_cutset.hpp:1101:43: note: the temporary was destroyed at the end of the full expression 'boost::get(treedec::bag_t(), (* & T), pos)' 1101 | auto const& parentB=boost::get(bag_t(), T, pos); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~ ../src/exact_cutset.hpp: In instantiation of 'void treedec::draft::exact_cutset::get_tree_decomposition(T_t&) const [with T_t = boost::adjacency_list; G_t = boost::adjacency_list; config = treedec::algo::default_config]': ../src/exact_cutset.hpp:966:41: required from 'void treedec::draft::exact_cutset::get_tree_decomposition(T&) [with T = boost::adjacency_list; G_t = boost::adjacency_list; config = treedec::algo::default_config]' 966 | return c->get_tree_decomposition(t); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ ../src/exact_cutset.hpp:1150:33: required from 'bool treedec::exact_cutset(const G_t&, T_t&, int) [with G_t = boost::adjacency_list; T_t = boost::adjacency_list]' 1150 | a.get_tree_decomposition(T); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~ ../src/combinations.hpp:653:37: required from 'void treedec::exact_decomposition_cutset(G_t&, T_t&, int) [with G_t = boost::adjacency_list; T_t = boost::adjacency_list]' 653 | while(!treedec::exact_cutset(G_, T_, lb)){ | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~ python_tdlib.cpp:494:44: required from here 494 | treedec::exact_decomposition_cutset(G, T, lb); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~ ../src/exact_cutset.hpp:1101:25: warning: possibly dangling reference to a temporary [-Wdangling-reference] 1101 | auto const& parentB=boost::get(bag_t(), T, pos); | ^~~~~~~ ../src/exact_cutset.hpp:1101:43: note: the temporary was destroyed at the end of the full expression 'boost::get(treedec::bag_t(), (* & T), pos)' 1101 | auto const& parentB=boost::get(bag_t(), T, pos); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~ In file included from python_tdlib.cpp:50: ../src/thorup.hpp: In instantiation of 'typename boost::graph_traits::vertex_iterator treedec::pkk_thorup::find_bag(const std::set&, const T_t&) [with T_t = boost::adjacency_list > >; typename boost::graph_traits::vertex_iterator = boost::range_detail::integer_iterator]': ../src/thorup.hpp:310:15: required from 'void treedec::pkk_thorup::add_vertices_to_tree_decomposition(T_t&, v_t, v_t, G_t&, std::vector&) [with T_t = boost::adjacency_list > >; v_t = std::reverse_iterator<__gnu_cxx::__normal_iterator > >; G_t = boost::adjacency_list]' 310 | t = find_bag(neighbours, T); | ~~~~~~~~^~~~~~~~~~~~~~~ ../src/thorup.hpp:336:37: required from 'void treedec::pkk_thorup::tree_decomposition_from_elimination_ordering(T_t&, const std::vector&, const G_t&) [with T_t = boost::adjacency_list > >; G_t = boost::adjacency_list]' 336 | add_vertices_to_tree_decomposition(T, v, v_end, G_sym, active); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../src/thorup.hpp:366:59: required from 'void treedec::thorup::do_it() [with G = boost::adjacency_list; config = treedec::algo::default_config]' 366 | pkk_thorup::tree_decomposition_from_elimination_ordering( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 367 | _t, _o, _g); | ~~~~~~~~~~~ python_tdlib.cpp:727:10: required from here 727 | Tp.do_it(); | ~~~~~~~~^~ ../src/thorup.hpp:242:31: warning: possibly dangling reference to a temporary [-Wdangling-reference] 242 | auto const& b=boost::get(treedec::bag_t(), T, *t); | ^ ../src/thorup.hpp:242:43: note: the temporary was destroyed at the end of the full expression 'boost::get > >, vecS, setS, undirectedS, property >, no_property, no_property, listS>::config, undirected_graph_helper > >, vecS, setS, undirectedS, property >, no_property, no_property, listS>::config>, treedec::bag_t, long unsigned int>(treedec::bag_t(), (*(const boost::adj_list_helper > >, boost::vecS, boost::setS, boost::undirectedS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config, boost::undirected_graph_helper > >, boost::vecS, boost::setS, boost::undirectedS, boost::property >, boost::no_property, boost::no_property, boost::listS>::config> >*)(& T)), ((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>*)(& t))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::iterators::random_access_traversal_tag, long unsigned int, long int, false, false>::operator*())' 242 | auto const& b=boost::get(treedec::bag_t(), T, *t); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In file included from ../src/treedec.hpp:29: ../src/graph.hpp: In instantiation of 'bool treedec::is_in_neighbour_bd::operator()(VD_t, VD_t) [with VD_t = long unsigned int; T_t = boost::adjacency_list]': ../src/overlay.hpp:99:31: required from 'const IG_t& treedec::draft::immutable_clone(const G_t&, IG_t&, I_t, I_t, S_t, M_t*, CB_t*) [with G_t = boost::adjacency_list; I_t = std::_Rb_tree_const_iterator; S_t = long unsigned int; IG_t = boost::adjacency_list; M_t = std::vector; CB_t = treedec::is_in_neighbour_bd >]' 99 | }else if((*cb)(*bi, *vi)){ | ~~~~~^~~~~~~~~~ ../src/postprocessing.hpp:170:58: required from 'void treedec::impl::MSVS::do_it() [with G_t = boost::adjacency_list; T_t = boost::adjacency_list]' 170 | HI = &treedec::draft::immutable_clone(_g, H, mybag.begin(), mybag.end(), mybag.size(), &vdMap_, &cb); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ../src/postprocessing.hpp:306:12: required from 'void treedec::MSVS(const G_t&, T_t&) [with G_t = boost::adjacency_list; T_t = boost::adjacency_list]' 306 | A.do_it(); | ~~~~~~~^~ python_tdlib.cpp:820:22: required from here 820 | treedec::MSVS(G, T); | ~~~~~~~~~~~~~^~~~~~ ../src/graph.hpp:465:25: warning: possibly dangling reference to a temporary [-Wdangling-reference] 465 | auto const& ibag=bag(*nIt, _T); // BUG | ^~~~ ../src/graph.hpp:465:33: note: the temporary was destroyed at the end of the full expression 'treedec::bag >(((boost::iterators::detail::iterator_facade_base, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, long unsigned int, boost::iterators::detail::iterator_category_with_traversal, long unsigned int, long int, false, false>*)(& nIt))->boost::iterators::detail::iterator_facade_base, long unsigned int, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator >, boost::no_property>*, std::vector >, boost::no_property>, std::allocator >, boost::no_property> > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, long int>, long unsigned int, boost::iterators::detail::iterator_category_with_traversal, long unsigned int, long int, false, false>::operator*(), (* &((treedec::is_in_neighbour_bd >*)this)->treedec::is_in_neighbour_bd >::_T))' 465 | auto const& ibag=bag(*nIt, _T); // BUG | ~~~^~~~~~~~~~ In file included from ../src/elimination_orderings.hpp:70: ../src/impl/greedy_heuristic.hpp: In instantiation of 'void treedec::impl::minDegree::initialize() [with G_t = boost::adjacency_list; CFG = treedec::algo::default_config]': ../src/impl/greedy_heuristic.hpp:64:10: required from here 64 | void initialize(){ | ^~~~~~~~~~ ../src/impl/greedy_heuristic.hpp:65:14: warning: moving a temporary object prevents copy elision [-Wpessimizing-move] 65 | auto zerodegbag1=MOVE(_degs.detach_bag(0)); | ^~~~~~~~~~~ ../src/impl/greedy_heuristic.hpp:65:14: note: remove 'std::move' call ../src/impl/greedy_heuristic.hpp: In instantiation of 'void treedec::impl::minDegree::postprocessing() [with G_t = boost::adjacency_list; CFG = treedec::algo::default_config]': ../src/impl/greedy_heuristic.hpp:104:10: required from here 104 | void postprocessing(){ | ^~~~~~~~~~~~~~ ../src/impl/greedy_heuristic.hpp:105:14: warning: moving a temporary object prevents copy elision [-Wpessimizing-move] 105 | auto zerodegbag=MOVE(_degs.detach_bag(0)); | ^~~~~~~~~~ ../src/impl/greedy_heuristic.hpp:105:14: note: remove 'std::move' call ../src/impl/greedy_heuristic.hpp: In instantiation of 'void treedec::impl::minDegree::initialize() [with G_t = boost::adjacency_list; CFG = treedec::algo::default_config]': ../src/impl/greedy_heuristic.hpp:64:10: required from here 64 | void initialize(){ | ^~~~~~~~~~ ../src/impl/greedy_heuristic.hpp:65:14: warning: moving a temporary object prevents copy elision [-Wpessimizing-move] 65 | auto zerodegbag1=MOVE(_degs.detach_bag(0)); | ^~~~~~~~~~~ ../src/impl/greedy_heuristic.hpp:65:14: note: remove 'std::move' call ../src/impl/greedy_heuristic.hpp: In instantiation of 'void treedec::impl::minDegree::postprocessing() [with G_t = boost::adjacency_list; CFG = treedec::algo::default_config]': ../src/impl/greedy_heuristic.hpp:104:10: required from here 104 | void postprocessing(){ | ^~~~~~~~~~~~~~ ../src/impl/greedy_heuristic.hpp:105:14: warning: moving a temporary object prevents copy elision [-Wpessimizing-move] 105 | auto zerodegbag=MOVE(_degs.detach_bag(0)); | ^~~~~~~~~~ ../src/impl/greedy_heuristic.hpp:105:14: note: remove 'std::move' call In file included from /usr/include/c++/14/cstddef:49, from /usr/include/boost/config/compiler/gcc.hpp:165, from /usr/include/boost/config.hpp:39, from /usr/include/boost/tuple/tuple.hpp:23, from python_tdlib.cpp:25: In member function 'std::vector<_Tp, _Alloc>::const_reference std::vector<_Tp, _Alloc>::operator[](size_type) const [with _Tp = boost::detail::adj_list_gen, boost::vecS, boost::vecS, boost::undirectedS, treedec::bag_t, boost::no_property, boost::no_property, boost::listS>::config::stored_vertex; _Alloc = std::allocator, boost::vecS, boost::vecS, boost::undirectedS, treedec::bag_t, boost::no_property, boost::no_property, boost::listS>::config::stored_vertex>]', inlined from 'Reference boost::vec_adj_list_vertex_property_map::operator[](key_type) const [with Graph = boost::adjacency_list; GraphPtr = const boost::adjacency_list*; ValueType = treedec::bag_t; Reference = const treedec::bag_t&; Tag = boost::vertex_bundle_t]' at /usr/include/boost/graph/detail/adjacency_list.hpp:2560:50, inlined from 'const boost::adjacency_list::vertex_bundled& boost::adjacency_list::operator[](vertex_descriptor) const [with OutEdgeListS = boost::vecS; VertexListS = boost::vecS; DirectedS = boost::undirectedS; VertexProperty = treedec::bag_t; EdgeProperty = boost::no_property; GraphProperty = boost::no_property; EdgeListS = boost::listS]' at /usr/include/boost/graph/adjacency_list.hpp:385:41, inlined from 'const boost::bagstuff::gtob, void>::type& boost::get(treedec::bag_t, const TD_tree_dec_t&, U) [with U = long unsigned int]' at ../src/treedec.hpp:37:1, inlined from 'bool treedec::validate_connectivity(const T_t&) [with T_t = boost::adjacency_list]' at ../src/misc.hpp:212:29: /usr/include/c++/14/bits/stl_vector.h:1149:9: warning: 'parent' may be used uninitialized [-Wmaybe-uninitialized] 1149 | __glibcxx_requires_subscript(__n); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from ../src/preprocessing.hpp:68: ../src/misc.hpp: In function 'bool treedec::validate_connectivity(const T_t&) [with T_t = boost::adjacency_list]': ../src/misc.hpp:183:62: note: 'parent' was declared here 183 | typename boost::graph_traits::vertex_descriptor parent; | ^~~~~~ In file included from /usr/include/boost/graph/adjacency_list.hpp:255, from python_tdlib.cpp:27: In function 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, undirectedS, treedec::bag_t, no_property, no_property, listS>::config; Base = undirected_graph_helper, vecS, vecS, undirectedS, treedec::bag_t, no_property, no_property, listS>::config>]', inlined from 'void treedec::glue_two_bags(T_t&, typename treedec_traits::bag_type&, typename treedec_traits::bag_type&) [with T_t = boost::adjacency_list]' at ../src/misc.hpp:753:20: /usr/include/boost/graph/detail/adjacency_list.hpp:2271:20: warning: 'b2' may be used uninitialized [-Wmaybe-uninitialized] 2271 | return add_edge(u, v, p, g_); | ~~~~~~~~^~~~~~~~~~~~~ ../src/misc.hpp: In function 'void treedec::glue_two_bags(T_t&, typename treedec_traits::bag_type&, typename treedec_traits::bag_type&) [with T_t = boost::adjacency_list]': ../src/misc.hpp:720:62: note: 'b2' was declared here 720 | typename boost::graph_traits::vertex_descriptor b1, b2; | ^~ In function 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, undirectedS, treedec::bag_t, no_property, no_property, listS>::config; Base = undirected_graph_helper, vecS, vecS, undirectedS, treedec::bag_t, no_property, no_property, listS>::config>]', inlined from 'void treedec::glue_two_bags(T_t&, typename treedec_traits::bag_type&, typename treedec_traits::bag_type&) [with T_t = boost::adjacency_list]' at ../src/misc.hpp:753:20: /usr/include/boost/graph/detail/adjacency_list.hpp:2271:20: warning: 'b1' may be used uninitialized [-Wmaybe-uninitialized] 2271 | return add_edge(u, v, p, g_); | ~~~~~~~~^~~~~~~~~~~~~ ../src/misc.hpp: In function 'void treedec::glue_two_bags(T_t&, typename treedec_traits::bag_type&, typename treedec_traits::bag_type&) [with T_t = boost::adjacency_list]': ../src/misc.hpp:720:58: note: 'b1' was declared here 720 | typename boost::graph_traits::vertex_descriptor b1, b2; | ^~ In file included from /usr/include/boost/graph/detail/adjacency_list.hpp:35: In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list]', inlined from 'static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list; MutableGraph = boost::adjacency_list; CopyVertex = treedec::pkk_thorup::forget_properties; CopyEdge = treedec::pkk_thorup::forget_properties; IndexMap = boost::vec_adj_list_vertex_id_map; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>]' at /usr/include/boost/graph/copy.hpp:192:59, inlined from 'void boost::copy_graph(const VertexListGraph&, MutableGraph&, const bgl_named_params&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list; P = treedec::pkk_thorup::forget_properties; T = edge_copy_t; R = bgl_named_params]' at /usr/include/boost/graph/copy.hpp:422:21, inlined from 'void treedec::pkk_thorup::tree_decomposition_from_elimination_ordering(T_t&, const std::vector&, const G_t&) [with T_t = boost::adjacency_list > >; G_t = boost::adjacency_list]' at ../src/thorup.hpp:332:20: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property* const*)((char*)&ei_end + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from ../src/preprocessing.hpp:53: /usr/include/boost/graph/copy.hpp: In function 'void treedec::pkk_thorup::tree_decomposition_from_elimination_ordering(T_t&, const std::vector&, const G_t&) [with T_t = boost::adjacency_list > >; G_t = boost::adjacency_list]': /usr/include/boost/graph/copy.hpp:191:63: note: '*(boost::detail::stored_edge_property* const*)((char*)&ei_end + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 191 | typename graph_traits< Graph >::edge_iterator ei, ei_end; | ^~~~~~ In file included from /usr/include/c++/14/bits/stl_algobase.h:67, from /usr/include/c++/14/bits/stl_tree.h:63, from /usr/include/c++/14/map:62, from python_tdlib.cpp:26: In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::vec_adj_list_vertex_id_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>; Reference = long unsigned int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list; MutableGraph = boost::adjacency_list; CopyVertex = treedec::pkk_thorup::forget_properties; CopyEdge = treedec::pkk_thorup::forget_properties; IndexMap = boost::vec_adj_list_vertex_id_map; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>]' at /usr/include/boost/graph/copy.hpp:197:35, inlined from 'void boost::copy_graph(const VertexListGraph&, MutableGraph&, const bgl_named_params&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list; P = treedec::pkk_thorup::forget_properties; T = edge_copy_t; R = bgl_named_params]' at /usr/include/boost/graph/copy.hpp:422:21, inlined from 'void treedec::pkk_thorup::tree_decomposition_from_elimination_ordering(T_t&, const std::vector&, const G_t&) [with T_t = boost::adjacency_list > >; G_t = boost::adjacency_list]' at ../src/thorup.hpp:332:20: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/copy.hpp: In function 'void treedec::pkk_thorup::tree_decomposition_from_elimination_ordering(T_t&, const std::vector&, const G_t&) [with T_t = boost::adjacency_list > >; G_t = boost::adjacency_list]': /usr/include/boost/graph/copy.hpp:191:59: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 191 | typename graph_traits< Graph >::edge_iterator ei, ei_end; | ^~ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list]', inlined from 'static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list; MutableGraph = boost::adjacency_list; CopyVertex = treedec::pkk_thorup::forget_properties; CopyEdge = treedec::pkk_thorup::forget_properties; IndexMap = boost::vec_adj_list_vertex_id_map; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>]' at /usr/include/boost/graph/copy.hpp:192:70, inlined from 'void boost::copy_graph(const VertexListGraph&, MutableGraph&, const bgl_named_params&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list; P = treedec::pkk_thorup::forget_properties; T = edge_copy_t; R = bgl_named_params]' at /usr/include/boost/graph/copy.hpp:422:21, inlined from 'void treedec::pkk_thorup::tree_decomposition_from_elimination_ordering(T_t&, const std::vector&, const G_t&) [with T_t = boost::adjacency_list > >; G_t = boost::adjacency_list]' at ../src/thorup.hpp:332:20: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property* const*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/copy.hpp: In function 'void treedec::pkk_thorup::tree_decomposition_from_elimination_ordering(T_t&, const std::vector&, const G_t&) [with T_t = boost::adjacency_list > >; G_t = boost::adjacency_list]': /usr/include/boost/graph/copy.hpp:191:59: note: '((boost::detail::stored_edge_property* const*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 191 | typename graph_traits< Graph >::edge_iterator ei, ei_end; | ^~ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list]', inlined from 'static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list; MutableGraph = boost::adjacency_list; CopyVertex = treedec::pkk_thorup::forget_properties; CopyEdge = treedec::pkk_thorup::forget_properties; IndexMap = boost::vec_adj_list_vertex_id_map; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>]' at /usr/include/boost/graph/copy.hpp:192:59, inlined from 'void boost::copy_graph(const VertexListGraph&, MutableGraph&, const bgl_named_params&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list; P = treedec::pkk_thorup::forget_properties; T = edge_copy_t; R = bgl_named_params]' at /usr/include/boost/graph/copy.hpp:422:21, inlined from 'void treedec::pkk_thorup::tree_decomposition_from_elimination_ordering(T_t&, const std::vector&, const G_t&) [with T_t = boost::adjacency_list > >; G_t = boost::adjacency_list]' at ../src/thorup.hpp:332:20: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/copy.hpp: In function 'void treedec::pkk_thorup::tree_decomposition_from_elimination_ordering(T_t&, const std::vector&, const G_t&) [with T_t = boost::adjacency_list > >; G_t = boost::adjacency_list]': /usr/include/boost/graph/copy.hpp:191:59: note: '*(__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >::_M_current' was declared here 191 | typename graph_traits< Graph >::edge_iterator ei, ei_end; | ^~ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list]', inlined from 'static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list; MutableGraph = boost::adjacency_list; CopyVertex = treedec::pkk_thorup::forget_properties; CopyEdge = treedec::pkk_thorup::forget_properties; IndexMap = boost::vec_adj_list_vertex_id_map; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>]' at /usr/include/boost/graph/copy.hpp:192:59, inlined from 'void boost::copy_graph(const VertexListGraph&, MutableGraph&, const bgl_named_params&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list; P = treedec::pkk_thorup::forget_properties; T = edge_copy_t; R = bgl_named_params]' at /usr/include/boost/graph/copy.hpp:422:21, inlined from 'void treedec::pkk_thorup::thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::vector; G_t = boost::adjacency_list]' at ../src/thorup.hpp:207:20: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property* const*)((char*)&ei_end + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/copy.hpp: In function 'void treedec::pkk_thorup::thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::vector; G_t = boost::adjacency_list]': /usr/include/boost/graph/copy.hpp:191:63: note: '*(boost::detail::stored_edge_property* const*)((char*)&ei_end + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 191 | typename graph_traits< Graph >::edge_iterator ei, ei_end; | ^~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::vec_adj_list_vertex_id_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>; Reference = long unsigned int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list; MutableGraph = boost::adjacency_list; CopyVertex = treedec::pkk_thorup::forget_properties; CopyEdge = treedec::pkk_thorup::forget_properties; IndexMap = boost::vec_adj_list_vertex_id_map; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>]' at /usr/include/boost/graph/copy.hpp:197:35, inlined from 'void boost::copy_graph(const VertexListGraph&, MutableGraph&, const bgl_named_params&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list; P = treedec::pkk_thorup::forget_properties; T = edge_copy_t; R = bgl_named_params]' at /usr/include/boost/graph/copy.hpp:422:21, inlined from 'void treedec::pkk_thorup::thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::vector; G_t = boost::adjacency_list]' at ../src/thorup.hpp:207:20: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/copy.hpp: In function 'void treedec::pkk_thorup::thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::vector; G_t = boost::adjacency_list]': /usr/include/boost/graph/copy.hpp:191:59: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 191 | typename graph_traits< Graph >::edge_iterator ei, ei_end; | ^~ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list]', inlined from 'static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list; MutableGraph = boost::adjacency_list; CopyVertex = treedec::pkk_thorup::forget_properties; CopyEdge = treedec::pkk_thorup::forget_properties; IndexMap = boost::vec_adj_list_vertex_id_map; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>]' at /usr/include/boost/graph/copy.hpp:192:70, inlined from 'void boost::copy_graph(const VertexListGraph&, MutableGraph&, const bgl_named_params&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list; P = treedec::pkk_thorup::forget_properties; T = edge_copy_t; R = bgl_named_params]' at /usr/include/boost/graph/copy.hpp:422:21, inlined from 'void treedec::pkk_thorup::thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::vector; G_t = boost::adjacency_list]' at ../src/thorup.hpp:207:20: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property* const*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/copy.hpp: In function 'void treedec::pkk_thorup::thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::vector; G_t = boost::adjacency_list]': /usr/include/boost/graph/copy.hpp:191:59: note: '((boost::detail::stored_edge_property* const*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 191 | typename graph_traits< Graph >::edge_iterator ei, ei_end; | ^~ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list]', inlined from 'static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list; MutableGraph = boost::adjacency_list; CopyVertex = treedec::pkk_thorup::forget_properties; CopyEdge = treedec::pkk_thorup::forget_properties; IndexMap = boost::vec_adj_list_vertex_id_map; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>]' at /usr/include/boost/graph/copy.hpp:192:59, inlined from 'void boost::copy_graph(const VertexListGraph&, MutableGraph&, const bgl_named_params&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list; P = treedec::pkk_thorup::forget_properties; T = edge_copy_t; R = bgl_named_params]' at /usr/include/boost/graph/copy.hpp:422:21, inlined from 'void treedec::pkk_thorup::thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::vector; G_t = boost::adjacency_list]' at ../src/thorup.hpp:207:20: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/copy.hpp: In function 'void treedec::pkk_thorup::thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::vector; G_t = boost::adjacency_list]': /usr/include/boost/graph/copy.hpp:191:59: note: '*(__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >::_M_current' was declared here 191 | typename graph_traits< Graph >::edge_iterator ei, ei_end; | ^~ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list]', inlined from 'static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list; MutableGraph = boost::adjacency_list; CopyVertex = boost::detail::vertex_copier, boost::adjacency_list >; CopyEdge = boost::detail::edge_copier, boost::adjacency_list >; IndexMap = boost::vec_adj_list_vertex_id_map; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>]' at /usr/include/boost/graph/copy.hpp:192:59, inlined from 'void boost::copy_graph(const VertexListGraph&, MutableGraph&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list]' at /usr/include/boost/graph/copy.hpp:398:21, inlined from 'void treedec::pkk_thorup::thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::vector; G_t = boost::adjacency_list]' at ../src/thorup.hpp:218:20: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(boost::detail::stored_edge_property* const*)((char*)&ei_end + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/copy.hpp: In function 'void treedec::pkk_thorup::thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::vector; G_t = boost::adjacency_list]': /usr/include/boost/graph/copy.hpp:191:63: note: '*(boost::detail::stored_edge_property* const*)((char*)&ei_end + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_))' was declared here 191 | typename graph_traits< Graph >::edge_iterator ei, ei_end; | ^~~~~~ In member function '__gnu_cxx::__normal_iterator<_Iterator, _Container> __gnu_cxx::__normal_iterator<_Iterator, _Container>::operator+(difference_type) const [with _Iterator = long unsigned int*; _Container = std::vector]', inlined from 'R boost::iterator_property_map::operator[](key_type) const [with RandomAccessIterator = __gnu_cxx::__normal_iterator >; IndexMap = boost::vec_adj_list_vertex_id_map; T = long unsigned int; R = long unsigned int&]' at /usr/include/boost/property_map/property_map.hpp:341:59, inlined from 'Reference boost::get(const put_get_helper&, const K&) [with PropertyMap = iterator_property_map<__gnu_cxx::__normal_iterator >, vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>; Reference = long unsigned int&; K = long unsigned int]' at /usr/include/boost/property_map/property_map.hpp:304:54, inlined from 'static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list; MutableGraph = boost::adjacency_list; CopyVertex = boost::detail::vertex_copier, boost::adjacency_list >; CopyEdge = boost::detail::edge_copier, boost::adjacency_list >; IndexMap = boost::vec_adj_list_vertex_id_map; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>]' at /usr/include/boost/graph/copy.hpp:197:35, inlined from 'void boost::copy_graph(const VertexListGraph&, MutableGraph&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list]' at /usr/include/boost/graph/copy.hpp:398:21, inlined from 'void treedec::pkk_thorup::thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::vector; G_t = boost::adjacency_list]' at ../src/thorup.hpp:218:20: /usr/include/c++/14/bits/stl_iterator.h:1139:45: warning: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' may be used uninitialized [-Wmaybe-uninitialized] 1139 | { return __normal_iterator(_M_current + __n); } | ~~~~~~~~~~~^~~~~ /usr/include/boost/graph/copy.hpp: In function 'void treedec::pkk_thorup::thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::vector; G_t = boost::adjacency_list]': /usr/include/boost/graph/copy.hpp:191:59: note: '*(const boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>::m_src' was declared here 191 | typename graph_traits< Graph >::edge_iterator ei, ei_end; | ^~ In member function 'boost::detail::adj_list_edge_iterator::self& boost::detail::adj_list_edge_iterator::operator++() [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list]', inlined from 'static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list; MutableGraph = boost::adjacency_list; CopyVertex = boost::detail::vertex_copier, boost::adjacency_list >; CopyEdge = boost::detail::edge_copier, boost::adjacency_list >; IndexMap = boost::vec_adj_list_vertex_id_map; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>]' at /usr/include/boost/graph/copy.hpp:192:70, inlined from 'void boost::copy_graph(const VertexListGraph&, MutableGraph&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list]' at /usr/include/boost/graph/copy.hpp:398:21, inlined from 'void treedec::pkk_thorup::thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::vector; G_t = boost::adjacency_list]' at ../src/thorup.hpp:218:20: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:80:13: warning: '((boost::detail::stored_edge_property* const*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' may be used uninitialized [-Wmaybe-uninitialized] 80 | if (edges BOOST_GRAPH_MEMBER first | ^~ /usr/include/boost/graph/copy.hpp: In function 'void treedec::pkk_thorup::thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::vector; G_t = boost::adjacency_list]': /usr/include/boost/graph/copy.hpp:191:59: note: '((boost::detail::stored_edge_property* const*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)))[2]' was declared here 191 | typename graph_traits< Graph >::edge_iterator ei, ei_end; | ^~ In member function 'bool boost::detail::adj_list_edge_iterator::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>; Graph = boost::adjacency_list]', inlined from 'static void boost::detail::copy_graph_impl<0>::apply(const Graph&, MutableGraph&, CopyVertex, CopyEdge, Orig2CopyVertexIndexMap, IndexMap) [with Graph = boost::adjacency_list; MutableGraph = boost::adjacency_list; CopyVertex = boost::detail::vertex_copier, boost::adjacency_list >; CopyEdge = boost::detail::edge_copier, boost::adjacency_list >; IndexMap = boost::vec_adj_list_vertex_id_map; Orig2CopyVertexIndexMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::vec_adj_list_vertex_id_map, long unsigned int, long unsigned int&>]' at /usr/include/boost/graph/copy.hpp:192:59, inlined from 'void boost::copy_graph(const VertexListGraph&, MutableGraph&) [with VertexListGraph = adjacency_list; MutableGraph = adjacency_list]' at /usr/include/boost/graph/copy.hpp:398:21, inlined from 'void treedec::pkk_thorup::thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::vector; G_t = boost::adjacency_list]' at ../src/thorup.hpp:218:20: /usr/include/boost/graph/detail/adj_list_edge_iterator.hpp:112:21: warning: '*(__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >::_M_current' may be used uninitialized [-Wmaybe-uninitialized] 111 | || (vCurr != vEnd | ~~~~~~~~~~~~~~ 112 | && edges BOOST_GRAPH_MEMBER first | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 113 | != x.edges BOOST_GRAPH_MEMBER first); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/boost/graph/copy.hpp: In function 'void treedec::pkk_thorup::thorup_elimination_ordering(l_t&, const G_t&) [with l_t = std::vector; G_t = boost::adjacency_list]': /usr/include/boost/graph/copy.hpp:191:59: note: '*(__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >*)((char*)&ei + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::adjacency_list >::edges.boost::optional*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::.boost::optional_detail::optional_base*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::m_storage.boost::optional_detail::aligned_storage*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::dummy_)).__gnu_cxx::__normal_iterator*, std::vector, std::allocator > > >::_M_current' was declared here 191 | typename graph_traits< Graph >::edge_iterator ei, ei_end; | ^~ In function 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config; Base = bidirectional_graph_helper_with_property, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config>]', inlined from 'std::pair::directed_overlay>::vertex_descriptor, typename boost::graph_traits::directed_overlay>::vertex_descriptor> treedec::make_digraph_with_source_and_sink(const G_t&, const std::vector&, unsigned int, typename graph_traits::directed_overlay&, std::vector::vertex_descriptor>&, const std::set::vertex_descriptor>&, const std::set::vertex_descriptor>&) [with G_t = boost::adjacency_list]' at ../src/network_flow.hpp:174:32: /usr/include/boost/graph/detail/adjacency_list.hpp:2271:20: warning: 'p' may be used uninitialized [-Wmaybe-uninitialized] 2271 | return add_edge(u, v, p, g_); | ~~~~~~~~^~~~~~~~~~~~~ /usr/include/boost/graph/detail/adjacency_list.hpp: In function 'std::pair::directed_overlay>::vertex_descriptor, typename boost::graph_traits::directed_overlay>::vertex_descriptor> treedec::make_digraph_with_source_and_sink(const G_t&, const std::vector&, unsigned int, typename graph_traits::directed_overlay&, std::vector::vertex_descriptor>&, const std::set::vertex_descriptor>&, const std::set::vertex_descriptor>&) [with G_t = boost::adjacency_list]': /usr/include/boost/graph/detail/adjacency_list.hpp:2252:60: note: by argument 3 of type 'const boost::detail::adj_list_gen, boost::vecS, boost::vecS, boost::bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, boost::no_property, boost::listS>::config::edge_property_type&' {aka 'const treedec::Edge_NF&'} to 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, const typename Config::edge_property_type&, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config; Base = bidirectional_graph_helper_with_property, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config>]' declared here 2252 | inline std::pair< typename Config::edge_descriptor, bool > add_edge( | ^~~~~~~~ /usr/include/boost/graph/detail/adjacency_list.hpp:2270:41: note: 'p' declared here 2270 | typename Config::edge_property_type p; | ^ In function 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config; Base = bidirectional_graph_helper_with_property, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config>]', inlined from 'std::pair::directed_overlay>::vertex_descriptor, typename boost::graph_traits::directed_overlay>::vertex_descriptor> treedec::make_digraph_with_source_and_sink(const G_t&, const std::vector&, unsigned int, typename graph_traits::directed_overlay&, std::vector::vertex_descriptor>&, const std::set::vertex_descriptor>&, const std::set::vertex_descriptor>&) [with G_t = boost::adjacency_list]' at ../src/network_flow.hpp:177:32: /usr/include/boost/graph/detail/adjacency_list.hpp:2271:20: warning: 'p' may be used uninitialized [-Wmaybe-uninitialized] 2271 | return add_edge(u, v, p, g_); | ~~~~~~~~^~~~~~~~~~~~~ /usr/include/boost/graph/detail/adjacency_list.hpp: In function 'std::pair::directed_overlay>::vertex_descriptor, typename boost::graph_traits::directed_overlay>::vertex_descriptor> treedec::make_digraph_with_source_and_sink(const G_t&, const std::vector&, unsigned int, typename graph_traits::directed_overlay&, std::vector::vertex_descriptor>&, const std::set::vertex_descriptor>&, const std::set::vertex_descriptor>&) [with G_t = boost::adjacency_list]': /usr/include/boost/graph/detail/adjacency_list.hpp:2252:60: note: by argument 3 of type 'const boost::detail::adj_list_gen, boost::vecS, boost::vecS, boost::bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, boost::no_property, boost::listS>::config::edge_property_type&' {aka 'const treedec::Edge_NF&'} to 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, const typename Config::edge_property_type&, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config; Base = bidirectional_graph_helper_with_property, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config>]' declared here 2252 | inline std::pair< typename Config::edge_descriptor, bool > add_edge( | ^~~~~~~~ /usr/include/boost/graph/detail/adjacency_list.hpp:2270:41: note: 'p' declared here 2270 | typename Config::edge_property_type p; | ^ In function 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config; Base = bidirectional_graph_helper_with_property, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config>]', inlined from 'std::pair::directed_overlay>::vertex_descriptor, typename boost::graph_traits::directed_overlay>::vertex_descriptor> treedec::make_digraph_with_source_and_sink(const G_t&, const std::vector&, unsigned int, typename graph_traits::directed_overlay&, std::vector::vertex_descriptor>&, const std::set::vertex_descriptor>&, const std::set::vertex_descriptor>&) [with G_t = boost::adjacency_list]' at ../src/network_flow.hpp:188:28: /usr/include/boost/graph/detail/adjacency_list.hpp:2271:20: warning: 'p' may be used uninitialized [-Wmaybe-uninitialized] 2271 | return add_edge(u, v, p, g_); | ~~~~~~~~^~~~~~~~~~~~~ /usr/include/boost/graph/detail/adjacency_list.hpp: In function 'std::pair::directed_overlay>::vertex_descriptor, typename boost::graph_traits::directed_overlay>::vertex_descriptor> treedec::make_digraph_with_source_and_sink(const G_t&, const std::vector&, unsigned int, typename graph_traits::directed_overlay&, std::vector::vertex_descriptor>&, const std::set::vertex_descriptor>&, const std::set::vertex_descriptor>&) [with G_t = boost::adjacency_list]': /usr/include/boost/graph/detail/adjacency_list.hpp:2252:60: note: by argument 3 of type 'const boost::detail::adj_list_gen, boost::vecS, boost::vecS, boost::bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, boost::no_property, boost::listS>::config::edge_property_type&' {aka 'const treedec::Edge_NF&'} to 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, const typename Config::edge_property_type&, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config; Base = bidirectional_graph_helper_with_property, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config>]' declared here 2252 | inline std::pair< typename Config::edge_descriptor, bool > add_edge( | ^~~~~~~~ /usr/include/boost/graph/detail/adjacency_list.hpp:2270:41: note: 'p' declared here 2270 | typename Config::edge_property_type p; | ^ In function 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config; Base = bidirectional_graph_helper_with_property, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config>]', inlined from 'std::pair::directed_overlay>::vertex_descriptor, typename boost::graph_traits::directed_overlay>::vertex_descriptor> treedec::make_digraph_with_source_and_sink(const G_t&, const std::vector&, unsigned int, typename graph_traits::directed_overlay&, std::vector::vertex_descriptor>&, const std::set::vertex_descriptor>&, const std::set::vertex_descriptor>&) [with G_t = boost::adjacency_list]' at ../src/network_flow.hpp:199:28: /usr/include/boost/graph/detail/adjacency_list.hpp:2271:20: warning: 'p' may be used uninitialized [-Wmaybe-uninitialized] 2271 | return add_edge(u, v, p, g_); | ~~~~~~~~^~~~~~~~~~~~~ /usr/include/boost/graph/detail/adjacency_list.hpp: In function 'std::pair::directed_overlay>::vertex_descriptor, typename boost::graph_traits::directed_overlay>::vertex_descriptor> treedec::make_digraph_with_source_and_sink(const G_t&, const std::vector&, unsigned int, typename graph_traits::directed_overlay&, std::vector::vertex_descriptor>&, const std::set::vertex_descriptor>&, const std::set::vertex_descriptor>&) [with G_t = boost::adjacency_list]': /usr/include/boost/graph/detail/adjacency_list.hpp:2252:60: note: by argument 3 of type 'const boost::detail::adj_list_gen, boost::vecS, boost::vecS, boost::bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, boost::no_property, boost::listS>::config::edge_property_type&' {aka 'const treedec::Edge_NF&'} to 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, const typename Config::edge_property_type&, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config; Base = bidirectional_graph_helper_with_property, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config>]' declared here 2252 | inline std::pair< typename Config::edge_descriptor, bool > add_edge( | ^~~~~~~~ /usr/include/boost/graph/detail/adjacency_list.hpp:2270:41: note: 'p' declared here 2270 | typename Config::edge_property_type p; | ^ In function 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config; Base = bidirectional_graph_helper_with_property, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config>]', inlined from 'std::pair::directed_overlay>::vertex_descriptor, typename boost::graph_traits::directed_overlay>::vertex_descriptor> treedec::make_digraph_with_source_and_sink(const G_t&, const std::vector&, unsigned int, typename graph_traits::directed_overlay&, std::vector::vertex_descriptor>&, const std::set::vertex_descriptor>&, const std::set::vertex_descriptor>&) [with G_t = boost::adjacency_list]' at ../src/network_flow.hpp:174:32: /usr/include/boost/graph/detail/adjacency_list.hpp:2271:20: warning: 'p' may be used uninitialized [-Wmaybe-uninitialized] 2271 | return add_edge(u, v, p, g_); | ~~~~~~~~^~~~~~~~~~~~~ /usr/include/boost/graph/detail/adjacency_list.hpp: In function 'std::pair::directed_overlay>::vertex_descriptor, typename boost::graph_traits::directed_overlay>::vertex_descriptor> treedec::make_digraph_with_source_and_sink(const G_t&, const std::vector&, unsigned int, typename graph_traits::directed_overlay&, std::vector::vertex_descriptor>&, const std::set::vertex_descriptor>&, const std::set::vertex_descriptor>&) [with G_t = boost::adjacency_list]': /usr/include/boost/graph/detail/adjacency_list.hpp:2252:60: note: by argument 3 of type 'const boost::detail::adj_list_gen, boost::vecS, boost::vecS, boost::bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, boost::no_property, boost::listS>::config::edge_property_type&' {aka 'const treedec::Edge_NF&'} to 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, const typename Config::edge_property_type&, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config; Base = bidirectional_graph_helper_with_property, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config>]' declared here 2252 | inline std::pair< typename Config::edge_descriptor, bool > add_edge( | ^~~~~~~~ /usr/include/boost/graph/detail/adjacency_list.hpp:2270:41: note: 'p' declared here 2270 | typename Config::edge_property_type p; | ^ In function 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config; Base = bidirectional_graph_helper_with_property, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config>]', inlined from 'std::pair::directed_overlay>::vertex_descriptor, typename boost::graph_traits::directed_overlay>::vertex_descriptor> treedec::make_digraph_with_source_and_sink(const G_t&, const std::vector&, unsigned int, typename graph_traits::directed_overlay&, std::vector::vertex_descriptor>&, const std::set::vertex_descriptor>&, const std::set::vertex_descriptor>&) [with G_t = boost::adjacency_list]' at ../src/network_flow.hpp:177:32: /usr/include/boost/graph/detail/adjacency_list.hpp:2271:20: warning: 'p' may be used uninitialized [-Wmaybe-uninitialized] 2271 | return add_edge(u, v, p, g_); | ~~~~~~~~^~~~~~~~~~~~~ /usr/include/boost/graph/detail/adjacency_list.hpp: In function 'std::pair::directed_overlay>::vertex_descriptor, typename boost::graph_traits::directed_overlay>::vertex_descriptor> treedec::make_digraph_with_source_and_sink(const G_t&, const std::vector&, unsigned int, typename graph_traits::directed_overlay&, std::vector::vertex_descriptor>&, const std::set::vertex_descriptor>&, const std::set::vertex_descriptor>&) [with G_t = boost::adjacency_list]': /usr/include/boost/graph/detail/adjacency_list.hpp:2252:60: note: by argument 3 of type 'const boost::detail::adj_list_gen, boost::vecS, boost::vecS, boost::bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, boost::no_property, boost::listS>::config::edge_property_type&' {aka 'const treedec::Edge_NF&'} to 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, const typename Config::edge_property_type&, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config; Base = bidirectional_graph_helper_with_property, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config>]' declared here 2252 | inline std::pair< typename Config::edge_descriptor, bool > add_edge( | ^~~~~~~~ /usr/include/boost/graph/detail/adjacency_list.hpp:2270:41: note: 'p' declared here 2270 | typename Config::edge_property_type p; | ^ In function 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config; Base = bidirectional_graph_helper_with_property, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config>]', inlined from 'std::pair::directed_overlay>::vertex_descriptor, typename boost::graph_traits::directed_overlay>::vertex_descriptor> treedec::make_digraph_with_source_and_sink(const G_t&, const std::vector&, unsigned int, typename graph_traits::directed_overlay&, std::vector::vertex_descriptor>&, const std::set::vertex_descriptor>&, const std::set::vertex_descriptor>&) [with G_t = boost::adjacency_list]' at ../src/network_flow.hpp:188:28: /usr/include/boost/graph/detail/adjacency_list.hpp:2271:20: warning: 'p' may be used uninitialized [-Wmaybe-uninitialized] 2271 | return add_edge(u, v, p, g_); | ~~~~~~~~^~~~~~~~~~~~~ /usr/include/boost/graph/detail/adjacency_list.hpp: In function 'std::pair::directed_overlay>::vertex_descriptor, typename boost::graph_traits::directed_overlay>::vertex_descriptor> treedec::make_digraph_with_source_and_sink(const G_t&, const std::vector&, unsigned int, typename graph_traits::directed_overlay&, std::vector::vertex_descriptor>&, const std::set::vertex_descriptor>&, const std::set::vertex_descriptor>&) [with G_t = boost::adjacency_list]': /usr/include/boost/graph/detail/adjacency_list.hpp:2252:60: note: by argument 3 of type 'const boost::detail::adj_list_gen, boost::vecS, boost::vecS, boost::bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, boost::no_property, boost::listS>::config::edge_property_type&' {aka 'const treedec::Edge_NF&'} to 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, const typename Config::edge_property_type&, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config; Base = bidirectional_graph_helper_with_property, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config>]' declared here 2252 | inline std::pair< typename Config::edge_descriptor, bool > add_edge( | ^~~~~~~~ /usr/include/boost/graph/detail/adjacency_list.hpp:2270:41: note: 'p' declared here 2270 | typename Config::edge_property_type p; | ^ In function 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config; Base = bidirectional_graph_helper_with_property, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config>]', inlined from 'std::pair::directed_overlay>::vertex_descriptor, typename boost::graph_traits::directed_overlay>::vertex_descriptor> treedec::make_digraph_with_source_and_sink(const G_t&, const std::vector&, unsigned int, typename graph_traits::directed_overlay&, std::vector::vertex_descriptor>&, const std::set::vertex_descriptor>&, const std::set::vertex_descriptor>&) [with G_t = boost::adjacency_list]' at ../src/network_flow.hpp:199:28: /usr/include/boost/graph/detail/adjacency_list.hpp:2271:20: warning: 'p' may be used uninitialized [-Wmaybe-uninitialized] 2271 | return add_edge(u, v, p, g_); | ~~~~~~~~^~~~~~~~~~~~~ /usr/include/boost/graph/detail/adjacency_list.hpp: In function 'std::pair::directed_overlay>::vertex_descriptor, typename boost::graph_traits::directed_overlay>::vertex_descriptor> treedec::make_digraph_with_source_and_sink(const G_t&, const std::vector&, unsigned int, typename graph_traits::directed_overlay&, std::vector::vertex_descriptor>&, const std::set::vertex_descriptor>&, const std::set::vertex_descriptor>&) [with G_t = boost::adjacency_list]': /usr/include/boost/graph/detail/adjacency_list.hpp:2252:60: note: by argument 3 of type 'const boost::detail::adj_list_gen, boost::vecS, boost::vecS, boost::bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, boost::no_property, boost::listS>::config::edge_property_type&' {aka 'const treedec::Edge_NF&'} to 'std::pair boost::add_edge(typename Config::vertex_descriptor, typename Config::vertex_descriptor, const typename Config::edge_property_type&, vec_adj_list_impl&) [with Graph = adjacency_list; Config = detail::adj_list_gen, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config; Base = bidirectional_graph_helper_with_property, vecS, vecS, bidirectionalS, treedec::Vertex_NF, treedec::Edge_NF, no_property, listS>::config>]' declared here 2252 | inline std::pair< typename Config::edge_descriptor, bool > add_edge( | ^~~~~~~~ /usr/include/boost/graph/detail/adjacency_list.hpp:2270:41: note: 'p' declared here 2270 | typename Config::edge_property_type p; | ^ make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' /bin/sh ../libtool --tag=CXX --mode=link g++ -pthread -Wl,-O1 -Wl,-Bsymbolic-functions -fno-strict-aliasing -g -fwrapv -O2 -Wall -Wformat -Werror=format-security -O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -std=c++11 -module -avoid-version -Wl,-z,relro -Wl,--as-needed -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes -o cytdlib.la -rpath /usr/lib64/python3.13/site-packages/tdlib cytdlib.lo python_tdlib.lo -lboost_thread -lboost_system libtool: link: g++ -Wl,--as-needed -fPIC -DPIC -shared -nostdlib /usr/lib/gcc/riscv64-redhat-linux/14/crti.o /usr/lib/gcc/riscv64-redhat-linux/14/crtbeginS.o .libs/cytdlib.o .libs/python_tdlib.o -lboost_thread -lboost_system -L/usr/lib/gcc/riscv64-redhat-linux/14 -L/lib64/lp64d/../lib64/lp64d -L/usr/lib64/lp64d/../lib64/lp64d -L/lib/../lib64/lp64d -L/usr/lib/../lib64/lp64d -L/lib64/lp64d -L/usr/lib64/lp64d -lstdc++ -lm -lgcc_s -lc -lgcc_s /usr/lib/gcc/riscv64-redhat-linux/14/crtendS.o /usr/lib/gcc/riscv64-redhat-linux/14/crtn.o -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -Wl,-O1 -Wl,-Bsymbolic-functions -g -O2 -O2 -g -grecord-gcc-switches -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -mno-omit-leaf-frame-pointer -Wl,-z -Wl,relro -Wl,--as-needed -Wl,-z -Wl,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes -pthread -Wl,-soname -Wl,cytdlib.so -o .libs/cytdlib.so libtool: link: ( cd ".libs" && rm -f "cytdlib.la" && ln -s "../cytdlib.la" "cytdlib.la" ) make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' [ -f cytdlib.so ] || ln -s .libs/cytdlib.so . make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' rm cytdlib.cpp Making all in tests make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib/tests' ln -s ./ref . make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib/tests' ln: failed to create symbolic link './ref': File exists make[3]: [Makefile:898: all-local] Error 1 (ignored) make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib/tests' [ -L tdlib ] || ln -s ../ tdlib make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib/tests' Making all in src Making all in bits make[3]: Nothing to be done for 'all'. Making all in impl make[3]: Nothing to be done for 'all'. Making all in applications make[3]: Nothing to be done for 'all'. make[3]: Nothing to be done for 'all-am'. + RPM_EC=0 ++ jobs -p + exit 0 Executing(%install): /bin/sh -e /var/tmp/rpm-tmp.WeAnOY + umask 022 + cd /builddir/build/BUILD/python-tdlib-0.9.2-build + '[' /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT '!=' / ']' + rm -rf /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT ++ dirname /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT + mkdir -p /builddir/build/BUILD/python-tdlib-0.9.2-build + mkdir /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT + CFLAGS='-O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer ' + export CFLAGS + CXXFLAGS='-O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer ' + export CXXFLAGS + FFLAGS='-O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FFLAGS + FCFLAGS='-O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FCFLAGS + VALAFLAGS=-g + export VALAFLAGS + RUSTFLAGS='-Copt-level=3 -Cdebuginfo=2 -Ccodegen-units=1 -Cstrip=none -Cforce-frame-pointers=yes -Clink-arg=-specs=/usr/lib/rpm/redhat/redhat-package-notes --cap-lints=warn' + export RUSTFLAGS + LDFLAGS='-Wl,-z,relro -Wl,--as-needed -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes ' + export LDFLAGS + LT_SYS_LIBRARY_PATH=/usr/lib64: + export LT_SYS_LIBRARY_PATH + CC=gcc + export CC + CXX=g++ + export CXX + cd tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e + /usr/bin/make install DESTDIR=/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT 'INSTALL=/usr/bin/install -p' Making install in tests make[1]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tests' /usr/bin/make install-am make[2]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tests' ln -s ./ref . ln: failed to create symbolic link './ref': File exists make[2]: [Makefile:1572: all-local] Error 1 (ignored) make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tests' make[3]: Nothing to be done for 'install-exec-am'. make[3]: Nothing to be done for 'install-data-am'. make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tests' make[2]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tests' make[1]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tests' Making install in examples make[1]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' /usr/bin/make install-recursive make[2]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' Making install in gr make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples/gr' make[4]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples/gr' make[4]: Nothing to be done for 'install-exec-am'. make[4]: Nothing to be done for 'install-data-am'. make[4]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples/gr' make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples/gr' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' make[4]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' make[4]: Nothing to be done for 'install-exec-am'. /usr/bin/mkdir -p '/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/libexec/treedec' /bin/sh ../libtool --mode=install /usr/bin/install -p tdecomp '/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/libexec/treedec' libtool: install: /usr/bin/install -p tdecomp /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/libexec/treedec/tdecomp make[4]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' make[2]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' make[1]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/examples' Making install in tdlib make[1]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' Making install in . make[2]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' make[3]: Nothing to be done for 'install-exec-am'. /usr/bin/mkdir -p '/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/lib64/python3.13/site-packages/tdlib' /bin/sh ../libtool --mode=install /usr/bin/install -p cytdlib.la '/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/lib64/python3.13/site-packages/tdlib' libtool: install: /usr/bin/install -p .libs/cytdlib.so /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/lib64/python3.13/site-packages/tdlib/cytdlib.so libtool: install: /usr/bin/install -p .libs/cytdlib.lai /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/lib64/python3.13/site-packages/tdlib/cytdlib.la libtool: warning: remember to run 'libtool --finish /usr/lib64/python3.13/site-packages/tdlib' /usr/bin/mkdir -p '/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/lib64/python3.13/site-packages/tdlib' /usr/bin/install -p -m 644 __init__.py graphs.py Decomp.py Graph.py '/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/lib64/python3.13/site-packages/tdlib' Byte-compiling python modules... __init__.pygraphs.pyDecomp.pyGraph.py Byte-compiling python modules (optimized versions) ... __init__.pygraphs.pyDecomp.pyGraph.py make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' make[2]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' Making install in tests make[2]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib/tests' ln -s ./ref . ln: failed to create symbolic link './ref': File exists make[2]: [Makefile:898: all-local] Error 1 (ignored) make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib/tests' make[3]: Nothing to be done for 'install-exec-am'. make[3]: Nothing to be done for 'install-data-am'. make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib/tests' make[2]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib/tests' make[1]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/tdlib' Making install in src make[1]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src' Making install in bits make[2]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src/bits' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src/bits' make[3]: Nothing to be done for 'install-exec-am'. /usr/bin/mkdir -p '/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/include/treedec/bits' /usr/bin/install -p -m 644 bool.hpp predicates.hpp trie.hpp triealloc.hpp '/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/include/treedec/bits' make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src/bits' make[2]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src/bits' Making install in impl make[2]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src/impl' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src/impl' make[3]: Nothing to be done for 'install-exec-am'. /usr/bin/mkdir -p '/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/include/treedec/impl' /usr/bin/install -p -m 644 greedy_base.hpp greedy_heuristic.hpp obsolete_greedy_base.hpp '/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/include/treedec/impl' make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src/impl' make[2]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src/impl' Making install in applications make[2]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src/applications' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src/applications' make[3]: Nothing to be done for 'install-exec-am'. /usr/bin/mkdir -p '/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/include/treedec/applications' /usr/bin/install -p -m 644 applications.hpp clique.hpp independent_set.hpp vertex_cover.hpp dominating_set.hpp coloring.hpp '/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/include/treedec/applications' make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src/applications' make[2]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src/applications' make[2]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src' make[3]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src' make[3]: Nothing to be done for 'install-exec-am'. /usr/bin/mkdir -p '/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/include/treedec' /usr/bin/install -p -m 644 algo.hpp applications.hpp branch_decomposition.hpp bucket_sorter_bits.hpp bucket_sorter.hpp combinations.hpp config_traits.hpp container.hpp container_traits.hpp convenience.hpp copy.hpp degree_config.hpp degree.hpp directed_view.hpp dynamicCR.hpp elimination_orderings.hpp error.hpp exact_base.hpp exact_cutset.hpp exact_ta.hpp fill.hpp generic_base.hpp generic_elimination_search_configs.hpp generic_elimination_search.hpp generic_elimination_search_overlay.hpp graph.hpp graph_gala.hpp graph_impl.hpp graph_traits.hpp graph_util.hpp grparse.h induced_subgraph.hpp iter.hpp lower_bounds.hpp marker.hpp message.hpp marker_util.hpp minimum_degree_ordering.hpp misc.hpp network_flow.hpp '/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/include/treedec' /usr/bin/install -p -m 644 nice_decomposition.hpp numbering.hpp overlay.hpp platform.hpp postprocessing.hpp preprocessing_edge_insertion.hpp preprocessing.hpp printer.hpp random_generators.hpp random.hpp separator_algorithm.hpp simple_graph_algos.hpp skeleton.hpp thorup.hpp timer.hpp trace.hpp treedec.hpp treedec_copy.hpp treedec_misc.hpp treedec_traits.hpp tuple_td.hpp upper_bounds.hpp util.hpp validation.hpp '/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/include/treedec' make[3]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src' make[2]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src' make[1]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/src' make[1]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e' make[2]: Entering directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e' make[2]: Nothing to be done for 'install-exec-am'. make[2]: Nothing to be done for 'install-data-am'. make[2]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e' make[1]: Leaving directory '/builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e' + rm -f /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/lib64/python3.13/site-packages/tdlib/cytdlib.la + /usr/bin/find-debuginfo -j4 --strict-build-id -m -i --build-id-seed 0.9.2-14.20210929.e8ec911.fc41 --unique-debug-suffix -0.9.2-14.20210929.e8ec911.fc41.riscv64 --unique-debug-src-base python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64 --run-dwz --dwz-low-mem-die-limit 10000000 --dwz-max-die-limit 50000000 -S debugsourcefiles.list /builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e find-debuginfo: starting Extracting debug info from 2 files DWARF-compressing 2 files sepdebugcrcfix: Updated 2 CRC32s, 0 CRC32s did match. Creating .debug symlinks for symlinks to ELF files Copying sources found by 'debugedit -l' to /usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64 cpio: tdlib/cytdlib.cpp: Cannot stat: No such file or directory 2898 blocks find-debuginfo: done + /usr/lib/rpm/check-buildroot + /usr/lib/rpm/redhat/brp-ldconfig + /usr/lib/rpm/brp-compress + /usr/lib/rpm/redhat/brp-strip-lto /usr/bin/strip + /usr/lib/rpm/brp-strip-static-archive /usr/bin/strip + /usr/lib/rpm/check-rpaths + /usr/lib/rpm/redhat/brp-mangle-shebangs *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/tdlib/python_tdlib.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/tdlib/python_tdlib.cpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/error.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/simple_graph_algos.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/misc.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/postprocessing.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/dynamicCR.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/nice_decomposition.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/preprocessing.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/network_flow.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/convenience.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/graph.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/overlay.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/combinations.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/fill.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/exact_cutset.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/iter.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/separator_algorithm.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/elimination_orderings.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/degree_config.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/minimum_degree_ordering.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/applications/coloring.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/applications/independent_set.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/applications/dominating_set.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/applications/vertex_cover.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/applications/clique.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/applications/applications.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/src/lower_bounds.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/examples/twh.h is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/examples/treedec/error.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/examples/treedec/simple_graph_algos.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/examples/treedec/misc.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/examples/treedec/postprocessing.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/examples/treedec/preprocessing.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/examples/treedec/graph.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/examples/treedec/overlay.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/examples/treedec/combinations.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/examples/treedec/fill.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/examples/treedec/iter.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/examples/treedec/elimination_orderings.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/examples/treedec/degree_config.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/examples/treedec/minimum_degree_ordering.hpp is executable but has no shebang, removing executable bit *** WARNING: ./usr/src/debug/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64/examples/tdecomp.cc is executable but has no shebang, removing executable bit + /usr/lib/rpm/brp-remove-la-files + env /usr/lib/rpm/redhat/brp-python-bytecompile '' 1 0 -j4 Bytecompiling .py files below /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/lib64/python3.13 using python3.13 Bytecompiling .py files below /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/lib/debug/usr/lib64/python3.13 using python3.13 + /usr/lib/rpm/redhat/brp-python-hardlink + /usr/bin/add-determinism --brp -j4 /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/lib64/python3.13/site-packages/tdlib/__pycache__/Decomp.cpython-313.pyc: rewriting with normalized contents /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/lib64/python3.13/site-packages/tdlib/__pycache__/graphs.cpython-313.opt-1.pyc: rewriting with normalized contents /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/lib64/python3.13/site-packages/tdlib/__pycache__/Graph.cpython-313.opt-1.pyc: rewriting with normalized contents /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/lib64/python3.13/site-packages/tdlib/__pycache__/__init__.cpython-313.pyc: rewriting with normalized contents Scanned 36 directories and 214 files, processed 4 inodes, 4 modified (0 replaced + 4 rewritten), 0 unsupported format, 0 errors Reading /builddir/build/BUILD/python-tdlib-0.9.2-build/SPECPARTS/rpm-debuginfo.specpart Executing(%check): /bin/sh -e /var/tmp/rpm-tmp.P0DU0l + umask 022 + cd /builddir/build/BUILD/python-tdlib-0.9.2-build + CFLAGS='-O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer ' + export CFLAGS + CXXFLAGS='-O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer ' + export CXXFLAGS + FFLAGS='-O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FFLAGS + FCFLAGS='-O2 -fexceptions -g -grecord-gcc-switches -pipe -Wall -Wp,-U_FORTIFY_SOURCE,-D_FORTIFY_SOURCE=3 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -fstack-protector-strong -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -fasynchronous-unwind-tables -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -I/usr/lib64/gfortran/modules ' + export FCFLAGS + VALAFLAGS=-g + export VALAFLAGS + RUSTFLAGS='-Copt-level=3 -Cdebuginfo=2 -Ccodegen-units=1 -Cstrip=none -Cforce-frame-pointers=yes -Clink-arg=-specs=/usr/lib/rpm/redhat/redhat-package-notes --cap-lints=warn' + export RUSTFLAGS + LDFLAGS='-Wl,-z,relro -Wl,--as-needed -Wl,-z,now -specs=/usr/lib/rpm/redhat/redhat-hardened-ld -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -Wl,--build-id=sha1 -specs=/usr/lib/rpm/redhat/redhat-package-notes ' + export LDFLAGS + LT_SYS_LIBRARY_PATH=/usr/lib64: + export LT_SYS_LIBRARY_PATH + CC=gcc + export CC + CXX=g++ + export CXX + cd tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e + PATH=/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/bin:/usr/bin:/bin:/usr/sbin:/sbin:/usr/local/sbin + PYTHONPATH=/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/lib64/python3.13/site-packages:/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/lib/python3.13/site-packages + _PYTHONSITE=/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/lib64/python3.13/site-packages:/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/lib/python3.13/site-packages + PYTHONDONTWRITEBYTECODE=1 + /usr/bin/python3 -sP /usr/lib/rpm/redhat/import_all_modules.py tdlib Check import: tdlib + RPM_EC=0 ++ jobs -p + exit 0 Processing files: python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64 Executing(%doc): /bin/sh -e /var/tmp/rpm-tmp.ck057E + umask 022 + cd /builddir/build/BUILD/python-tdlib-0.9.2-build + cd tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e + DOCDIR=/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/share/doc/python-tdlib + export LC_ALL=C.UTF-8 + LC_ALL=C.UTF-8 + export DOCDIR + /usr/bin/mkdir -p /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/share/doc/python-tdlib + cp -pr /builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/AUTHORS /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/share/doc/python-tdlib + cp -pr /builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/BUGS /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/share/doc/python-tdlib + cp -pr /builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/NEWS /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/share/doc/python-tdlib + cp -pr /builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/README /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/share/doc/python-tdlib + cp -pr /builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/THANKS /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/share/doc/python-tdlib + cp -pr /builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/TODO /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/share/doc/python-tdlib + RPM_EC=0 ++ jobs -p + exit 0 Executing(%license): /bin/sh -e /var/tmp/rpm-tmp.RceujB + umask 022 + cd /builddir/build/BUILD/python-tdlib-0.9.2-build + cd tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e + LICENSEDIR=/builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/share/licenses/python-tdlib + export LC_ALL=C.UTF-8 + LC_ALL=C.UTF-8 + export LICENSEDIR + /usr/bin/mkdir -p /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/share/licenses/python-tdlib + cp -pr /builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/COPYING /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/share/licenses/python-tdlib + cp -pr /builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/GPL-2 /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/share/licenses/python-tdlib + cp -pr /builddir/build/BUILD/python-tdlib-0.9.2-build/tdlib-e8ec9114377574f22ff4447cf29e66411b491b7e/GPL-3 /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT/usr/share/licenses/python-tdlib + RPM_EC=0 ++ jobs -p + exit 0 Provides: python-tdlib = 0.9.2-14.20210929.e8ec911.fc41 python-tdlib(riscv-64) = 0.9.2-14.20210929.e8ec911.fc41 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Requires: ld-linux-riscv64-lp64d.so.1()(64bit) ld-linux-riscv64-lp64d.so.1(GLIBC_2.27)(64bit) libboost_graph.so.1.83.0()(64bit) libboost_thread.so.1.83.0()(64bit) libc.so.6()(64bit) libc.so.6(GLIBC_2.27)(64bit) libc.so.6(GLIBC_2.34)(64bit) libc.so.6(GLIBC_2.38)(64bit) libgcc_s.so.1()(64bit) libgcc_s.so.1(GCC_3.0)(64bit) libgcc_s.so.1(GCC_3.4)(64bit) libm.so.6()(64bit) libm.so.6(GLIBC_2.27)(64bit) libstdc++.so.6()(64bit) libstdc++.so.6(CXXABI_1.3)(64bit) libstdc++.so.6(GLIBCXX_3.4)(64bit) libstdc++.so.6(GLIBCXX_3.4.11)(64bit) libstdc++.so.6(GLIBCXX_3.4.15)(64bit) libstdc++.so.6(GLIBCXX_3.4.21)(64bit) libstdc++.so.6(GLIBCXX_3.4.26)(64bit) libstdc++.so.6(GLIBCXX_3.4.29)(64bit) libstdc++.so.6(GLIBCXX_3.4.30)(64bit) libstdc++.so.6(GLIBCXX_3.4.32)(64bit) libstdc++.so.6(GLIBCXX_3.4.9)(64bit) rtld(GNU_HASH) Processing files: python3-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64 Provides: python-tdlib = 0.9.2-14.20210929.e8ec911.fc41 python3-tdlib = 0.9.2-14.20210929.e8ec911.fc41 python3-tdlib(riscv-64) = 0.9.2-14.20210929.e8ec911.fc41 python3.13-tdlib = 0.9.2-14.20210929.e8ec911.fc41 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PartialHardlinkSets) <= 4.0.4-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Requires: ld-linux-riscv64-lp64d.so.1()(64bit) ld-linux-riscv64-lp64d.so.1(GLIBC_2.27)(64bit) libc.so.6()(64bit) libc.so.6(GLIBC_2.27)(64bit) libgcc_s.so.1()(64bit) libgcc_s.so.1(GCC_3.0)(64bit) libgcc_s.so.1(GCC_3.4)(64bit) libm.so.6()(64bit) libm.so.6(GLIBC_2.27)(64bit) libstdc++.so.6()(64bit) libstdc++.so.6(CXXABI_1.3)(64bit) libstdc++.so.6(GLIBCXX_3.4)(64bit) libstdc++.so.6(GLIBCXX_3.4.11)(64bit) libstdc++.so.6(GLIBCXX_3.4.15)(64bit) libstdc++.so.6(GLIBCXX_3.4.21)(64bit) libstdc++.so.6(GLIBCXX_3.4.29)(64bit) libstdc++.so.6(GLIBCXX_3.4.30)(64bit) libstdc++.so.6(GLIBCXX_3.4.32)(64bit) libstdc++.so.6(GLIBCXX_3.4.9)(64bit) python(abi) = 3.13 rtld(GNU_HASH) Processing files: python3-tdlib-devel-0.9.2-14.20210929.e8ec911.fc41.noarch Provides: python-tdlib-devel = 0.9.2-14.20210929.e8ec911.fc41 python3-tdlib-devel = 0.9.2-14.20210929.e8ec911.fc41 python3.13-tdlib-devel = 0.9.2-14.20210929.e8ec911.fc41 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Processing files: python-tdlib-debugsource-0.9.2-14.20210929.e8ec911.fc41.riscv64 Provides: python-tdlib-debugsource = 0.9.2-14.20210929.e8ec911.fc41 python-tdlib-debugsource(riscv-64) = 0.9.2-14.20210929.e8ec911.fc41 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Processing files: python-tdlib-debuginfo-0.9.2-14.20210929.e8ec911.fc41.riscv64 Provides: debuginfo(build-id) = 7cc0c77b8dd31784a3a3bd7cb4260a4146d13494 python-tdlib-debuginfo = 0.9.2-14.20210929.e8ec911.fc41 python-tdlib-debuginfo(riscv-64) = 0.9.2-14.20210929.e8ec911.fc41 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Recommends: python-tdlib-debugsource(riscv-64) = 0.9.2-14.20210929.e8ec911.fc41 Processing files: python3-tdlib-debuginfo-0.9.2-14.20210929.e8ec911.fc41.riscv64 Provides: debuginfo(build-id) = fe9eeac6c9a046ec825f432e15b76864b011d76e python-tdlib-debuginfo = 0.9.2-14.20210929.e8ec911.fc41 python3-tdlib-debuginfo = 0.9.2-14.20210929.e8ec911.fc41 python3-tdlib-debuginfo(riscv-64) = 0.9.2-14.20210929.e8ec911.fc41 python3.13-tdlib-debuginfo = 0.9.2-14.20210929.e8ec911.fc41 Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1 Recommends: python-tdlib-debugsource(riscv-64) = 0.9.2-14.20210929.e8ec911.fc41 Checking for unpackaged file(s): /usr/lib/rpm/check-files /builddir/build/BUILD/python-tdlib-0.9.2-build/BUILDROOT Wrote: /builddir/build/RPMS/python-tdlib-debugsource-0.9.2-14.20210929.e8ec911.fc41.riscv64.rpm Wrote: /builddir/build/RPMS/python3-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64.rpm Wrote: /builddir/build/RPMS/python-tdlib-0.9.2-14.20210929.e8ec911.fc41.riscv64.rpm Wrote: /builddir/build/RPMS/python3-tdlib-devel-0.9.2-14.20210929.e8ec911.fc41.noarch.rpm Wrote: /builddir/build/RPMS/python3-tdlib-debuginfo-0.9.2-14.20210929.e8ec911.fc41.riscv64.rpm Wrote: /builddir/build/RPMS/python-tdlib-debuginfo-0.9.2-14.20210929.e8ec911.fc41.riscv64.rpm Executing(rmbuild): /bin/sh -e /var/tmp/rpm-tmp.rqPWSE + umask 022 + cd /builddir/build/BUILD/python-tdlib-0.9.2-build + test -d /builddir/build/BUILD/python-tdlib-0.9.2-build + /usr/bin/chmod -Rf a+rX,u+w,g-w,o-w /builddir/build/BUILD/python-tdlib-0.9.2-build + rm -rf /builddir/build/BUILD/python-tdlib-0.9.2-build + RPM_EC=0 ++ jobs -p + exit 0 Child return code was: 0