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-666feb3-m [2018-04-11 15:23:18,721 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:23:18,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:23:18,734 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:23:18,734 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:23:18,735 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:23:18,735 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:23:18,737 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:23:18,739 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:23:18,739 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:23:18,740 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:23:18,740 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:23:18,741 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:23:18,742 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:23:18,742 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:23:18,744 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:23:18,745 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:23:18,747 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:23:18,747 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:23:18,748 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:23:18,750 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:23:18,750 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:23:18,750 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:23:18,751 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:23:18,752 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:23:18,753 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:23:18,753 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:23:18,753 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:23:18,754 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:23:18,754 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:23:18,754 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:23:18,754 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-11 15:23:18,774 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:23:18,774 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:23:18,775 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:23:18,775 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:23:18,775 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:23:18,775 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:23:18,775 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:23:18,775 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:23:18,776 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:23:18,776 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:23:18,776 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:23:18,776 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:23:18,776 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:23:18,776 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:23:18,776 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:23:18,776 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:23:18,776 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:23:18,776 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:23:18,777 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:23:18,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:23:18,777 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:23:18,777 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:23:18,777 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:23:18,777 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 15:23:18,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:23:18,815 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:23:18,817 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:23:18,818 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:23:18,818 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:23:18,819 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-11 15:23:19,109 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG4c602984f [2018-04-11 15:23:19,247 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:23:19,247 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:23:19,248 INFO L168 CDTParser]: Scanning openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:23:19,255 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:23:19,255 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:23:19,255 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:23:19,255 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:23:19,255 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-11 15:23:19,255 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-11 15:23:19,256 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-11 15:23:19,256 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-11 15:23:19,256 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-11 15:23:19,256 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:23:19,256 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-11 15:23:19,256 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-11 15:23:19,256 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-11 15:23:19,256 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-11 15:23:19,256 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-11 15:23:19,257 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-11 15:23:19,257 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-11 15:23:19,257 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-11 15:23:19,257 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-11 15:23:19,257 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-11 15:23:19,257 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-11 15:23:19,257 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-11 15:23:19,257 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-11 15:23:19,257 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-11 15:23:19,257 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-11 15:23:19,258 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-11 15:23:19,258 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-11 15:23:19,258 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-11 15:23:19,258 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-11 15:23:19,258 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-11 15:23:19,258 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-11 15:23:19,258 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-11 15:23:19,258 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-11 15:23:19,258 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-11 15:23:19,259 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-11 15:23:19,259 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-11 15:23:19,259 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-11 15:23:19,259 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-11 15:23:19,259 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-11 15:23:19,259 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-11 15:23:19,259 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-11 15:23:19,259 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-11 15:23:19,259 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-11 15:23:19,259 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-11 15:23:19,259 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,260 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,261 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-11 15:23:19,262 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-11 15:23:19,262 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-11 15:23:19,262 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-11 15:23:19,262 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-11 15:23:19,262 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-11 15:23:19,262 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-11 15:23:19,262 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-11 15:23:19,262 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-11 15:23:19,262 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-11 15:23:19,262 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-11 15:23:19,262 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-11 15:23:19,262 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-11 15:23:19,263 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-11 15:23:19,263 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-11 15:23:19,263 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-11 15:23:19,263 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-11 15:23:19,263 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-11 15:23:19,263 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-11 15:23:19,263 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-11 15:23:19,263 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-11 15:23:19,263 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-11 15:23:19,263 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-11 15:23:19,263 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-11 15:23:19,264 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-11 15:23:19,264 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-11 15:23:19,264 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-11 15:23:19,264 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-11 15:23:19,264 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-11 15:23:19,264 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-11 15:23:19,264 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-11 15:23:19,264 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-11 15:23:19,264 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-11 15:23:19,264 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-11 15:23:19,264 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-11 15:23:19,265 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-11 15:23:19,265 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-11 15:23:19,265 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-11 15:23:19,265 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-11 15:23:19,265 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-11 15:23:19,265 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-11 15:23:19,265 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-11 15:23:19,265 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-11 15:23:19,265 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-11 15:23:19,265 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-11 15:23:19,266 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-11 15:23:19,266 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-11 15:23:19,280 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG4c602984f [2018-04-11 15:23:19,284 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:23:19,285 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:23:19,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:23:19,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:23:19,292 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:23:19,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:23:19" (1/1) ... [2018-04-11 15:23:19,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de3dfdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:23:19, skipping insertion in model container [2018-04-11 15:23:19,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:23:19" (1/1) ... [2018-04-11 15:23:19,312 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:23:19,335 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:23:19,469 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:23:19,503 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:23:19,509 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 114 non ball SCCs. Number of states in SCCs 114. [2018-04-11 15:23:19,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:23:19 WrapperNode [2018-04-11 15:23:19,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:23:19,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:23:19,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:23:19,546 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:23:19,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:23:19" (1/1) ... [2018-04-11 15:23:19,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:23:19" (1/1) ... [2018-04-11 15:23:19,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:23:19" (1/1) ... [2018-04-11 15:23:19,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:23:19" (1/1) ... [2018-04-11 15:23:19,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:23:19" (1/1) ... [2018-04-11 15:23:19,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:23:19" (1/1) ... [2018-04-11 15:23:19,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:23:19" (1/1) ... [2018-04-11 15:23:19,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:23:19,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:23:19,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:23:19,591 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:23:19,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:23:19" (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-11 15:23:19,685 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:23:19,685 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:23:19,685 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:23:19,685 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:23:19,685 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlen [2018-04-11 15:23:19,685 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmp [2018-04-11 15:23:19,685 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstr [2018-04-11 15:23:19,685 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:23:19,685 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:23:19,686 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:23:19,686 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:23:19,686 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:23:19,686 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:23:19,686 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:23:19,686 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:23:19,686 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:23:19,686 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:23:19,686 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:23:19,686 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:23:19,687 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:23:19,687 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:23:19,687 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:23:19,687 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:23:19,687 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:23:19,687 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:23:19,687 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:23:19,687 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:23:19,687 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:23:19,688 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:23:19,688 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:23:19,688 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:23:19,688 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:23:19,688 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:23:19,688 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:23:19,688 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:23:19,688 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:23:19,688 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:23:19,688 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:23:19,689 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:23:19,689 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:23:19,689 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:23:19,689 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:23:19,689 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:23:19,689 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:23:19,689 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:23:19,689 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:23:19,689 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:23:19,690 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:23:19,690 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:23:19,690 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:23:19,690 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:23:19,690 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:23:19,690 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:23:19,690 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:23:19,690 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:23:19,690 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:23:19,690 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:23:19,691 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:23:19,691 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:23:19,691 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:23:19,691 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:23:19,691 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:23:19,691 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:23:19,691 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:23:19,691 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:23:19,691 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:23:19,691 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:23:19,692 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:23:19,692 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:23:19,692 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:23:19,692 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:23:19,692 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:23:19,692 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:23:19,692 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:23:19,692 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:23:19,692 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:23:19,692 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:23:19,692 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:23:19,693 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:23:19,693 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:23:19,693 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:23:19,693 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:23:19,693 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:23:19,693 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:23:19,693 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:23:19,693 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:23:19,693 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:23:19,693 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:23:19,694 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:23:19,694 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:23:19,694 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:23:19,694 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:23:19,694 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:23:19,694 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:23:19,694 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:23:19,694 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:23:19,694 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:23:19,694 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:23:19,695 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:23:19,695 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:23:19,695 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:23:19,695 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:23:19,695 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:23:19,695 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:23:19,695 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:23:19,695 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:23:19,695 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:23:19,695 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:23:19,695 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:23:19,696 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:23:19,696 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:23:19,696 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlen [2018-04-11 15:23:19,696 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:23:19,696 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmp [2018-04-11 15:23:19,696 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstr [2018-04-11 15:23:19,696 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:23:19,696 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:23:19,696 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:23:19,696 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:23:19,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:23:19,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:23:19,697 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:23:20,020 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:23:20,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:23:20 BoogieIcfgContainer [2018-04-11 15:23:20,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:23:20,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:23:20,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:23:20,024 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:23:20,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:23:19" (1/3) ... [2018-04-11 15:23:20,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54788276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:23:20, skipping insertion in model container [2018-04-11 15:23:20,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:23:19" (2/3) ... [2018-04-11 15:23:20,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54788276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:23:20, skipping insertion in model container [2018-04-11 15:23:20,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:23:20" (3/3) ... [2018-04-11 15:23:20,027 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:23:20,033 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:23:20,038 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-04-11 15:23:20,072 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:23:20,073 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:23:20,073 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:23:20,073 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:23:20,073 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:23:20,073 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:23:20,073 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:23:20,073 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:23:20,073 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:23:20,074 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:23:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-04-11 15:23:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:23:20,089 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:20,089 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:23:20,089 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-11 15:23:20,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1281524752, now seen corresponding path program 1 times [2018-04-11 15:23:20,093 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:20,094 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:20,123 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:20,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:20,123 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:20,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:20,182 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:23:20,182 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:23:20,183 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:23:20,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:20,222 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:23:20,254 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-11 15:23:20,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:20,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:20,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:23:20,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:20,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:20,283 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-11 15:23:20,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:20,292 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-11 15:23:20,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 15:23:20,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-11 15:23:20,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:23:20,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:23:20,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:23:20,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:23:20,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:23:20,326 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 5 states. [2018-04-11 15:23:20,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:20,432 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-04-11 15:23:20,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:23:20,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-04-11 15:23:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:20,445 INFO L225 Difference]: With dead ends: 89 [2018-04-11 15:23:20,445 INFO L226 Difference]: Without dead ends: 86 [2018-04-11 15:23:20,447 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-11 15:23:20,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-11 15:23:20,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-11 15:23:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-11 15:23:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-04-11 15:23:20,478 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 13 [2018-04-11 15:23:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:20,478 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-04-11 15:23:20,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:23:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-04-11 15:23:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:23:20,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:20,478 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:23:20,478 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-11 15:23:20,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1281524751, now seen corresponding path program 1 times [2018-04-11 15:23:20,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:20,479 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:20,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:20,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:20,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:20,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:20,500 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:23:20,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:23:20,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:23:20,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:20,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:23:20,536 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-11 15:23:20,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:20,543 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-11 15:23:20,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:20,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:20,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:23:20,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:20,585 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-11 15:23:20,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:20,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:20,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:20,597 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-11 15:23:20,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:20,602 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-11 15:23:20,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:23:20,610 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-11 15:23:20,610 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:23:20,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:23:20,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:23:20,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:23:20,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:23:20,611 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 6 states. [2018-04-11 15:23:20,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:20,649 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-04-11 15:23:20,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:23:20,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-11 15:23:20,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:20,652 INFO L225 Difference]: With dead ends: 103 [2018-04-11 15:23:20,652 INFO L226 Difference]: Without dead ends: 103 [2018-04-11 15:23:20,653 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-11 15:23:20,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-11 15:23:20,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2018-04-11 15:23:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-11 15:23:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2018-04-11 15:23:20,664 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 13 [2018-04-11 15:23:20,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:20,664 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2018-04-11 15:23:20,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:23:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2018-04-11 15:23:20,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:23:20,664 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:20,665 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:23:20,665 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-11 15:23:20,665 INFO L82 PathProgramCache]: Analyzing trace with hash 493482611, now seen corresponding path program 1 times [2018-04-11 15:23:20,665 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:20,665 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:20,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:20,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:20,666 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:20,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:20,683 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:23:20,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:23:20,683 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:23:20,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:20,704 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:23:20,710 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-11 15:23:20,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:20,728 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-11 15:23:20,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:20,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:20,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:23:20,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:20,766 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-11 15:23:20,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:20,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:20,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:20,778 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-11 15:23:20,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:20,784 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-11 15:23:20,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:23:20,792 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-11 15:23:20,792 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:23:20,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:23:20,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:23:20,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:23:20,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:23:20,793 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 6 states. [2018-04-11 15:23:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:20,897 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2018-04-11 15:23:20,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:23:20,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-11 15:23:20,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:20,898 INFO L225 Difference]: With dead ends: 91 [2018-04-11 15:23:20,898 INFO L226 Difference]: Without dead ends: 91 [2018-04-11 15:23:20,898 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-11 15:23:20,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-11 15:23:20,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-04-11 15:23:20,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-11 15:23:20,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-04-11 15:23:20,901 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 13 [2018-04-11 15:23:20,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:20,902 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-04-11 15:23:20,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:23:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-04-11 15:23:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:23:20,902 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:20,902 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:23:20,902 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-11 15:23:20,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1072561654, now seen corresponding path program 1 times [2018-04-11 15:23:20,902 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:20,902 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:20,903 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:20,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:20,903 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:20,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:20,932 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-11 15:23:20,932 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:23:20,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:23:20,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:23:20,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:23:20,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:23:20,933 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 4 states. [2018-04-11 15:23:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:20,986 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-04-11 15:23:20,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:23:20,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 15:23:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:20,987 INFO L225 Difference]: With dead ends: 84 [2018-04-11 15:23:20,987 INFO L226 Difference]: Without dead ends: 84 [2018-04-11 15:23:20,987 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-11 15:23:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-11 15:23:20,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-04-11 15:23:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-11 15:23:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-04-11 15:23:20,990 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2018-04-11 15:23:20,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:20,990 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-04-11 15:23:20,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:23:20,990 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-04-11 15:23:20,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:23:20,990 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:20,990 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:23:20,991 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-11 15:23:20,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1072561653, now seen corresponding path program 1 times [2018-04-11 15:23:20,991 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:20,991 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:20,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:20,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:20,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:21,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:21,041 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-11 15:23:21,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:23:21,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:23:21,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:23:21,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:23:21,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:23:21,042 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 5 states. [2018-04-11 15:23:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:21,067 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-04-11 15:23:21,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:23:21,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 15:23:21,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:21,068 INFO L225 Difference]: With dead ends: 83 [2018-04-11 15:23:21,068 INFO L226 Difference]: Without dead ends: 83 [2018-04-11 15:23:21,068 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-11 15:23:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-11 15:23:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-11 15:23:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-11 15:23:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-04-11 15:23:21,071 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-04-11 15:23:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:21,072 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-04-11 15:23:21,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:23:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-04-11 15:23:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 15:23:21,072 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:21,072 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:23:21,072 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-11 15:23:21,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1872573656, now seen corresponding path program 1 times [2018-04-11 15:23:21,073 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:21,073 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:21,073 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:21,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:21,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:21,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:21,100 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-11 15:23:21,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:23:21,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:23:21,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:23:21,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:23:21,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:23:21,101 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2018-04-11 15:23:21,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:21,164 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-04-11 15:23:21,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:23:21,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-11 15:23:21,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:21,165 INFO L225 Difference]: With dead ends: 82 [2018-04-11 15:23:21,165 INFO L226 Difference]: Without dead ends: 82 [2018-04-11 15:23:21,165 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-11 15:23:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-11 15:23:21,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-04-11 15:23:21,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-11 15:23:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-04-11 15:23:21,168 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 17 [2018-04-11 15:23:21,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:21,168 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-04-11 15:23:21,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:23:21,168 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-04-11 15:23:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 15:23:21,169 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:21,169 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:23:21,169 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-11 15:23:21,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1872573657, now seen corresponding path program 1 times [2018-04-11 15:23:21,169 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:21,169 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:21,169 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:21,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:21,170 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:21,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:21,248 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-11 15:23:21,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:23:21,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:23:21,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:23:21,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:23:21,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:23:21,249 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-04-11 15:23:21,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:21,339 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-04-11 15:23:21,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:23:21,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-04-11 15:23:21,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:21,340 INFO L225 Difference]: With dead ends: 81 [2018-04-11 15:23:21,340 INFO L226 Difference]: Without dead ends: 81 [2018-04-11 15:23:21,340 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-11 15:23:21,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-11 15:23:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-04-11 15:23:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-11 15:23:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-04-11 15:23:21,344 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 17 [2018-04-11 15:23:21,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:21,344 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-04-11 15:23:21,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:23:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-04-11 15:23:21,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:23:21,345 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:21,345 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-11 15:23:21,345 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-11 15:23:21,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1417476355, now seen corresponding path program 1 times [2018-04-11 15:23:21,345 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:21,345 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:21,346 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:21,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:21,346 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:21,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:21,384 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-11 15:23:21,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:23:21,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:23:21,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:23:21,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:23:21,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:23:21,385 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 7 states. [2018-04-11 15:23:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:21,472 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-04-11 15:23:21,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:23:21,475 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-04-11 15:23:21,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:21,476 INFO L225 Difference]: With dead ends: 80 [2018-04-11 15:23:21,476 INFO L226 Difference]: Without dead ends: 80 [2018-04-11 15:23:21,476 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-11 15:23:21,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-11 15:23:21,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-04-11 15:23:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-11 15:23:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-04-11 15:23:21,479 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 23 [2018-04-11 15:23:21,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:21,480 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-04-11 15:23:21,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:23:21,480 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-04-11 15:23:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:23:21,480 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:21,480 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-11 15:23:21,480 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-11 15:23:21,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1417476356, now seen corresponding path program 1 times [2018-04-11 15:23:21,481 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:21,481 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:21,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:21,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:21,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:21,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:21,555 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-11 15:23:21,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:23:21,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 15:23:21,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:23:21,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:23:21,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:23:21,556 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 10 states. [2018-04-11 15:23:21,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:21,681 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-04-11 15:23:21,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:23:21,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-04-11 15:23:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:21,683 INFO L225 Difference]: With dead ends: 104 [2018-04-11 15:23:21,684 INFO L226 Difference]: Without dead ends: 104 [2018-04-11 15:23:21,684 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:23:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-11 15:23:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-04-11 15:23:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-04-11 15:23:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-04-11 15:23:21,686 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 23 [2018-04-11 15:23:21,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:21,687 INFO L459 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-04-11 15:23:21,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:23:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-04-11 15:23:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:23:21,687 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:21,687 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-11 15:23:21,687 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-11 15:23:21,687 INFO L82 PathProgramCache]: Analyzing trace with hash 396408002, now seen corresponding path program 1 times [2018-04-11 15:23:21,688 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:21,688 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:21,688 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:21,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:21,688 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:21,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:21,815 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-11 15:23:21,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:23:21,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 15:23:21,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:23:21,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:23:21,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:23:21,816 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 13 states. [2018-04-11 15:23:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:22,088 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-04-11 15:23:22,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:23:22,088 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-04-11 15:23:22,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:22,089 INFO L225 Difference]: With dead ends: 104 [2018-04-11 15:23:22,089 INFO L226 Difference]: Without dead ends: 104 [2018-04-11 15:23:22,090 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-11 15:23:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-11 15:23:22,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2018-04-11 15:23:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-11 15:23:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-04-11 15:23:22,093 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 23 [2018-04-11 15:23:22,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:22,094 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-04-11 15:23:22,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:23:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-04-11 15:23:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 15:23:22,094 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:22,094 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-11 15:23:22,094 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-11 15:23:22,094 INFO L82 PathProgramCache]: Analyzing trace with hash 989716549, now seen corresponding path program 1 times [2018-04-11 15:23:22,095 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:22,095 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:22,095 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:22,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:22,095 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:22,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:22,316 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-11 15:23:22,316 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:23:22,316 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:23:22,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:22,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:23:22,344 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-11 15:23:22,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:22,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:22,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:23:22,373 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-11 15:23:22,374 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-11 15:23:22,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:22,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:22,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:22,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 15:23:22,620 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-11 15:23:22,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:22,628 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-11 15:23:22,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:23:22,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:23:22,649 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-11 15:23:22,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:95 [2018-04-11 15:23:22,737 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-11 15:23:22,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:23:22,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-04-11 15:23:22,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:23:22,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:23:22,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:23:22,738 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 28 states. [2018-04-11 15:23:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:24,051 INFO L93 Difference]: Finished difference Result 171 states and 193 transitions. [2018-04-11 15:23:24,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:23:24,051 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-04-11 15:23:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:24,052 INFO L225 Difference]: With dead ends: 171 [2018-04-11 15:23:24,052 INFO L226 Difference]: Without dead ends: 171 [2018-04-11 15:23:24,053 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=288, Invalid=2364, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 15:23:24,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-04-11 15:23:24,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 104. [2018-04-11 15:23:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-11 15:23:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-04-11 15:23:24,057 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 27 [2018-04-11 15:23:24,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:24,057 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-04-11 15:23:24,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:23:24,058 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-04-11 15:23:24,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:23:24,058 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:24,058 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-11 15:23:24,058 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-11 15:23:24,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2041517279, now seen corresponding path program 1 times [2018-04-11 15:23:24,058 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:24,058 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:24,059 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:24,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:24,059 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:24,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:24,069 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:23:24,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:23:24,069 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:23:24,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:24,085 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:23:24,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:24,108 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-11 15:23:24,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:24,111 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-11 15:23:24,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:24,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:24,117 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-11 15:23:24,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 15:23:24,163 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-11 15:23:24,168 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-11 15:23:24,172 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-11 15:23:24,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:23:24,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:23:24,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:23:24,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:23:24,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-11 15:23:24,174 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 8 states. [2018-04-11 15:23:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:24,344 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2018-04-11 15:23:24,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:23:24,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-11 15:23:24,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:24,345 INFO L225 Difference]: With dead ends: 103 [2018-04-11 15:23:24,345 INFO L226 Difference]: Without dead ends: 79 [2018-04-11 15:23:24,345 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-11 15:23:24,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-04-11 15:23:24,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-04-11 15:23:24,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-11 15:23:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2018-04-11 15:23:24,347 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 28 [2018-04-11 15:23:24,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:24,347 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2018-04-11 15:23:24,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:23:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-04-11 15:23:24,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 15:23:24,347 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:24,347 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-11 15:23:24,348 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-11 15:23:24,348 INFO L82 PathProgramCache]: Analyzing trace with hash -343838603, now seen corresponding path program 1 times [2018-04-11 15:23:24,348 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:24,348 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:24,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:24,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:24,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:24,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:24,409 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-11 15:23:24,409 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:23:24,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:23:24,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:23:24,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:23:24,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:23:24,409 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 6 states. [2018-04-11 15:23:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:24,504 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-04-11 15:23:24,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:23:24,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-11 15:23:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:24,505 INFO L225 Difference]: With dead ends: 78 [2018-04-11 15:23:24,505 INFO L226 Difference]: Without dead ends: 78 [2018-04-11 15:23:24,505 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-11 15:23:24,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-11 15:23:24,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-04-11 15:23:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-11 15:23:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-04-11 15:23:24,507 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 31 [2018-04-11 15:23:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:24,508 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-04-11 15:23:24,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:23:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-04-11 15:23:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 15:23:24,508 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:24,508 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-11 15:23:24,509 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-11 15:23:24,509 INFO L82 PathProgramCache]: Analyzing trace with hash -343838602, now seen corresponding path program 1 times [2018-04-11 15:23:24,509 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:24,509 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:24,509 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:24,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:24,510 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:24,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:24,584 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-11 15:23:24,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:23:24,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:23:24,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:23:24,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:23:24,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:23:24,585 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 9 states. [2018-04-11 15:23:24,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:24,682 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-04-11 15:23:24,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:23:24,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-04-11 15:23:24,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:24,683 INFO L225 Difference]: With dead ends: 83 [2018-04-11 15:23:24,683 INFO L226 Difference]: Without dead ends: 83 [2018-04-11 15:23:24,683 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-11 15:23:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-11 15:23:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-04-11 15:23:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-11 15:23:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-04-11 15:23:24,685 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 31 [2018-04-11 15:23:24,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:24,685 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-04-11 15:23:24,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:23:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-04-11 15:23:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 15:23:24,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:24,686 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-11 15:23:24,686 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-11 15:23:24,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1593144629, now seen corresponding path program 2 times [2018-04-11 15:23:24,687 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:24,687 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:24,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:24,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:24,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:24,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:24,826 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-11 15:23:24,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:23:24,826 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:23:24,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:23:24,853 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:23:24,853 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:23:24,856 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:23:24,860 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-11 15:23:24,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:24,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:24,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:23:24,872 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-11 15:23:24,873 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-11 15:23:24,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:24,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:24,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:24,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-11 15:23:24,890 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-11 15:23:24,896 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-11 15:23:24,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:23:24,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:23:24,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:23:24,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-11 15:23:24,946 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-11 15:23:24,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:23:24,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2018-04-11 15:23:24,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:23:24,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:23:24,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:23:24,947 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 15 states. [2018-04-11 15:23:25,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:25,221 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-04-11 15:23:25,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:23:25,222 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-04-11 15:23:25,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:25,222 INFO L225 Difference]: With dead ends: 83 [2018-04-11 15:23:25,222 INFO L226 Difference]: Without dead ends: 83 [2018-04-11 15:23:25,223 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-11 15:23:25,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-11 15:23:25,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2018-04-11 15:23:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-11 15:23:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-04-11 15:23:25,225 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 35 [2018-04-11 15:23:25,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:25,225 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-04-11 15:23:25,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:23:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-04-11 15:23:25,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 15:23:25,226 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:25,226 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-11 15:23:25,226 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-11 15:23:25,226 INFO L82 PathProgramCache]: Analyzing trace with hash 132134015, now seen corresponding path program 1 times [2018-04-11 15:23:25,226 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:25,226 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:25,227 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:25,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:23:25,227 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:25,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:25,239 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:23:25,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:23:25,240 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:23:25,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:25,259 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:23:25,284 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-11 15:23:25,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:25,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:25,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:23:25,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:25,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:25,302 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-11 15:23:25,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:25,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:25,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 15:23:25,318 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-11 15:23:25,320 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-11 15:23:25,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:25,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:25,327 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-11 15:23:25,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-11 15:23:25,364 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-11 15:23:25,366 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-11 15:23:25,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:25,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:25,374 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-11 15:23:25,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:36 [2018-04-11 15:23:25,940 WARN L151 SmtUtils]: Spent 469ms on a formula simplification. DAG size of input: 53 DAG size of output 42 [2018-04-11 15:23:26,022 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-11 15:23:26,028 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-11 15:23:26,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,064 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:23:26,064 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-11 15:23:26,065 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,087 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-11 15:23:26,087 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,110 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-11 15:23:26,110 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,131 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:23:26,133 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-11 15:23:26,133 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,151 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:23:26,154 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-11 15:23:26,154 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,169 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-11 15:23:26,170 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 10 variables, input treesize:70, output treesize:3 [2018-04-11 15:23:26,193 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-11 15:23:26,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:23:26,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-11 15:23:26,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:23:26,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:23:26,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:23:26,194 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 16 states. [2018-04-11 15:23:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:26,552 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-04-11 15:23:26,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:23:26,552 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-04-11 15:23:26,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:26,553 INFO L225 Difference]: With dead ends: 97 [2018-04-11 15:23:26,553 INFO L226 Difference]: Without dead ends: 70 [2018-04-11 15:23:26,553 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-11 15:23:26,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-11 15:23:26,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-04-11 15:23:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-11 15:23:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-04-11 15:23:26,554 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 36 [2018-04-11 15:23:26,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:26,554 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-04-11 15:23:26,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:23:26,554 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-04-11 15:23:26,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 15:23:26,555 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:26,555 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-11 15:23:26,555 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-11 15:23:26,555 INFO L82 PathProgramCache]: Analyzing trace with hash 154766269, now seen corresponding path program 1 times [2018-04-11 15:23:26,555 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:26,555 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:26,556 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:26,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:26,556 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:26,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:26,571 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:23:26,571 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:23:26,571 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:23:26,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:26,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:23:26,608 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-11 15:23:26,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,619 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-11 15:23:26,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:23:26,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:26,635 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-11 15:23:26,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:26,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:26,644 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-11 15:23:26,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:23:26,680 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-11 15:23:26,682 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-11 15:23:26,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-11 15:23:26,710 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-11 15:23:26,712 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-11 15:23:26,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:26,732 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-11 15:23:26,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-04-11 15:23:31,517 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-11 15:23:31,520 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-11 15:23:31,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:31,530 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-11 15:23:31,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:23:31,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:23:31,541 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-11 15:23:31,542 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:56, output treesize:54 [2018-04-11 15:23:31,633 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-11 15:23:31,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:23:31,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:23:31,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:23:31,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:23:31,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=232, Unknown=3, NotChecked=0, Total=272 [2018-04-11 15:23:31,682 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 17 states. [2018-04-11 15:23:35,071 WARN L151 SmtUtils]: Spent 3021ms on a formula simplification. DAG size of input: 68 DAG size of output 66 [2018-04-11 15:23:37,889 WARN L151 SmtUtils]: Spent 2791ms on a formula simplification. DAG size of input: 72 DAG size of output 70 [2018-04-11 15:23:38,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:38,168 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-04-11 15:23:38,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:23:38,169 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-04-11 15:23:38,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:38,169 INFO L225 Difference]: With dead ends: 81 [2018-04-11 15:23:38,169 INFO L226 Difference]: Without dead ends: 81 [2018-04-11 15:23:38,170 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=117, Invalid=636, Unknown=3, NotChecked=0, Total=756 [2018-04-11 15:23:38,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-11 15:23:38,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-04-11 15:23:38,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-11 15:23:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-04-11 15:23:38,172 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 36 [2018-04-11 15:23:38,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:38,172 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-04-11 15:23:38,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:23:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-04-11 15:23:38,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:23:38,173 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:38,173 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-11 15:23:38,173 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-11 15:23:38,173 INFO L82 PathProgramCache]: Analyzing trace with hash 2139102706, now seen corresponding path program 1 times [2018-04-11 15:23:38,173 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:38,173 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:38,174 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:38,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:38,174 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:38,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:38,274 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-11 15:23:38,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:23:38,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:23:38,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:23:38,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:23:38,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:23:38,275 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 8 states. [2018-04-11 15:23:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:38,356 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2018-04-11 15:23:38,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:23:38,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-04-11 15:23:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:38,356 INFO L225 Difference]: With dead ends: 113 [2018-04-11 15:23:38,357 INFO L226 Difference]: Without dead ends: 113 [2018-04-11 15:23:38,357 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-11 15:23:38,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-04-11 15:23:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-04-11 15:23:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-11 15:23:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2018-04-11 15:23:38,359 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 39 [2018-04-11 15:23:38,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:38,359 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2018-04-11 15:23:38,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:23:38,359 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2018-04-11 15:23:38,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 15:23:38,359 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:38,359 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-11 15:23:38,360 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-11 15:23:38,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1227427224, now seen corresponding path program 2 times [2018-04-11 15:23:38,360 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:38,360 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:38,360 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:38,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:38,360 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:38,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:38,374 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:23:38,374 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:23:38,374 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:23:38,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:23:38,395 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:23:38,395 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:23:38,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:23:38,405 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-11 15:23:38,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:38,410 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-11 15:23:38,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:38,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:38,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:23:38,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:38,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:38,426 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-11 15:23:38,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:38,433 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-11 15:23:38,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:38,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:38,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:23:38,455 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-11 15:23:38,456 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-11 15:23:38,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:38,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:38,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:38,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 15:23:38,476 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-11 15:23:38,477 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-11 15:23:38,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:38,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:38,486 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-11 15:23:38,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-11 15:23:42,069 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-11 15:23:42,072 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-11 15:23:42,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:42,113 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-11 15:23:42,113 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:23:42,143 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-11 15:23:42,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:42,174 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-11 15:23:42,174 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:42,175 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-11 15:23:42,175 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:42,208 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-11 15:23:42,208 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 15:23:42,237 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-11 15:23:42,237 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:42,260 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-11 15:23:42,261 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 15:23:42,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:23:42,282 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-11 15:23:42,282 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:62, output treesize:38 [2018-04-11 15:23:42,367 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-11 15:23:42,368 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:23:42,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:23:42,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:23:42,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:23:42,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=297, Unknown=1, NotChecked=0, Total=342 [2018-04-11 15:23:42,368 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 19 states. [2018-04-11 15:23:45,536 WARN L148 SmtUtils]: Spent 2011ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-11 15:23:47,073 WARN L148 SmtUtils]: Spent 1356ms on a formula simplification that was a NOOP. DAG size: 50 [2018-04-11 15:23:48,665 WARN L148 SmtUtils]: Spent 1556ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-11 15:23:52,591 WARN L151 SmtUtils]: Spent 3897ms on a formula simplification. DAG size of input: 67 DAG size of output 65 [2018-04-11 15:23:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:53,349 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-04-11 15:23:53,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:23:53,350 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2018-04-11 15:23:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:53,350 INFO L225 Difference]: With dead ends: 133 [2018-04-11 15:23:53,351 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 15:23:53,351 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=142, Invalid=913, Unknown=1, NotChecked=0, Total=1056 [2018-04-11 15:23:53,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 15:23:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-04-11 15:23:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 15:23:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 146 transitions. [2018-04-11 15:23:53,354 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 146 transitions. Word has length 41 [2018-04-11 15:23:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:53,355 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 146 transitions. [2018-04-11 15:23:53,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:23:53,355 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 146 transitions. [2018-04-11 15:23:53,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 15:23:53,355 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:53,355 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-11 15:23:53,355 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-11 15:23:53,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1135874677, now seen corresponding path program 1 times [2018-04-11 15:23:53,356 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:53,356 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:53,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:53,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:23:53,356 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:53,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:53,370 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:23:53,370 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:23:53,370 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:23:53,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:53,390 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:23:53,400 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-11 15:23:53,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:53,406 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-11 15:23:53,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:53,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:53,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:23:53,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:53,434 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-11 15:23:53,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:53,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:53,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:53,448 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-11 15:23:53,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:53,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:53,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:23:53,481 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-11 15:23:53,482 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-11 15:23:53,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:53,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:53,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:53,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:32 [2018-04-11 15:23:53,499 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-11 15:23:53,500 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-11 15:23:53,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:53,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:53,508 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-11 15:23:53,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-04-11 15:23:53,986 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-11 15:23:54,010 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-11 15:23:54,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:23:54,064 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-11 15:23:54,065 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:23:54,101 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-11 15:23:54,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:54,133 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-11 15:23:54,133 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:54,191 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-11 15:23:54,191 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 15:23:54,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 42 treesize of output 32 [2018-04-11 15:23:54,225 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:54,281 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-11 15:23:54,282 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 15:23:54,318 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-11 15:23:54,318 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:54,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 15:23:54,378 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-11 15:23:54,378 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:78, output treesize:129 [2018-04-11 15:23:54,489 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-11 15:23:54,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:23:54,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:23:54,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:23:54,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:23:54,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:23:54,490 INFO L87 Difference]: Start difference. First operand 129 states and 146 transitions. Second operand 20 states. [2018-04-11 15:23:57,020 WARN L148 SmtUtils]: Spent 2015ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-11 15:23:57,712 WARN L151 SmtUtils]: Spent 669ms on a formula simplification. DAG size of input: 78 DAG size of output 56 [2018-04-11 15:23:58,159 WARN L151 SmtUtils]: Spent 420ms on a formula simplification. DAG size of input: 82 DAG size of output 60 [2018-04-11 15:23:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:58,837 INFO L93 Difference]: Finished difference Result 178 states and 198 transitions. [2018-04-11 15:23:58,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:23:58,837 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-04-11 15:23:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:58,838 INFO L225 Difference]: With dead ends: 178 [2018-04-11 15:23:58,838 INFO L226 Difference]: Without dead ends: 178 [2018-04-11 15:23:58,839 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:23:58,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-11 15:23:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2018-04-11 15:23:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-11 15:23:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 191 transitions. [2018-04-11 15:23:58,842 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 191 transitions. Word has length 43 [2018-04-11 15:23:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:58,843 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 191 transitions. [2018-04-11 15:23:58,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:23:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 191 transitions. [2018-04-11 15:23:58,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 15:23:58,843 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:58,844 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-11 15:23:58,844 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-11 15:23:58,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1135874676, now seen corresponding path program 1 times [2018-04-11 15:23:58,844 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:58,844 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:58,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:58,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:58,845 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:58,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:58,892 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-11 15:23:58,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:23:58,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:23:58,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:23:58,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:23:58,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:23:58,893 INFO L87 Difference]: Start difference. First operand 157 states and 191 transitions. Second operand 7 states. [2018-04-11 15:23:58,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:58,953 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2018-04-11 15:23:58,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:23:58,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-04-11 15:23:58,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:58,954 INFO L225 Difference]: With dead ends: 155 [2018-04-11 15:23:58,954 INFO L226 Difference]: Without dead ends: 155 [2018-04-11 15:23:58,954 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-11 15:23:58,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-11 15:23:58,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-04-11 15:23:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-11 15:23:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 185 transitions. [2018-04-11 15:23:58,959 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 185 transitions. Word has length 43 [2018-04-11 15:23:58,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:58,959 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 185 transitions. [2018-04-11 15:23:58,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:23:58,959 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 185 transitions. [2018-04-11 15:23:58,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 15:23:58,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:58,960 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-11 15:23:58,960 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-11 15:23:58,960 INFO L82 PathProgramCache]: Analyzing trace with hash 653871061, now seen corresponding path program 1 times [2018-04-11 15:23:58,960 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:58,960 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:58,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:58,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:58,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:58,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:59,020 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-11 15:23:59,020 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:23:59,021 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:23:59,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:59,043 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:23:59,047 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-11 15:23:59,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:59,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:59,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:23:59,129 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-11 15:23:59,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:23:59,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 11 [2018-04-11 15:23:59,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:23:59,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:23:59,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:23:59,130 INFO L87 Difference]: Start difference. First operand 155 states and 185 transitions. Second operand 12 states. [2018-04-11 15:23:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:59,273 INFO L93 Difference]: Finished difference Result 154 states and 182 transitions. [2018-04-11 15:23:59,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:23:59,274 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-04-11 15:23:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:59,275 INFO L225 Difference]: With dead ends: 154 [2018-04-11 15:23:59,275 INFO L226 Difference]: Without dead ends: 154 [2018-04-11 15:23:59,275 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-11 15:23:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-11 15:23:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-04-11 15:23:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-11 15:23:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2018-04-11 15:23:59,279 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 45 [2018-04-11 15:23:59,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:59,279 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2018-04-11 15:23:59,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:23:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2018-04-11 15:23:59,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 15:23:59,280 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:59,280 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-11 15:23:59,280 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-11 15:23:59,280 INFO L82 PathProgramCache]: Analyzing trace with hash 653871062, now seen corresponding path program 1 times [2018-04-11 15:23:59,280 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:59,281 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:59,281 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:59,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:59,281 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:59,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:59,448 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-11 15:23:59,448 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:23:59,448 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:23:59,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:59,473 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:23:59,475 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-11 15:23:59,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:59,477 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-11 15:23:59,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-11 15:23:59,505 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-11 15:23:59,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:23:59,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 15 [2018-04-11 15:23:59,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:23:59,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:23:59,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:23:59,506 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand 16 states. [2018-04-11 15:23:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:59,717 INFO L93 Difference]: Finished difference Result 164 states and 193 transitions. [2018-04-11 15:23:59,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:23:59,718 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-04-11 15:23:59,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:59,718 INFO L225 Difference]: With dead ends: 164 [2018-04-11 15:23:59,719 INFO L226 Difference]: Without dead ends: 164 [2018-04-11 15:23:59,719 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:23:59,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-11 15:23:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2018-04-11 15:23:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 15:23:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-04-11 15:23:59,722 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 45 [2018-04-11 15:23:59,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:59,723 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-04-11 15:23:59,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:23:59,723 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-04-11 15:23:59,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 15:23:59,723 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:59,723 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-11 15:23:59,723 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-11 15:23:59,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1031240861, now seen corresponding path program 3 times [2018-04-11 15:23:59,723 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:59,723 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:59,724 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:59,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:23:59,724 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:59,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:59,742 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:23:59,742 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:23:59,742 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:23:59,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:23:59,768 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:23:59,768 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:23:59,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:23:59,774 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-11 15:23:59,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:59,779 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-11 15:23:59,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:59,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:59,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:23:59,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:59,794 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-11 15:23:59,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:59,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:59,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:59,819 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-11 15:23:59,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:59,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:59,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:23:59,843 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-11 15:23:59,845 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-11 15:23:59,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:59,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:59,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:59,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-11 15:23:59,863 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-11 15:23:59,864 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-11 15:23:59,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:59,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:59,870 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-11 15:23:59,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-11 15:24:01,297 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-11 15:24:01,300 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-11 15:24:01,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:01,348 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-11 15:24:01,349 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:01,381 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-11 15:24:01,382 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:01,427 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-11 15:24:01,428 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:01,466 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-11 15:24:01,466 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:01,505 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-11 15:24:01,505 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:01,507 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-11 15:24:01,507 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:01,572 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-11 15:24:01,572 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:01,618 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-11 15:24:01,619 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:01,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:24:01,637 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-11 15:24:01,637 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:56, output treesize:32 [2018-04-11 15:24:01,714 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-11 15:24:01,714 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:24:01,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:24:01,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:24:01,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:24:01,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2018-04-11 15:24:01,715 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 17 states. [2018-04-11 15:24:03,596 WARN L148 SmtUtils]: Spent 1677ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-11 15:24:04,599 WARN L151 SmtUtils]: Spent 318ms on a formula simplification. DAG size of input: 78 DAG size of output 53 [2018-04-11 15:24:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:24:04,804 INFO L93 Difference]: Finished difference Result 157 states and 184 transitions. [2018-04-11 15:24:04,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:24:04,805 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-04-11 15:24:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:24:04,805 INFO L225 Difference]: With dead ends: 157 [2018-04-11 15:24:04,805 INFO L226 Difference]: Without dead ends: 115 [2018-04-11 15:24:04,806 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=177, Invalid=752, Unknown=1, NotChecked=0, Total=930 [2018-04-11 15:24:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-11 15:24:04,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2018-04-11 15:24:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 15:24:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2018-04-11 15:24:04,807 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 46 [2018-04-11 15:24:04,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:24:04,808 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2018-04-11 15:24:04,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:24:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2018-04-11 15:24:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 15:24:04,808 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:24:04,808 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-11 15:24:04,808 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-11 15:24:04,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1304865494, now seen corresponding path program 1 times [2018-04-11 15:24:04,808 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:24:04,808 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:24:04,809 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:04,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:24:04,809 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:04,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:24:04,849 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-11 15:24:04,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:24:04,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:24:04,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:24:04,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:24:04,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:24:04,851 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 8 states. [2018-04-11 15:24:04,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:24:04,956 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2018-04-11 15:24:04,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:24:04,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-04-11 15:24:04,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:24:04,957 INFO L225 Difference]: With dead ends: 100 [2018-04-11 15:24:04,957 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 15:24:04,957 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-11 15:24:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 15:24:04,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-04-11 15:24:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-11 15:24:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2018-04-11 15:24:04,959 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 47 [2018-04-11 15:24:04,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:24:04,960 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2018-04-11 15:24:04,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:24:04,960 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2018-04-11 15:24:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 15:24:04,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:24:04,960 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-11 15:24:04,960 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-11 15:24:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1304865495, now seen corresponding path program 1 times [2018-04-11 15:24:04,961 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:24:04,961 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:24:04,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:04,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:24:04,962 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:04,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:24:05,059 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-11 15:24:05,059 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:24:05,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 15:24:05,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:24:05,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:24:05,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:24:05,060 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 12 states. [2018-04-11 15:24:05,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:24:05,233 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-04-11 15:24:05,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:24:05,234 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-04-11 15:24:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:24:05,235 INFO L225 Difference]: With dead ends: 102 [2018-04-11 15:24:05,235 INFO L226 Difference]: Without dead ends: 102 [2018-04-11 15:24:05,235 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-11 15:24:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-11 15:24:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2018-04-11 15:24:05,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-11 15:24:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-04-11 15:24:05,238 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 47 [2018-04-11 15:24:05,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:24:05,238 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-04-11 15:24:05,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:24:05,238 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-04-11 15:24:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 15:24:05,239 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:24:05,239 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-11 15:24:05,239 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-11 15:24:05,239 INFO L82 PathProgramCache]: Analyzing trace with hash -504893548, now seen corresponding path program 1 times [2018-04-11 15:24:05,239 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:24:05,239 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:24:05,240 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:05,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:24:05,240 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:05,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:24:05,259 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:24:05,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:24:05,259 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:24:05,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:24:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:05,284 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:24:05,288 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-11 15:24:05,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:05,293 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-11 15:24:05,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:05,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:05,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:24:05,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:05,313 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-11 15:24:05,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:05,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:05,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:05,323 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-11 15:24:05,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:05,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:05,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:24:05,349 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-11 15:24:05,351 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-11 15:24:05,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:05,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:05,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:05,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 15:24:05,377 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-11 15:24:05,382 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-11 15:24:05,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:05,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:05,395 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-11 15:24:05,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-11 15:24:11,839 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 51 DAG size of output 30 [2018-04-11 15:24:11,961 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-11 15:24:11,966 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-11 15:24:11,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:11,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:11,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:11,974 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-11 15:24:11,974 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:11,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:24:11,990 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-11 15:24:11,990 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:59, output treesize:46 [2018-04-11 15:24:12,128 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-11 15:24:12,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:24:12,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:24:12,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:24:12,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:24:12,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=498, Unknown=3, NotChecked=0, Total=552 [2018-04-11 15:24:12,129 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 24 states. [2018-04-11 15:24:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:24:29,533 INFO L93 Difference]: Finished difference Result 148 states and 166 transitions. [2018-04-11 15:24:29,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:24:29,533 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2018-04-11 15:24:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:24:29,534 INFO L225 Difference]: With dead ends: 148 [2018-04-11 15:24:29,534 INFO L226 Difference]: Without dead ends: 148 [2018-04-11 15:24:29,534 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=165, Invalid=1470, Unknown=5, NotChecked=0, Total=1640 [2018-04-11 15:24:29,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-11 15:24:29,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2018-04-11 15:24:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-11 15:24:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2018-04-11 15:24:29,536 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 48 [2018-04-11 15:24:29,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:24:29,536 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2018-04-11 15:24:29,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:24:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2018-04-11 15:24:29,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:24:29,536 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:24:29,536 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-11 15:24:29,537 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-11 15:24:29,537 INFO L82 PathProgramCache]: Analyzing trace with hash -154986537, now seen corresponding path program 1 times [2018-04-11 15:24:29,537 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:24:29,537 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:24:29,537 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:29,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:24:29,537 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:29,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:24:29,572 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-11 15:24:29,573 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:24:29,573 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:24:29,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:24:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:29,587 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:24:29,589 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-11 15:24:29,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:29,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:29,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:24:29,636 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-11 15:24:29,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:24:29,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 11 [2018-04-11 15:24:29,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:24:29,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:24:29,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:24:29,637 INFO L87 Difference]: Start difference. First operand 127 states and 152 transitions. Second operand 12 states. [2018-04-11 15:24:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:24:29,803 INFO L93 Difference]: Finished difference Result 126 states and 149 transitions. [2018-04-11 15:24:29,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:24:29,803 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-04-11 15:24:29,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:24:29,805 INFO L225 Difference]: With dead ends: 126 [2018-04-11 15:24:29,805 INFO L226 Difference]: Without dead ends: 126 [2018-04-11 15:24:29,806 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-11 15:24:29,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-11 15:24:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-11 15:24:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 15:24:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2018-04-11 15:24:29,810 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 49 [2018-04-11 15:24:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:24:29,811 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2018-04-11 15:24:29,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:24:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2018-04-11 15:24:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:24:29,812 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:24:29,812 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-11 15:24:29,812 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-11 15:24:29,812 INFO L82 PathProgramCache]: Analyzing trace with hash -154986536, now seen corresponding path program 1 times [2018-04-11 15:24:29,812 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:24:29,812 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:24:29,813 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:29,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:24:29,813 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:29,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:24:29,992 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-11 15:24:29,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:24:29,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:24:29,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:24:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:30,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:24:30,018 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-11 15:24:30,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:30,019 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-11 15:24:30,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-11 15:24:30,048 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-11 15:24:30,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:24:30,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 16 [2018-04-11 15:24:30,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:24:30,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:24:30,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:24:30,049 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand 17 states. [2018-04-11 15:24:30,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:24:30,317 INFO L93 Difference]: Finished difference Result 179 states and 212 transitions. [2018-04-11 15:24:30,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:24:30,317 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-04-11 15:24:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:24:30,318 INFO L225 Difference]: With dead ends: 179 [2018-04-11 15:24:30,318 INFO L226 Difference]: Without dead ends: 179 [2018-04-11 15:24:30,318 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-11 15:24:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-11 15:24:30,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 138. [2018-04-11 15:24:30,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 15:24:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2018-04-11 15:24:30,321 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 49 [2018-04-11 15:24:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:24:30,321 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2018-04-11 15:24:30,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:24:30,321 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2018-04-11 15:24:30,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 15:24:30,321 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:24:30,321 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-11 15:24:30,321 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-11 15:24:30,322 INFO L82 PathProgramCache]: Analyzing trace with hash -446349253, now seen corresponding path program 1 times [2018-04-11 15:24:30,322 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:24:30,322 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:24:30,322 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:30,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:24:30,322 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:30,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:24:30,403 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-11 15:24:30,403 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:24:30,403 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:24:30,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:24:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:30,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:24:30,440 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-11 15:24:30,440 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:24:30,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-04-11 15:24:30,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:24:30,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:24:30,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:24:30,441 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand 10 states. [2018-04-11 15:24:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:24:30,511 INFO L93 Difference]: Finished difference Result 236 states and 272 transitions. [2018-04-11 15:24:30,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:24:30,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-04-11 15:24:30,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:24:30,512 INFO L225 Difference]: With dead ends: 236 [2018-04-11 15:24:30,512 INFO L226 Difference]: Without dead ends: 236 [2018-04-11 15:24:30,512 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-11 15:24:30,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-11 15:24:30,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 225. [2018-04-11 15:24:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-11 15:24:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 262 transitions. [2018-04-11 15:24:30,517 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 262 transitions. Word has length 52 [2018-04-11 15:24:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:24:30,518 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 262 transitions. [2018-04-11 15:24:30,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:24:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 262 transitions. [2018-04-11 15:24:30,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 15:24:30,518 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:24:30,519 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-11 15:24:30,519 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-11 15:24:30,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2138861013, now seen corresponding path program 2 times [2018-04-11 15:24:30,519 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:24:30,519 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:24:30,520 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:30,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:24:30,520 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:30,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:24:30,540 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:24:30,541 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:24:30,541 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:24:30,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:24:30,570 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:24:30,571 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:24:30,574 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:24:30,588 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-11 15:24:30,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:30,594 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-11 15:24:30,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:30,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:30,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:24:30,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:30,613 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-11 15:24:30,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:30,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:30,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:30,624 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-11 15:24:30,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:30,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:30,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:24:30,650 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-11 15:24:30,652 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-11 15:24:30,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:30,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:30,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:30,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-11 15:24:30,674 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-11 15:24:30,676 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-11 15:24:30,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:30,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:30,685 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-11 15:24:30,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-11 15:24:34,924 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-11 15:24:34,941 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-11 15:24:34,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-04-11 15:24:35,046 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-11 15:24:35,046 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-11 15:24:35,140 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-11 15:24:35,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:35,141 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-11 15:24:35,142 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:35,143 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-11 15:24:35,143 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:35,144 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-11 15:24:35,145 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:35,212 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-11 15:24:35,212 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:35,285 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-11 15:24:35,285 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:35,365 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-11 15:24:35,365 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:35,473 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-11 15:24:35,473 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:35,478 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-11 15:24:35,478 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:35,535 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-11 15:24:35,535 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:35,536 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-11 15:24:35,536 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:35,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-04-11 15:24:35,643 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-11 15:24:35,643 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:52, output treesize:91 [2018-04-11 15:24:35,785 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-11 15:24:35,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:24:35,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:24:35,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:24:35,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:24:35,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=361, Unknown=2, NotChecked=0, Total=420 [2018-04-11 15:24:35,785 INFO L87 Difference]: Start difference. First operand 225 states and 262 transitions. Second operand 21 states. [2018-04-11 15:24:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:24:36,781 INFO L93 Difference]: Finished difference Result 240 states and 275 transitions. [2018-04-11 15:24:36,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:24:36,781 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-04-11 15:24:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:24:36,782 INFO L225 Difference]: With dead ends: 240 [2018-04-11 15:24:36,782 INFO L226 Difference]: Without dead ends: 151 [2018-04-11 15:24:36,782 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=188, Invalid=1070, Unknown=2, NotChecked=0, Total=1260 [2018-04-11 15:24:36,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-11 15:24:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 74. [2018-04-11 15:24:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 15:24:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-04-11 15:24:36,784 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 53 [2018-04-11 15:24:36,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:24:36,785 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-04-11 15:24:36,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:24:36,785 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-04-11 15:24:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 15:24:36,785 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:24:36,785 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-11 15:24:36,786 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-11 15:24:36,786 INFO L82 PathProgramCache]: Analyzing trace with hash -994314088, now seen corresponding path program 2 times [2018-04-11 15:24:36,786 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:24:36,786 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:24:36,786 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:36,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:24:36,787 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:36,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:24:36,804 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:24:36,804 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:24:36,805 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:24:36,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:24:36,840 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:24:36,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:24:36,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:24:36,858 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-11 15:24:36,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:36,864 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-11 15:24:36,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:36,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:36,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:24:36,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:36,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:36,885 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-11 15:24:36,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:36,893 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-11 15:24:36,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:36,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:36,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:24:36,919 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-11 15:24:36,921 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-11 15:24:36,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:36,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:36,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:36,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 15:24:36,940 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-11 15:24:36,941 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-11 15:24:36,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:36,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:36,948 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-11 15:24:36,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-11 15:24:39,996 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-11 15:24:39,998 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-11 15:24:39,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:40,036 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-11 15:24:40,037 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:40,060 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-11 15:24:40,061 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:40,088 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-11 15:24:40,089 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:40,110 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-11 15:24:40,111 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:40,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 19 treesize of output 17 [2018-04-11 15:24:40,132 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:40,150 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-11 15:24:40,150 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:40,170 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-11 15:24:40,170 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:40,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:24:40,196 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-11 15:24:40,196 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:54, output treesize:30 [2018-04-11 15:24:40,242 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-11 15:24:40,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:24:40,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:24:40,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:24:40,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:24:40,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=366, Unknown=1, NotChecked=0, Total=420 [2018-04-11 15:24:40,243 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 21 states. [2018-04-11 15:24:42,554 WARN L148 SmtUtils]: Spent 2010ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-11 15:24:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:24:43,740 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2018-04-11 15:24:43,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:24:43,741 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-04-11 15:24:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:24:43,741 INFO L225 Difference]: With dead ends: 137 [2018-04-11 15:24:43,741 INFO L226 Difference]: Without dead ends: 137 [2018-04-11 15:24:43,742 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=142, Invalid=979, Unknown=1, NotChecked=0, Total=1122 [2018-04-11 15:24:43,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-11 15:24:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 113. [2018-04-11 15:24:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-11 15:24:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2018-04-11 15:24:43,744 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 56 [2018-04-11 15:24:43,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:24:43,744 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2018-04-11 15:24:43,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:24:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2018-04-11 15:24:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 15:24:43,744 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:24:43,745 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-11 15:24:43,745 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-11 15:24:43,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2053099207, now seen corresponding path program 1 times [2018-04-11 15:24:43,745 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:24:43,745 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:24:43,745 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:43,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:24:43,745 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:43,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:24:43,886 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-11 15:24:43,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:24:43,887 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:24:43,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:24:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:43,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:24:43,930 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-11 15:24:43,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:43,931 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-11 15:24:43,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-11 15:24:43,996 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-11 15:24:43,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:24:43,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2018-04-11 15:24:43,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:24:43,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:24:43,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:24:43,998 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 15 states. [2018-04-11 15:24:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:24:44,226 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2018-04-11 15:24:44,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:24:44,226 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-04-11 15:24:44,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:24:44,227 INFO L225 Difference]: With dead ends: 141 [2018-04-11 15:24:44,227 INFO L226 Difference]: Without dead ends: 141 [2018-04-11 15:24:44,227 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:24:44,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-11 15:24:44,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2018-04-11 15:24:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 15:24:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2018-04-11 15:24:44,230 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 58 [2018-04-11 15:24:44,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:24:44,230 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2018-04-11 15:24:44,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:24:44,230 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2018-04-11 15:24:44,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 15:24:44,231 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:24:44,231 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-11 15:24:44,231 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-11 15:24:44,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1827516351, now seen corresponding path program 1 times [2018-04-11 15:24:44,231 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:24:44,232 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:24:44,232 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:44,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:24:44,232 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:44,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:24:44,250 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:24:44,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:24:44,250 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:24:44,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:24:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:44,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:24:44,292 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-11 15:24:44,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:44,298 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-11 15:24:44,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:44,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:44,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:24:44,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:44,339 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-11 15:24:44,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:44,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:44,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:44,351 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-11 15:24:44,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:44,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:44,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:24:44,388 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-11 15:24:44,390 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-11 15:24:44,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:44,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:44,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:44,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-04-11 15:24:44,417 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-11 15:24:44,419 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-11 15:24:44,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:44,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:44,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:44,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-04-11 15:24:44,727 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-11 15:24:44,729 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-11 15:24:44,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:44,740 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-11 15:24:44,741 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:44,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:24:44,751 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-11 15:24:44,752 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2018-04-11 15:24:44,793 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-11 15:24:44,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:24:44,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:24:44,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:24:44,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:24:44,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:24:44,794 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand 22 states. [2018-04-11 15:24:45,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:24:45,557 INFO L93 Difference]: Finished difference Result 185 states and 215 transitions. [2018-04-11 15:24:45,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:24:45,558 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-04-11 15:24:45,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:24:45,558 INFO L225 Difference]: With dead ends: 185 [2018-04-11 15:24:45,558 INFO L226 Difference]: Without dead ends: 185 [2018-04-11 15:24:45,559 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-11 15:24:45,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-11 15:24:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 166. [2018-04-11 15:24:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-11 15:24:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 198 transitions. [2018-04-11 15:24:45,561 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 198 transitions. Word has length 61 [2018-04-11 15:24:45,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:24:45,561 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 198 transitions. [2018-04-11 15:24:45,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:24:45,561 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 198 transitions. [2018-04-11 15:24:45,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 15:24:45,562 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:24:45,562 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-11 15:24:45,562 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-11 15:24:45,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1799395259, now seen corresponding path program 1 times [2018-04-11 15:24:45,562 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:24:45,562 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:24:45,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:45,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:24:45,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:45,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:24:45,821 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-11 15:24:45,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:24:45,822 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:24:45,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:24:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:45,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:24:45,858 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-11 15:24:45,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:45,859 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-11 15:24:45,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-11 15:24:45,972 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-11 15:24:45,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:24:45,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 24 [2018-04-11 15:24:45,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:24:45,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:24:45,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:24:45,973 INFO L87 Difference]: Start difference. First operand 166 states and 198 transitions. Second operand 25 states. [2018-04-11 15:24:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:24:46,358 INFO L93 Difference]: Finished difference Result 242 states and 282 transitions. [2018-04-11 15:24:46,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:24:46,358 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-04-11 15:24:46,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:24:46,359 INFO L225 Difference]: With dead ends: 242 [2018-04-11 15:24:46,359 INFO L226 Difference]: Without dead ends: 242 [2018-04-11 15:24:46,359 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-11 15:24:46,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-11 15:24:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 183. [2018-04-11 15:24:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-11 15:24:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 225 transitions. [2018-04-11 15:24:46,362 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 225 transitions. Word has length 62 [2018-04-11 15:24:46,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:24:46,363 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 225 transitions. [2018-04-11 15:24:46,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:24:46,363 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 225 transitions. [2018-04-11 15:24:46,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 15:24:46,363 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:24:46,363 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-11 15:24:46,363 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-11 15:24:46,363 INFO L82 PathProgramCache]: Analyzing trace with hash -34958984, now seen corresponding path program 3 times [2018-04-11 15:24:46,363 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:24:46,363 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:24:46,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:46,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:24:46,364 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:46,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:24:46,502 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-11 15:24:46,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:24:46,503 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:24:46,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:24:46,534 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 15:24:46,534 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:24:46,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:24:46,565 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-11 15:24:46,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:24:46,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-04-11 15:24:46,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:24:46,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:24:46,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:24:46,566 INFO L87 Difference]: Start difference. First operand 183 states and 225 transitions. Second operand 12 states. [2018-04-11 15:24:46,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:24:46,734 INFO L93 Difference]: Finished difference Result 329 states and 390 transitions. [2018-04-11 15:24:46,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:24:46,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-04-11 15:24:46,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:24:46,735 INFO L225 Difference]: With dead ends: 329 [2018-04-11 15:24:46,736 INFO L226 Difference]: Without dead ends: 329 [2018-04-11 15:24:46,736 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-11 15:24:46,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-04-11 15:24:46,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 297. [2018-04-11 15:24:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-11 15:24:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 359 transitions. [2018-04-11 15:24:46,741 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 359 transitions. Word has length 65 [2018-04-11 15:24:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:24:46,741 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 359 transitions. [2018-04-11 15:24:46,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:24:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 359 transitions. [2018-04-11 15:24:46,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 15:24:46,742 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:24:46,742 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-11 15:24:46,742 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-11 15:24:46,742 INFO L82 PathProgramCache]: Analyzing trace with hash -993830664, now seen corresponding path program 2 times [2018-04-11 15:24:46,742 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:24:46,743 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:24:46,743 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:46,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:24:46,743 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:46,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:24:46,776 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:24:46,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:24:46,776 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:24:46,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:24:46,814 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:24:46,814 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:24:46,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:24:46,821 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-11 15:24:46,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:46,838 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-11 15:24:46,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:46,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:46,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:24:46,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:46,859 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-11 15:24:46,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:46,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:46,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:46,871 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-11 15:24:46,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:46,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:46,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:24:46,902 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-11 15:24:46,904 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-11 15:24:46,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:46,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:46,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:46,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-11 15:24:46,928 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-11 15:24:46,930 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-11 15:24:46,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:46,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:46,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:46,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-04-11 15:24:47,268 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-11 15:24:47,284 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-11 15:24:47,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:47,293 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-11 15:24:47,293 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:47,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:24:47,311 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-11 15:24:47,311 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:56, output treesize:60 [2018-04-11 15:24:47,465 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-11 15:24:47,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:24:47,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:24:47,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:24:47,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:24:47,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:24:47,466 INFO L87 Difference]: Start difference. First operand 297 states and 359 transitions. Second operand 23 states. [2018-04-11 15:24:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:24:48,272 INFO L93 Difference]: Finished difference Result 345 states and 405 transitions. [2018-04-11 15:24:48,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:24:48,272 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-04-11 15:24:48,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:24:48,273 INFO L225 Difference]: With dead ends: 345 [2018-04-11 15:24:48,273 INFO L226 Difference]: Without dead ends: 214 [2018-04-11 15:24:48,273 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=1390, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:24:48,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-11 15:24:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 91. [2018-04-11 15:24:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-11 15:24:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2018-04-11 15:24:48,275 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 66 [2018-04-11 15:24:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:24:48,275 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2018-04-11 15:24:48,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:24:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-04-11 15:24:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 15:24:48,276 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:24:48,276 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-11 15:24:48,276 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-11 15:24:48,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1328474053, now seen corresponding path program 4 times [2018-04-11 15:24:48,276 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:24:48,276 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:24:48,276 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:48,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:24:48,277 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:48,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:24:48,301 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:24:48,301 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:24:48,301 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:24:48,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:24:48,339 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:24:48,339 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:24:48,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:24:48,347 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-11 15:24:48,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:48,353 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-11 15:24:48,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:48,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:48,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:24:48,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:48,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:48,373 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-11 15:24:48,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:48,382 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-11 15:24:48,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:48,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:48,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:24:48,420 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-11 15:24:48,422 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-11 15:24:48,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:48,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:48,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:48,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-04-11 15:24:48,449 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-11 15:24:48,456 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-11 15:24:48,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:48,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:48,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:48,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-04-11 15:24:48,950 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-11 15:24:48,955 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-11 15:24:48,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:48,962 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-11 15:24:48,963 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:48,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:24:48,980 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-11 15:24:48,980 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:59, output treesize:66 [2018-04-11 15:24:49,093 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-11 15:24:49,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:24:49,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 15:24:49,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 15:24:49,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 15:24:49,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:24:49,093 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 27 states. [2018-04-11 15:24:50,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:24:50,310 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2018-04-11 15:24:50,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:24:50,310 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 69 [2018-04-11 15:24:50,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:24:50,311 INFO L225 Difference]: With dead ends: 161 [2018-04-11 15:24:50,311 INFO L226 Difference]: Without dead ends: 161 [2018-04-11 15:24:50,311 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-11 15:24:50,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-11 15:24:50,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 138. [2018-04-11 15:24:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 15:24:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2018-04-11 15:24:50,313 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 69 [2018-04-11 15:24:50,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:24:50,313 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2018-04-11 15:24:50,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 15:24:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2018-04-11 15:24:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:24:50,314 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:24:50,314 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-11 15:24:50,314 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-11 15:24:50,314 INFO L82 PathProgramCache]: Analyzing trace with hash -689622706, now seen corresponding path program 3 times [2018-04-11 15:24:50,314 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:24:50,314 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:24:50,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:50,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:24:50,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:50,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:24:50,341 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:24:50,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:24:50,341 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:24:50,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:24:50,398 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 15:24:50,398 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:24:50,404 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:24:50,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-11 15:24:50,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:50,424 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-11 15:24:50,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:50,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:50,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:24:50,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:50,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:24:50,444 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-11 15:24:50,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:50,451 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-11 15:24:50,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:50,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:50,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:24:50,476 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-11 15:24:50,478 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-11 15:24:50,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:50,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:50,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:50,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-11 15:24:50,501 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-11 15:24:50,503 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-11 15:24:50,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:50,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:50,513 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-11 15:24:50,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-11 15:24:55,626 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-11 15:24:55,631 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-11 15:24:55,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:55,637 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-11 15:24:55,637 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:55,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:24:55,645 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-11 15:24:55,645 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-04-11 15:24:55,698 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-11 15:24:55,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:24:55,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:24:55,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:24:55,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:24:55,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=261, Unknown=2, NotChecked=0, Total=306 [2018-04-11 15:24:55,699 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand 18 states. [2018-04-11 15:24:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:24:57,744 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions. [2018-04-11 15:24:57,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:24:57,745 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2018-04-11 15:24:57,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:24:57,746 INFO L225 Difference]: With dead ends: 159 [2018-04-11 15:24:57,746 INFO L226 Difference]: Without dead ends: 159 [2018-04-11 15:24:57,746 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=142, Invalid=726, Unknown=2, NotChecked=0, Total=870 [2018-04-11 15:24:57,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-11 15:24:57,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 90. [2018-04-11 15:24:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-11 15:24:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-04-11 15:24:57,749 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 74 [2018-04-11 15:24:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:24:57,749 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-04-11 15:24:57,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:24:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-04-11 15:24:57,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-11 15:24:57,750 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:24:57,750 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-11 15:24:57,750 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-11 15:24:57,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1149641066, now seen corresponding path program 2 times [2018-04-11 15:24:57,750 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:24:57,751 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:24:57,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:57,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:24:57,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:57,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:24:57,943 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-11 15:24:57,944 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:24:57,944 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:24:57,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:24:57,968 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:24:57,968 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:24:57,972 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:24:58,024 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-11 15:24:58,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:24:58,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-04-11 15:24:58,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:24:58,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:24:58,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:24:58,026 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 14 states. [2018-04-11 15:24:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:24:58,201 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2018-04-11 15:24:58,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:24:58,202 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-04-11 15:24:58,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:24:58,202 INFO L225 Difference]: With dead ends: 161 [2018-04-11 15:24:58,203 INFO L226 Difference]: Without dead ends: 95 [2018-04-11 15:24:58,203 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-11 15:24:58,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-11 15:24:58,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-04-11 15:24:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-04-11 15:24:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2018-04-11 15:24:58,205 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 80 [2018-04-11 15:24:58,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:24:58,205 INFO L459 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2018-04-11 15:24:58,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:24:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2018-04-11 15:24:58,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:24:58,206 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:24:58,206 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-11 15:24:58,206 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-11 15:24:58,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1276287347, now seen corresponding path program 3 times [2018-04-11 15:24:58,206 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:24:58,206 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:24:58,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:58,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:24:58,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:24:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:24:58,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:24:58,446 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-11 15:24:58,446 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:24:58,446 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:24:58,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:24:58,533 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:24:58,533 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:24:58,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:24:58,569 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-11 15:24:58,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:58,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:58,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:24:58,615 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-11 15:24:58,618 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-11 15:24:58,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:58,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:58,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:24:58,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-11 15:24:59,187 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-11 15:24:59,194 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-11 15:24:59,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:59,210 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-11 15:24:59,210 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:59,212 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-11 15:24:59,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:24:59,229 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-11 15:24:59,229 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 15:24:59,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:24:59,242 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-11 15:24:59,242 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-04-11 15:24:59,343 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-11 15:24:59,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:24:59,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 39 [2018-04-11 15:24:59,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 15:24:59,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 15:24:59,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1449, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:24:59,344 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 40 states. [2018-04-11 15:25:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:01,320 INFO L93 Difference]: Finished difference Result 221 states and 252 transitions. [2018-04-11 15:25:01,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 15:25:01,320 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2018-04-11 15:25:01,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:01,321 INFO L225 Difference]: With dead ends: 221 [2018-04-11 15:25:01,321 INFO L226 Difference]: Without dead ends: 221 [2018-04-11 15:25:01,322 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1438 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=564, Invalid=5916, Unknown=0, NotChecked=0, Total=6480 [2018-04-11 15:25:01,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-11 15:25:01,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 103. [2018-04-11 15:25:01,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-11 15:25:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2018-04-11 15:25:01,323 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 84 [2018-04-11 15:25:01,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:01,323 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2018-04-11 15:25:01,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 15:25:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2018-04-11 15:25:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-11 15:25:01,324 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:01,324 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-11 15:25:01,324 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-11 15:25:01,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1242412257, now seen corresponding path program 4 times [2018-04-11 15:25:01,324 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:01,324 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:01,324 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:01,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:01,325 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:01,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:01,527 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-11 15:25:01,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:01,527 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:01,528 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:25:01,572 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:25:01,573 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:01,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:01,589 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-11 15:25:01,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:25:01,590 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-11 15:25:01,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-11 15:25:02,198 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-11 15:25:02,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:02,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-04-11 15:25:02,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 15:25:02,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 15:25:02,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=858, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:25:02,199 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand 31 states. [2018-04-11 15:25:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:03,672 INFO L93 Difference]: Finished difference Result 249 states and 281 transitions. [2018-04-11 15:25:03,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-11 15:25:03,672 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 93 [2018-04-11 15:25:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:03,673 INFO L225 Difference]: With dead ends: 249 [2018-04-11 15:25:03,673 INFO L226 Difference]: Without dead ends: 152 [2018-04-11 15:25:03,674 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=454, Invalid=4658, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 15:25:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-11 15:25:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 116. [2018-04-11 15:25:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 15:25:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2018-04-11 15:25:03,676 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 93 [2018-04-11 15:25:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:03,676 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2018-04-11 15:25:03,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 15:25:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2018-04-11 15:25:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-04-11 15:25:03,676 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:03,676 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-11 15:25:03,676 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-11 15:25:03,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2075901424, now seen corresponding path program 5 times [2018-04-11 15:25:03,677 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:03,677 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:03,677 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:03,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:03,677 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:03,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:03,905 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-11 15:25:03,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:03,905 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:03,906 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:25:03,961 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:25:03,962 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:03,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:04,028 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-11 15:25:04,029 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:04,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-04-11 15:25:04,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:25:04,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:25:04,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:25:04,030 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand 18 states. [2018-04-11 15:25:04,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:04,364 INFO L93 Difference]: Finished difference Result 219 states and 253 transitions. [2018-04-11 15:25:04,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:25:04,364 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 106 [2018-04-11 15:25:04,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:04,365 INFO L225 Difference]: With dead ends: 219 [2018-04-11 15:25:04,365 INFO L226 Difference]: Without dead ends: 121 [2018-04-11 15:25:04,365 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:25:04,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-04-11 15:25:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-04-11 15:25:04,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-11 15:25:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2018-04-11 15:25:04,367 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 106 [2018-04-11 15:25:04,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:04,367 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2018-04-11 15:25:04,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:25:04,367 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2018-04-11 15:25:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-04-11 15:25:04,368 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:04,368 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-11 15:25:04,368 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-11 15:25:04,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1745089197, now seen corresponding path program 6 times [2018-04-11 15:25:04,368 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:04,368 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:04,369 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:04,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:04,369 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:04,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:04,754 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-11 15:25:04,754 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:04,754 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:04,755 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:25:04,858 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-11 15:25:04,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:04,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:04,877 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-11 15:25:04,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:25:04,879 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-11 15:25:04,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-11 15:25:04,944 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-11 15:25:04,945 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:04,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 22 [2018-04-11 15:25:04,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:25:04,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:25:04,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:25:04,946 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand 23 states. [2018-04-11 15:25:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:05,657 INFO L93 Difference]: Finished difference Result 178 states and 200 transitions. [2018-04-11 15:25:05,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:25:05,658 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 110 [2018-04-11 15:25:05,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:05,659 INFO L225 Difference]: With dead ends: 178 [2018-04-11 15:25:05,659 INFO L226 Difference]: Without dead ends: 178 [2018-04-11 15:25:05,659 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=1446, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 15:25:05,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-11 15:25:05,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 129. [2018-04-11 15:25:05,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 15:25:05,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-04-11 15:25:05,662 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 110 [2018-04-11 15:25:05,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:05,663 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-04-11 15:25:05,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:25:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-04-11 15:25:05,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-11 15:25:05,663 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:05,664 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-11 15:25:05,664 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-11 15:25:05,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1511568165, now seen corresponding path program 7 times [2018-04-11 15:25:05,664 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:05,664 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:05,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:05,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:05,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:05,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:05,953 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-11 15:25:05,954 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:05,954 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:05,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:25:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:05,978 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:06,049 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-11 15:25:06,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:06,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-04-11 15:25:06,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:25:06,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:25:06,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:25:06,051 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand 20 states. [2018-04-11 15:25:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:06,392 INFO L93 Difference]: Finished difference Result 248 states and 288 transitions. [2018-04-11 15:25:06,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:25:06,392 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2018-04-11 15:25:06,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:06,392 INFO L225 Difference]: With dead ends: 248 [2018-04-11 15:25:06,392 INFO L226 Difference]: Without dead ends: 134 [2018-04-11 15:25:06,393 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-11 15:25:06,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-11 15:25:06,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-04-11 15:25:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-11 15:25:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2018-04-11 15:25:06,394 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 119 [2018-04-11 15:25:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:06,394 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2018-04-11 15:25:06,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:25:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2018-04-11 15:25:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-04-11 15:25:06,395 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:06,395 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-11 15:25:06,395 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-11 15:25:06,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1000625752, now seen corresponding path program 8 times [2018-04-11 15:25:06,395 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:06,395 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:06,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:06,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:25:06,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:06,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:06,830 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-11 15:25:06,831 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:06,831 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:06,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:25:06,895 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:25:06,895 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:06,900 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:06,909 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-11 15:25:06,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:25:06,910 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-11 15:25:06,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-11 15:25:07,219 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-11 15:25:07,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:07,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 38 [2018-04-11 15:25:07,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 15:25:07,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 15:25:07,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1323, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:25:07,220 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 39 states. [2018-04-11 15:25:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:08,267 INFO L93 Difference]: Finished difference Result 208 states and 236 transitions. [2018-04-11 15:25:08,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 15:25:08,267 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 123 [2018-04-11 15:25:08,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:08,267 INFO L225 Difference]: With dead ends: 208 [2018-04-11 15:25:08,267 INFO L226 Difference]: Without dead ends: 208 [2018-04-11 15:25:08,268 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=418, Invalid=3488, Unknown=0, NotChecked=0, Total=3906 [2018-04-11 15:25:08,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-04-11 15:25:08,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 151. [2018-04-11 15:25:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-11 15:25:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 178 transitions. [2018-04-11 15:25:08,270 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 178 transitions. Word has length 123 [2018-04-11 15:25:08,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:08,270 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 178 transitions. [2018-04-11 15:25:08,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 15:25:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 178 transitions. [2018-04-11 15:25:08,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-04-11 15:25:08,270 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:08,270 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-11 15:25:08,271 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-11 15:25:08,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1911359464, now seen corresponding path program 9 times [2018-04-11 15:25:08,271 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:08,271 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:08,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:08,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:08,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:08,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:08,613 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-11 15:25:08,614 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:08,614 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:08,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:25:08,751 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-04-11 15:25:08,752 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:08,757 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:08,812 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-11 15:25:08,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:08,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-04-11 15:25:08,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:25:08,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:25:08,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:25:08,813 INFO L87 Difference]: Start difference. First operand 151 states and 178 transitions. Second operand 23 states. [2018-04-11 15:25:09,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:09,332 INFO L93 Difference]: Finished difference Result 286 states and 335 transitions. [2018-04-11 15:25:09,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:25:09,333 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 141 [2018-04-11 15:25:09,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:09,334 INFO L225 Difference]: With dead ends: 286 [2018-04-11 15:25:09,334 INFO L226 Difference]: Without dead ends: 156 [2018-04-11 15:25:09,334 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-11 15:25:09,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-11 15:25:09,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-04-11 15:25:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-11 15:25:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2018-04-11 15:25:09,339 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 141 [2018-04-11 15:25:09,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:09,339 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2018-04-11 15:25:09,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:25:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2018-04-11 15:25:09,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-04-11 15:25:09,340 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:09,340 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-11 15:25:09,340 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-11 15:25:09,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2136271403, now seen corresponding path program 10 times [2018-04-11 15:25:09,340 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:09,340 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:09,341 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:09,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:09,341 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:09,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:09,823 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-11 15:25:09,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:09,823 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:09,823 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:25:09,879 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:25:09,880 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:09,887 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:09,888 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-11 15:25:09,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:25:09,889 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-11 15:25:09,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-11 15:25:10,554 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-11 15:25:10,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:10,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-04-11 15:25:10,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-11 15:25:10,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-11 15:25:10,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2014, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 15:25:10,556 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand 47 states. [2018-04-11 15:25:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:14,013 INFO L93 Difference]: Finished difference Result 421 states and 477 transitions. [2018-04-11 15:25:14,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-11 15:25:14,014 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 145 [2018-04-11 15:25:14,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:14,014 INFO L225 Difference]: With dead ends: 421 [2018-04-11 15:25:14,014 INFO L226 Difference]: Without dead ends: 240 [2018-04-11 15:25:14,017 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3244 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1226, Invalid=13054, Unknown=0, NotChecked=0, Total=14280 [2018-04-11 15:25:14,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-11 15:25:14,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 168. [2018-04-11 15:25:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 15:25:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 198 transitions. [2018-04-11 15:25:14,019 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 198 transitions. Word has length 145 [2018-04-11 15:25:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:14,019 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 198 transitions. [2018-04-11 15:25:14,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-11 15:25:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 198 transitions. [2018-04-11 15:25:14,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-04-11 15:25:14,019 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:14,020 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-11 15:25:14,020 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-11 15:25:14,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1340707836, now seen corresponding path program 11 times [2018-04-11 15:25:14,020 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:14,020 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:14,020 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:14,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:14,020 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:14,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:14,479 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-11 15:25:14,480 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:14,480 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:14,480 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:25:14,589 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-04-11 15:25:14,589 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:14,600 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:14,687 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-11 15:25:14,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:14,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-04-11 15:25:14,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:25:14,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:25:14,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:25:14,689 INFO L87 Difference]: Start difference. First operand 168 states and 198 transitions. Second operand 26 states. [2018-04-11 15:25:15,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:15,141 INFO L93 Difference]: Finished difference Result 335 states and 393 transitions. [2018-04-11 15:25:15,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:25:15,141 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 158 [2018-04-11 15:25:15,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:15,142 INFO L225 Difference]: With dead ends: 335 [2018-04-11 15:25:15,142 INFO L226 Difference]: Without dead ends: 173 [2018-04-11 15:25:15,142 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-11 15:25:15,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-11 15:25:15,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-04-11 15:25:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-04-11 15:25:15,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 202 transitions. [2018-04-11 15:25:15,145 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 202 transitions. Word has length 158 [2018-04-11 15:25:15,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:15,145 INFO L459 AbstractCegarLoop]: Abstraction has 172 states and 202 transitions. [2018-04-11 15:25:15,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:25:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 202 transitions. [2018-04-11 15:25:15,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-04-11 15:25:15,145 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:15,145 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-11 15:25:15,145 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-11 15:25:15,146 INFO L82 PathProgramCache]: Analyzing trace with hash 2036135969, now seen corresponding path program 12 times [2018-04-11 15:25:15,146 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:15,146 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:15,146 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:15,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:15,146 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:15,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:15,762 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-11 15:25:15,762 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:15,762 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:15,763 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:25:16,040 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-04-11 15:25:16,040 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:16,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:16,072 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-11 15:25:16,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:25:16,073 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-11 15:25:16,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-11 15:25:16,285 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-11 15:25:16,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:16,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 36 [2018-04-11 15:25:16,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 15:25:16,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 15:25:16,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:25:16,287 INFO L87 Difference]: Start difference. First operand 172 states and 202 transitions. Second operand 37 states. [2018-04-11 15:25:17,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:17,255 INFO L93 Difference]: Finished difference Result 284 states and 321 transitions. [2018-04-11 15:25:17,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-11 15:25:17,255 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 162 [2018-04-11 15:25:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:17,256 INFO L225 Difference]: With dead ends: 284 [2018-04-11 15:25:17,256 INFO L226 Difference]: Without dead ends: 284 [2018-04-11 15:25:17,257 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=877, Invalid=4379, Unknown=0, NotChecked=0, Total=5256 [2018-04-11 15:25:17,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-04-11 15:25:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 190. [2018-04-11 15:25:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-11 15:25:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 226 transitions. [2018-04-11 15:25:17,260 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 226 transitions. Word has length 162 [2018-04-11 15:25:17,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:17,261 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 226 transitions. [2018-04-11 15:25:17,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 15:25:17,261 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 226 transitions. [2018-04-11 15:25:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-04-11 15:25:17,261 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:17,262 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-11 15:25:17,262 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-11 15:25:17,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1744767521, now seen corresponding path program 13 times [2018-04-11 15:25:17,262 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:17,262 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:17,263 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:17,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:17,263 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:17,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:17,830 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-11 15:25:17,830 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:17,830 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:17,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:25:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:17,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:17,928 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-11 15:25:17,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:17,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-04-11 15:25:17,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:25:17,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:25:17,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:25:17,929 INFO L87 Difference]: Start difference. First operand 190 states and 226 transitions. Second operand 28 states. [2018-04-11 15:25:18,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:18,527 INFO L93 Difference]: Finished difference Result 373 states and 440 transitions. [2018-04-11 15:25:18,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:25:18,528 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 180 [2018-04-11 15:25:18,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:18,528 INFO L225 Difference]: With dead ends: 373 [2018-04-11 15:25:18,529 INFO L226 Difference]: Without dead ends: 195 [2018-04-11 15:25:18,529 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-11 15:25:18,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-11 15:25:18,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-04-11 15:25:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-11 15:25:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2018-04-11 15:25:18,531 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 180 [2018-04-11 15:25:18,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:18,531 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2018-04-11 15:25:18,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:25:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2018-04-11 15:25:18,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-04-11 15:25:18,532 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:18,532 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-11 15:25:18,533 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-11 15:25:18,533 INFO L82 PathProgramCache]: Analyzing trace with hash -533532034, now seen corresponding path program 14 times [2018-04-11 15:25:18,533 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:18,533 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:18,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:18,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:25:18,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:18,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:19,093 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-11 15:25:19,093 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:19,093 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:19,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:25:19,135 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:25:19,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:19,144 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:19,242 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-11 15:25:19,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:19,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-04-11 15:25:19,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 15:25:19,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 15:25:19,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:25:19,244 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand 30 states. [2018-04-11 15:25:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:19,943 INFO L93 Difference]: Finished difference Result 393 states and 463 transitions. [2018-04-11 15:25:19,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:25:19,943 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 184 [2018-04-11 15:25:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:19,944 INFO L225 Difference]: With dead ends: 393 [2018-04-11 15:25:19,944 INFO L226 Difference]: Without dead ends: 199 [2018-04-11 15:25:19,945 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=1697, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 15:25:19,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-11 15:25:19,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2018-04-11 15:25:19,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-11 15:25:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 234 transitions. [2018-04-11 15:25:19,946 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 234 transitions. Word has length 184 [2018-04-11 15:25:19,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:19,947 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 234 transitions. [2018-04-11 15:25:19,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 15:25:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 234 transitions. [2018-04-11 15:25:19,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-04-11 15:25:19,947 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:19,947 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-11 15:25:19,947 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-11 15:25:19,948 INFO L82 PathProgramCache]: Analyzing trace with hash -783195045, now seen corresponding path program 15 times [2018-04-11 15:25:19,948 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:19,948 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:19,948 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:19,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:19,948 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:19,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:20,612 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-11 15:25:20,612 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:20,612 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:20,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:25:20,897 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-04-11 15:25:20,897 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:20,931 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:20,983 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-11 15:25:20,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:25:20,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:25:20,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:25:21,049 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-11 15:25:21,051 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-11 15:25:21,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:25:21,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:25:21,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:25:21,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-11 15:25:22,255 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-11 15:25:22,260 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-11 15:25:22,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:25:22,271 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-11 15:25:22,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:25:22,272 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-11 15:25:22,272 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:25:22,282 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-11 15:25:22,282 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 15:25:22,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:25:22,290 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-11 15:25:22,290 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-04-11 15:25:22,455 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-11 15:25:22,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:22,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 39] total 71 [2018-04-11 15:25:22,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-11 15:25:22,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-11 15:25:22,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=4801, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 15:25:22,457 INFO L87 Difference]: Start difference. First operand 198 states and 234 transitions. Second operand 72 states. [2018-04-11 15:25:29,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:29,437 INFO L93 Difference]: Finished difference Result 525 states and 604 transitions. [2018-04-11 15:25:29,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-04-11 15:25:29,437 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 188 [2018-04-11 15:25:29,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:29,438 INFO L225 Difference]: With dead ends: 525 [2018-04-11 15:25:29,438 INFO L226 Difference]: Without dead ends: 525 [2018-04-11 15:25:29,440 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7426 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2448, Invalid=25944, Unknown=0, NotChecked=0, Total=28392 [2018-04-11 15:25:29,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-04-11 15:25:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 207. [2018-04-11 15:25:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-04-11 15:25:29,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 246 transitions. [2018-04-11 15:25:29,442 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 246 transitions. Word has length 188 [2018-04-11 15:25:29,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:29,442 INFO L459 AbstractCegarLoop]: Abstraction has 207 states and 246 transitions. [2018-04-11 15:25:29,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-11 15:25:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 246 transitions. [2018-04-11 15:25:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-04-11 15:25:29,443 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:29,443 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-11 15:25:29,443 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-11 15:25:29,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1941617353, now seen corresponding path program 16 times [2018-04-11 15:25:29,443 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:29,443 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:29,444 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:29,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:29,444 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:29,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:30,189 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-11 15:25:30,189 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:30,189 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:30,189 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:25:30,327 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:25:30,327 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:30,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:30,343 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-11 15:25:30,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:25:30,357 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-11 15:25:30,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:10, output treesize:3 [2018-04-11 15:25:30,876 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-11 15:25:30,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:30,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 37] total 56 [2018-04-11 15:25:30,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-11 15:25:30,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-11 15:25:30,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=2820, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 15:25:30,878 INFO L87 Difference]: Start difference. First operand 207 states and 246 transitions. Second operand 57 states. [2018-04-11 15:25:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:32,588 INFO L93 Difference]: Finished difference Result 326 states and 369 transitions. [2018-04-11 15:25:32,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-11 15:25:32,588 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 197 [2018-04-11 15:25:32,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:32,589 INFO L225 Difference]: With dead ends: 326 [2018-04-11 15:25:32,589 INFO L226 Difference]: Without dead ends: 326 [2018-04-11 15:25:32,590 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2886 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1428, Invalid=8672, Unknown=0, NotChecked=0, Total=10100 [2018-04-11 15:25:32,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-04-11 15:25:32,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 216. [2018-04-11 15:25:32,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-11 15:25:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2018-04-11 15:25:32,593 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 197 [2018-04-11 15:25:32,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:32,594 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2018-04-11 15:25:32,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-11 15:25:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2018-04-11 15:25:32,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-04-11 15:25:32,595 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:32,595 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-11 15:25:32,595 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-11 15:25:32,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1530225701, now seen corresponding path program 17 times [2018-04-11 15:25:32,595 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:32,595 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:32,595 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:32,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:32,596 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:32,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:33,073 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-11 15:25:33,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:33,073 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:33,074 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:25:33,256 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-04-11 15:25:33,256 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:33,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:33,347 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-11 15:25:33,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:33,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-04-11 15:25:33,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 15:25:33,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 15:25:33,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:25:33,348 INFO L87 Difference]: Start difference. First operand 216 states and 258 transitions. Second operand 32 states. [2018-04-11 15:25:34,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:34,152 INFO L93 Difference]: Finished difference Result 431 states and 510 transitions. [2018-04-11 15:25:34,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:25:34,152 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 206 [2018-04-11 15:25:34,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:34,153 INFO L225 Difference]: With dead ends: 431 [2018-04-11 15:25:34,153 INFO L226 Difference]: Without dead ends: 221 [2018-04-11 15:25:34,153 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-11 15:25:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-11 15:25:34,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2018-04-11 15:25:34,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-11 15:25:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 262 transitions. [2018-04-11 15:25:34,158 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 262 transitions. Word has length 206 [2018-04-11 15:25:34,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:34,158 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 262 transitions. [2018-04-11 15:25:34,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 15:25:34,158 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 262 transitions. [2018-04-11 15:25:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-04-11 15:25:34,160 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:34,161 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-11 15:25:34,161 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-11 15:25:34,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1126196744, now seen corresponding path program 18 times [2018-04-11 15:25:34,161 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:34,161 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:34,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:34,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:34,162 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:34,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:34,733 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-11 15:25:34,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:34,733 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:34,733 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:25:34,942 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-04-11 15:25:34,942 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:34,961 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:35,086 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-11 15:25:35,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:35,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-04-11 15:25:35,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 15:25:35,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 15:25:35,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:25:35,087 INFO L87 Difference]: Start difference. First operand 220 states and 262 transitions. Second operand 34 states. [2018-04-11 15:25:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:35,998 INFO L93 Difference]: Finished difference Result 451 states and 533 transitions. [2018-04-11 15:25:35,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 15:25:35,999 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 210 [2018-04-11 15:25:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:35,999 INFO L225 Difference]: With dead ends: 451 [2018-04-11 15:25:35,999 INFO L226 Difference]: Without dead ends: 225 [2018-04-11 15:25:36,000 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 209 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=2227, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 15:25:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-11 15:25:36,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2018-04-11 15:25:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-11 15:25:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 266 transitions. [2018-04-11 15:25:36,001 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 266 transitions. Word has length 210 [2018-04-11 15:25:36,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:36,001 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 266 transitions. [2018-04-11 15:25:36,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 15:25:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 266 transitions. [2018-04-11 15:25:36,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-04-11 15:25:36,002 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:36,002 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-11 15:25:36,002 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-11 15:25:36,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1478606443, now seen corresponding path program 19 times [2018-04-11 15:25:36,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:36,003 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:36,003 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:36,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:36,004 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:36,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:36,769 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-11 15:25:36,769 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:36,769 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:36,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:25:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:37,067 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:37,070 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-11 15:25:37,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:25:37,071 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-11 15:25:37,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-11 15:25:37,330 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-11 15:25:37,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:37,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 34] total 44 [2018-04-11 15:25:37,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 15:25:37,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 15:25:37,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=1690, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:25:37,333 INFO L87 Difference]: Start difference. First operand 224 states and 266 transitions. Second operand 45 states. [2018-04-11 15:25:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:38,875 INFO L93 Difference]: Finished difference Result 372 states and 421 transitions. [2018-04-11 15:25:38,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-11 15:25:38,875 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 214 [2018-04-11 15:25:38,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:38,876 INFO L225 Difference]: With dead ends: 372 [2018-04-11 15:25:38,876 INFO L226 Difference]: Without dead ends: 372 [2018-04-11 15:25:38,876 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2258 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1511, Invalid=7045, Unknown=0, NotChecked=0, Total=8556 [2018-04-11 15:25:38,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-04-11 15:25:38,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 242. [2018-04-11 15:25:38,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-11 15:25:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 290 transitions. [2018-04-11 15:25:38,878 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 290 transitions. Word has length 214 [2018-04-11 15:25:38,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:38,879 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 290 transitions. [2018-04-11 15:25:38,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 15:25:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 290 transitions. [2018-04-11 15:25:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-11 15:25:38,879 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:38,879 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-11 15:25:38,880 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-11 15:25:38,880 INFO L82 PathProgramCache]: Analyzing trace with hash 525622933, now seen corresponding path program 20 times [2018-04-11 15:25:38,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:38,880 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:38,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:38,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:25:38,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:38,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:39,482 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-11 15:25:39,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:39,482 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:39,482 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:25:39,522 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:25:39,522 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:39,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:39,675 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-11 15:25:39,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:39,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-04-11 15:25:39,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 15:25:39,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 15:25:39,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:25:39,676 INFO L87 Difference]: Start difference. First operand 242 states and 290 transitions. Second operand 36 states. [2018-04-11 15:25:40,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:40,727 INFO L93 Difference]: Finished difference Result 489 states and 580 transitions. [2018-04-11 15:25:40,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 15:25:40,727 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 232 [2018-04-11 15:25:40,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:40,727 INFO L225 Difference]: With dead ends: 489 [2018-04-11 15:25:40,728 INFO L226 Difference]: Without dead ends: 247 [2018-04-11 15:25:40,728 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-11 15:25:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-11 15:25:40,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2018-04-11 15:25:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-04-11 15:25:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 294 transitions. [2018-04-11 15:25:40,729 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 294 transitions. Word has length 232 [2018-04-11 15:25:40,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:40,730 INFO L459 AbstractCegarLoop]: Abstraction has 246 states and 294 transitions. [2018-04-11 15:25:40,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 15:25:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 294 transitions. [2018-04-11 15:25:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-04-11 15:25:40,731 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:40,731 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-11 15:25:40,731 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-11 15:25:40,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1932968562, now seen corresponding path program 21 times [2018-04-11 15:25:40,731 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:40,731 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:40,732 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:40,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:40,732 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:40,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:41,707 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-11 15:25:41,708 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:41,708 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:41,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:25:42,021 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-11 15:25:42,021 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:42,110 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:43,122 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-11 15:25:43,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:43,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38] total 77 [2018-04-11 15:25:43,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-11 15:25:43,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-11 15:25:43,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=5476, Unknown=0, NotChecked=0, Total=5852 [2018-04-11 15:25:43,124 INFO L87 Difference]: Start difference. First operand 246 states and 294 transitions. Second operand 77 states. [2018-04-11 15:25:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:51,056 INFO L93 Difference]: Finished difference Result 726 states and 824 transitions. [2018-04-11 15:25:51,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-04-11 15:25:51,056 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 236 [2018-04-11 15:25:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:51,057 INFO L225 Difference]: With dead ends: 726 [2018-04-11 15:25:51,057 INFO L226 Difference]: Without dead ends: 396 [2018-04-11 15:25:51,058 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11810 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3764, Invalid=39708, Unknown=0, NotChecked=0, Total=43472 [2018-04-11 15:25:51,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-04-11 15:25:51,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 259. [2018-04-11 15:25:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-04-11 15:25:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 310 transitions. [2018-04-11 15:25:51,061 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 310 transitions. Word has length 236 [2018-04-11 15:25:51,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:51,061 INFO L459 AbstractCegarLoop]: Abstraction has 259 states and 310 transitions. [2018-04-11 15:25:51,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-11 15:25:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 310 transitions. [2018-04-11 15:25:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-04-11 15:25:51,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:51,062 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-11 15:25:51,062 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-11 15:25:51,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1928354883, now seen corresponding path program 22 times [2018-04-11 15:25:51,062 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:51,062 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:51,063 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:51,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:51,063 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:51,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:52,076 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-11 15:25:52,076 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:52,076 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:52,076 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:25:52,296 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:25:52,296 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:52,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:52,316 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-11 15:25:52,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:25:52,317 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-11 15:25:52,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-11 15:25:52,452 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-11 15:25:52,453 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:52,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 43 [2018-04-11 15:25:52,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 15:25:52,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 15:25:52,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1565, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:25:52,454 INFO L87 Difference]: Start difference. First operand 259 states and 310 transitions. Second operand 44 states. [2018-04-11 15:25:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:54,261 INFO L93 Difference]: Finished difference Result 414 states and 469 transitions. [2018-04-11 15:25:54,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-11 15:25:54,261 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 249 [2018-04-11 15:25:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:54,262 INFO L225 Difference]: With dead ends: 414 [2018-04-11 15:25:54,262 INFO L226 Difference]: Without dead ends: 414 [2018-04-11 15:25:54,263 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-11 15:25:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-04-11 15:25:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 268. [2018-04-11 15:25:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-11 15:25:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 322 transitions. [2018-04-11 15:25:54,266 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 322 transitions. Word has length 249 [2018-04-11 15:25:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:54,266 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 322 transitions. [2018-04-11 15:25:54,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 15:25:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 322 transitions. [2018-04-11 15:25:54,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-04-11 15:25:54,268 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:54,268 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-11 15:25:54,268 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-11 15:25:54,268 INFO L82 PathProgramCache]: Analyzing trace with hash 454734415, now seen corresponding path program 23 times [2018-04-11 15:25:54,268 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:54,268 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:54,269 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:54,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:54,269 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:54,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:55,101 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-11 15:25:55,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:55,102 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:55,102 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:25:55,333 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-11 15:25:55,333 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:55,350 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:55,496 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-11 15:25:55,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:55,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-04-11 15:25:55,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 15:25:55,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 15:25:55,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:25:55,497 INFO L87 Difference]: Start difference. First operand 268 states and 322 transitions. Second operand 40 states. [2018-04-11 15:25:56,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:25:56,640 INFO L93 Difference]: Finished difference Result 547 states and 650 transitions. [2018-04-11 15:25:56,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 15:25:56,641 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 258 [2018-04-11 15:25:56,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:25:56,641 INFO L225 Difference]: With dead ends: 547 [2018-04-11 15:25:56,641 INFO L226 Difference]: Without dead ends: 273 [2018-04-11 15:25:56,642 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-11 15:25:56,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-11 15:25:56,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 272. [2018-04-11 15:25:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-04-11 15:25:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 326 transitions. [2018-04-11 15:25:56,643 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 326 transitions. Word has length 258 [2018-04-11 15:25:56,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:25:56,643 INFO L459 AbstractCegarLoop]: Abstraction has 272 states and 326 transitions. [2018-04-11 15:25:56,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 15:25:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 326 transitions. [2018-04-11 15:25:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-04-11 15:25:56,645 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:25:56,645 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-11 15:25:56,645 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-11 15:25:56,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1290980332, now seen corresponding path program 24 times [2018-04-11 15:25:56,645 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:25:56,645 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:25:56,646 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:56,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:25:56,646 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:25:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:25:56,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:25:57,741 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-11 15:25:57,741 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:25:57,741 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:25:57,741 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:25:58,215 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-04-11 15:25:58,215 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:25:58,234 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:25:59,471 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-11 15:25:59,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:25:59,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 42] total 85 [2018-04-11 15:25:59,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-11 15:25:59,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-11 15:25:59,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=6684, Unknown=0, NotChecked=0, Total=7140 [2018-04-11 15:25:59,473 INFO L87 Difference]: Start difference. First operand 272 states and 326 transitions. Second operand 85 states. Received shutdown request... [2018-04-11 15:26:05,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-04-11 15:26:05,475 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 15:26:05,478 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 15:26:05,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:26:05 BoogieIcfgContainer [2018-04-11 15:26:05,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:26:05,478 INFO L168 Benchmark]: Toolchain (without parser) took 166193.95 ms. Allocated memory was 401.1 MB in the beginning and 2.3 GB in the end (delta: 1.9 GB). Free memory was 332.6 MB in the beginning and 2.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 311.9 MB. Max. memory is 5.3 GB. [2018-04-11 15:26:05,479 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 401.1 MB. Free memory is still 358.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:26:05,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.20 ms. Allocated memory is still 401.1 MB. Free memory was 332.6 MB in the beginning and 306.0 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:26:05,479 INFO L168 Benchmark]: Boogie Preprocessor took 44.86 ms. Allocated memory is still 401.1 MB. Free memory was 306.0 MB in the beginning and 303.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:26:05,480 INFO L168 Benchmark]: RCFGBuilder took 429.71 ms. Allocated memory was 401.1 MB in the beginning and 587.7 MB in the end (delta: 186.6 MB). Free memory was 303.3 MB in the beginning and 514.3 MB in the end (delta: -211.0 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB. [2018-04-11 15:26:05,480 INFO L168 Benchmark]: TraceAbstraction took 165456.43 ms. Allocated memory was 587.7 MB in the beginning and 2.3 GB in the end (delta: 1.7 GB). Free memory was 512.2 MB in the beginning and 2.0 GB in the end (delta: -1.4 GB). Peak memory consumption was 304.9 MB. Max. memory is 5.3 GB. [2018-04-11 15:26:05,481 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.10 ms. Allocated memory is still 401.1 MB. Free memory is still 358.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 259.20 ms. Allocated memory is still 401.1 MB. Free memory was 332.6 MB in the beginning and 306.0 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.86 ms. Allocated memory is still 401.1 MB. Free memory was 306.0 MB in the beginning and 303.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 429.71 ms. Allocated memory was 401.1 MB in the beginning and 587.7 MB in the end (delta: 186.6 MB). Free memory was 303.3 MB in the beginning and 514.3 MB in the end (delta: -211.0 MB). Peak memory consumption was 22.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 165456.43 ms. Allocated memory was 587.7 MB in the beginning and 2.3 GB in the end (delta: 1.7 GB). Free memory was 512.2 MB in the beginning and 2.0 GB in the end (delta: -1.4 GB). Peak memory consumption was 304.9 MB. 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 constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (272states) and interpolant automaton (currently 100 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 180 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 96 locations, 21 error locations. TIMEOUT Result, 165.4s OverallTime, 62 OverallIterations, 18 TraceHistogramMax, 99.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6294 SDtfs, 16305 SDslu, 126626 SDs, 0 SdLazy, 65844 SolverSat, 2622 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 39.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7116 GetRequests, 4632 SyntacticMatches, 45 SemanticMatches, 2438 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 46676 ImplicationChecksByTransitivity, 103.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred in iteration=36, 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.1s AutomataMinimizationTime, 61 MinimizatonAttempts, 1967 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 59.6s InterpolantComputationTime, 10609 NumberOfCodeBlocks, 10545 NumberOfCodeBlocksAsserted, 254 NumberOfCheckSat, 9818 ConstructedInterpolants, 441 QuantifiedInterpolants, 11676517 SizeOfPredicates, 727 NumberOfNonLiveVariables, 22070 ConjunctsInSsa, 3219 ConjunctsInUnsatCore, 95 InterpolantComputations, 21 PerfectInterpolantSequences, 7143/36191 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-11_15-26-05-487.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-11_15-26-05-487.csv Completed graceful shutdown