java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 04:41:10,327 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 04:41:10,328 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 04:41:10,341 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 04:41:10,342 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 04:41:10,342 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 04:41:10,343 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 04:41:10,344 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 04:41:10,346 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 04:41:10,347 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 04:41:10,347 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 04:41:10,347 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 04:41:10,348 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 04:41:10,349 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 04:41:10,350 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 04:41:10,351 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 04:41:10,353 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 04:41:10,354 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 04:41:10,355 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 04:41:10,356 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 04:41:10,357 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 04:41:10,357 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 04:41:10,358 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 04:41:10,358 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 04:41:10,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 04:41:10,360 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 04:41:10,360 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 04:41:10,361 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 04:41:10,361 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 04:41:10,361 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 04:41:10,362 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 04:41:10,362 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-13 04:41:10,372 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 04:41:10,372 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 04:41:10,373 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 04:41:10,373 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 04:41:10,374 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 04:41:10,374 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 04:41:10,374 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 04:41:10,374 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 04:41:10,374 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 04:41:10,374 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 04:41:10,374 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 04:41:10,375 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 04:41:10,375 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 04:41:10,375 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 04:41:10,375 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 04:41:10,375 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 04:41:10,375 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 04:41:10,375 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 04:41:10,376 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 04:41:10,376 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 04:41:10,376 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 04:41:10,376 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 04:41:10,376 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 04:41:10,376 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 04:41:10,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 04:41:10,415 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 04:41:10,419 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 04:41:10,420 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 04:41:10,421 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 04:41:10,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,700 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG479b98f7c [2018-04-13 04:41:10,848 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 04:41:10,848 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 04:41:10,849 INFO L168 CDTParser]: Scanning openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,857 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 04:41:10,857 INFO L215 ultiparseSymbolTable]: [2018-04-13 04:41:10,857 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 04:41:10,858 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,858 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlen ('cstrlen') in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,858 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,858 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,858 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmp ('cstrncmp') in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,858 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstr ('cstrstr') in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,858 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 04:41:10,858 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,858 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:10,880 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG479b98f7c [2018-04-13 04:41:10,882 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 04:41:10,883 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 04:41:10,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 04:41:10,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 04:41:10,887 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 04:41:10,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:41:10" (1/1) ... [2018-04-13 04:41:10,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@192946f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:41:10, skipping insertion in model container [2018-04-13 04:41:10,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:41:10" (1/1) ... [2018-04-13 04:41:10,901 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 04:41:10,923 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 04:41:11,048 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 04:41:11,085 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 04:41:11,091 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 114 non ball SCCs. Number of states in SCCs 114. [2018-04-13 04:41:11,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:41:11 WrapperNode [2018-04-13 04:41:11,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 04:41:11,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 04:41:11,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 04:41:11,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 04:41:11,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:41:11" (1/1) ... [2018-04-13 04:41:11,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:41:11" (1/1) ... [2018-04-13 04:41:11,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:41:11" (1/1) ... [2018-04-13 04:41:11,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:41:11" (1/1) ... [2018-04-13 04:41:11,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:41:11" (1/1) ... [2018-04-13 04:41:11,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:41:11" (1/1) ... [2018-04-13 04:41:11,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:41:11" (1/1) ... [2018-04-13 04:41:11,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 04:41:11,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 04:41:11,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 04:41:11,171 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 04:41:11,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:41:11" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 04:41:11,257 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 04:41:11,258 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 04:41:11,258 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 04:41:11,258 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 04:41:11,258 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlen [2018-04-13 04:41:11,258 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmp [2018-04-13 04:41:11,258 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstr [2018-04-13 04:41:11,258 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 04:41:11,258 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 04:41:11,258 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 04:41:11,258 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 04:41:11,259 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 04:41:11,259 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 04:41:11,259 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 04:41:11,259 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 04:41:11,259 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 04:41:11,259 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 04:41:11,259 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 04:41:11,259 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 04:41:11,259 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 04:41:11,260 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 04:41:11,260 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 04:41:11,260 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 04:41:11,260 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 04:41:11,260 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 04:41:11,260 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 04:41:11,260 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 04:41:11,260 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 04:41:11,260 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 04:41:11,261 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 04:41:11,261 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 04:41:11,261 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 04:41:11,261 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 04:41:11,261 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 04:41:11,261 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 04:41:11,261 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 04:41:11,261 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 04:41:11,261 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 04:41:11,261 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 04:41:11,262 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 04:41:11,262 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 04:41:11,262 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 04:41:11,262 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 04:41:11,262 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 04:41:11,262 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 04:41:11,262 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 04:41:11,262 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 04:41:11,262 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 04:41:11,262 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 04:41:11,263 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 04:41:11,263 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 04:41:11,263 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 04:41:11,263 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 04:41:11,263 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 04:41:11,263 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 04:41:11,263 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 04:41:11,263 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 04:41:11,263 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 04:41:11,264 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 04:41:11,264 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 04:41:11,264 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 04:41:11,264 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 04:41:11,264 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 04:41:11,264 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 04:41:11,264 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 04:41:11,264 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 04:41:11,264 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 04:41:11,264 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 04:41:11,264 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 04:41:11,265 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 04:41:11,265 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 04:41:11,265 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 04:41:11,265 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 04:41:11,265 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 04:41:11,265 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 04:41:11,265 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 04:41:11,265 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 04:41:11,265 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 04:41:11,265 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 04:41:11,266 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 04:41:11,266 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 04:41:11,266 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 04:41:11,266 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 04:41:11,266 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 04:41:11,266 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 04:41:11,266 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 04:41:11,266 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 04:41:11,266 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 04:41:11,267 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 04:41:11,267 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 04:41:11,267 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 04:41:11,267 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 04:41:11,267 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 04:41:11,267 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 04:41:11,267 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 04:41:11,267 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 04:41:11,267 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 04:41:11,268 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 04:41:11,268 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 04:41:11,268 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 04:41:11,268 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 04:41:11,268 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 04:41:11,268 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 04:41:11,268 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 04:41:11,268 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 04:41:11,268 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 04:41:11,268 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 04:41:11,269 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 04:41:11,269 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 04:41:11,269 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 04:41:11,269 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 04:41:11,269 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlen [2018-04-13 04:41:11,269 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 04:41:11,269 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmp [2018-04-13 04:41:11,269 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstr [2018-04-13 04:41:11,269 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 04:41:11,269 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 04:41:11,269 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 04:41:11,270 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 04:41:11,270 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 04:41:11,270 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 04:41:11,270 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 04:41:11,614 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 04:41:11,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:41:11 BoogieIcfgContainer [2018-04-13 04:41:11,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 04:41:11,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 04:41:11,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 04:41:11,616 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 04:41:11,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 04:41:10" (1/3) ... [2018-04-13 04:41:11,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db07c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:41:11, skipping insertion in model container [2018-04-13 04:41:11,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:41:11" (2/3) ... [2018-04-13 04:41:11,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db07c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:41:11, skipping insertion in model container [2018-04-13 04:41:11,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:41:11" (3/3) ... [2018-04-13 04:41:11,618 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:41:11,626 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 04:41:11,632 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-04-13 04:41:11,656 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 04:41:11,657 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 04:41:11,657 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 04:41:11,657 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 04:41:11,657 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 04:41:11,657 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 04:41:11,657 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 04:41:11,657 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 04:41:11,657 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 04:41:11,658 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 04:41:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-04-13 04:41:11,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 04:41:11,670 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:11,671 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:11,671 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:11,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1281524752, now seen corresponding path program 1 times [2018-04-13 04:41:11,674 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:11,674 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:11,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:11,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:11,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:11,739 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:11,752 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:41:11,752 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:41:11,752 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:41:11,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:11,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:41:11,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:11,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:11,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:11,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:41:11,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:11,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:11,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 04:41:11,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:11,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:41:11,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-13 04:41:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:11,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:41:11,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:41:11,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:41:11,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:41:11,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:41:11,864 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 5 states. [2018-04-13 04:41:11,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:11,980 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-04-13 04:41:11,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 04:41:11,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-04-13 04:41:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:11,991 INFO L225 Difference]: With dead ends: 89 [2018-04-13 04:41:11,991 INFO L226 Difference]: Without dead ends: 86 [2018-04-13 04:41:11,993 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-13 04:41:12,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-13 04:41:12,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-13 04:41:12,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-13 04:41:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-04-13 04:41:12,022 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 13 [2018-04-13 04:41:12,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:12,022 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-04-13 04:41:12,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:41:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-04-13 04:41:12,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 04:41:12,023 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:12,023 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:12,023 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:12,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1281524751, now seen corresponding path program 1 times [2018-04-13 04:41:12,023 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:12,023 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:12,024 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:12,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:12,024 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:12,032 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:12,037 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:41:12,037 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:41:12,037 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:41:12,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:12,056 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:41:12,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:12,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:12,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:12,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:12,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:12,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:41:12,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:12,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:41:12,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:12,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:12,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:12,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:41:12,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:12,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:12,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 04:41:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:12,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:41:12,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:41:12,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:41:12,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:41:12,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:41:12,147 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 6 states. [2018-04-13 04:41:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:12,196 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-04-13 04:41:12,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:41:12,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-13 04:41:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:12,199 INFO L225 Difference]: With dead ends: 103 [2018-04-13 04:41:12,199 INFO L226 Difference]: Without dead ends: 103 [2018-04-13 04:41:12,200 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-13 04:41:12,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-13 04:41:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2018-04-13 04:41:12,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-13 04:41:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2018-04-13 04:41:12,210 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 13 [2018-04-13 04:41:12,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:12,210 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2018-04-13 04:41:12,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:41:12,211 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2018-04-13 04:41:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 04:41:12,211 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:12,211 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:12,211 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:12,211 INFO L82 PathProgramCache]: Analyzing trace with hash 493482611, now seen corresponding path program 1 times [2018-04-13 04:41:12,211 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:12,211 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:12,212 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:12,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:12,212 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:12,222 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:12,225 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:41:12,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:41:12,225 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:41:12,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:12,246 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:41:12,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:12,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:12,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:12,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:12,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:12,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:41:12,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:12,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:41:12,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:12,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:12,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:12,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:41:12,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:12,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:12,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 04:41:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:12,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:41:12,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:41:12,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:41:12,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:41:12,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:41:12,311 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 6 states. [2018-04-13 04:41:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:12,393 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2018-04-13 04:41:12,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:41:12,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-13 04:41:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:12,394 INFO L225 Difference]: With dead ends: 91 [2018-04-13 04:41:12,394 INFO L226 Difference]: Without dead ends: 91 [2018-04-13 04:41:12,394 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-13 04:41:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-13 04:41:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-04-13 04:41:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-13 04:41:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-04-13 04:41:12,397 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 13 [2018-04-13 04:41:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:12,397 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-04-13 04:41:12,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:41:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-04-13 04:41:12,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 04:41:12,397 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:12,398 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:12,398 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:12,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1072561654, now seen corresponding path program 1 times [2018-04-13 04:41:12,398 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:12,398 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:12,398 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:12,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:12,399 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:12,416 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:12,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:41:12,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 04:41:12,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 04:41:12,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 04:41:12,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 04:41:12,437 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 4 states. [2018-04-13 04:41:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:12,494 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-04-13 04:41:12,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 04:41:12,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-13 04:41:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:12,495 INFO L225 Difference]: With dead ends: 84 [2018-04-13 04:41:12,495 INFO L226 Difference]: Without dead ends: 84 [2018-04-13 04:41:12,495 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:41:12,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-13 04:41:12,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-04-13 04:41:12,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-13 04:41:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-04-13 04:41:12,499 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2018-04-13 04:41:12,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:12,499 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-04-13 04:41:12,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 04:41:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-04-13 04:41:12,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 04:41:12,500 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:12,500 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:12,500 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:12,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1072561653, now seen corresponding path program 1 times [2018-04-13 04:41:12,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:12,500 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:12,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:12,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:12,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:12,509 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:12,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:41:12,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:41:12,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:41:12,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:41:12,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:41:12,540 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 5 states. [2018-04-13 04:41:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:12,565 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-04-13 04:41:12,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:41:12,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-13 04:41:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:12,567 INFO L225 Difference]: With dead ends: 83 [2018-04-13 04:41:12,567 INFO L226 Difference]: Without dead ends: 83 [2018-04-13 04:41:12,567 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:41:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-13 04:41:12,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-13 04:41:12,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-13 04:41:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-04-13 04:41:12,572 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-04-13 04:41:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:12,572 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-04-13 04:41:12,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:41:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-04-13 04:41:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-13 04:41:12,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:12,573 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:12,573 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:12,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1872573656, now seen corresponding path program 1 times [2018-04-13 04:41:12,573 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:12,574 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:12,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:12,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:12,578 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:12,593 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:12,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:41:12,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:41:12,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:41:12,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:41:12,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:41:12,613 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2018-04-13 04:41:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:12,659 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-04-13 04:41:12,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 04:41:12,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-13 04:41:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:12,660 INFO L225 Difference]: With dead ends: 82 [2018-04-13 04:41:12,661 INFO L226 Difference]: Without dead ends: 82 [2018-04-13 04:41:12,661 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:41:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-13 04:41:12,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-04-13 04:41:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-13 04:41:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-04-13 04:41:12,665 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 17 [2018-04-13 04:41:12,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:12,665 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-04-13 04:41:12,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:41:12,665 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-04-13 04:41:12,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-13 04:41:12,666 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:12,666 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:12,666 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:12,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1872573657, now seen corresponding path program 1 times [2018-04-13 04:41:12,666 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:12,666 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:12,667 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:12,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:12,667 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:12,676 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:12,738 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:41:12,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:41:12,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:41:12,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:41:12,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:41:12,739 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-04-13 04:41:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:12,821 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-04-13 04:41:12,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 04:41:12,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-04-13 04:41:12,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:12,822 INFO L225 Difference]: With dead ends: 81 [2018-04-13 04:41:12,822 INFO L226 Difference]: Without dead ends: 81 [2018-04-13 04:41:12,822 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-13 04:41:12,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-13 04:41:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-04-13 04:41:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-13 04:41:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-04-13 04:41:12,824 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 17 [2018-04-13 04:41:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:12,825 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-04-13 04:41:12,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:41:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-04-13 04:41:12,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 04:41:12,825 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:12,825 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:12,825 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:12,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1417476355, now seen corresponding path program 1 times [2018-04-13 04:41:12,826 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:12,826 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:12,826 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:12,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:12,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:12,834 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:12,860 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:41:12,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 04:41:12,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 04:41:12,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 04:41:12,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-13 04:41:12,860 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 7 states. [2018-04-13 04:41:12,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:12,932 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-04-13 04:41:12,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 04:41:12,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-04-13 04:41:12,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:12,933 INFO L225 Difference]: With dead ends: 80 [2018-04-13 04:41:12,933 INFO L226 Difference]: Without dead ends: 80 [2018-04-13 04:41:12,933 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-13 04:41:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-13 04:41:12,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-04-13 04:41:12,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-13 04:41:12,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-04-13 04:41:12,935 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 23 [2018-04-13 04:41:12,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:12,935 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-04-13 04:41:12,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 04:41:12,935 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-04-13 04:41:12,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 04:41:12,936 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:12,936 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:12,936 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:12,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1417476356, now seen corresponding path program 1 times [2018-04-13 04:41:12,936 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:12,936 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:12,937 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:12,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:12,937 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:12,947 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:12,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:41:12,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-13 04:41:12,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 04:41:12,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 04:41:13,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-13 04:41:13,000 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 10 states. [2018-04-13 04:41:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:13,087 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-04-13 04:41:13,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 04:41:13,088 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-04-13 04:41:13,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:13,090 INFO L225 Difference]: With dead ends: 104 [2018-04-13 04:41:13,090 INFO L226 Difference]: Without dead ends: 104 [2018-04-13 04:41:13,090 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:41:13,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-13 04:41:13,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-04-13 04:41:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-04-13 04:41:13,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-04-13 04:41:13,093 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 23 [2018-04-13 04:41:13,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:13,093 INFO L459 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-04-13 04:41:13,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 04:41:13,093 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-04-13 04:41:13,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 04:41:13,094 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:13,094 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:13,094 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:13,094 INFO L82 PathProgramCache]: Analyzing trace with hash 396408002, now seen corresponding path program 1 times [2018-04-13 04:41:13,094 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:13,095 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:13,095 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:13,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:13,095 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:13,102 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:13,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:41:13,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-13 04:41:13,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 04:41:13,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 04:41:13,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-04-13 04:41:13,212 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 13 states. [2018-04-13 04:41:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:13,476 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-04-13 04:41:13,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 04:41:13,476 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-04-13 04:41:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:13,477 INFO L225 Difference]: With dead ends: 104 [2018-04-13 04:41:13,477 INFO L226 Difference]: Without dead ends: 104 [2018-04-13 04:41:13,477 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-04-13 04:41:13,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-13 04:41:13,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2018-04-13 04:41:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-13 04:41:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-04-13 04:41:13,480 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 23 [2018-04-13 04:41:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:13,481 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-04-13 04:41:13,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 04:41:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-04-13 04:41:13,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-13 04:41:13,482 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:13,482 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:13,482 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:13,482 INFO L82 PathProgramCache]: Analyzing trace with hash 989716549, now seen corresponding path program 1 times [2018-04-13 04:41:13,482 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:13,482 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:13,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:13,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:13,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:13,492 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:13,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:41:13,666 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:41:13,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:13,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:41:13,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:13,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:13,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:13,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:41:13,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:41:13,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:41:13,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:13,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:13,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:13,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-13 04:41:14,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-04-13 04:41:14,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:14,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 35 [2018-04-13 04:41:14,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:41:14,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:41:14,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:41:14,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:95 [2018-04-13 04:41:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:14,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:41:14,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-04-13 04:41:14,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 04:41:14,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 04:41:14,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2018-04-13 04:41:14,184 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 28 states. [2018-04-13 04:41:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:15,484 INFO L93 Difference]: Finished difference Result 171 states and 193 transitions. [2018-04-13 04:41:15,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 04:41:15,484 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-04-13 04:41:15,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:15,485 INFO L225 Difference]: With dead ends: 171 [2018-04-13 04:41:15,485 INFO L226 Difference]: Without dead ends: 171 [2018-04-13 04:41:15,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=288, Invalid=2364, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 04:41:15,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-04-13 04:41:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 104. [2018-04-13 04:41:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-13 04:41:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-04-13 04:41:15,489 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 27 [2018-04-13 04:41:15,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:15,489 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-04-13 04:41:15,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 04:41:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-04-13 04:41:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 04:41:15,489 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:15,489 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:15,489 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2041517279, now seen corresponding path program 1 times [2018-04-13 04:41:15,489 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:15,490 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:15,490 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:15,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:15,490 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:15,495 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:15,496 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:41:15,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:41:15,497 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:41:15,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:15,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:41:15,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:15,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-13 04:41:15,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:15,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 04:41:15,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:15,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:15,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 04:41:15,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-13 04:41:15,569 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc22.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc22.base| 1))) (and (= (select .cse0 |c_main_#t~malloc23.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc22.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc23.base| 1) |main_#t~malloc22.base| 0))))) is different from true [2018-04-13 04:41:15,574 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc22.base| Int) (|main_#t~malloc23.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc22.base| 1))) (and (= (select .cse0 |main_#t~malloc23.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc22.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc23.base| 1) |main_#t~malloc22.base| 0) |main_#t~malloc23.base| 0))))) is different from true [2018-04-13 04:41:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:15,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:41:15,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:41:15,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:41:15,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:41:15,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-13 04:41:15,580 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 8 states. [2018-04-13 04:41:15,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:15,713 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2018-04-13 04:41:15,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 04:41:15,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-13 04:41:15,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:15,714 INFO L225 Difference]: With dead ends: 103 [2018-04-13 04:41:15,714 INFO L226 Difference]: Without dead ends: 79 [2018-04-13 04:41:15,715 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-13 04:41:15,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-04-13 04:41:15,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-04-13 04:41:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-13 04:41:15,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2018-04-13 04:41:15,717 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 28 [2018-04-13 04:41:15,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:15,717 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2018-04-13 04:41:15,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:41:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-04-13 04:41:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 04:41:15,718 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:15,718 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:15,718 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:15,719 INFO L82 PathProgramCache]: Analyzing trace with hash -343838603, now seen corresponding path program 1 times [2018-04-13 04:41:15,719 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:15,719 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:15,719 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:15,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:15,720 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:15,726 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:15,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:41:15,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:41:15,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:41:15,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:41:15,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:41:15,758 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 6 states. [2018-04-13 04:41:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:15,812 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-04-13 04:41:15,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:41:15,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-13 04:41:15,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:15,813 INFO L225 Difference]: With dead ends: 78 [2018-04-13 04:41:15,813 INFO L226 Difference]: Without dead ends: 78 [2018-04-13 04:41:15,813 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:41:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-13 04:41:15,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-04-13 04:41:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-13 04:41:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-04-13 04:41:15,814 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 31 [2018-04-13 04:41:15,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:15,815 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-04-13 04:41:15,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:41:15,815 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-04-13 04:41:15,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 04:41:15,815 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:15,815 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:15,815 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:15,815 INFO L82 PathProgramCache]: Analyzing trace with hash -343838602, now seen corresponding path program 1 times [2018-04-13 04:41:15,815 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:15,815 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:15,816 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:15,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:15,816 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:15,820 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:15,881 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:41:15,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 04:41:15,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 04:41:15,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 04:41:15,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-13 04:41:15,882 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 9 states. [2018-04-13 04:41:15,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:15,960 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-04-13 04:41:15,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 04:41:15,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-04-13 04:41:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:15,961 INFO L225 Difference]: With dead ends: 83 [2018-04-13 04:41:15,961 INFO L226 Difference]: Without dead ends: 83 [2018-04-13 04:41:15,961 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-04-13 04:41:15,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-13 04:41:15,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-04-13 04:41:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-13 04:41:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-04-13 04:41:15,963 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 31 [2018-04-13 04:41:15,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:15,963 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-04-13 04:41:15,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 04:41:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-04-13 04:41:15,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 04:41:15,964 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:15,964 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:15,964 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:15,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1593144629, now seen corresponding path program 2 times [2018-04-13 04:41:15,965 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:15,965 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:15,965 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:15,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:15,965 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:15,973 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:41:16,064 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:41:16,064 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:41:16,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:41:16,089 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:41:16,089 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:41:16,092 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:41:16,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:16,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:16,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:16,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:41:16,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:41:16,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 04:41:16,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:16,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:16,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:16,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-13 04:41:16,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 04:41:16,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:41:16,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:41:16,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:41:16,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:41:16,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-13 04:41:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-04-13 04:41:16,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:41:16,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2018-04-13 04:41:16,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 04:41:16,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 04:41:16,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-04-13 04:41:16,154 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 15 states. [2018-04-13 04:41:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:16,384 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-04-13 04:41:16,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 04:41:16,384 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-04-13 04:41:16,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:16,385 INFO L225 Difference]: With dead ends: 83 [2018-04-13 04:41:16,385 INFO L226 Difference]: Without dead ends: 83 [2018-04-13 04:41:16,385 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2018-04-13 04:41:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-13 04:41:16,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2018-04-13 04:41:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-13 04:41:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-04-13 04:41:16,386 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 35 [2018-04-13 04:41:16,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:16,386 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-04-13 04:41:16,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 04:41:16,387 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-04-13 04:41:16,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 04:41:16,387 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:16,387 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:16,387 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:16,388 INFO L82 PathProgramCache]: Analyzing trace with hash 132134015, now seen corresponding path program 1 times [2018-04-13 04:41:16,388 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:16,388 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:16,388 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:16,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:41:16,389 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:16,397 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:16,399 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:41:16,399 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:41:16,399 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:41:16,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:16,421 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:41:16,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:16,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:16,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:16,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 04:41:16,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:16,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:16,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:41:16,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:16,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:16,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-13 04:41:16,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 04:41:16,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 04:41:16,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:16,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:16,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:41:16,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-13 04:41:16,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-13 04:41:16,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 04:41:16,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:16,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:16,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 04:41:16,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:36 [2018-04-13 04:41:17,067 WARN L151 SmtUtils]: Spent 462ms on a formula simplification. DAG size of input: 53 DAG size of output 42 [2018-04-13 04:41:17,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 50 [2018-04-13 04:41:17,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-04-13 04:41:17,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,182 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 04:41:17,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-04-13 04:41:17,182 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-13 04:41:17,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-04-13 04:41:17,225 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,246 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 04:41:17,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-04-13 04:41:17,248 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,262 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 04:41:17,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2018-04-13 04:41:17,264 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,278 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 10 variables, input treesize:70, output treesize:3 [2018-04-13 04:41:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:17,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:41:17,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-13 04:41:17,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:41:17,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:41:17,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:41:17,301 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 16 states. [2018-04-13 04:41:17,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:17,619 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-04-13 04:41:17,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 04:41:17,619 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-04-13 04:41:17,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:17,620 INFO L225 Difference]: With dead ends: 97 [2018-04-13 04:41:17,620 INFO L226 Difference]: Without dead ends: 70 [2018-04-13 04:41:17,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2018-04-13 04:41:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-13 04:41:17,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-04-13 04:41:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-13 04:41:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-04-13 04:41:17,622 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 36 [2018-04-13 04:41:17,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:17,622 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-04-13 04:41:17,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:41:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-04-13 04:41:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 04:41:17,623 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:17,623 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:17,623 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:17,623 INFO L82 PathProgramCache]: Analyzing trace with hash 154766269, now seen corresponding path program 1 times [2018-04-13 04:41:17,623 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:17,623 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:17,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:17,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:17,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:17,631 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:17,635 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:41:17,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:41:17,635 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:41:17,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:17,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:41:17,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:17,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:17,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:41:17,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:17,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:41:17,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:17,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:17,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:41:17,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 04:41:17,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:41:17,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:41:17,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-13 04:41:17,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 04:41:17,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:41:17,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:17,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:41:17,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-04-13 04:41:24,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-04-13 04:41:24,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 04:41:24,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:24,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-04-13 04:41:24,456 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:41:24,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:41:24,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:41:24,475 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:56, output treesize:54 [2018-04-13 04:41:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:24,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:41:24,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 04:41:24,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 04:41:24,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 04:41:24,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=232, Unknown=4, NotChecked=0, Total=272 [2018-04-13 04:41:24,561 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 17 states. [2018-04-13 04:41:26,570 WARN L148 SmtUtils]: Spent 1694ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-13 04:41:28,518 WARN L151 SmtUtils]: Spent 1919ms on a formula simplification. DAG size of input: 68 DAG size of output 66 [2018-04-13 04:41:30,768 WARN L151 SmtUtils]: Spent 2224ms on a formula simplification. DAG size of input: 72 DAG size of output 70 [2018-04-13 04:41:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:31,025 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-04-13 04:41:31,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 04:41:31,026 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-04-13 04:41:31,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:31,026 INFO L225 Difference]: With dead ends: 81 [2018-04-13 04:41:31,026 INFO L226 Difference]: Without dead ends: 81 [2018-04-13 04:41:31,026 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=116, Invalid=636, Unknown=4, NotChecked=0, Total=756 [2018-04-13 04:41:31,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-13 04:41:31,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-04-13 04:41:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-13 04:41:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-04-13 04:41:31,028 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 36 [2018-04-13 04:41:31,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:31,028 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-04-13 04:41:31,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 04:41:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-04-13 04:41:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 04:41:31,029 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:31,029 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:31,029 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:31,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2139102706, now seen corresponding path program 1 times [2018-04-13 04:41:31,030 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:31,030 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:31,030 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:31,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:31,030 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:31,043 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:31,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:41:31,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 04:41:31,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:41:31,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:41:31,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:41:31,081 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 8 states. [2018-04-13 04:41:31,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:31,143 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2018-04-13 04:41:31,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 04:41:31,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-04-13 04:41:31,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:31,144 INFO L225 Difference]: With dead ends: 113 [2018-04-13 04:41:31,145 INFO L226 Difference]: Without dead ends: 113 [2018-04-13 04:41:31,145 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-13 04:41:31,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-04-13 04:41:31,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-04-13 04:41:31,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-13 04:41:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2018-04-13 04:41:31,148 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 39 [2018-04-13 04:41:31,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:31,148 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2018-04-13 04:41:31,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:41:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2018-04-13 04:41:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-13 04:41:31,149 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:31,149 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:31,149 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:31,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1227427224, now seen corresponding path program 2 times [2018-04-13 04:41:31,149 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:31,149 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:31,150 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:31,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:31,150 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:31,159 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:31,164 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:41:31,164 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:41:31,164 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:41:31,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:41:31,190 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:41:31,191 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:41:31,194 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:41:31,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:31,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:31,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:31,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:31,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:31,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:41:31,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:31,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:31,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:41:31,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:31,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:41:31,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:31,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:31,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 04:41:31,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:41:31,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:41:31,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:31,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:31,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:31,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-13 04:41:31,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 04:41:31,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:41:31,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:31,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:31,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:41:31,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-13 04:41:33,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 56 [2018-04-13 04:41:33,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-04-13 04:41:33,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:34,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2018-04-13 04:41:34,010 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:41:34,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-04-13 04:41:34,037 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:34,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-04-13 04:41:34,065 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:34,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-04-13 04:41:34,066 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:34,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 30 [2018-04-13 04:41:34,098 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-13 04:41:34,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-04-13 04:41:34,128 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:34,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2018-04-13 04:41:34,146 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-13 04:41:34,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 04:41:34,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:41:34,166 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:62, output treesize:38 [2018-04-13 04:41:34,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:34,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:41:34,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 04:41:34,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:41:34,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:41:34,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=297, Unknown=1, NotChecked=0, Total=342 [2018-04-13 04:41:34,268 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 19 states. [2018-04-13 04:41:35,293 WARN L151 SmtUtils]: Spent 783ms on a formula simplification. DAG size of input: 52 DAG size of output 35 [2018-04-13 04:41:37,562 WARN L151 SmtUtils]: Spent 2249ms on a formula simplification. DAG size of input: 54 DAG size of output 36 [2018-04-13 04:41:38,988 WARN L148 SmtUtils]: Spent 1297ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-13 04:41:42,971 WARN L151 SmtUtils]: Spent 3865ms on a formula simplification. DAG size of input: 71 DAG size of output 68 [2018-04-13 04:41:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:43,174 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-04-13 04:41:43,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 04:41:43,175 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2018-04-13 04:41:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:43,175 INFO L225 Difference]: With dead ends: 133 [2018-04-13 04:41:43,175 INFO L226 Difference]: Without dead ends: 133 [2018-04-13 04:41:43,176 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=142, Invalid=913, Unknown=1, NotChecked=0, Total=1056 [2018-04-13 04:41:43,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-13 04:41:43,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-04-13 04:41:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-13 04:41:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 146 transitions. [2018-04-13 04:41:43,178 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 146 transitions. Word has length 41 [2018-04-13 04:41:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:43,178 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 146 transitions. [2018-04-13 04:41:43,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:41:43,178 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 146 transitions. [2018-04-13 04:41:43,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 04:41:43,179 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:43,179 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:43,179 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:43,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1135874677, now seen corresponding path program 1 times [2018-04-13 04:41:43,179 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:43,179 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:43,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:43,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:41:43,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:43,186 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:43,189 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:41:43,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:41:43,190 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:41:43,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:43,207 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:41:43,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:43,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:43,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:43,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:43,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:43,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:41:43,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:43,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:41:43,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:43,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:43,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:43,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:41:43,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:43,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:43,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 04:41:43,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:41:43,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:41:43,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:43,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:43,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:43,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:32 [2018-04-13 04:41:43,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 04:41:43,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:41:43,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:43,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:43,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:41:43,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-04-13 04:41:47,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 58 [2018-04-13 04:41:47,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 50 [2018-04-13 04:41:47,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:41:47,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 45 [2018-04-13 04:41:47,671 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:41:47,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-04-13 04:41:47,701 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:47,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2018-04-13 04:41:47,732 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:47,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-04-13 04:41:47,762 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-13 04:41:47,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2018-04-13 04:41:47,788 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:47,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 35 [2018-04-13 04:41:47,819 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-13 04:41:47,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2018-04-13 04:41:47,840 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:47,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-13 04:41:47,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-13 04:41:47,874 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:78, output treesize:129 [2018-04-13 04:41:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:47,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:41:47,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 04:41:47,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 04:41:47,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 04:41:47,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=330, Unknown=2, NotChecked=0, Total=380 [2018-04-13 04:41:47,992 INFO L87 Difference]: Start difference. First operand 129 states and 146 transitions. Second operand 20 states. [2018-04-13 04:41:52,288 WARN L148 SmtUtils]: Spent 2013ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-13 04:41:53,018 WARN L151 SmtUtils]: Spent 706ms on a formula simplification. DAG size of input: 78 DAG size of output 56 [2018-04-13 04:41:56,127 WARN L151 SmtUtils]: Spent 3084ms on a formula simplification. DAG size of input: 82 DAG size of output 60 [2018-04-13 04:41:56,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:56,847 INFO L93 Difference]: Finished difference Result 178 states and 198 transitions. [2018-04-13 04:41:56,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 04:41:56,847 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-04-13 04:41:56,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:56,848 INFO L225 Difference]: With dead ends: 178 [2018-04-13 04:41:56,848 INFO L226 Difference]: Without dead ends: 178 [2018-04-13 04:41:56,849 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=138, Invalid=852, Unknown=2, NotChecked=0, Total=992 [2018-04-13 04:41:56,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-13 04:41:56,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2018-04-13 04:41:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-13 04:41:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 191 transitions. [2018-04-13 04:41:56,853 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 191 transitions. Word has length 43 [2018-04-13 04:41:56,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:56,853 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 191 transitions. [2018-04-13 04:41:56,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 04:41:56,853 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 191 transitions. [2018-04-13 04:41:56,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 04:41:56,853 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:56,854 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:56,854 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:56,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1135874676, now seen corresponding path program 1 times [2018-04-13 04:41:56,854 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:56,854 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:56,855 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:56,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:56,855 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:56,860 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 04:41:56,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:41:56,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 04:41:56,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 04:41:56,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 04:41:56,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-13 04:41:56,888 INFO L87 Difference]: Start difference. First operand 157 states and 191 transitions. Second operand 7 states. [2018-04-13 04:41:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:56,949 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2018-04-13 04:41:56,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 04:41:56,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-04-13 04:41:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:56,950 INFO L225 Difference]: With dead ends: 155 [2018-04-13 04:41:56,950 INFO L226 Difference]: Without dead ends: 155 [2018-04-13 04:41:56,950 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-13 04:41:56,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-13 04:41:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-04-13 04:41:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-13 04:41:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 185 transitions. [2018-04-13 04:41:56,954 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 185 transitions. Word has length 43 [2018-04-13 04:41:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:56,955 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 185 transitions. [2018-04-13 04:41:56,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 04:41:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 185 transitions. [2018-04-13 04:41:56,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-13 04:41:56,955 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:56,955 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:56,955 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:56,956 INFO L82 PathProgramCache]: Analyzing trace with hash 653871061, now seen corresponding path program 1 times [2018-04-13 04:41:56,956 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:56,956 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:56,956 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:56,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:56,956 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:56,963 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:57,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-13 04:41:57,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:41:57,001 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:41:57,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:57,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:41:57,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:57,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:57,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:57,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:41:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 04:41:57,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:41:57,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 11 [2018-04-13 04:41:57,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 04:41:57,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 04:41:57,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:41:57,089 INFO L87 Difference]: Start difference. First operand 155 states and 185 transitions. Second operand 12 states. [2018-04-13 04:41:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:57,240 INFO L93 Difference]: Finished difference Result 154 states and 182 transitions. [2018-04-13 04:41:57,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 04:41:57,242 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-04-13 04:41:57,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:57,243 INFO L225 Difference]: With dead ends: 154 [2018-04-13 04:41:57,243 INFO L226 Difference]: Without dead ends: 154 [2018-04-13 04:41:57,243 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:41:57,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-13 04:41:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-04-13 04:41:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-13 04:41:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2018-04-13 04:41:57,247 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 45 [2018-04-13 04:41:57,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:57,247 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2018-04-13 04:41:57,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 04:41:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2018-04-13 04:41:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-13 04:41:57,247 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:57,247 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:57,248 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:57,248 INFO L82 PathProgramCache]: Analyzing trace with hash 653871062, now seen corresponding path program 1 times [2018-04-13 04:41:57,248 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:57,248 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:57,248 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:57,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:57,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:57,255 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:41:57,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:41:57,407 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:41:57,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:57,429 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:41:57,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:57,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:57,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:57,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 04:41:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-13 04:41:57,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:41:57,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 15 [2018-04-13 04:41:57,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:41:57,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:41:57,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:41:57,476 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand 16 states. [2018-04-13 04:41:57,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:41:57,679 INFO L93 Difference]: Finished difference Result 164 states and 193 transitions. [2018-04-13 04:41:57,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 04:41:57,680 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-04-13 04:41:57,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:41:57,680 INFO L225 Difference]: With dead ends: 164 [2018-04-13 04:41:57,680 INFO L226 Difference]: Without dead ends: 164 [2018-04-13 04:41:57,681 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-04-13 04:41:57,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-13 04:41:57,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2018-04-13 04:41:57,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-13 04:41:57,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-04-13 04:41:57,684 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 45 [2018-04-13 04:41:57,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:41:57,684 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-04-13 04:41:57,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:41:57,684 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-04-13 04:41:57,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-13 04:41:57,685 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:41:57,685 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:41:57,685 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:41:57,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1031240861, now seen corresponding path program 3 times [2018-04-13 04:41:57,685 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:41:57,685 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:41:57,685 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:57,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:41:57,686 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:41:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:41:57,694 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:41:57,699 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:41:57,699 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:41:57,699 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:41:57,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:41:57,728 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:41:57,729 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:41:57,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:41:57,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:57,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:57,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:41:57,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:57,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:57,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:41:57,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:57,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:41:57,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:57,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:57,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:41:57,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:41:57,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:57,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:57,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 04:41:57,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:41:57,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 04:41:57,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:57,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:57,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:57,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-13 04:41:57,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-13 04:41:57,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:41:57,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:41:57,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:41:57,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:41:57,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-13 04:42:02,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 56 [2018-04-13 04:42:02,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-04-13 04:42:02,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:02,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2018-04-13 04:42:02,942 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:02,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-04-13 04:42:02,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:03,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 23 [2018-04-13 04:42:03,004 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:03,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2018-04-13 04:42:03,065 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:03,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2018-04-13 04:42:03,103 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:03,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-04-13 04:42:03,104 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:03,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 30 [2018-04-13 04:42:03,141 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:03,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2018-04-13 04:42:03,159 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:03,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 04:42:03,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:42:03,178 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:56, output treesize:32 [2018-04-13 04:42:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-13 04:42:03,248 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:42:03,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 04:42:03,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 04:42:03,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 04:42:03,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=232, Unknown=3, NotChecked=0, Total=272 [2018-04-13 04:42:03,248 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 17 states. [2018-04-13 04:42:04,328 WARN L148 SmtUtils]: Spent 951ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-13 04:42:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:05,604 INFO L93 Difference]: Finished difference Result 157 states and 184 transitions. [2018-04-13 04:42:05,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 04:42:05,604 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-04-13 04:42:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:05,605 INFO L225 Difference]: With dead ends: 157 [2018-04-13 04:42:05,605 INFO L226 Difference]: Without dead ends: 115 [2018-04-13 04:42:05,605 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=175, Invalid=752, Unknown=3, NotChecked=0, Total=930 [2018-04-13 04:42:05,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-13 04:42:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2018-04-13 04:42:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-13 04:42:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2018-04-13 04:42:05,608 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 46 [2018-04-13 04:42:05,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:05,608 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2018-04-13 04:42:05,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 04:42:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2018-04-13 04:42:05,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-13 04:42:05,609 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:05,609 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:05,609 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:05,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1304865494, now seen corresponding path program 1 times [2018-04-13 04:42:05,609 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:05,609 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:05,610 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:05,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:42:05,610 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:05,618 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 04:42:05,657 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:42:05,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:42:05,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:42:05,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:42:05,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:42:05,658 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 8 states. [2018-04-13 04:42:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:05,733 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2018-04-13 04:42:05,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 04:42:05,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-04-13 04:42:05,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:05,733 INFO L225 Difference]: With dead ends: 100 [2018-04-13 04:42:05,733 INFO L226 Difference]: Without dead ends: 100 [2018-04-13 04:42:05,734 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-04-13 04:42:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-13 04:42:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-04-13 04:42:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-13 04:42:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2018-04-13 04:42:05,736 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 47 [2018-04-13 04:42:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:05,737 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2018-04-13 04:42:05,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:42:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2018-04-13 04:42:05,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-13 04:42:05,737 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:05,737 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:05,737 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:05,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1304865495, now seen corresponding path program 1 times [2018-04-13 04:42:05,738 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:05,738 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:05,738 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:05,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:05,739 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:05,746 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 04:42:05,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:42:05,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-13 04:42:05,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 04:42:05,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 04:42:05,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:42:05,840 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 12 states. [2018-04-13 04:42:05,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:05,967 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-04-13 04:42:05,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 04:42:05,968 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-04-13 04:42:05,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:05,968 INFO L225 Difference]: With dead ends: 102 [2018-04-13 04:42:05,968 INFO L226 Difference]: Without dead ends: 102 [2018-04-13 04:42:05,968 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:42:05,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-13 04:42:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2018-04-13 04:42:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-13 04:42:05,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-04-13 04:42:05,970 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 47 [2018-04-13 04:42:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:05,970 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-04-13 04:42:05,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 04:42:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-04-13 04:42:05,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 04:42:05,971 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:05,971 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:05,971 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:05,971 INFO L82 PathProgramCache]: Analyzing trace with hash -504893548, now seen corresponding path program 1 times [2018-04-13 04:42:05,971 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:05,971 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:05,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:05,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:05,972 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:05,976 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:05,979 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:42:05,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:05,979 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:05,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:05,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:06,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:06,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:06,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:06,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:06,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:06,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:42:06,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:06,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:42:06,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:06,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:06,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:06,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:42:06,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:06,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:06,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 04:42:06,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:42:06,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:42:06,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:06,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:06,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:06,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-13 04:42:06,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 04:42:06,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:42:06,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:06,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:06,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:42:06,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-13 04:42:15,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-04-13 04:42:15,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-13 04:42:15,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:15,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:15,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:15,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-04-13 04:42:15,411 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:15,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:42:15,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:42:15,429 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:59, output treesize:46 [2018-04-13 04:42:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:15,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:42:15,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 04:42:15,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 04:42:15,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 04:42:15,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=497, Unknown=5, NotChecked=0, Total=552 [2018-04-13 04:42:15,573 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 24 states. [2018-04-13 04:42:26,185 WARN L148 SmtUtils]: Spent 2017ms on a formula simplification that was a NOOP. DAG size: 72 [2018-04-13 04:42:32,569 WARN L151 SmtUtils]: Spent 2087ms on a formula simplification. DAG size of input: 87 DAG size of output 65 [2018-04-13 04:42:33,243 WARN L151 SmtUtils]: Spent 636ms on a formula simplification. DAG size of input: 91 DAG size of output 68 [2018-04-13 04:42:35,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:35,724 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2018-04-13 04:42:35,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 04:42:35,725 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2018-04-13 04:42:35,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:35,726 INFO L225 Difference]: With dead ends: 144 [2018-04-13 04:42:35,726 INFO L226 Difference]: Without dead ends: 144 [2018-04-13 04:42:35,726 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=163, Invalid=1470, Unknown=7, NotChecked=0, Total=1640 [2018-04-13 04:42:35,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-13 04:42:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2018-04-13 04:42:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-13 04:42:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2018-04-13 04:42:35,730 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 48 [2018-04-13 04:42:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:35,730 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2018-04-13 04:42:35,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 04:42:35,730 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2018-04-13 04:42:35,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 04:42:35,731 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:35,731 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:35,731 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:35,731 INFO L82 PathProgramCache]: Analyzing trace with hash -154986537, now seen corresponding path program 1 times [2018-04-13 04:42:35,731 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:35,731 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:35,732 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:35,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:35,732 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:35,738 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-13 04:42:35,775 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:35,775 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:35,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:35,793 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:35,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:35,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:35,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:35,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:42:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 04:42:35,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:42:35,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 11 [2018-04-13 04:42:35,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 04:42:35,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 04:42:35,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:42:35,844 INFO L87 Difference]: Start difference. First operand 127 states and 152 transitions. Second operand 12 states. [2018-04-13 04:42:35,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:35,980 INFO L93 Difference]: Finished difference Result 126 states and 149 transitions. [2018-04-13 04:42:35,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 04:42:35,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-04-13 04:42:35,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:35,982 INFO L225 Difference]: With dead ends: 126 [2018-04-13 04:42:35,982 INFO L226 Difference]: Without dead ends: 126 [2018-04-13 04:42:35,983 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:42:35,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-13 04:42:35,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-13 04:42:35,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-13 04:42:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2018-04-13 04:42:35,986 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 49 [2018-04-13 04:42:35,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:35,986 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2018-04-13 04:42:35,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 04:42:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2018-04-13 04:42:35,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 04:42:35,987 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:35,987 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:35,987 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:35,987 INFO L82 PathProgramCache]: Analyzing trace with hash -154986536, now seen corresponding path program 1 times [2018-04-13 04:42:35,987 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:35,987 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:35,988 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:35,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:35,988 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:35,994 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:36,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:36,143 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:36,143 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:36,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:36,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:36,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:36,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:36,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:36,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 04:42:36,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-13 04:42:36,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:42:36,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 16 [2018-04-13 04:42:36,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 04:42:36,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 04:42:36,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:42:36,198 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand 17 states. [2018-04-13 04:42:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:36,568 INFO L93 Difference]: Finished difference Result 179 states and 212 transitions. [2018-04-13 04:42:36,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 04:42:36,569 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-04-13 04:42:36,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:36,570 INFO L225 Difference]: With dead ends: 179 [2018-04-13 04:42:36,570 INFO L226 Difference]: Without dead ends: 179 [2018-04-13 04:42:36,570 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2018-04-13 04:42:36,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-13 04:42:36,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 138. [2018-04-13 04:42:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-13 04:42:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2018-04-13 04:42:36,574 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 49 [2018-04-13 04:42:36,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:36,574 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2018-04-13 04:42:36,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 04:42:36,574 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2018-04-13 04:42:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-13 04:42:36,575 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:36,575 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:36,575 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:36,575 INFO L82 PathProgramCache]: Analyzing trace with hash -446349253, now seen corresponding path program 1 times [2018-04-13 04:42:36,575 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:36,575 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:36,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:36,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:36,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:36,583 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:36,653 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:36,653 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:36,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:36,664 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:36,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:42:36,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-04-13 04:42:36,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 04:42:36,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 04:42:36,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-04-13 04:42:36,688 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand 10 states. [2018-04-13 04:42:36,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:36,767 INFO L93 Difference]: Finished difference Result 236 states and 272 transitions. [2018-04-13 04:42:36,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 04:42:36,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-04-13 04:42:36,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:36,768 INFO L225 Difference]: With dead ends: 236 [2018-04-13 04:42:36,768 INFO L226 Difference]: Without dead ends: 236 [2018-04-13 04:42:36,768 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-04-13 04:42:36,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-13 04:42:36,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 225. [2018-04-13 04:42:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-13 04:42:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 262 transitions. [2018-04-13 04:42:36,773 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 262 transitions. Word has length 52 [2018-04-13 04:42:36,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:36,774 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 262 transitions. [2018-04-13 04:42:36,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 04:42:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 262 transitions. [2018-04-13 04:42:36,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-13 04:42:36,774 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:36,775 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:36,775 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:36,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2138861013, now seen corresponding path program 2 times [2018-04-13 04:42:36,775 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:36,775 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:36,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:36,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:36,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:36,783 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:36,788 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:42:36,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:36,788 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:36,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:42:36,815 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:42:36,816 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:42:36,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:36,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:36,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:36,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:36,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:36,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:36,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:42:36,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:36,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:42:36,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:36,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:36,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:36,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:42:36,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:36,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:36,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 04:42:36,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:42:36,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 04:42:36,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:36,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:36,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:36,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-13 04:42:36,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-13 04:42:36,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:42:36,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:36,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:36,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 04:42:36,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-13 04:42:37,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 52 [2018-04-13 04:42:37,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 55 [2018-04-13 04:42:37,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-04-13 04:42:37,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 65 [2018-04-13 04:42:37,299 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-13 04:42:37,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2018-04-13 04:42:37,428 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:37,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-04-13 04:42:37,430 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:37,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-04-13 04:42:37,432 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:37,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2018-04-13 04:42:37,437 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:37,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-04-13 04:42:37,518 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:37,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-04-13 04:42:37,594 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:37,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2018-04-13 04:42:37,678 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:37,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2018-04-13 04:42:37,786 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:37,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2018-04-13 04:42:37,790 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:37,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-04-13 04:42:37,848 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:37,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-04-13 04:42:37,849 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:37,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-13 04:42:37,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-13 04:42:37,937 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:52, output treesize:91 [2018-04-13 04:42:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-13 04:42:38,069 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:42:38,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 04:42:38,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 04:42:38,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 04:42:38,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-04-13 04:42:38,069 INFO L87 Difference]: Start difference. First operand 225 states and 262 transitions. Second operand 20 states. [2018-04-13 04:42:40,241 WARN L151 SmtUtils]: Spent 1602ms on a formula simplification. DAG size of input: 56 DAG size of output 52 [2018-04-13 04:42:40,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:40,641 INFO L93 Difference]: Finished difference Result 240 states and 275 transitions. [2018-04-13 04:42:40,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 04:42:40,641 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2018-04-13 04:42:40,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:40,642 INFO L225 Difference]: With dead ends: 240 [2018-04-13 04:42:40,642 INFO L226 Difference]: Without dead ends: 151 [2018-04-13 04:42:40,643 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=177, Invalid=1013, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 04:42:40,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-13 04:42:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 74. [2018-04-13 04:42:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-13 04:42:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-04-13 04:42:40,644 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 53 [2018-04-13 04:42:40,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:40,644 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-04-13 04:42:40,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 04:42:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-04-13 04:42:40,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-13 04:42:40,645 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:40,645 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:40,645 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:40,645 INFO L82 PathProgramCache]: Analyzing trace with hash -994314088, now seen corresponding path program 2 times [2018-04-13 04:42:40,645 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:40,645 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:40,645 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:40,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:42:40,646 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:40,656 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:40,659 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:42:40,659 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:40,660 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:40,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:42:40,689 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:42:40,689 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:42:40,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:40,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:40,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:40,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:40,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:40,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:40,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:42:40,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:40,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:40,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:42:40,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:40,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:42:40,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:40,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:40,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 04:42:40,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:42:40,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:42:40,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:40,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:40,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:40,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-13 04:42:40,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 04:42:40,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:42:40,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:40,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:40,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:42:40,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-13 04:42:42,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 54 [2018-04-13 04:42:42,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-04-13 04:42:42,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:42,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 38 [2018-04-13 04:42:42,761 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:42,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2018-04-13 04:42:42,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:42,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 29 [2018-04-13 04:42:42,815 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:42,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-04-13 04:42:42,837 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:42,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2018-04-13 04:42:42,859 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:42,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-04-13 04:42:42,875 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:42,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 26 [2018-04-13 04:42:42,894 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:42,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 04:42:42,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:42:42,910 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:54, output treesize:30 [2018-04-13 04:42:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:42:42,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:42:42,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 04:42:42,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 04:42:42,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 04:42:42,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-04-13 04:42:42,953 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 21 states. [2018-04-13 04:42:44,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:44,118 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2018-04-13 04:42:44,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 04:42:44,118 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-04-13 04:42:44,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:44,119 INFO L225 Difference]: With dead ends: 137 [2018-04-13 04:42:44,119 INFO L226 Difference]: Without dead ends: 137 [2018-04-13 04:42:44,119 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 04:42:44,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-13 04:42:44,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 113. [2018-04-13 04:42:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-13 04:42:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2018-04-13 04:42:44,122 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 56 [2018-04-13 04:42:44,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:44,122 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2018-04-13 04:42:44,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 04:42:44,122 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2018-04-13 04:42:44,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-13 04:42:44,122 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:44,123 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:44,123 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:44,123 INFO L82 PathProgramCache]: Analyzing trace with hash -2053099207, now seen corresponding path program 1 times [2018-04-13 04:42:44,123 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:44,123 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:44,123 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:44,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:42:44,123 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:44,128 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:44,209 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:44,209 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:44,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:44,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:44,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:44,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:44,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:44,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 04:42:44,265 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:44,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:42:44,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2018-04-13 04:42:44,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 04:42:44,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 04:42:44,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-04-13 04:42:44,267 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 15 states. [2018-04-13 04:42:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:44,482 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2018-04-13 04:42:44,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 04:42:44,482 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-04-13 04:42:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:44,483 INFO L225 Difference]: With dead ends: 141 [2018-04-13 04:42:44,483 INFO L226 Difference]: Without dead ends: 141 [2018-04-13 04:42:44,483 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-04-13 04:42:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-13 04:42:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2018-04-13 04:42:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-13 04:42:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2018-04-13 04:42:44,485 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 58 [2018-04-13 04:42:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:44,485 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2018-04-13 04:42:44,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 04:42:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2018-04-13 04:42:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-13 04:42:44,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:44,486 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:44,486 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:44,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1827516351, now seen corresponding path program 1 times [2018-04-13 04:42:44,486 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:44,486 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:44,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:44,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:44,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:44,493 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:44,496 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:42:44,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:44,497 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:44,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:44,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:44,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:44,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:44,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:44,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:44,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:44,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:42:44,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:44,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:42:44,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:44,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:44,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:44,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:42:44,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:44,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:44,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 04:42:44,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:42:44,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:42:44,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:44,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:44,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:44,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-04-13 04:42:44,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 04:42:44,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:42:44,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:44,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:44,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:44,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-04-13 04:42:44,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-04-13 04:42:44,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-13 04:42:44,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:44,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:42:44,857 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:44,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:42:44,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:42:44,864 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2018-04-13 04:42:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 04:42:44,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:42:44,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 04:42:44,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 04:42:44,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 04:42:44,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-04-13 04:42:44,907 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand 22 states. [2018-04-13 04:42:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:45,615 INFO L93 Difference]: Finished difference Result 185 states and 215 transitions. [2018-04-13 04:42:45,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 04:42:45,615 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-04-13 04:42:45,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:45,616 INFO L225 Difference]: With dead ends: 185 [2018-04-13 04:42:45,616 INFO L226 Difference]: Without dead ends: 185 [2018-04-13 04:42:45,616 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 04:42:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-13 04:42:45,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 166. [2018-04-13 04:42:45,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-13 04:42:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 198 transitions. [2018-04-13 04:42:45,618 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 198 transitions. Word has length 61 [2018-04-13 04:42:45,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:45,619 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 198 transitions. [2018-04-13 04:42:45,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 04:42:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 198 transitions. [2018-04-13 04:42:45,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-13 04:42:45,619 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:45,619 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:45,619 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:45,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1799395259, now seen corresponding path program 1 times [2018-04-13 04:42:45,620 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:45,620 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:45,620 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:45,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:45,620 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:45,629 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:45,818 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:45,818 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:45,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:45,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:45,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:45,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:45,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:45,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 04:42:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-13 04:42:45,976 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:42:45,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 24 [2018-04-13 04:42:45,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 04:42:45,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 04:42:45,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2018-04-13 04:42:45,977 INFO L87 Difference]: Start difference. First operand 166 states and 198 transitions. Second operand 25 states. [2018-04-13 04:42:46,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:46,392 INFO L93 Difference]: Finished difference Result 242 states and 282 transitions. [2018-04-13 04:42:46,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 04:42:46,392 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-04-13 04:42:46,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:46,393 INFO L225 Difference]: With dead ends: 242 [2018-04-13 04:42:46,393 INFO L226 Difference]: Without dead ends: 242 [2018-04-13 04:42:46,394 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=1374, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:42:46,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-13 04:42:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 183. [2018-04-13 04:42:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-13 04:42:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 225 transitions. [2018-04-13 04:42:46,397 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 225 transitions. Word has length 62 [2018-04-13 04:42:46,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:46,397 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 225 transitions. [2018-04-13 04:42:46,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 04:42:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 225 transitions. [2018-04-13 04:42:46,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-13 04:42:46,398 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:46,398 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:46,398 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:46,398 INFO L82 PathProgramCache]: Analyzing trace with hash -34958984, now seen corresponding path program 3 times [2018-04-13 04:42:46,398 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:46,398 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:46,398 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:46,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:46,398 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:46,404 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:46,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:46,499 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:46,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:42:46,528 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-13 04:42:46,528 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:42:46,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:46,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:42:46,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-04-13 04:42:46,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 04:42:46,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 04:42:46,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:42:46,562 INFO L87 Difference]: Start difference. First operand 183 states and 225 transitions. Second operand 12 states. [2018-04-13 04:42:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:46,676 INFO L93 Difference]: Finished difference Result 329 states and 390 transitions. [2018-04-13 04:42:46,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 04:42:46,676 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-04-13 04:42:46,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:46,677 INFO L225 Difference]: With dead ends: 329 [2018-04-13 04:42:46,677 INFO L226 Difference]: Without dead ends: 329 [2018-04-13 04:42:46,678 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:42:46,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-04-13 04:42:46,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 297. [2018-04-13 04:42:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-13 04:42:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 359 transitions. [2018-04-13 04:42:46,683 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 359 transitions. Word has length 65 [2018-04-13 04:42:46,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:46,683 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 359 transitions. [2018-04-13 04:42:46,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 04:42:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 359 transitions. [2018-04-13 04:42:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-13 04:42:46,684 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:46,684 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:46,684 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:46,685 INFO L82 PathProgramCache]: Analyzing trace with hash -993830664, now seen corresponding path program 2 times [2018-04-13 04:42:46,685 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:46,685 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:46,685 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:46,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:42:46,685 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:46,696 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:46,701 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:42:46,702 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:46,702 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:46,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:42:46,739 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:42:46,739 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:42:46,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:46,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:46,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:46,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:46,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:46,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:46,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:42:46,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:46,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:42:46,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:46,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:46,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:46,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:42:46,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:46,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:46,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 04:42:46,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:42:46,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 04:42:46,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:46,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:46,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:46,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-13 04:42:46,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-13 04:42:46,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:42:46,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:46,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:46,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:46,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-04-13 04:42:47,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-13 04:42:47,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:42:47,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:47,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-13 04:42:47,140 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:47,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:42:47,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 04:42:47,165 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:56, output treesize:60 [2018-04-13 04:42:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-04-13 04:42:47,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:42:47,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 04:42:47,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 04:42:47,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 04:42:47,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-04-13 04:42:47,265 INFO L87 Difference]: Start difference. First operand 297 states and 359 transitions. Second operand 23 states. [2018-04-13 04:42:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:48,026 INFO L93 Difference]: Finished difference Result 345 states and 405 transitions. [2018-04-13 04:42:48,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 04:42:48,027 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-04-13 04:42:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:48,027 INFO L225 Difference]: With dead ends: 345 [2018-04-13 04:42:48,028 INFO L226 Difference]: Without dead ends: 214 [2018-04-13 04:42:48,028 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=1390, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:42:48,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-13 04:42:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 91. [2018-04-13 04:42:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-13 04:42:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2018-04-13 04:42:48,030 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 66 [2018-04-13 04:42:48,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:48,030 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2018-04-13 04:42:48,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 04:42:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-04-13 04:42:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-13 04:42:48,031 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:48,031 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:48,031 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:48,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1328474053, now seen corresponding path program 4 times [2018-04-13 04:42:48,032 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:48,032 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:48,032 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:48,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:42:48,032 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:48,047 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:48,049 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:42:48,049 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:48,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:48,049 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:42:48,069 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:42:48,069 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:42:48,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:48,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:48,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:48,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:48,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:48,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:48,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:42:48,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:48,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:48,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:42:48,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:48,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:42:48,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:48,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:48,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 04:42:48,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:42:48,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:42:48,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:48,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:48,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:48,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-04-13 04:42:48,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 04:42:48,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:42:48,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:48,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:48,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:48,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-04-13 04:42:48,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-13 04:42:48,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:42:48,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:48,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-13 04:42:48,687 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:48,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:42:48,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 04:42:48,703 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:59, output treesize:66 [2018-04-13 04:42:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:42:48,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:42:48,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 04:42:48,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 04:42:48,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 04:42:48,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2018-04-13 04:42:48,818 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 27 states. [2018-04-13 04:42:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:49,969 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2018-04-13 04:42:49,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 04:42:49,969 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 69 [2018-04-13 04:42:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:49,970 INFO L225 Difference]: With dead ends: 161 [2018-04-13 04:42:49,970 INFO L226 Difference]: Without dead ends: 161 [2018-04-13 04:42:49,970 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=192, Invalid=1878, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 04:42:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-13 04:42:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 138. [2018-04-13 04:42:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-13 04:42:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2018-04-13 04:42:49,972 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 69 [2018-04-13 04:42:49,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:49,973 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2018-04-13 04:42:49,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 04:42:49,973 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2018-04-13 04:42:49,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-13 04:42:49,973 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:49,973 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:49,973 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:49,973 INFO L82 PathProgramCache]: Analyzing trace with hash -689622706, now seen corresponding path program 3 times [2018-04-13 04:42:49,973 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:49,973 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:49,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:49,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:42:49,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:49,982 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:49,985 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:42:49,985 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:49,985 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:49,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:42:50,020 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-13 04:42:50,020 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:42:50,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:50,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:50,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:50,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:50,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:50,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:50,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:42:50,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:50,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:42:50,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:42:50,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:50,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:42:50,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:50,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:50,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-13 04:42:50,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:42:50,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 04:42:50,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:50,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:50,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:50,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-13 04:42:50,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-13 04:42:50,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:42:50,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:50,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:50,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:42:50,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-13 04:42:50,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-04-13 04:42:50,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-13 04:42:50,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:50,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 04:42:50,644 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:50,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:42:50,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:42:50,652 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-04-13 04:42:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-04-13 04:42:50,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:42:50,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 04:42:50,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 04:42:50,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 04:42:50,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-04-13 04:42:50,710 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand 18 states. [2018-04-13 04:42:51,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:51,472 INFO L93 Difference]: Finished difference Result 155 states and 179 transitions. [2018-04-13 04:42:51,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 04:42:51,472 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2018-04-13 04:42:51,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:51,473 INFO L225 Difference]: With dead ends: 155 [2018-04-13 04:42:51,473 INFO L226 Difference]: Without dead ends: 155 [2018-04-13 04:42:51,473 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2018-04-13 04:42:51,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-13 04:42:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 90. [2018-04-13 04:42:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-13 04:42:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-04-13 04:42:51,476 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 74 [2018-04-13 04:42:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:51,476 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-04-13 04:42:51,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 04:42:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-04-13 04:42:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-13 04:42:51,476 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:51,477 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:51,477 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:51,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1149641066, now seen corresponding path program 2 times [2018-04-13 04:42:51,477 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:51,477 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:51,477 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:51,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:42:51,478 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:51,487 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:51,616 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:51,617 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:51,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:42:51,638 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:42:51,638 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:42:51,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:51,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:42:51,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-04-13 04:42:51,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 04:42:51,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 04:42:51,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-04-13 04:42:51,684 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 14 states. [2018-04-13 04:42:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:51,855 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2018-04-13 04:42:51,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 04:42:51,856 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-04-13 04:42:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:51,856 INFO L225 Difference]: With dead ends: 161 [2018-04-13 04:42:51,857 INFO L226 Difference]: Without dead ends: 95 [2018-04-13 04:42:51,857 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:42:51,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-13 04:42:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-04-13 04:42:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-04-13 04:42:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2018-04-13 04:42:51,859 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 80 [2018-04-13 04:42:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:51,859 INFO L459 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2018-04-13 04:42:51,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 04:42:51,859 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2018-04-13 04:42:51,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 04:42:51,860 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:51,860 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:51,860 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:51,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1276287347, now seen corresponding path program 3 times [2018-04-13 04:42:51,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:51,860 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:51,861 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:51,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:42:51,861 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:51,870 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 32 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:52,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:52,039 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:52,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:42:52,113 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:42:52,114 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:42:52,138 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:52,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:52,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:52,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:52,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 04:42:52,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:42:52,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:42:52,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:52,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:52,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:52,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-13 04:42:52,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-04-13 04:42:52,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2018-04-13 04:42:52,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:52,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-13 04:42:52,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:52,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-13 04:42:52,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:52,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:42:52,793 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 04:42:52,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:42:52,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:42:52,805 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-04-13 04:42:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-04-13 04:42:52,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:42:52,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 39 [2018-04-13 04:42:52,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 04:42:52,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 04:42:52,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1449, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:42:52,931 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 40 states. [2018-04-13 04:42:54,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:54,678 INFO L93 Difference]: Finished difference Result 221 states and 252 transitions. [2018-04-13 04:42:54,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-13 04:42:54,679 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2018-04-13 04:42:54,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:54,679 INFO L225 Difference]: With dead ends: 221 [2018-04-13 04:42:54,679 INFO L226 Difference]: Without dead ends: 221 [2018-04-13 04:42:54,680 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1438 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=564, Invalid=5916, Unknown=0, NotChecked=0, Total=6480 [2018-04-13 04:42:54,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-13 04:42:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 103. [2018-04-13 04:42:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-13 04:42:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2018-04-13 04:42:54,682 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 84 [2018-04-13 04:42:54,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:54,682 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2018-04-13 04:42:54,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 04:42:54,682 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2018-04-13 04:42:54,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-13 04:42:54,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:54,683 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:54,683 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:54,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1242412257, now seen corresponding path program 4 times [2018-04-13 04:42:54,683 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:54,683 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:54,683 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:54,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:42:54,683 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:54,691 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:54,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:54,847 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:54,848 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:42:54,886 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:42:54,886 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:42:54,891 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:54,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:54,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:54,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:54,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 04:42:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 32 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:55,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:42:55,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-04-13 04:42:55,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 04:42:55,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 04:42:55,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=858, Unknown=0, NotChecked=0, Total=930 [2018-04-13 04:42:55,248 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand 31 states. [2018-04-13 04:42:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:56,629 INFO L93 Difference]: Finished difference Result 249 states and 281 transitions. [2018-04-13 04:42:56,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 04:42:56,629 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 93 [2018-04-13 04:42:56,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:56,630 INFO L225 Difference]: With dead ends: 249 [2018-04-13 04:42:56,630 INFO L226 Difference]: Without dead ends: 152 [2018-04-13 04:42:56,631 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=454, Invalid=4658, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 04:42:56,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-13 04:42:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 116. [2018-04-13 04:42:56,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-13 04:42:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2018-04-13 04:42:56,633 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 93 [2018-04-13 04:42:56,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:56,633 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2018-04-13 04:42:56,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 04:42:56,633 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2018-04-13 04:42:56,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-04-13 04:42:56,633 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:56,633 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:56,634 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:56,634 INFO L82 PathProgramCache]: Analyzing trace with hash -2075901424, now seen corresponding path program 5 times [2018-04-13 04:42:56,634 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:56,634 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:56,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:56,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:42:56,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:56,643 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 20 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:56,842 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:56,842 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:56,842 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:42:56,887 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-13 04:42:56,887 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:42:56,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 20 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:56,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:42:56,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-04-13 04:42:56,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 04:42:56,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 04:42:56,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-04-13 04:42:56,941 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand 18 states. [2018-04-13 04:42:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:57,264 INFO L93 Difference]: Finished difference Result 219 states and 253 transitions. [2018-04-13 04:42:57,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 04:42:57,264 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 106 [2018-04-13 04:42:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:57,265 INFO L225 Difference]: With dead ends: 219 [2018-04-13 04:42:57,265 INFO L226 Difference]: Without dead ends: 121 [2018-04-13 04:42:57,265 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-04-13 04:42:57,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-04-13 04:42:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-04-13 04:42:57,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-13 04:42:57,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2018-04-13 04:42:57,267 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 106 [2018-04-13 04:42:57,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:57,267 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2018-04-13 04:42:57,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 04:42:57,267 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2018-04-13 04:42:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-04-13 04:42:57,267 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:57,267 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:57,267 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:57,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1745089197, now seen corresponding path program 6 times [2018-04-13 04:42:57,268 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:57,268 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:57,268 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:57,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:42:57,268 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:57,276 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 72 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:57,472 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:57,472 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:57,472 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:42:57,531 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-13 04:42:57,531 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:42:57,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:57,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:57,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:57,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:57,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 04:42:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 72 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:57,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:42:57,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 22 [2018-04-13 04:42:57,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 04:42:57,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 04:42:57,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-04-13 04:42:57,600 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand 23 states. [2018-04-13 04:42:58,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:58,280 INFO L93 Difference]: Finished difference Result 178 states and 200 transitions. [2018-04-13 04:42:58,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 04:42:58,280 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 110 [2018-04-13 04:42:58,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:58,281 INFO L225 Difference]: With dead ends: 178 [2018-04-13 04:42:58,281 INFO L226 Difference]: Without dead ends: 178 [2018-04-13 04:42:58,281 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=1446, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 04:42:58,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-13 04:42:58,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 129. [2018-04-13 04:42:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-13 04:42:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-04-13 04:42:58,284 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 110 [2018-04-13 04:42:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:58,284 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-04-13 04:42:58,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 04:42:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-04-13 04:42:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:42:58,285 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:58,285 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:58,285 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:58,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1511568165, now seen corresponding path program 7 times [2018-04-13 04:42:58,286 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:58,286 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:58,286 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:58,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:42:58,286 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:58,306 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:58,582 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 24 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:58,582 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:58,582 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:58,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:58,604 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 24 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:58,666 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:42:58,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-04-13 04:42:58,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 04:42:58,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 04:42:58,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-04-13 04:42:58,667 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 20 states. [2018-04-13 04:42:58,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:42:58,960 INFO L93 Difference]: Finished difference Result 248 states and 288 transitions. [2018-04-13 04:42:58,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 04:42:58,960 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2018-04-13 04:42:58,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:42:58,961 INFO L225 Difference]: With dead ends: 248 [2018-04-13 04:42:58,961 INFO L226 Difference]: Without dead ends: 134 [2018-04-13 04:42:58,961 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-04-13 04:42:58,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-13 04:42:58,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-04-13 04:42:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-13 04:42:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2018-04-13 04:42:58,963 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 119 [2018-04-13 04:42:58,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:42:58,963 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2018-04-13 04:42:58,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 04:42:58,963 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2018-04-13 04:42:58,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-04-13 04:42:58,964 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:42:58,964 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:42:58,964 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:42:58,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1000625752, now seen corresponding path program 8 times [2018-04-13 04:42:58,964 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:42:58,964 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:42:58,965 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:58,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:42:58,965 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:42:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:42:58,973 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:42:59,309 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:42:59,309 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:42:59,309 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:42:59,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:42:59,394 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:42:59,394 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:42:59,401 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:42:59,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:42:59,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:42:59,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:42:59,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 04:42:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 72 proven. 191 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-13 04:42:59,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:42:59,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 38 [2018-04-13 04:42:59,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 04:42:59,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 04:42:59,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1323, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 04:42:59,748 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 39 states. [2018-04-13 04:43:00,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:43:00,690 INFO L93 Difference]: Finished difference Result 208 states and 236 transitions. [2018-04-13 04:43:00,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 04:43:00,691 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 123 [2018-04-13 04:43:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:43:00,691 INFO L225 Difference]: With dead ends: 208 [2018-04-13 04:43:00,691 INFO L226 Difference]: Without dead ends: 208 [2018-04-13 04:43:00,692 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=418, Invalid=3488, Unknown=0, NotChecked=0, Total=3906 [2018-04-13 04:43:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-04-13 04:43:00,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 151. [2018-04-13 04:43:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-13 04:43:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 178 transitions. [2018-04-13 04:43:00,694 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 178 transitions. Word has length 123 [2018-04-13 04:43:00,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:43:00,694 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 178 transitions. [2018-04-13 04:43:00,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 04:43:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 178 transitions. [2018-04-13 04:43:00,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-04-13 04:43:00,694 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:43:00,694 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:43:00,694 INFO L408 AbstractCegarLoop]: === Iteration 47 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:43:00,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1911359464, now seen corresponding path program 9 times [2018-04-13 04:43:00,695 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:43:00,695 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:43:00,695 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:00,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:43:00,695 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:00,704 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:43:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 91 proven. 294 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:43:00,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:43:00,990 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:43:00,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:43:01,121 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-04-13 04:43:01,121 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:43:01,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:43:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 91 proven. 294 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:43:01,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:43:01,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-04-13 04:43:01,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 04:43:01,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 04:43:01,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-04-13 04:43:01,216 INFO L87 Difference]: Start difference. First operand 151 states and 178 transitions. Second operand 23 states. [2018-04-13 04:43:01,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:43:01,823 INFO L93 Difference]: Finished difference Result 286 states and 335 transitions. [2018-04-13 04:43:01,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 04:43:01,823 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 141 [2018-04-13 04:43:01,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:43:01,824 INFO L225 Difference]: With dead ends: 286 [2018-04-13 04:43:01,824 INFO L226 Difference]: Without dead ends: 156 [2018-04-13 04:43:01,824 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=911, Unknown=0, NotChecked=0, Total=992 [2018-04-13 04:43:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-13 04:43:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-04-13 04:43:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-13 04:43:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2018-04-13 04:43:01,826 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 141 [2018-04-13 04:43:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:43:01,826 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2018-04-13 04:43:01,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 04:43:01,826 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2018-04-13 04:43:01,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-04-13 04:43:01,826 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:43:01,826 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:43:01,826 INFO L408 AbstractCegarLoop]: === Iteration 48 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:43:01,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2136271403, now seen corresponding path program 10 times [2018-04-13 04:43:01,827 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:43:01,827 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:43:01,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:01,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:43:01,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:01,840 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:43:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 32 proven. 388 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:02,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:43:02,175 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:43:02,175 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:43:02,262 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:43:02,263 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:43:02,274 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:43:02,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:43:02,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:43:02,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:43:02,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 04:43:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 128 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:02,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:43:02,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-04-13 04:43:02,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-13 04:43:02,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-13 04:43:02,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2014, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 04:43:02,852 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand 47 states. [2018-04-13 04:43:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:43:05,980 INFO L93 Difference]: Finished difference Result 421 states and 477 transitions. [2018-04-13 04:43:05,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-13 04:43:05,981 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 145 [2018-04-13 04:43:05,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:43:05,981 INFO L225 Difference]: With dead ends: 421 [2018-04-13 04:43:05,981 INFO L226 Difference]: Without dead ends: 240 [2018-04-13 04:43:05,983 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3244 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1226, Invalid=13054, Unknown=0, NotChecked=0, Total=14280 [2018-04-13 04:43:05,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-13 04:43:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 168. [2018-04-13 04:43:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-13 04:43:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 198 transitions. [2018-04-13 04:43:05,985 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 198 transitions. Word has length 145 [2018-04-13 04:43:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:43:05,985 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 198 transitions. [2018-04-13 04:43:05,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-13 04:43:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 198 transitions. [2018-04-13 04:43:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-04-13 04:43:05,986 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:43:05,986 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:43:05,986 INFO L408 AbstractCegarLoop]: === Iteration 49 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:43:05,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1340707836, now seen corresponding path program 11 times [2018-04-13 04:43:05,987 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:43:05,987 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:43:05,987 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:05,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:43:05,987 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:06,003 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:43:06,360 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 36 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:06,360 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:43:06,360 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:43:06,360 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:43:06,457 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-04-13 04:43:06,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:43:06,468 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:43:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 36 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:06,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:43:06,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-04-13 04:43:06,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 04:43:06,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 04:43:06,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-04-13 04:43:06,523 INFO L87 Difference]: Start difference. First operand 168 states and 198 transitions. Second operand 26 states. [2018-04-13 04:43:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:43:07,069 INFO L93 Difference]: Finished difference Result 335 states and 393 transitions. [2018-04-13 04:43:07,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 04:43:07,069 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 158 [2018-04-13 04:43:07,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:43:07,070 INFO L225 Difference]: With dead ends: 335 [2018-04-13 04:43:07,070 INFO L226 Difference]: Without dead ends: 173 [2018-04-13 04:43:07,070 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 04:43:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-13 04:43:07,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-04-13 04:43:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-04-13 04:43:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 202 transitions. [2018-04-13 04:43:07,073 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 202 transitions. Word has length 158 [2018-04-13 04:43:07,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:43:07,073 INFO L459 AbstractCegarLoop]: Abstraction has 172 states and 202 transitions. [2018-04-13 04:43:07,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 04:43:07,073 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 202 transitions. [2018-04-13 04:43:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-04-13 04:43:07,073 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:43:07,073 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:43:07,073 INFO L408 AbstractCegarLoop]: === Iteration 50 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:43:07,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2036135969, now seen corresponding path program 12 times [2018-04-13 04:43:07,073 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:43:07,074 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:43:07,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:07,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:43:07,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:07,084 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:43:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 200 proven. 370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:07,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:43:07,407 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:43:07,408 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:43:07,559 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-04-13 04:43:07,560 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:43:07,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:43:07,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:43:07,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:43:07,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:43:07,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 04:43:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 162 proven. 407 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-13 04:43:07,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:43:07,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 36 [2018-04-13 04:43:07,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 04:43:07,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 04:43:07,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 04:43:07,802 INFO L87 Difference]: Start difference. First operand 172 states and 202 transitions. Second operand 37 states. [2018-04-13 04:43:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:43:08,671 INFO L93 Difference]: Finished difference Result 284 states and 321 transitions. [2018-04-13 04:43:08,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-13 04:43:08,672 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 162 [2018-04-13 04:43:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:43:08,672 INFO L225 Difference]: With dead ends: 284 [2018-04-13 04:43:08,672 INFO L226 Difference]: Without dead ends: 284 [2018-04-13 04:43:08,673 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=877, Invalid=4379, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 04:43:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-04-13 04:43:08,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 190. [2018-04-13 04:43:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-13 04:43:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 226 transitions. [2018-04-13 04:43:08,676 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 226 transitions. Word has length 162 [2018-04-13 04:43:08,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:43:08,676 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 226 transitions. [2018-04-13 04:43:08,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 04:43:08,677 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 226 transitions. [2018-04-13 04:43:08,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-04-13 04:43:08,677 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:43:08,677 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:43:08,677 INFO L408 AbstractCegarLoop]: === Iteration 51 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:43:08,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1744767521, now seen corresponding path program 13 times [2018-04-13 04:43:08,678 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:43:08,678 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:43:08,678 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:08,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:43:08,678 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:08,689 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:43:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 130 proven. 615 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:43:09,083 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:43:09,083 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:43:09,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:43:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:09,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:43:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 130 proven. 615 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:43:09,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:43:09,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-04-13 04:43:09,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 04:43:09,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 04:43:09,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-04-13 04:43:09,177 INFO L87 Difference]: Start difference. First operand 190 states and 226 transitions. Second operand 28 states. [2018-04-13 04:43:09,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:43:09,710 INFO L93 Difference]: Finished difference Result 373 states and 440 transitions. [2018-04-13 04:43:09,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 04:43:09,711 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 180 [2018-04-13 04:43:09,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:43:09,711 INFO L225 Difference]: With dead ends: 373 [2018-04-13 04:43:09,711 INFO L226 Difference]: Without dead ends: 195 [2018-04-13 04:43:09,711 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:43:09,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-13 04:43:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-04-13 04:43:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-13 04:43:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2018-04-13 04:43:09,714 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 180 [2018-04-13 04:43:09,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:43:09,714 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2018-04-13 04:43:09,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 04:43:09,714 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2018-04-13 04:43:09,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-04-13 04:43:09,715 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:43:09,715 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:43:09,715 INFO L408 AbstractCegarLoop]: === Iteration 52 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:43:09,716 INFO L82 PathProgramCache]: Analyzing trace with hash -533532034, now seen corresponding path program 14 times [2018-04-13 04:43:09,716 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:43:09,716 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:43:09,716 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:09,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:43:09,717 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:09,735 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:43:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 44 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:10,109 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:43:10,109 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:43:10,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:43:10,136 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:43:10,136 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:43:10,144 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:43:10,212 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 44 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:10,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:43:10,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-04-13 04:43:10,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-13 04:43:10,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-13 04:43:10,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-04-13 04:43:10,213 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand 30 states. [2018-04-13 04:43:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:43:10,840 INFO L93 Difference]: Finished difference Result 393 states and 463 transitions. [2018-04-13 04:43:10,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 04:43:10,840 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 184 [2018-04-13 04:43:10,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:43:10,841 INFO L225 Difference]: With dead ends: 393 [2018-04-13 04:43:10,841 INFO L226 Difference]: Without dead ends: 199 [2018-04-13 04:43:10,841 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=1697, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 04:43:10,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-13 04:43:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2018-04-13 04:43:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 04:43:10,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 234 transitions. [2018-04-13 04:43:10,843 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 234 transitions. Word has length 184 [2018-04-13 04:43:10,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:43:10,844 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 234 transitions. [2018-04-13 04:43:10,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-13 04:43:10,844 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 234 transitions. [2018-04-13 04:43:10,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-04-13 04:43:10,844 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:43:10,844 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:43:10,844 INFO L408 AbstractCegarLoop]: === Iteration 53 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:43:10,844 INFO L82 PathProgramCache]: Analyzing trace with hash -783195045, now seen corresponding path program 15 times [2018-04-13 04:43:10,844 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:43:10,844 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:43:10,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:10,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:43:10,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:10,859 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:43:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 839 backedges. 288 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:11,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:43:11,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:43:11,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:43:11,518 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-04-13 04:43:11,518 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:43:11,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:43:11,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:43:11,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:43:11,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:43:11,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 04:43:11,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:43:11,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:43:11,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:43:11,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:43:11,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:43:11,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-13 04:43:12,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-04-13 04:43:12,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2018-04-13 04:43:12,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:43:12,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-13 04:43:12,830 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:43:12,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-13 04:43:12,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:43:12,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:43:12,841 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 04:43:12,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:43:12,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:43:12,850 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-04-13 04:43:13,012 INFO L134 CoverageAnalysis]: Checked inductivity of 839 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-04-13 04:43:13,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:43:13,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 39] total 71 [2018-04-13 04:43:13,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-13 04:43:13,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-13 04:43:13,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=4801, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 04:43:13,013 INFO L87 Difference]: Start difference. First operand 198 states and 234 transitions. Second operand 72 states. [2018-04-13 04:43:19,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:43:19,894 INFO L93 Difference]: Finished difference Result 525 states and 604 transitions. [2018-04-13 04:43:19,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-04-13 04:43:19,895 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 188 [2018-04-13 04:43:19,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:43:19,896 INFO L225 Difference]: With dead ends: 525 [2018-04-13 04:43:19,896 INFO L226 Difference]: Without dead ends: 525 [2018-04-13 04:43:19,897 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7426 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2448, Invalid=25944, Unknown=0, NotChecked=0, Total=28392 [2018-04-13 04:43:19,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-04-13 04:43:19,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 207. [2018-04-13 04:43:19,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-04-13 04:43:19,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 246 transitions. [2018-04-13 04:43:19,900 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 246 transitions. Word has length 188 [2018-04-13 04:43:19,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:43:19,900 INFO L459 AbstractCegarLoop]: Abstraction has 207 states and 246 transitions. [2018-04-13 04:43:19,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-13 04:43:19,900 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 246 transitions. [2018-04-13 04:43:19,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-04-13 04:43:19,901 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:43:19,901 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:43:19,901 INFO L408 AbstractCegarLoop]: === Iteration 54 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:43:19,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1941617353, now seen corresponding path program 16 times [2018-04-13 04:43:19,901 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:43:19,902 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:43:19,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:19,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:43:19,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:19,914 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:43:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 288 proven. 654 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:20,361 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:43:20,361 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:43:20,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:43:20,487 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:43:20,487 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:43:20,497 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:43:20,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:43:20,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:43:20,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:43:20,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:10, output treesize:3 [2018-04-13 04:43:21,154 INFO L134 CoverageAnalysis]: Checked inductivity of 942 backedges. 288 proven. 654 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:21,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:43:21,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 37] total 56 [2018-04-13 04:43:21,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-13 04:43:21,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-13 04:43:21,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=2820, Unknown=0, NotChecked=0, Total=3192 [2018-04-13 04:43:21,155 INFO L87 Difference]: Start difference. First operand 207 states and 246 transitions. Second operand 57 states. [2018-04-13 04:43:22,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:43:22,762 INFO L93 Difference]: Finished difference Result 326 states and 369 transitions. [2018-04-13 04:43:22,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-13 04:43:22,762 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 197 [2018-04-13 04:43:22,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:43:22,763 INFO L225 Difference]: With dead ends: 326 [2018-04-13 04:43:22,763 INFO L226 Difference]: Without dead ends: 326 [2018-04-13 04:43:22,763 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2886 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1428, Invalid=8672, Unknown=0, NotChecked=0, Total=10100 [2018-04-13 04:43:22,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-04-13 04:43:22,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 216. [2018-04-13 04:43:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-13 04:43:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2018-04-13 04:43:22,765 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 197 [2018-04-13 04:43:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:43:22,766 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2018-04-13 04:43:22,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-13 04:43:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2018-04-13 04:43:22,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-04-13 04:43:22,766 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:43:22,766 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:43:22,766 INFO L408 AbstractCegarLoop]: === Iteration 55 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:43:22,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1530225701, now seen corresponding path program 17 times [2018-04-13 04:43:22,767 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:43:22,767 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:43:22,767 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:22,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:43:22,768 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:22,786 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:43:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 156 proven. 894 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:43:23,247 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:43:23,247 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:43:23,248 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:43:23,369 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-04-13 04:43:23,370 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:43:23,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:43:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 156 proven. 894 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:43:23,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:43:23,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-04-13 04:43:23,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 04:43:23,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 04:43:23,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-04-13 04:43:23,488 INFO L87 Difference]: Start difference. First operand 216 states and 258 transitions. Second operand 32 states. [2018-04-13 04:43:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:43:24,222 INFO L93 Difference]: Finished difference Result 431 states and 510 transitions. [2018-04-13 04:43:24,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 04:43:24,223 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 206 [2018-04-13 04:43:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:43:24,223 INFO L225 Difference]: With dead ends: 431 [2018-04-13 04:43:24,223 INFO L226 Difference]: Without dead ends: 221 [2018-04-13 04:43:24,223 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 205 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=1953, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 04:43:24,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-13 04:43:24,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2018-04-13 04:43:24,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-13 04:43:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 262 transitions. [2018-04-13 04:43:24,226 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 262 transitions. Word has length 206 [2018-04-13 04:43:24,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:43:24,226 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 262 transitions. [2018-04-13 04:43:24,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 04:43:24,226 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 262 transitions. [2018-04-13 04:43:24,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-04-13 04:43:24,227 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:43:24,227 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:43:24,227 INFO L408 AbstractCegarLoop]: === Iteration 56 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:43:24,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1126196744, now seen corresponding path program 18 times [2018-04-13 04:43:24,227 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:43:24,228 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:43:24,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:24,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:43:24,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:24,239 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:43:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 52 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:24,714 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:43:24,714 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:43:24,715 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:43:24,864 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-04-13 04:43:24,864 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:43:24,879 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:43:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 52 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:24,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:43:24,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-04-13 04:43:24,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 04:43:24,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 04:43:24,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 04:43:24,983 INFO L87 Difference]: Start difference. First operand 220 states and 262 transitions. Second operand 34 states. [2018-04-13 04:43:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:43:25,808 INFO L93 Difference]: Finished difference Result 451 states and 533 transitions. [2018-04-13 04:43:25,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 04:43:25,808 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 210 [2018-04-13 04:43:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:43:25,809 INFO L225 Difference]: With dead ends: 451 [2018-04-13 04:43:25,809 INFO L226 Difference]: Without dead ends: 225 [2018-04-13 04:43:25,809 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 209 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=2227, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 04:43:25,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-13 04:43:25,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2018-04-13 04:43:25,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-13 04:43:25,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 266 transitions. [2018-04-13 04:43:25,811 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 266 transitions. Word has length 210 [2018-04-13 04:43:25,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:43:25,811 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 266 transitions. [2018-04-13 04:43:25,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 04:43:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 266 transitions. [2018-04-13 04:43:25,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-04-13 04:43:25,812 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:43:25,812 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:43:25,812 INFO L408 AbstractCegarLoop]: === Iteration 57 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:43:25,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1478606443, now seen corresponding path program 19 times [2018-04-13 04:43:25,812 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:43:25,812 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:43:25,812 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:25,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:43:25,813 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:25,824 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:43:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 392 proven. 768 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:26,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:43:26,244 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:43:26,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:43:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:26,413 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:43:26,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:43:26,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:43:26,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:43:26,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 04:43:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 338 proven. 821 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-13 04:43:26,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:43:26,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 34] total 44 [2018-04-13 04:43:26,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-13 04:43:26,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-13 04:43:26,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=1690, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 04:43:26,617 INFO L87 Difference]: Start difference. First operand 224 states and 266 transitions. Second operand 45 states. [2018-04-13 04:43:28,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:43:28,046 INFO L93 Difference]: Finished difference Result 372 states and 421 transitions. [2018-04-13 04:43:28,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-13 04:43:28,046 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 214 [2018-04-13 04:43:28,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:43:28,047 INFO L225 Difference]: With dead ends: 372 [2018-04-13 04:43:28,047 INFO L226 Difference]: Without dead ends: 372 [2018-04-13 04:43:28,048 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2258 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1511, Invalid=7045, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 04:43:28,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-04-13 04:43:28,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 242. [2018-04-13 04:43:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-13 04:43:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 290 transitions. [2018-04-13 04:43:28,050 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 290 transitions. Word has length 214 [2018-04-13 04:43:28,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:43:28,050 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 290 transitions. [2018-04-13 04:43:28,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-13 04:43:28,050 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 290 transitions. [2018-04-13 04:43:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-13 04:43:28,051 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:43:28,051 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:43:28,051 INFO L408 AbstractCegarLoop]: === Iteration 58 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:43:28,051 INFO L82 PathProgramCache]: Analyzing trace with hash 525622933, now seen corresponding path program 20 times [2018-04-13 04:43:28,051 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:43:28,051 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:43:28,052 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:28,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:43:28,052 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:28,068 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:43:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1411 backedges. 182 proven. 1225 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:43:28,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:43:28,539 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:43:28,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:43:28,572 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:43:28,572 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:43:28,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:43:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1411 backedges. 182 proven. 1225 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:43:28,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:43:28,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-04-13 04:43:28,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 04:43:28,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 04:43:28,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 04:43:28,745 INFO L87 Difference]: Start difference. First operand 242 states and 290 transitions. Second operand 36 states. [2018-04-13 04:43:29,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:43:29,676 INFO L93 Difference]: Finished difference Result 489 states and 580 transitions. [2018-04-13 04:43:29,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 04:43:29,676 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 232 [2018-04-13 04:43:29,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:43:29,677 INFO L225 Difference]: With dead ends: 489 [2018-04-13 04:43:29,677 INFO L226 Difference]: Without dead ends: 247 [2018-04-13 04:43:29,677 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 231 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=2519, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 04:43:29,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-13 04:43:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2018-04-13 04:43:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-04-13 04:43:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 294 transitions. [2018-04-13 04:43:29,679 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 294 transitions. Word has length 232 [2018-04-13 04:43:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:43:29,679 INFO L459 AbstractCegarLoop]: Abstraction has 246 states and 294 transitions. [2018-04-13 04:43:29,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 04:43:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 294 transitions. [2018-04-13 04:43:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-04-13 04:43:29,680 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:43:29,680 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:43:29,680 INFO L408 AbstractCegarLoop]: === Iteration 59 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:43:29,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1932968562, now seen corresponding path program 21 times [2018-04-13 04:43:29,681 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:43:29,681 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:43:29,681 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:29,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:43:29,681 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:29,698 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:43:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 450 proven. 1020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:30,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:43:30,205 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:43:30,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:43:30,424 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-13 04:43:30,424 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:43:30,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:43:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 60 proven. 1410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:31,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:43:31,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38] total 77 [2018-04-13 04:43:31,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-13 04:43:31,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-13 04:43:31,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=5476, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 04:43:31,340 INFO L87 Difference]: Start difference. First operand 246 states and 294 transitions. Second operand 77 states. [2018-04-13 04:43:38,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:43:38,767 INFO L93 Difference]: Finished difference Result 726 states and 824 transitions. [2018-04-13 04:43:38,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-04-13 04:43:38,767 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 236 [2018-04-13 04:43:38,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:43:38,768 INFO L225 Difference]: With dead ends: 726 [2018-04-13 04:43:38,768 INFO L226 Difference]: Without dead ends: 396 [2018-04-13 04:43:38,769 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11810 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3764, Invalid=39708, Unknown=0, NotChecked=0, Total=43472 [2018-04-13 04:43:38,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-04-13 04:43:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 259. [2018-04-13 04:43:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-04-13 04:43:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 310 transitions. [2018-04-13 04:43:38,772 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 310 transitions. Word has length 236 [2018-04-13 04:43:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:43:38,773 INFO L459 AbstractCegarLoop]: Abstraction has 259 states and 310 transitions. [2018-04-13 04:43:38,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-13 04:43:38,773 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 310 transitions. [2018-04-13 04:43:38,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-04-13 04:43:38,774 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:43:38,774 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:43:38,774 INFO L408 AbstractCegarLoop]: === Iteration 60 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:43:38,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1928354883, now seen corresponding path program 22 times [2018-04-13 04:43:38,774 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:43:38,774 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:43:38,775 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:38,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:43:38,775 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:38,790 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:43:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 512 proven. 1160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:39,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:43:39,347 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:43:39,347 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:43:39,534 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:43:39,534 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:43:39,550 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:43:39,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:43:39,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:43:39,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:43:39,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 04:43:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1672 backedges. 512 proven. 1160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:39,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:43:39,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 43 [2018-04-13 04:43:39,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 04:43:39,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 04:43:39,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1565, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 04:43:39,665 INFO L87 Difference]: Start difference. First operand 259 states and 310 transitions. Second operand 44 states. [2018-04-13 04:43:41,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:43:41,354 INFO L93 Difference]: Finished difference Result 414 states and 469 transitions. [2018-04-13 04:43:41,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-13 04:43:41,377 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 249 [2018-04-13 04:43:41,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:43:41,377 INFO L225 Difference]: With dead ends: 414 [2018-04-13 04:43:41,378 INFO L226 Difference]: Without dead ends: 414 [2018-04-13 04:43:41,378 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2547 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1610, Invalid=7320, Unknown=0, NotChecked=0, Total=8930 [2018-04-13 04:43:41,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-04-13 04:43:41,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 268. [2018-04-13 04:43:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-13 04:43:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 322 transitions. [2018-04-13 04:43:41,381 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 322 transitions. Word has length 249 [2018-04-13 04:43:41,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:43:41,381 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 322 transitions. [2018-04-13 04:43:41,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 04:43:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 322 transitions. [2018-04-13 04:43:41,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-04-13 04:43:41,382 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:43:41,383 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:43:41,383 INFO L408 AbstractCegarLoop]: === Iteration 61 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:43:41,383 INFO L82 PathProgramCache]: Analyzing trace with hash 454734415, now seen corresponding path program 23 times [2018-04-13 04:43:41,383 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:43:41,383 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:43:41,384 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:41,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:43:41,384 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:41,408 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:43:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 208 proven. 1608 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:43:42,016 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:43:42,016 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:43:42,016 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:43:42,188 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-13 04:43:42,188 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:43:42,210 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:43:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 208 proven. 1608 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:43:42,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:43:42,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-04-13 04:43:42,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 04:43:42,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 04:43:42,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:43:42,367 INFO L87 Difference]: Start difference. First operand 268 states and 322 transitions. Second operand 40 states. [2018-04-13 04:43:43,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:43:43,559 INFO L93 Difference]: Finished difference Result 547 states and 650 transitions. [2018-04-13 04:43:43,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 04:43:43,559 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 258 [2018-04-13 04:43:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:43:43,560 INFO L225 Difference]: With dead ends: 547 [2018-04-13 04:43:43,560 INFO L226 Difference]: Without dead ends: 273 [2018-04-13 04:43:43,560 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=3157, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 04:43:43,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-13 04:43:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 272. [2018-04-13 04:43:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-04-13 04:43:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 326 transitions. [2018-04-13 04:43:43,562 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 326 transitions. Word has length 258 [2018-04-13 04:43:43,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:43:43,562 INFO L459 AbstractCegarLoop]: Abstraction has 272 states and 326 transitions. [2018-04-13 04:43:43,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 04:43:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 326 transitions. [2018-04-13 04:43:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-04-13 04:43:43,564 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:43:43,564 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:43:43,564 INFO L408 AbstractCegarLoop]: === Iteration 62 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:43:43,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1290980332, now seen corresponding path program 24 times [2018-04-13 04:43:43,564 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:43:43,564 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:43:43,565 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:43,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:43:43,565 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:43,592 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:43:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1887 backedges. 578 proven. 1309 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:44,171 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:43:44,171 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:43:44,172 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:43:44,591 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-04-13 04:43:44,591 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:43:44,607 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:43:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1887 backedges. 68 proven. 1819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:45,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:43:45,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 42] total 85 [2018-04-13 04:43:45,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-13 04:43:45,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-13 04:43:45,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=6684, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 04:43:45,743 INFO L87 Difference]: Start difference. First operand 272 states and 326 transitions. Second operand 85 states. [2018-04-13 04:43:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:43:54,721 INFO L93 Difference]: Finished difference Result 812 states and 922 transitions. [2018-04-13 04:43:54,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-04-13 04:43:54,722 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 262 [2018-04-13 04:43:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:43:54,723 INFO L225 Difference]: With dead ends: 812 [2018-04-13 04:43:54,723 INFO L226 Difference]: Without dead ends: 440 [2018-04-13 04:43:54,724 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14891 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=4662, Invalid=49394, Unknown=0, NotChecked=0, Total=54056 [2018-04-13 04:43:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-04-13 04:43:54,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 285. [2018-04-13 04:43:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-04-13 04:43:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 342 transitions. [2018-04-13 04:43:54,727 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 342 transitions. Word has length 262 [2018-04-13 04:43:54,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:43:54,727 INFO L459 AbstractCegarLoop]: Abstraction has 285 states and 342 transitions. [2018-04-13 04:43:54,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-13 04:43:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 342 transitions. [2018-04-13 04:43:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-04-13 04:43:54,728 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:43:54,729 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:43:54,729 INFO L408 AbstractCegarLoop]: === Iteration 63 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:43:54,729 INFO L82 PathProgramCache]: Analyzing trace with hash 985529929, now seen corresponding path program 25 times [2018-04-13 04:43:54,729 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:43:54,729 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:43:54,729 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:54,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:43:54,729 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:43:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:54,749 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:43:55,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2115 backedges. 648 proven. 1467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:55,403 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:43:55,403 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:43:55,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:43:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:43:55,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:43:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2115 backedges. 72 proven. 2043 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:43:56,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:43:56,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44] total 89 [2018-04-13 04:43:56,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-04-13 04:43:56,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-04-13 04:43:56,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=7381, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 04:43:56,677 INFO L87 Difference]: Start difference. First operand 285 states and 342 transitions. Second operand 89 states. [2018-04-13 04:44:07,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:44:07,603 INFO L93 Difference]: Finished difference Result 843 states and 959 transitions. [2018-04-13 04:44:07,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-04-13 04:44:07,603 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 275 [2018-04-13 04:44:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:44:07,604 INFO L225 Difference]: With dead ends: 843 [2018-04-13 04:44:07,604 INFO L226 Difference]: Without dead ends: 456 [2018-04-13 04:44:07,605 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15418 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=4240, Invalid=52642, Unknown=0, NotChecked=0, Total=56882 [2018-04-13 04:44:07,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-13 04:44:07,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 298. [2018-04-13 04:44:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-04-13 04:44:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 358 transitions. [2018-04-13 04:44:07,608 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 358 transitions. Word has length 275 [2018-04-13 04:44:07,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:44:07,608 INFO L459 AbstractCegarLoop]: Abstraction has 298 states and 358 transitions. [2018-04-13 04:44:07,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-04-13 04:44:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 358 transitions. [2018-04-13 04:44:07,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-04-13 04:44:07,609 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:44:07,609 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:44:07,609 INFO L408 AbstractCegarLoop]: === Iteration 64 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:44:07,609 INFO L82 PathProgramCache]: Analyzing trace with hash 577640038, now seen corresponding path program 26 times [2018-04-13 04:44:07,609 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:44:07,609 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:44:07,609 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:44:07,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:44:07,609 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:44:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:44:07,626 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:44:08,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 722 proven. 1634 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:44:08,293 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:44:08,293 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:44:08,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:44:08,315 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:44:08,316 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:44:08,322 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:44:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 76 proven. 2280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:44:09,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:44:09,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 46] total 93 [2018-04-13 04:44:09,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-13 04:44:09,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-13 04:44:09,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=544, Invalid=8012, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 04:44:09,629 INFO L87 Difference]: Start difference. First operand 298 states and 358 transitions. Second operand 93 states. [2018-04-13 04:44:20,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:44:20,600 INFO L93 Difference]: Finished difference Result 898 states and 1020 transitions. [2018-04-13 04:44:20,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-04-13 04:44:20,600 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 288 [2018-04-13 04:44:20,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:44:20,601 INFO L225 Difference]: With dead ends: 898 [2018-04-13 04:44:20,601 INFO L226 Difference]: Without dead ends: 484 [2018-04-13 04:44:20,603 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18328 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=5656, Invalid=60136, Unknown=0, NotChecked=0, Total=65792 [2018-04-13 04:44:20,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-04-13 04:44:20,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 311. [2018-04-13 04:44:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-04-13 04:44:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 374 transitions. [2018-04-13 04:44:20,606 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 374 transitions. Word has length 288 [2018-04-13 04:44:20,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:44:20,606 INFO L459 AbstractCegarLoop]: Abstraction has 311 states and 374 transitions. [2018-04-13 04:44:20,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-13 04:44:20,606 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 374 transitions. [2018-04-13 04:44:20,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-04-13 04:44:20,607 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:44:20,607 INFO L355 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:44:20,607 INFO L408 AbstractCegarLoop]: === Iteration 65 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:44:20,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1887228081, now seen corresponding path program 27 times [2018-04-13 04:44:20,608 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:44:20,608 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:44:20,608 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:44:20,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:44:20,608 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:44:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:44:20,625 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:44:21,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2610 backedges. 80 proven. 2530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:44:21,472 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:44:21,472 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:44:21,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:44:21,882 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-04-13 04:44:21,882 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:44:21,903 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:44:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2610 backedges. 80 proven. 2530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:44:22,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:44:22,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-04-13 04:44:22,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-13 04:44:22,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-13 04:44:22,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 04:44:22,094 INFO L87 Difference]: Start difference. First operand 311 states and 374 transitions. Second operand 48 states. [2018-04-13 04:44:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:44:23,832 INFO L93 Difference]: Finished difference Result 654 states and 778 transitions. [2018-04-13 04:44:23,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 04:44:23,832 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 301 [2018-04-13 04:44:23,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:44:23,833 INFO L225 Difference]: With dead ends: 654 [2018-04-13 04:44:23,833 INFO L226 Difference]: Without dead ends: 316 [2018-04-13 04:44:23,833 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 300 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=181, Invalid=4649, Unknown=0, NotChecked=0, Total=4830 [2018-04-13 04:44:23,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-04-13 04:44:23,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2018-04-13 04:44:23,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-04-13 04:44:23,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 378 transitions. [2018-04-13 04:44:23,835 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 378 transitions. Word has length 301 [2018-04-13 04:44:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:44:23,835 INFO L459 AbstractCegarLoop]: Abstraction has 315 states and 378 transitions. [2018-04-13 04:44:23,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-13 04:44:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 378 transitions. [2018-04-13 04:44:23,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-04-13 04:44:23,836 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:44:23,836 INFO L355 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:44:23,836 INFO L408 AbstractCegarLoop]: === Iteration 66 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:44:23,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1207047570, now seen corresponding path program 28 times [2018-04-13 04:44:23,837 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:44:23,837 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:44:23,837 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:44:23,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:44:23,837 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:44:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:44:23,855 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:44:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2693 backedges. 882 proven. 1811 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:44:24,624 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:44:24,624 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:44:24,624 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:44:24,982 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:44:24,982 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:44:25,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:44:25,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:44:25,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:44:25,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:44:25,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:10, output treesize:3 [2018-04-13 04:44:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2693 backedges. 882 proven. 1811 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:44:25,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:44:25,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 54] total 81 [2018-04-13 04:44:25,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-13 04:44:25,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-13 04:44:25,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=931, Invalid=5711, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 04:44:25,906 INFO L87 Difference]: Start difference. First operand 315 states and 378 transitions. Second operand 82 states. [2018-04-13 04:44:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:44:28,766 INFO L93 Difference]: Finished difference Result 506 states and 573 transitions. [2018-04-13 04:44:28,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-13 04:44:28,767 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 305 [2018-04-13 04:44:28,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:44:28,767 INFO L225 Difference]: With dead ends: 506 [2018-04-13 04:44:28,768 INFO L226 Difference]: Without dead ends: 506 [2018-04-13 04:44:28,768 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 278 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6985 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3628, Invalid=18722, Unknown=0, NotChecked=0, Total=22350 [2018-04-13 04:44:28,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-04-13 04:44:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 324. [2018-04-13 04:44:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-04-13 04:44:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 390 transitions. [2018-04-13 04:44:28,771 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 390 transitions. Word has length 305 [2018-04-13 04:44:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:44:28,771 INFO L459 AbstractCegarLoop]: Abstraction has 324 states and 390 transitions. [2018-04-13 04:44:28,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-04-13 04:44:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 390 transitions. [2018-04-13 04:44:28,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-04-13 04:44:28,773 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:44:28,773 INFO L355 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:44:28,773 INFO L408 AbstractCegarLoop]: === Iteration 67 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:44:28,773 INFO L82 PathProgramCache]: Analyzing trace with hash -861732384, now seen corresponding path program 29 times [2018-04-13 04:44:28,773 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:44:28,774 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:44:28,774 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:44:28,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:44:28,774 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:44:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:44:28,794 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:44:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2877 backedges. 84 proven. 2793 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:44:29,690 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:44:29,690 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:44:29,690 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:44:29,952 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-04-13 04:44:29,953 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:44:29,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:44:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2877 backedges. 84 proven. 2793 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:44:30,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:44:30,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-04-13 04:44:30,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-13 04:44:30,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-13 04:44:30,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 04:44:30,106 INFO L87 Difference]: Start difference. First operand 324 states and 390 transitions. Second operand 50 states. [2018-04-13 04:44:31,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:44:31,944 INFO L93 Difference]: Finished difference Result 683 states and 813 transitions. [2018-04-13 04:44:31,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-13 04:44:31,945 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 314 [2018-04-13 04:44:31,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:44:31,945 INFO L225 Difference]: With dead ends: 683 [2018-04-13 04:44:31,945 INFO L226 Difference]: Without dead ends: 329 [2018-04-13 04:44:31,946 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 313 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=189, Invalid=5067, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 04:44:31,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-04-13 04:44:31,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 328. [2018-04-13 04:44:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-04-13 04:44:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 394 transitions. [2018-04-13 04:44:31,948 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 394 transitions. Word has length 314 [2018-04-13 04:44:31,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:44:31,948 INFO L459 AbstractCegarLoop]: Abstraction has 328 states and 394 transitions. [2018-04-13 04:44:31,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-13 04:44:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 394 transitions. [2018-04-13 04:44:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-04-13 04:44:31,949 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:44:31,949 INFO L355 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:44:31,949 INFO L408 AbstractCegarLoop]: === Iteration 68 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:44:31,949 INFO L82 PathProgramCache]: Analyzing trace with hash 388341885, now seen corresponding path program 30 times [2018-04-13 04:44:31,949 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:44:31,949 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:44:31,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:44:31,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:44:31,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:44:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:44:31,970 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:44:32,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 968 proven. 1996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:44:32,783 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:44:32,783 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:44:32,784 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:44:33,366 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2018-04-13 04:44:33,367 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:44:33,436 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:44:33,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:44:33,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:44:33,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:44:33,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 04:44:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 882 proven. 2081 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-13 04:44:33,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:44:33,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 50] total 60 [2018-04-13 04:44:33,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-13 04:44:33,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-13 04:44:33,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=610, Invalid=3050, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 04:44:33,713 INFO L87 Difference]: Start difference. First operand 328 states and 394 transitions. Second operand 61 states. [2018-04-13 04:44:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:44:36,327 INFO L93 Difference]: Finished difference Result 548 states and 621 transitions. [2018-04-13 04:44:36,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-13 04:44:36,327 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 318 [2018-04-13 04:44:36,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:44:36,328 INFO L225 Difference]: With dead ends: 548 [2018-04-13 04:44:36,328 INFO L226 Difference]: Without dead ends: 548 [2018-04-13 04:44:36,329 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5038 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3307, Invalid=14249, Unknown=0, NotChecked=0, Total=17556 [2018-04-13 04:44:36,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-04-13 04:44:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 346. [2018-04-13 04:44:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-04-13 04:44:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 418 transitions. [2018-04-13 04:44:36,332 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 418 transitions. Word has length 318 [2018-04-13 04:44:36,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:44:36,332 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 418 transitions. [2018-04-13 04:44:36,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-13 04:44:36,332 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 418 transitions. [2018-04-13 04:44:36,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-04-13 04:44:36,333 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:44:36,333 INFO L355 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:44:36,333 INFO L408 AbstractCegarLoop]: === Iteration 69 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:44:36,333 INFO L82 PathProgramCache]: Analyzing trace with hash -584526979, now seen corresponding path program 31 times [2018-04-13 04:44:36,333 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:44:36,333 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:44:36,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:44:36,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:44:36,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:44:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:44:36,355 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:44:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3359 backedges. 286 proven. 3069 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:44:37,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:44:37,373 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:44:37,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:44:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:44:37,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:44:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3359 backedges. 286 proven. 3069 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:44:37,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:44:37,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-04-13 04:44:37,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-13 04:44:37,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-13 04:44:37,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 04:44:37,539 INFO L87 Difference]: Start difference. First operand 346 states and 418 transitions. Second operand 52 states. [2018-04-13 04:44:39,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:44:39,489 INFO L93 Difference]: Finished difference Result 721 states and 860 transitions. [2018-04-13 04:44:39,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-13 04:44:39,489 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 336 [2018-04-13 04:44:39,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:44:39,490 INFO L225 Difference]: With dead ends: 721 [2018-04-13 04:44:39,490 INFO L226 Difference]: Without dead ends: 351 [2018-04-13 04:44:39,490 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 335 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=197, Invalid=5503, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 04:44:39,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-13 04:44:39,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 350. [2018-04-13 04:44:39,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-04-13 04:44:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 422 transitions. [2018-04-13 04:44:39,492 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 422 transitions. Word has length 336 [2018-04-13 04:44:39,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:44:39,492 INFO L459 AbstractCegarLoop]: Abstraction has 350 states and 422 transitions. [2018-04-13 04:44:39,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-13 04:44:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 422 transitions. [2018-04-13 04:44:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-04-13 04:44:39,493 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:44:39,494 INFO L355 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:44:39,494 INFO L408 AbstractCegarLoop]: === Iteration 70 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:44:39,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1758728614, now seen corresponding path program 32 times [2018-04-13 04:44:39,494 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:44:39,494 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:44:39,494 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:44:39,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:44:39,495 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:44:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:44:39,515 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:44:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3450 backedges. 92 proven. 3358 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:44:40,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:44:40,584 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:44:40,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:44:40,652 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:44:40,652 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:44:40,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:44:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3450 backedges. 92 proven. 3358 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:44:40,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:44:40,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-04-13 04:44:40,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-13 04:44:40,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-13 04:44:40,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 04:44:40,801 INFO L87 Difference]: Start difference. First operand 350 states and 422 transitions. Second operand 54 states. [2018-04-13 04:44:42,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:44:42,923 INFO L93 Difference]: Finished difference Result 741 states and 883 transitions. [2018-04-13 04:44:42,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-13 04:44:42,923 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 340 [2018-04-13 04:44:42,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:44:42,924 INFO L225 Difference]: With dead ends: 741 [2018-04-13 04:44:42,924 INFO L226 Difference]: Without dead ends: 355 [2018-04-13 04:44:42,924 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 339 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=205, Invalid=5957, Unknown=0, NotChecked=0, Total=6162 [2018-04-13 04:44:42,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-04-13 04:44:42,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 354. [2018-04-13 04:44:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-04-13 04:44:42,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 426 transitions. [2018-04-13 04:44:42,926 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 426 transitions. Word has length 340 [2018-04-13 04:44:42,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:44:42,927 INFO L459 AbstractCegarLoop]: Abstraction has 354 states and 426 transitions. [2018-04-13 04:44:42,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-13 04:44:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 426 transitions. [2018-04-13 04:44:42,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-04-13 04:44:42,928 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:44:42,928 INFO L355 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:44:42,928 INFO L408 AbstractCegarLoop]: === Iteration 71 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:44:42,929 INFO L82 PathProgramCache]: Analyzing trace with hash 305943223, now seen corresponding path program 33 times [2018-04-13 04:44:42,929 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:44:42,929 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:44:42,929 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:44:42,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:44:42,929 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:44:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:44:42,954 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:44:43,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3545 backedges. 1152 proven. 2393 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:44:43,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:44:43,899 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:44:43,899 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:44:44,707 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-04-13 04:44:44,707 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:44:44,725 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:44:44,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:44:44,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:44:44,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:44:44,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 04:44:44,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:44:44,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:44:44,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:44:44,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:44:44,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:44:44,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-13 04:44:47,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-04-13 04:44:47,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2018-04-13 04:44:47,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:44:47,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-13 04:44:47,720 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:44:47,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-13 04:44:47,721 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:44:47,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:44:47,731 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 04:44:47,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:44:47,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:44:47,739 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-04-13 04:44:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3545 backedges. 0 proven. 2369 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-04-13 04:44:48,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:44:48,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 63] total 119 [2018-04-13 04:44:48,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-04-13 04:44:48,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-04-13 04:44:48,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=851, Invalid=13429, Unknown=0, NotChecked=0, Total=14280 [2018-04-13 04:44:48,132 INFO L87 Difference]: Start difference. First operand 354 states and 426 transitions. Second operand 120 states. [2018-04-13 04:45:08,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:45:08,178 INFO L93 Difference]: Finished difference Result 981 states and 1132 transitions. [2018-04-13 04:45:08,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-04-13 04:45:08,178 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 344 [2018-04-13 04:45:08,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:45:08,180 INFO L225 Difference]: With dead ends: 981 [2018-04-13 04:45:08,180 INFO L226 Difference]: Without dead ends: 981 [2018-04-13 04:45:08,182 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 284 SyntacticMatches, 1 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24928 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=8034, Invalid=82266, Unknown=0, NotChecked=0, Total=90300 [2018-04-13 04:45:08,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-04-13 04:45:08,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 363. [2018-04-13 04:45:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-04-13 04:45:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 438 transitions. [2018-04-13 04:45:08,187 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 438 transitions. Word has length 344 [2018-04-13 04:45:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:45:08,188 INFO L459 AbstractCegarLoop]: Abstraction has 363 states and 438 transitions. [2018-04-13 04:45:08,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-04-13 04:45:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 438 transitions. [2018-04-13 04:45:08,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-04-13 04:45:08,189 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:45:08,190 INFO L355 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:45:08,190 INFO L408 AbstractCegarLoop]: === Iteration 72 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:45:08,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1003831717, now seen corresponding path program 34 times [2018-04-13 04:45:08,190 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:45:08,190 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:45:08,191 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:45:08,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:45:08,191 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:45:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:45:08,218 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:45:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3756 backedges. 96 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:45:09,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:45:09,335 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:45:09,336 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:45:09,801 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:45:09,801 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:45:09,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:45:09,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:45:09,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:45:09,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:45:09,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:10, output treesize:3 [2018-04-13 04:45:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3756 backedges. 1152 proven. 2604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:45:12,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:45:12,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 61] total 116 [2018-04-13 04:45:12,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-04-13 04:45:12,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-04-13 04:45:12,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=12557, Unknown=0, NotChecked=0, Total=13340 [2018-04-13 04:45:12,933 INFO L87 Difference]: Start difference. First operand 363 states and 438 transitions. Second operand 116 states. [2018-04-13 04:45:31,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:45:31,034 INFO L93 Difference]: Finished difference Result 1109 states and 1261 transitions. [2018-04-13 04:45:31,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-04-13 04:45:31,035 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 353 [2018-04-13 04:45:31,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:45:31,036 INFO L225 Difference]: With dead ends: 1109 [2018-04-13 04:45:31,036 INFO L226 Difference]: Without dead ends: 592 [2018-04-13 04:45:31,038 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26596 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=8198, Invalid=95164, Unknown=0, NotChecked=0, Total=103362 [2018-04-13 04:45:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-04-13 04:45:31,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 376. [2018-04-13 04:45:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-04-13 04:45:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 454 transitions. [2018-04-13 04:45:31,043 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 454 transitions. Word has length 353 [2018-04-13 04:45:31,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:45:31,043 INFO L459 AbstractCegarLoop]: Abstraction has 376 states and 454 transitions. [2018-04-13 04:45:31,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-04-13 04:45:31,043 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 454 transitions. [2018-04-13 04:45:31,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-04-13 04:45:31,045 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:45:31,045 INFO L355 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:45:31,045 INFO L408 AbstractCegarLoop]: === Iteration 73 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:45:31,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1304216620, now seen corresponding path program 35 times [2018-04-13 04:45:31,045 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:45:31,045 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:45:31,046 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:45:31,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:45:31,046 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:45:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:45:31,081 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:45:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4075 backedges. 100 proven. 3975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:45:32,327 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:45:32,327 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:45:32,327 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:45:32,624 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2018-04-13 04:45:32,625 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:45:32,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:45:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4075 backedges. 100 proven. 3975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:45:32,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:45:32,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-04-13 04:45:32,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-13 04:45:32,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-13 04:45:32,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 04:45:32,814 INFO L87 Difference]: Start difference. First operand 376 states and 454 transitions. Second operand 58 states. [2018-04-13 04:45:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:45:35,265 INFO L93 Difference]: Finished difference Result 799 states and 953 transitions. [2018-04-13 04:45:35,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-13 04:45:35,265 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 366 [2018-04-13 04:45:35,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:45:35,266 INFO L225 Difference]: With dead ends: 799 [2018-04-13 04:45:35,266 INFO L226 Difference]: Without dead ends: 381 [2018-04-13 04:45:35,267 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 365 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=221, Invalid=6919, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 04:45:35,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-04-13 04:45:35,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 380. [2018-04-13 04:45:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-04-13 04:45:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 458 transitions. [2018-04-13 04:45:35,269 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 458 transitions. Word has length 366 [2018-04-13 04:45:35,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:45:35,269 INFO L459 AbstractCegarLoop]: Abstraction has 380 states and 458 transitions. [2018-04-13 04:45:35,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-13 04:45:35,269 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 458 transitions. [2018-04-13 04:45:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-04-13 04:45:35,270 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:45:35,270 INFO L355 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:45:35,270 INFO L408 AbstractCegarLoop]: === Iteration 74 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:45:35,270 INFO L82 PathProgramCache]: Analyzing trace with hash -162417167, now seen corresponding path program 36 times [2018-04-13 04:45:35,270 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:45:35,270 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:45:35,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:45:35,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:45:35,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:45:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:45:35,296 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:45:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4178 backedges. 1352 proven. 2826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:45:36,369 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:45:36,369 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:45:36,370 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:45:37,249 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-04-13 04:45:37,249 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:45:37,328 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:45:37,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:45:37,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:45:37,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:45:37,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 04:45:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4178 backedges. 1352 proven. 2826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:45:37,549 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:45:37,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 59] total 62 [2018-04-13 04:45:37,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-13 04:45:37,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-13 04:45:37,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=775, Invalid=3131, Unknown=0, NotChecked=0, Total=3906 [2018-04-13 04:45:37,550 INFO L87 Difference]: Start difference. First operand 380 states and 458 transitions. Second operand 63 states. [2018-04-13 04:45:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:45:40,195 INFO L93 Difference]: Finished difference Result 618 states and 700 transitions. [2018-04-13 04:45:40,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-04-13 04:45:40,195 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 370 [2018-04-13 04:45:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:45:40,196 INFO L225 Difference]: With dead ends: 618 [2018-04-13 04:45:40,196 INFO L226 Difference]: Without dead ends: 618 [2018-04-13 04:45:40,197 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 370 SyntacticMatches, 2 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6164 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3966, Invalid=16056, Unknown=0, NotChecked=0, Total=20022 [2018-04-13 04:45:40,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-04-13 04:45:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 389. [2018-04-13 04:45:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-04-13 04:45:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 470 transitions. [2018-04-13 04:45:40,200 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 470 transitions. Word has length 370 [2018-04-13 04:45:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:45:40,200 INFO L459 AbstractCegarLoop]: Abstraction has 389 states and 470 transitions. [2018-04-13 04:45:40,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-13 04:45:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 470 transitions. [2018-04-13 04:45:40,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-04-13 04:45:40,201 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:45:40,201 INFO L355 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:45:40,201 INFO L408 AbstractCegarLoop]: === Iteration 75 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:45:40,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1729649761, now seen corresponding path program 37 times [2018-04-13 04:45:40,201 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:45:40,201 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:45:40,202 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:45:40,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:45:40,202 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:45:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:45:40,224 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:45:41,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4407 backedges. 104 proven. 4303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:45:41,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:45:41,482 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:45:41,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:45:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:45:41,515 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:45:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4407 backedges. 104 proven. 4303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:45:41,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:45:41,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-04-13 04:45:41,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-13 04:45:41,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-13 04:45:41,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-04-13 04:45:41,681 INFO L87 Difference]: Start difference. First operand 389 states and 470 transitions. Second operand 60 states. [2018-04-13 04:45:44,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:45:44,359 INFO L93 Difference]: Finished difference Result 828 states and 988 transitions. [2018-04-13 04:45:44,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-13 04:45:44,359 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 379 [2018-04-13 04:45:44,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:45:44,360 INFO L225 Difference]: With dead ends: 828 [2018-04-13 04:45:44,360 INFO L226 Difference]: Without dead ends: 394 [2018-04-13 04:45:44,360 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 378 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=229, Invalid=7427, Unknown=0, NotChecked=0, Total=7656 [2018-04-13 04:45:44,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-04-13 04:45:44,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2018-04-13 04:45:44,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-04-13 04:45:44,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 474 transitions. [2018-04-13 04:45:44,362 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 474 transitions. Word has length 379 [2018-04-13 04:45:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:45:44,362 INFO L459 AbstractCegarLoop]: Abstraction has 393 states and 474 transitions. [2018-04-13 04:45:44,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-13 04:45:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 474 transitions. [2018-04-13 04:45:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-04-13 04:45:44,363 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:45:44,364 INFO L355 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:45:44,364 INFO L408 AbstractCegarLoop]: === Iteration 76 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:45:44,364 INFO L82 PathProgramCache]: Analyzing trace with hash -234882716, now seen corresponding path program 38 times [2018-04-13 04:45:44,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:45:44,364 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:45:44,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:45:44,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:45:44,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:45:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:45:44,389 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:45:45,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 1458 proven. 3056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:45:45,522 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:45:45,522 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:45:45,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:45:46,035 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:45:46,035 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:45:46,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:45:46,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:45:46,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:45:46,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:45:46,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:10, output treesize:3 [2018-04-13 04:45:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 1458 proven. 3056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:45:47,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:45:47,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 65] total 98 [2018-04-13 04:45:47,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-13 04:45:47,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-13 04:45:47,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1430, Invalid=8272, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 04:45:47,311 INFO L87 Difference]: Start difference. First operand 393 states and 474 transitions. Second operand 99 states. [2018-04-13 04:45:51,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:45:51,845 INFO L93 Difference]: Finished difference Result 634 states and 719 transitions. [2018-04-13 04:45:51,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-04-13 04:45:51,846 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 383 [2018-04-13 04:45:51,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:45:51,847 INFO L225 Difference]: With dead ends: 634 [2018-04-13 04:45:51,847 INFO L226 Difference]: Without dead ends: 634 [2018-04-13 04:45:51,848 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10225 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5474, Invalid=27106, Unknown=0, NotChecked=0, Total=32580 [2018-04-13 04:45:51,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-04-13 04:45:51,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 402. [2018-04-13 04:45:51,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-04-13 04:45:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 486 transitions. [2018-04-13 04:45:51,851 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 486 transitions. Word has length 383 [2018-04-13 04:45:51,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:45:51,851 INFO L459 AbstractCegarLoop]: Abstraction has 402 states and 486 transitions. [2018-04-13 04:45:51,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-13 04:45:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 486 transitions. [2018-04-13 04:45:51,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-04-13 04:45:51,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:45:51,852 INFO L355 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:45:51,852 INFO L408 AbstractCegarLoop]: === Iteration 77 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:45:51,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1530705330, now seen corresponding path program 39 times [2018-04-13 04:45:51,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:45:51,852 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:45:51,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:45:51,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:45:51,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:45:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:45:51,877 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:45:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4752 backedges. 108 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:45:53,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:45:53,237 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:45:53,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:45:54,046 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-04-13 04:45:54,046 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:45:54,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:45:54,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4752 backedges. 108 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:45:54,263 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:45:54,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-04-13 04:45:54,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-13 04:45:54,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-13 04:45:54,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 04:45:54,264 INFO L87 Difference]: Start difference. First operand 402 states and 486 transitions. Second operand 62 states. [2018-04-13 04:45:57,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:45:57,050 INFO L93 Difference]: Finished difference Result 857 states and 1023 transitions. [2018-04-13 04:45:57,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-13 04:45:57,050 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 392 [2018-04-13 04:45:57,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:45:57,052 INFO L225 Difference]: With dead ends: 857 [2018-04-13 04:45:57,052 INFO L226 Difference]: Without dead ends: 407 [2018-04-13 04:45:57,052 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 391 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=237, Invalid=7953, Unknown=0, NotChecked=0, Total=8190 [2018-04-13 04:45:57,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-04-13 04:45:57,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 406. [2018-04-13 04:45:57,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-04-13 04:45:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 490 transitions. [2018-04-13 04:45:57,054 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 490 transitions. Word has length 392 [2018-04-13 04:45:57,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:45:57,055 INFO L459 AbstractCegarLoop]: Abstraction has 406 states and 490 transitions. [2018-04-13 04:45:57,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-13 04:45:57,055 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 490 transitions. [2018-04-13 04:45:57,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-04-13 04:45:57,056 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:45:57,056 INFO L355 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:45:57,056 INFO L408 AbstractCegarLoop]: === Iteration 78 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:45:57,056 INFO L82 PathProgramCache]: Analyzing trace with hash -209966549, now seen corresponding path program 40 times [2018-04-13 04:45:57,056 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:45:57,056 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:45:57,056 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:45:57,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:45:57,057 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:45:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:45:57,082 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:45:58,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4863 backedges. 1568 proven. 3295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:45:58,308 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:45:58,308 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:45:58,309 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:45:58,903 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:45:58,903 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:45:58,958 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:45:58,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:45:58,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:45:58,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:45:58,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 04:45:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4863 backedges. 1568 proven. 3295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:45:59,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:45:59,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 63] total 66 [2018-04-13 04:45:59,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-13 04:45:59,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-13 04:45:59,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=889, Invalid=3533, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 04:45:59,184 INFO L87 Difference]: Start difference. First operand 406 states and 490 transitions. Second operand 67 states. [2018-04-13 04:46:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:46:02,352 INFO L93 Difference]: Finished difference Result 662 states and 750 transitions. [2018-04-13 04:46:02,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-04-13 04:46:02,352 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 396 [2018-04-13 04:46:02,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:46:02,353 INFO L225 Difference]: With dead ends: 662 [2018-04-13 04:46:02,353 INFO L226 Difference]: Without dead ends: 662 [2018-04-13 04:46:02,354 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 397 SyntacticMatches, 1 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7060 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4577, Invalid=18375, Unknown=0, NotChecked=0, Total=22952 [2018-04-13 04:46:02,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-04-13 04:46:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 415. [2018-04-13 04:46:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-04-13 04:46:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 502 transitions. [2018-04-13 04:46:02,357 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 502 transitions. Word has length 396 [2018-04-13 04:46:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:46:02,357 INFO L459 AbstractCegarLoop]: Abstraction has 415 states and 502 transitions. [2018-04-13 04:46:02,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-13 04:46:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 502 transitions. [2018-04-13 04:46:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-04-13 04:46:02,358 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:46:02,358 INFO L355 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:46:02,358 INFO L408 AbstractCegarLoop]: === Iteration 79 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:46:02,358 INFO L82 PathProgramCache]: Analyzing trace with hash 957614439, now seen corresponding path program 41 times [2018-04-13 04:46:02,358 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:46:02,358 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:46:02,359 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:46:02,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:46:02,359 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:46:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:46:02,385 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:46:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5110 backedges. 1568 proven. 3542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:46:03,548 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:46:03,548 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:46:03,548 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:46:04,041 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-04-13 04:46:04,041 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:46:04,066 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:46:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5110 backedges. 112 proven. 4998 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:46:06,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:46:06,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 64] total 129 [2018-04-13 04:46:06,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-04-13 04:46:06,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-04-13 04:46:06,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1012, Invalid=15500, Unknown=0, NotChecked=0, Total=16512 [2018-04-13 04:46:06,616 INFO L87 Difference]: Start difference. First operand 415 states and 502 transitions. Second operand 129 states. [2018-04-13 04:46:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:46:27,645 INFO L93 Difference]: Finished difference Result 1281 states and 1457 transitions. [2018-04-13 04:46:27,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2018-04-13 04:46:27,645 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 405 [2018-04-13 04:46:27,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:46:27,646 INFO L225 Difference]: With dead ends: 1281 [2018-04-13 04:46:27,646 INFO L226 Difference]: Without dead ends: 680 [2018-04-13 04:46:27,650 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37583 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=10854, Invalid=120552, Unknown=0, NotChecked=0, Total=131406 [2018-04-13 04:46:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2018-04-13 04:46:27,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 428. [2018-04-13 04:46:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-04-13 04:46:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 518 transitions. [2018-04-13 04:46:27,653 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 518 transitions. Word has length 405 [2018-04-13 04:46:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:46:27,654 INFO L459 AbstractCegarLoop]: Abstraction has 428 states and 518 transitions. [2018-04-13 04:46:27,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-04-13 04:46:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 518 transitions. [2018-04-13 04:46:27,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-04-13 04:46:27,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:46:27,656 INFO L355 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:46:27,656 INFO L408 AbstractCegarLoop]: === Iteration 80 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:46:27,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1104774712, now seen corresponding path program 42 times [2018-04-13 04:46:27,656 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:46:27,656 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:46:27,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:46:27,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:46:27,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:46:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:46:27,688 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:46:29,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5481 backedges. 116 proven. 5365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:46:29,224 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:46:29,224 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:46:29,224 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:46:30,437 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2018-04-13 04:46:30,438 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:46:30,466 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:46:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5481 backedges. 116 proven. 5365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:46:30,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:46:30,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-04-13 04:46:30,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-13 04:46:30,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-13 04:46:30,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 04:46:30,677 INFO L87 Difference]: Start difference. First operand 428 states and 518 transitions. Second operand 66 states. [2018-04-13 04:46:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:46:33,911 INFO L93 Difference]: Finished difference Result 915 states and 1093 transitions. [2018-04-13 04:46:33,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-13 04:46:33,911 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 418 [2018-04-13 04:46:33,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:46:33,912 INFO L225 Difference]: With dead ends: 915 [2018-04-13 04:46:33,912 INFO L226 Difference]: Without dead ends: 433 [2018-04-13 04:46:33,912 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 417 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=253, Invalid=9059, Unknown=0, NotChecked=0, Total=9312 [2018-04-13 04:46:33,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-04-13 04:46:33,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 432. [2018-04-13 04:46:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-04-13 04:46:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 522 transitions. [2018-04-13 04:46:33,914 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 522 transitions. Word has length 418 [2018-04-13 04:46:33,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:46:33,914 INFO L459 AbstractCegarLoop]: Abstraction has 432 states and 522 transitions. [2018-04-13 04:46:33,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-13 04:46:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 522 transitions. [2018-04-13 04:46:33,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-04-13 04:46:33,915 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:46:33,915 INFO L355 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:46:33,916 INFO L408 AbstractCegarLoop]: === Iteration 81 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:46:33,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1351479451, now seen corresponding path program 43 times [2018-04-13 04:46:33,916 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:46:33,916 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:46:33,916 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:46:33,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:46:33,916 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:46:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:46:33,944 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:46:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5600 backedges. 1800 proven. 3800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:46:35,323 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:46:35,323 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:46:35,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:46:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:46:36,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:46:36,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:46:36,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:46:36,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:46:36,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 04:46:36,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5600 backedges. 1800 proven. 3800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:46:36,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:46:36,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 67] total 70 [2018-04-13 04:46:36,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-13 04:46:36,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-13 04:46:36,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1011, Invalid=3959, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 04:46:36,650 INFO L87 Difference]: Start difference. First operand 432 states and 522 transitions. Second operand 71 states. [2018-04-13 04:46:40,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:46:40,002 INFO L93 Difference]: Finished difference Result 706 states and 800 transitions. [2018-04-13 04:46:40,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-04-13 04:46:40,002 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 422 [2018-04-13 04:46:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:46:40,003 INFO L225 Difference]: With dead ends: 706 [2018-04-13 04:46:40,003 INFO L226 Difference]: Without dead ends: 706 [2018-04-13 04:46:40,004 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 423 SyntacticMatches, 1 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8075 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5232, Invalid=20850, Unknown=0, NotChecked=0, Total=26082 [2018-04-13 04:46:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2018-04-13 04:46:40,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 441. [2018-04-13 04:46:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-04-13 04:46:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 534 transitions. [2018-04-13 04:46:40,007 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 534 transitions. Word has length 422 [2018-04-13 04:46:40,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:46:40,008 INFO L459 AbstractCegarLoop]: Abstraction has 441 states and 534 transitions. [2018-04-13 04:46:40,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-13 04:46:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 534 transitions. [2018-04-13 04:46:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-04-13 04:46:40,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:46:40,009 INFO L355 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:46:40,009 INFO L408 AbstractCegarLoop]: === Iteration 82 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:46:40,009 INFO L82 PathProgramCache]: Analyzing trace with hash 731080045, now seen corresponding path program 44 times [2018-04-13 04:46:40,009 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:46:40,009 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:46:40,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:46:40,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:46:40,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:46:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:46:40,038 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:46:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5865 backedges. 1800 proven. 4065 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:46:41,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:46:41,698 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:46:41,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:46:41,757 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:46:41,758 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:46:41,771 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:46:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5865 backedges. 120 proven. 5745 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:46:45,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:46:45,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 68] total 140 [2018-04-13 04:46:45,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-04-13 04:46:45,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-04-13 04:46:45,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=745, Invalid=18715, Unknown=0, NotChecked=0, Total=19460 [2018-04-13 04:46:45,220 INFO L87 Difference]: Start difference. First operand 441 states and 534 transitions. Second operand 140 states. [2018-04-13 04:47:05,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:47:05,848 INFO L93 Difference]: Finished difference Result 1255 states and 1443 transitions. [2018-04-13 04:47:05,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-04-13 04:47:05,848 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 431 [2018-04-13 04:47:05,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:47:05,850 INFO L225 Difference]: With dead ends: 1255 [2018-04-13 04:47:05,850 INFO L226 Difference]: Without dead ends: 668 [2018-04-13 04:47:05,851 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15938 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=2110, Invalid=73240, Unknown=0, NotChecked=0, Total=75350 [2018-04-13 04:47:05,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-04-13 04:47:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 454. [2018-04-13 04:47:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-04-13 04:47:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 550 transitions. [2018-04-13 04:47:05,854 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 550 transitions. Word has length 431 [2018-04-13 04:47:05,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:47:05,854 INFO L459 AbstractCegarLoop]: Abstraction has 454 states and 550 transitions. [2018-04-13 04:47:05,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-04-13 04:47:05,854 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 550 transitions. [2018-04-13 04:47:05,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-04-13 04:47:05,856 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:47:05,856 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:47:05,856 INFO L408 AbstractCegarLoop]: === Iteration 83 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:47:05,856 INFO L82 PathProgramCache]: Analyzing trace with hash -2004407742, now seen corresponding path program 45 times [2018-04-13 04:47:05,856 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:47:05,856 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:47:05,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:47:05,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:47:05,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:47:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:47:05,885 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:47:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6262 backedges. 1922 proven. 4340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:47:07,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:47:07,345 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:47:07,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:47:08,536 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-04-13 04:47:08,536 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:47:08,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:47:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6262 backedges. 124 proven. 6138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:47:11,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:47:11,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 70] total 141 [2018-04-13 04:47:11,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-04-13 04:47:11,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-04-13 04:47:11,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1240, Invalid=18500, Unknown=0, NotChecked=0, Total=19740 [2018-04-13 04:47:11,496 INFO L87 Difference]: Start difference. First operand 454 states and 550 transitions. Second operand 141 states. [2018-04-13 04:47:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:47:35,342 INFO L93 Difference]: Finished difference Result 1414 states and 1608 transitions. [2018-04-13 04:47:35,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 265 states. [2018-04-13 04:47:35,342 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 444 [2018-04-13 04:47:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:47:35,344 INFO L225 Difference]: With dead ends: 1414 [2018-04-13 04:47:35,345 INFO L226 Difference]: Without dead ends: 748 [2018-04-13 04:47:35,348 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 778 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46426 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=13636, Invalid=146764, Unknown=0, NotChecked=0, Total=160400 [2018-04-13 04:47:35,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-04-13 04:47:35,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 467. [2018-04-13 04:47:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-04-13 04:47:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 566 transitions. [2018-04-13 04:47:35,352 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 566 transitions. Word has length 444 [2018-04-13 04:47:35,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:47:35,352 INFO L459 AbstractCegarLoop]: Abstraction has 467 states and 566 transitions. [2018-04-13 04:47:35,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-04-13 04:47:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 566 transitions. [2018-04-13 04:47:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-04-13 04:47:35,353 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:47:35,354 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:47:35,354 INFO L408 AbstractCegarLoop]: === Iteration 84 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:47:35,354 INFO L82 PathProgramCache]: Analyzing trace with hash 476844147, now seen corresponding path program 46 times [2018-04-13 04:47:35,354 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:47:35,354 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:47:35,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:47:35,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:47:35,355 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:47:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:47:35,386 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:47:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6672 backedges. 2048 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:47:36,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:47:36,926 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:47:36,926 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:47:37,849 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:47:37,849 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:47:37,952 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:47:37,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:47:37,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:47:37,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:47:37,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 04:47:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6672 backedges. 2048 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:47:38,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:47:38,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 72] total 75 [2018-04-13 04:47:38,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-13 04:47:38,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-13 04:47:38,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1143, Invalid=4557, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 04:47:38,208 INFO L87 Difference]: Start difference. First operand 467 states and 566 transitions. Second operand 76 states. [2018-04-13 04:47:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:47:42,295 INFO L93 Difference]: Finished difference Result 766 states and 869 transitions. [2018-04-13 04:47:42,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-04-13 04:47:42,296 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 457 [2018-04-13 04:47:42,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:47:42,297 INFO L225 Difference]: With dead ends: 766 [2018-04-13 04:47:42,297 INFO L226 Difference]: Without dead ends: 766 [2018-04-13 04:47:42,298 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 458 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9451 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6002, Invalid=24448, Unknown=0, NotChecked=0, Total=30450 [2018-04-13 04:47:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2018-04-13 04:47:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 476. [2018-04-13 04:47:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-04-13 04:47:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 578 transitions. [2018-04-13 04:47:42,302 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 578 transitions. Word has length 457 [2018-04-13 04:47:42,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:47:42,303 INFO L459 AbstractCegarLoop]: Abstraction has 476 states and 578 transitions. [2018-04-13 04:47:42,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-13 04:47:42,303 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 578 transitions. [2018-04-13 04:47:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-04-13 04:47:42,304 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:47:42,304 INFO L355 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:47:42,304 INFO L408 AbstractCegarLoop]: === Iteration 85 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:47:42,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1565439007, now seen corresponding path program 47 times [2018-04-13 04:47:42,304 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:47:42,304 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:47:42,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:47:42,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:47:42,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:47:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:47:42,336 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:47:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6964 backedges. 416 proven. 6544 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:47:44,160 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:47:44,160 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:47:44,161 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:47:44,931 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2018-04-13 04:47:44,932 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:47:44,963 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:47:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6964 backedges. 416 proven. 6544 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:47:45,190 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:47:45,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-04-13 04:47:45,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-13 04:47:45,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-13 04:47:45,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 04:47:45,191 INFO L87 Difference]: Start difference. First operand 476 states and 578 transitions. Second operand 72 states. [2018-04-13 04:47:49,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:47:49,067 INFO L93 Difference]: Finished difference Result 1011 states and 1210 transitions. [2018-04-13 04:47:49,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-13 04:47:49,067 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 466 [2018-04-13 04:47:49,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:47:49,068 INFO L225 Difference]: With dead ends: 1011 [2018-04-13 04:47:49,068 INFO L226 Difference]: Without dead ends: 481 [2018-04-13 04:47:49,068 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 465 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=277, Invalid=10853, Unknown=0, NotChecked=0, Total=11130 [2018-04-13 04:47:49,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-04-13 04:47:49,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 480. [2018-04-13 04:47:49,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-04-13 04:47:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 582 transitions. [2018-04-13 04:47:49,071 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 582 transitions. Word has length 466 [2018-04-13 04:47:49,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:47:49,071 INFO L459 AbstractCegarLoop]: Abstraction has 480 states and 582 transitions. [2018-04-13 04:47:49,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-13 04:47:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 582 transitions. [2018-04-13 04:47:49,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-04-13 04:47:49,072 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:47:49,072 INFO L355 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:47:49,072 INFO L408 AbstractCegarLoop]: === Iteration 86 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:47:49,073 INFO L82 PathProgramCache]: Analyzing trace with hash 983546812, now seen corresponding path program 48 times [2018-04-13 04:47:49,073 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:47:49,073 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:47:49,073 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:47:49,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:47:49,073 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:47:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:47:49,104 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:47:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 7095 backedges. 2178 proven. 4917 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:47:50,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:47:50,707 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:47:50,708 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:47:53,175 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-04-13 04:47:53,175 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:47:53,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:47:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7095 backedges. 132 proven. 6963 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:47:56,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:47:56,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 75] total 150 [2018-04-13 04:47:56,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-04-13 04:47:56,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-04-13 04:47:56,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=20963, Unknown=0, NotChecked=0, Total=22350 [2018-04-13 04:47:56,597 INFO L87 Difference]: Start difference. First operand 480 states and 582 transitions. Second operand 150 states. [2018-04-13 04:48:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:48:24,571 INFO L93 Difference]: Finished difference Result 1497 states and 1702 transitions. [2018-04-13 04:48:24,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 282 states. [2018-04-13 04:48:24,571 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 470 [2018-04-13 04:48:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:48:24,573 INFO L225 Difference]: With dead ends: 1497 [2018-04-13 04:48:24,573 INFO L226 Difference]: Without dead ends: 792 [2018-04-13 04:48:24,578 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 425 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52729 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=15321, Invalid=166581, Unknown=0, NotChecked=0, Total=181902 [2018-04-13 04:48:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-04-13 04:48:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 493. [2018-04-13 04:48:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-04-13 04:48:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 598 transitions. [2018-04-13 04:48:24,582 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 598 transitions. Word has length 470 [2018-04-13 04:48:24,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:48:24,582 INFO L459 AbstractCegarLoop]: Abstraction has 493 states and 598 transitions. [2018-04-13 04:48:24,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-04-13 04:48:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 598 transitions. [2018-04-13 04:48:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-04-13 04:48:24,584 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:48:24,584 INFO L355 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:48:24,584 INFO L408 AbstractCegarLoop]: === Iteration 87 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:48:24,584 INFO L82 PathProgramCache]: Analyzing trace with hash -472667527, now seen corresponding path program 49 times [2018-04-13 04:48:24,585 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:48:24,585 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:48:24,585 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:48:24,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:48:24,585 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:48:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:48:24,623 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:48:26,358 INFO L134 CoverageAnalysis]: Checked inductivity of 7531 backedges. 2312 proven. 5219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:48:26,359 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:48:26,359 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:48:26,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:48:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:48:26,444 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:48:30,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7531 backedges. 136 proven. 7395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:48:30,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:48:30,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 76] total 153 [2018-04-13 04:48:30,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-04-13 04:48:30,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-04-13 04:48:30,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1363, Invalid=21893, Unknown=0, NotChecked=0, Total=23256 [2018-04-13 04:48:30,053 INFO L87 Difference]: Start difference. First operand 493 states and 598 transitions. Second operand 153 states. [2018-04-13 04:49:01,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:49:01,788 INFO L93 Difference]: Finished difference Result 1531 states and 1743 transitions. [2018-04-13 04:49:01,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 283 states. [2018-04-13 04:49:01,788 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 483 [2018-04-13 04:49:01,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:49:01,790 INFO L225 Difference]: With dead ends: 1531 [2018-04-13 04:49:01,790 INFO L226 Difference]: Without dead ends: 808 [2018-04-13 04:49:01,794 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 429 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53362 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=14464, Invalid=170866, Unknown=0, NotChecked=0, Total=185330 [2018-04-13 04:49:01,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-04-13 04:49:01,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 506. [2018-04-13 04:49:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-04-13 04:49:01,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 614 transitions. [2018-04-13 04:49:01,798 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 614 transitions. Word has length 483 [2018-04-13 04:49:01,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:49:01,798 INFO L459 AbstractCegarLoop]: Abstraction has 506 states and 614 transitions. [2018-04-13 04:49:01,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-04-13 04:49:01,798 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 614 transitions. [2018-04-13 04:49:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-04-13 04:49:01,800 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:49:01,800 INFO L355 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:49:01,800 INFO L408 AbstractCegarLoop]: === Iteration 88 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:49:01,801 INFO L82 PathProgramCache]: Analyzing trace with hash 701140534, now seen corresponding path program 50 times [2018-04-13 04:49:01,801 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:49:01,801 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:49:01,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:49:01,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:49:01,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:49:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:49:01,840 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:49:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7980 backedges. 2450 proven. 5530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:49:03,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:49:03,969 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:49:03,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:49:04,049 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:49:04,049 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:49:04,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:49:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7980 backedges. 140 proven. 7840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:49:07,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:49:07,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 78] total 157 [2018-04-13 04:49:07,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-04-13 04:49:07,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-04-13 04:49:07,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1536, Invalid=22956, Unknown=0, NotChecked=0, Total=24492 [2018-04-13 04:49:07,776 INFO L87 Difference]: Start difference. First operand 506 states and 614 transitions. Second operand 157 states. [2018-04-13 04:49:38,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:49:38,510 INFO L93 Difference]: Finished difference Result 1586 states and 1804 transitions. [2018-04-13 04:49:38,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 297 states. [2018-04-13 04:49:38,510 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 496 [2018-04-13 04:49:38,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:49:38,512 INFO L225 Difference]: With dead ends: 1586 [2018-04-13 04:49:38,512 INFO L226 Difference]: Without dead ends: 836 [2018-04-13 04:49:38,517 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 870 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 447 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58640 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=17064, Invalid=184088, Unknown=0, NotChecked=0, Total=201152 [2018-04-13 04:49:38,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2018-04-13 04:49:38,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 519. [2018-04-13 04:49:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-04-13 04:49:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 630 transitions. [2018-04-13 04:49:38,521 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 630 transitions. Word has length 496 [2018-04-13 04:49:38,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:49:38,521 INFO L459 AbstractCegarLoop]: Abstraction has 519 states and 630 transitions. [2018-04-13 04:49:38,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-04-13 04:49:38,521 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 630 transitions. [2018-04-13 04:49:38,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-04-13 04:49:38,523 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:49:38,523 INFO L355 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:49:38,523 INFO L408 AbstractCegarLoop]: === Iteration 89 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:49:38,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1650447231, now seen corresponding path program 51 times [2018-04-13 04:49:38,523 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:49:38,523 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:49:38,523 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:49:38,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:49:38,524 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:49:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:49:38,563 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:49:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8442 backedges. 2592 proven. 5850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:49:40,492 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:49:40,492 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:49:40,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:49:42,365 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-04-13 04:49:42,365 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:49:42,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:49:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8442 backedges. 144 proven. 8298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:49:46,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:49:46,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 80] total 161 [2018-04-13 04:49:46,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-04-13 04:49:46,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-04-13 04:49:46,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1580, Invalid=24180, Unknown=0, NotChecked=0, Total=25760 [2018-04-13 04:49:46,367 INFO L87 Difference]: Start difference. First operand 519 states and 630 transitions. Second operand 161 states. [2018-04-13 04:50:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:50:20,603 INFO L93 Difference]: Finished difference Result 1625 states and 1849 transitions. [2018-04-13 04:50:20,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 303 states. [2018-04-13 04:50:20,604 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 509 [2018-04-13 04:50:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:50:20,605 INFO L225 Difference]: With dead ends: 1625 [2018-04-13 04:50:20,605 INFO L226 Difference]: Without dead ends: 856 [2018-04-13 04:50:20,610 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 891 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 457 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61131 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=17390, Invalid=192832, Unknown=0, NotChecked=0, Total=210222 [2018-04-13 04:50:20,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-04-13 04:50:20,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 532. [2018-04-13 04:50:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-04-13 04:50:20,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 646 transitions. [2018-04-13 04:50:20,614 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 646 transitions. Word has length 509 [2018-04-13 04:50:20,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:50:20,614 INFO L459 AbstractCegarLoop]: Abstraction has 532 states and 646 transitions. [2018-04-13 04:50:20,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-04-13 04:50:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 646 transitions. [2018-04-13 04:50:20,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-04-13 04:50:20,616 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:50:20,616 INFO L355 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:50:20,616 INFO L408 AbstractCegarLoop]: === Iteration 90 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:50:20,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1006764464, now seen corresponding path program 52 times [2018-04-13 04:50:20,616 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:50:20,616 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:50:20,616 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:50:20,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:50:20,617 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:50:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:50:20,657 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:50:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8917 backedges. 2738 proven. 6179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:50:22,714 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:50:22,714 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:50:22,714 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:50:24,091 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:50:24,091 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:50:24,184 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:50:24,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:50:24,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:50:24,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:50:24,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-13 04:50:24,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8917 backedges. 2738 proven. 6179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:50:24,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:50:24,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 82] total 85 [2018-04-13 04:50:24,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-13 04:50:24,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-13 04:50:24,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1539, Invalid=5771, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 04:50:24,636 INFO L87 Difference]: Start difference. First operand 532 states and 646 transitions. Second operand 86 states. [2018-04-13 04:50:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:50:29,363 INFO L93 Difference]: Finished difference Result 878 states and 996 transitions. [2018-04-13 04:50:29,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-04-13 04:50:29,363 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 522 [2018-04-13 04:50:29,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:50:29,364 INFO L225 Difference]: With dead ends: 878 [2018-04-13 04:50:29,364 INFO L226 Difference]: Without dead ends: 878 [2018-04-13 04:50:29,366 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 523 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12657 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8251, Invalid=31949, Unknown=0, NotChecked=0, Total=40200 [2018-04-13 04:50:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-04-13 04:50:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 541. [2018-04-13 04:50:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-04-13 04:50:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 658 transitions. [2018-04-13 04:50:29,372 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 658 transitions. Word has length 522 [2018-04-13 04:50:29,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:50:29,372 INFO L459 AbstractCegarLoop]: Abstraction has 541 states and 658 transitions. [2018-04-13 04:50:29,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-13 04:50:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 658 transitions. [2018-04-13 04:50:29,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-04-13 04:50:29,374 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:50:29,374 INFO L355 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:50:29,374 INFO L408 AbstractCegarLoop]: === Iteration 91 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:50:29,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1314379650, now seen corresponding path program 53 times [2018-04-13 04:50:29,374 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:50:29,374 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:50:29,375 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:50:29,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:50:29,375 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:50:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:50:29,418 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:50:31,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9254 backedges. 481 proven. 8769 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:50:31,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:50:31,791 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:50:31,792 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:50:33,086 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2018-04-13 04:50:33,086 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:50:33,142 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:50:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9254 backedges. 481 proven. 8769 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:50:33,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:50:33,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2018-04-13 04:50:33,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-13 04:50:33,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-13 04:50:33,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 04:50:33,463 INFO L87 Difference]: Start difference. First operand 541 states and 658 transitions. Second operand 82 states. [2018-04-13 04:50:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:50:38,704 INFO L93 Difference]: Finished difference Result 1156 states and 1385 transitions. [2018-04-13 04:50:38,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-13 04:50:38,704 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 531 [2018-04-13 04:50:38,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:50:38,706 INFO L225 Difference]: With dead ends: 1156 [2018-04-13 04:50:38,706 INFO L226 Difference]: Without dead ends: 546 [2018-04-13 04:50:38,706 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 530 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=317, Invalid=14203, Unknown=0, NotChecked=0, Total=14520 [2018-04-13 04:50:38,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-04-13 04:50:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 545. [2018-04-13 04:50:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-04-13 04:50:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 662 transitions. [2018-04-13 04:50:38,709 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 662 transitions. Word has length 531 [2018-04-13 04:50:38,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:50:38,709 INFO L459 AbstractCegarLoop]: Abstraction has 545 states and 662 transitions. [2018-04-13 04:50:38,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-04-13 04:50:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 662 transitions. [2018-04-13 04:50:38,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2018-04-13 04:50:38,711 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:50:38,711 INFO L355 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:50:38,711 INFO L408 AbstractCegarLoop]: === Iteration 92 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:50:38,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1895421051, now seen corresponding path program 54 times [2018-04-13 04:50:38,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:50:38,712 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:50:38,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:50:38,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:50:38,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:50:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:50:38,753 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:50:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9405 backedges. 2888 proven. 6517 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:50:40,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:50:40,984 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:50:40,985 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:50:44,643 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2018-04-13 04:50:44,644 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:50:44,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:50:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9405 backedges. 152 proven. 9253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:50:49,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:50:49,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 84] total 169 [2018-04-13 04:50:49,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-04-13 04:50:49,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-04-13 04:50:49,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1541, Invalid=26851, Unknown=0, NotChecked=0, Total=28392 [2018-04-13 04:50:49,141 INFO L87 Difference]: Start difference. First operand 545 states and 662 transitions. Second operand 169 states. [2018-04-13 04:51:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:51:31,301 INFO L93 Difference]: Finished difference Result 1687 states and 1923 transitions. [2018-04-13 04:51:31,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 307 states. [2018-04-13 04:51:31,301 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 535 [2018-04-13 04:51:31,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:51:31,303 INFO L225 Difference]: With dead ends: 1687 [2018-04-13 04:51:31,303 INFO L226 Difference]: Without dead ends: 888 [2018-04-13 04:51:31,313 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 925 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 469 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63432 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=15556, Invalid=205814, Unknown=0, NotChecked=0, Total=221370 [2018-04-13 04:51:31,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-04-13 04:51:31,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 558. [2018-04-13 04:51:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2018-04-13 04:51:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 678 transitions. [2018-04-13 04:51:31,321 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 678 transitions. Word has length 535 [2018-04-13 04:51:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:51:31,321 INFO L459 AbstractCegarLoop]: Abstraction has 558 states and 678 transitions. [2018-04-13 04:51:31,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-04-13 04:51:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 678 transitions. [2018-04-13 04:51:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2018-04-13 04:51:31,324 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:51:31,324 INFO L355 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:51:31,324 INFO L408 AbstractCegarLoop]: === Iteration 93 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:51:31,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1507882538, now seen corresponding path program 55 times [2018-04-13 04:51:31,325 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:51:31,325 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:51:31,325 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:51:31,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:51:31,325 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:51:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:51:31,391 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:51:33,632 INFO L134 CoverageAnalysis]: Checked inductivity of 9906 backedges. 3042 proven. 6864 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:51:33,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:51:33,632 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:51:33,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:51:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:51:33,737 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:51:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9906 backedges. 156 proven. 9750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:51:38,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:51:38,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 86] total 173 [2018-04-13 04:51:38,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-04-13 04:51:38,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-04-13 04:51:38,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1864, Invalid=27892, Unknown=0, NotChecked=0, Total=29756 [2018-04-13 04:51:38,308 INFO L87 Difference]: Start difference. First operand 558 states and 678 transitions. Second operand 173 states. [2018-04-13 04:52:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:52:14,053 INFO L93 Difference]: Finished difference Result 1758 states and 2000 transitions. [2018-04-13 04:52:14,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 329 states. [2018-04-13 04:52:14,053 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 548 [2018-04-13 04:52:14,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:52:14,055 INFO L225 Difference]: With dead ends: 1758 [2018-04-13 04:52:14,055 INFO L226 Difference]: Without dead ends: 924 [2018-04-13 04:52:14,060 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 962 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 495 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72278 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=20876, Invalid=225636, Unknown=0, NotChecked=0, Total=246512 [2018-04-13 04:52:14,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2018-04-13 04:52:14,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 571. [2018-04-13 04:52:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-04-13 04:52:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 694 transitions. [2018-04-13 04:52:14,064 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 694 transitions. Word has length 548 [2018-04-13 04:52:14,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:52:14,065 INFO L459 AbstractCegarLoop]: Abstraction has 571 states and 694 transitions. [2018-04-13 04:52:14,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-04-13 04:52:14,065 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 694 transitions. [2018-04-13 04:52:14,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2018-04-13 04:52:14,066 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:52:14,067 INFO L355 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:52:14,067 INFO L408 AbstractCegarLoop]: === Iteration 94 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:52:14,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2061741429, now seen corresponding path program 56 times [2018-04-13 04:52:14,067 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:52:14,067 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:52:14,067 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:52:14,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:52:14,067 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:52:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:52:14,112 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:52:16,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10420 backedges. 3200 proven. 7220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:52:16,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:52:16,415 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:52:16,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:52:16,566 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:52:16,566 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:52:16,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:52:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10420 backedges. 160 proven. 10260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:52:21,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:52:21,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 88] total 177 [2018-04-13 04:52:21,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-04-13 04:52:21,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-04-13 04:52:21,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1912, Invalid=29240, Unknown=0, NotChecked=0, Total=31152 [2018-04-13 04:52:21,319 INFO L87 Difference]: Start difference. First operand 571 states and 694 transitions. Second operand 177 states. [2018-04-13 04:53:01,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:53:01,511 INFO L93 Difference]: Finished difference Result 1797 states and 2045 transitions. [2018-04-13 04:53:01,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 335 states. [2018-04-13 04:53:01,511 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 561 [2018-04-13 04:53:01,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:53:01,513 INFO L225 Difference]: With dead ends: 1797 [2018-04-13 04:53:01,513 INFO L226 Difference]: Without dead ends: 944 [2018-04-13 04:53:01,519 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 983 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 505 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75041 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=21234, Invalid=235308, Unknown=0, NotChecked=0, Total=256542 [2018-04-13 04:53:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-04-13 04:53:01,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 584. [2018-04-13 04:53:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-04-13 04:53:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 710 transitions. [2018-04-13 04:53:01,524 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 710 transitions. Word has length 561 [2018-04-13 04:53:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:53:01,525 INFO L459 AbstractCegarLoop]: Abstraction has 584 states and 710 transitions. [2018-04-13 04:53:01,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-04-13 04:53:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 710 transitions. [2018-04-13 04:53:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2018-04-13 04:53:01,527 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:53:01,527 INFO L355 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:53:01,527 INFO L408 AbstractCegarLoop]: === Iteration 95 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:53:01,527 INFO L82 PathProgramCache]: Analyzing trace with hash -526365788, now seen corresponding path program 57 times [2018-04-13 04:53:01,527 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:53:01,527 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:53:01,528 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:53:01,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:53:01,528 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:53:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:53:01,580 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:53:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10947 backedges. 3362 proven. 7585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:53:04,014 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:53:04,014 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:53:04,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:53:06,499 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-04-13 04:53:06,500 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:53:06,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:53:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10947 backedges. 164 proven. 10783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:53:11,594 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:53:11,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 91] total 182 [2018-04-13 04:53:11,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-04-13 04:53:11,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-04-13 04:53:11,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2043, Invalid=30899, Unknown=0, NotChecked=0, Total=32942 [2018-04-13 04:53:11,596 INFO L87 Difference]: Start difference. First operand 584 states and 710 transitions. Second operand 182 states. [2018-04-13 04:53:51,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:53:51,752 INFO L93 Difference]: Finished difference Result 1841 states and 2094 transitions. [2018-04-13 04:53:51,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 346 states. [2018-04-13 04:53:51,752 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 574 [2018-04-13 04:53:51,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:53:51,753 INFO L225 Difference]: With dead ends: 1841 [2018-04-13 04:53:51,753 INFO L226 Difference]: Without dead ends: 968 [2018-04-13 04:53:51,760 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1009 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 521 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80093 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=22945, Invalid=250061, Unknown=0, NotChecked=0, Total=273006 [2018-04-13 04:53:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-04-13 04:53:51,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 597. [2018-04-13 04:53:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2018-04-13 04:53:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 726 transitions. [2018-04-13 04:53:51,764 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 726 transitions. Word has length 574 [2018-04-13 04:53:51,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:53:51,765 INFO L459 AbstractCegarLoop]: Abstraction has 597 states and 726 transitions. [2018-04-13 04:53:51,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-04-13 04:53:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 726 transitions. [2018-04-13 04:53:51,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2018-04-13 04:53:51,767 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:53:51,767 INFO L355 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:53:51,767 INFO L408 AbstractCegarLoop]: === Iteration 96 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:53:51,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1839732591, now seen corresponding path program 58 times [2018-04-13 04:53:51,767 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:53:51,767 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:53:51,767 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:53:51,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:53:51,768 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:53:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:53:51,816 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-04-13 04:53:52,790 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-13 04:53:52,793 WARN L197 ceAbstractionStarter]: Timeout [2018-04-13 04:53:52,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 04:53:52 BoogieIcfgContainer [2018-04-13 04:53:52,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 04:53:52,794 INFO L168 Benchmark]: Toolchain (without parser) took 761911.16 ms. Allocated memory was 404.2 MB in the beginning and 2.7 GB in the end (delta: 2.3 GB). Free memory was 341.3 MB in the beginning and 814.7 MB in the end (delta: -473.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-04-13 04:53:52,795 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 04:53:52,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.28 ms. Allocated memory is still 404.2 MB. Free memory was 339.9 MB in the beginning and 314.7 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-04-13 04:53:52,795 INFO L168 Benchmark]: Boogie Preprocessor took 43.96 ms. Allocated memory is still 404.2 MB. Free memory was 314.7 MB in the beginning and 312.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-13 04:53:52,795 INFO L168 Benchmark]: RCFGBuilder took 443.51 ms. Allocated memory was 404.2 MB in the beginning and 611.8 MB in the end (delta: 207.6 MB). Free memory was 312.1 MB in the beginning and 539.1 MB in the end (delta: -227.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-04-13 04:53:52,796 INFO L168 Benchmark]: TraceAbstraction took 761178.82 ms. Allocated memory was 611.8 MB in the beginning and 2.7 GB in the end (delta: 2.1 GB). Free memory was 537.3 MB in the beginning and 814.7 MB in the end (delta: -277.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-04-13 04:53:52,797 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 242.28 ms. Allocated memory is still 404.2 MB. Free memory was 339.9 MB in the beginning and 314.7 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.96 ms. Allocated memory is still 404.2 MB. Free memory was 314.7 MB in the beginning and 312.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 443.51 ms. Allocated memory was 404.2 MB in the beginning and 611.8 MB in the end (delta: 207.6 MB). Free memory was 312.1 MB in the beginning and 539.1 MB in the end (delta: -227.0 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 761178.82 ms. Allocated memory was 611.8 MB in the beginning and 2.7 GB in the end (delta: 2.1 GB). Free memory was 537.3 MB in the beginning and 814.7 MB in the end (delta: -277.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 588 with TraceHistMax 43, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 96 locations, 21 error locations. TIMEOUT Result, 761.1s OverallTime, 96 OverallIterations, 43 TraceHistogramMax, 566.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18892 SDtfs, 99888 SDslu, 1030591 SDs, 0 SdLazy, 675468 SolverSat, 16274 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 199.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27888 GetRequests, 17287 SyntacticMatches, 74 SemanticMatches, 10527 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 825339 ImplicationChecksByTransitivity, 468.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=597occurred in iteration=95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 95 MinimizatonAttempts, 8676 StatesRemovedByMinimization, 82 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 29.8s SatisfiabilityAnalysisTime, 155.7s InterpolantComputationTime, 38073 NumberOfCodeBlocks, 37855 NumberOfCodeBlocksAsserted, 797 NumberOfCheckSat, 37216 ConstructedInterpolants, 544 QuantifiedInterpolants, 91304718 SizeOfPredicates, 1484 NumberOfNonLiveVariables, 80463 ConjunctsInSsa, 9187 ConjunctsInUnsatCore, 161 InterpolantComputations, 21 PerfectInterpolantSequences, 70392/412921 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_04-53-52-801.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_04-53-52-801.csv Completed graceful shutdown