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_cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 04:21:11,011 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 04:21:11,013 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 04:21:11,025 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 04:21:11,025 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 04:21:11,025 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 04:21:11,026 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 04:21:11,028 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 04:21:11,029 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 04:21:11,030 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 04:21:11,030 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 04:21:11,031 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 04:21:11,031 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 04:21:11,032 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 04:21:11,033 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 04:21:11,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 04:21:11,036 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 04:21:11,037 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 04:21:11,038 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 04:21:11,039 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 04:21:11,040 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 04:21:11,040 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 04:21:11,041 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 04:21:11,041 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 04:21:11,042 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 04:21:11,043 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 04:21:11,043 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 04:21:11,044 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 04:21:11,044 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 04:21:11,045 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 04:21:11,045 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 04:21:11,045 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-13 04:21:11,054 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 04:21:11,054 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 04:21:11,055 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 04:21:11,055 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 04:21:11,055 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 04:21:11,055 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 04:21:11,055 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 04:21:11,056 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 04:21:11,056 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 04:21:11,056 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 04:21:11,056 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 04:21:11,056 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 04:21:11,056 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 04:21:11,056 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 04:21:11,057 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 04:21:11,057 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 04:21:11,057 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 04:21:11,057 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 04:21:11,057 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 04:21:11,057 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 04:21:11,057 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 04:21:11,057 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 04:21:11,058 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 04:21:11,058 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 04:21:11,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 04:21:11,096 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 04:21:11,100 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 04:21:11,101 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 04:21:11,102 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 04:21:11,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,394 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6f4fdceaf [2018-04-13 04:21:11,533 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 04:21:11,533 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 04:21:11,534 INFO L168 CDTParser]: Scanning openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,541 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 04:21:11,541 INFO L215 ultiparseSymbolTable]: [2018-04-13 04:21:11,541 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 04:21:11,541 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,541 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,541 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpy ('cstrcpy') in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,541 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,542 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 04:21:11,542 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,542 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,542 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,542 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,542 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,542 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,542 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,542 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,542 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,543 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,543 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,543 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,543 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,543 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,543 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,543 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,543 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,543 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,543 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,544 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,544 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,544 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,544 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,544 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,544 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,544 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,544 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,544 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,545 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,546 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:11,565 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6f4fdceaf [2018-04-13 04:21:11,568 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 04:21:11,569 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 04:21:11,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 04:21:11,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 04:21:11,573 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 04:21:11,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:21:11" (1/1) ... [2018-04-13 04:21:11,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606b9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:21:11, skipping insertion in model container [2018-04-13 04:21:11,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:21:11" (1/1) ... [2018-04-13 04:21:11,588 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 04:21:11,608 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 04:21:11,725 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 04:21:11,759 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 04:21:11,764 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-13 04:21:11,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:21:11 WrapperNode [2018-04-13 04:21:11,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 04:21:11,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 04:21:11,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 04:21:11,793 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 04:21:11,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:21:11" (1/1) ... [2018-04-13 04:21:11,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:21:11" (1/1) ... [2018-04-13 04:21:11,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:21:11" (1/1) ... [2018-04-13 04:21:11,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:21:11" (1/1) ... [2018-04-13 04:21:11,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:21:11" (1/1) ... [2018-04-13 04:21:11,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:21:11" (1/1) ... [2018-04-13 04:21:11,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:21:11" (1/1) ... [2018-04-13 04:21:11,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 04:21:11,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 04:21:11,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 04:21:11,826 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 04:21:11,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:21:11" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 04:21:11,912 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 04:21:11,912 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 04:21:11,912 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 04:21:11,912 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 04:21:11,912 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpy [2018-04-13 04:21:11,912 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 04:21:11,912 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 04:21:11,913 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 04:21:11,913 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 04:21:11,913 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 04:21:11,913 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 04:21:11,913 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 04:21:11,913 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 04:21:11,913 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 04:21:11,913 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 04:21:11,913 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 04:21:11,913 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 04:21:11,914 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 04:21:11,914 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 04:21:11,914 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 04:21:11,914 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 04:21:11,914 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 04:21:11,914 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 04:21:11,914 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 04:21:11,914 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 04:21:11,914 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 04:21:11,914 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 04:21:11,915 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 04:21:11,915 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 04:21:11,915 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 04:21:11,915 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 04:21:11,915 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 04:21:11,915 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 04:21:11,915 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 04:21:11,915 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 04:21:11,915 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 04:21:11,915 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 04:21:11,916 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 04:21:11,916 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 04:21:11,916 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 04:21:11,916 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 04:21:11,916 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 04:21:11,916 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 04:21:11,916 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 04:21:11,916 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 04:21:11,916 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 04:21:11,916 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 04:21:11,917 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 04:21:11,917 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 04:21:11,917 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 04:21:11,917 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 04:21:11,917 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 04:21:11,917 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 04:21:11,917 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 04:21:11,917 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 04:21:11,917 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 04:21:11,918 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 04:21:11,918 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 04:21:11,918 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 04:21:11,918 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 04:21:11,918 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 04:21:11,918 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 04:21:11,918 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 04:21:11,918 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 04:21:11,918 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 04:21:11,918 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 04:21:11,919 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 04:21:11,920 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 04:21:11,920 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 04:21:11,920 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 04:21:11,920 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 04:21:11,920 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 04:21:11,920 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 04:21:11,920 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 04:21:11,920 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 04:21:11,920 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 04:21:11,920 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 04:21:11,920 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 04:21:11,920 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 04:21:11,920 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 04:21:11,920 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 04:21:11,920 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 04:21:11,921 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 04:21:11,921 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 04:21:11,921 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 04:21:11,921 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 04:21:11,921 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 04:21:11,921 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 04:21:11,921 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 04:21:11,921 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 04:21:11,921 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 04:21:11,921 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 04:21:11,921 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpy [2018-04-13 04:21:11,922 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 04:21:11,922 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 04:21:11,922 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 04:21:11,922 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 04:21:11,922 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 04:21:11,922 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 04:21:11,922 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 04:21:11,922 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 04:21:12,163 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 04:21:12,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:21:12 BoogieIcfgContainer [2018-04-13 04:21:12,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 04:21:12,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 04:21:12,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 04:21:12,166 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 04:21:12,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 04:21:11" (1/3) ... [2018-04-13 04:21:12,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ee964b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:21:12, skipping insertion in model container [2018-04-13 04:21:12,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:21:11" (2/3) ... [2018-04-13 04:21:12,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ee964b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:21:12, skipping insertion in model container [2018-04-13 04:21:12,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:21:12" (3/3) ... [2018-04-13 04:21:12,168 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:21:12,175 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 04:21:12,180 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-04-13 04:21:12,208 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 04:21:12,208 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 04:21:12,209 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 04:21:12,209 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 04:21:12,209 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 04:21:12,209 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 04:21:12,209 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 04:21:12,209 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 04:21:12,209 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 04:21:12,209 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 04:21:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-04-13 04:21:12,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-13 04:21:12,221 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:12,221 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:12,222 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:12,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1015483767, now seen corresponding path program 1 times [2018-04-13 04:21:12,225 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:12,225 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:12,253 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:12,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:12,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:12,290 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:12,327 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:21:12,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:21:12,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 04:21:12,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 04:21:12,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 04:21:12,342 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-04-13 04:21:12,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:12,388 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-04-13 04:21:12,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 04:21:12,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-04-13 04:21:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:12,395 INFO L225 Difference]: With dead ends: 44 [2018-04-13 04:21:12,395 INFO L226 Difference]: Without dead ends: 40 [2018-04-13 04:21:12,397 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:21:12,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-04-13 04:21:12,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-04-13 04:21:12,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-13 04:21:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-04-13 04:21:12,417 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-04-13 04:21:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:12,418 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-04-13 04:21:12,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 04:21:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-04-13 04:21:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-13 04:21:12,418 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:12,418 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:12,418 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:12,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1015485689, now seen corresponding path program 1 times [2018-04-13 04:21:12,419 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:12,419 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:12,419 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:12,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:12,420 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:12,425 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:12,437 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:21:12,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 04:21:12,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 04:21:12,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 04:21:12,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 04:21:12,438 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-04-13 04:21:12,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:12,456 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-04-13 04:21:12,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 04:21:12,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-04-13 04:21:12,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:12,457 INFO L225 Difference]: With dead ends: 39 [2018-04-13 04:21:12,457 INFO L226 Difference]: Without dead ends: 38 [2018-04-13 04:21:12,457 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 04:21:12,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-04-13 04:21:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-04-13 04:21:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-04-13 04:21:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-04-13 04:21:12,460 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-04-13 04:21:12,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:12,460 INFO L459 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-04-13 04:21:12,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 04:21:12,460 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-04-13 04:21:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 04:21:12,460 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:12,460 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:12,460 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:12,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1606378251, now seen corresponding path program 1 times [2018-04-13 04:21:12,460 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:12,460 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:12,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:12,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:12,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:12,470 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:12,491 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:21:12,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 04:21:12,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 04:21:12,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 04:21:12,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 04:21:12,492 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-04-13 04:21:12,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:12,525 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-04-13 04:21:12,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 04:21:12,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-13 04:21:12,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:12,526 INFO L225 Difference]: With dead ends: 36 [2018-04-13 04:21:12,526 INFO L226 Difference]: Without dead ends: 36 [2018-04-13 04:21:12,527 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:21:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-04-13 04:21:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-04-13 04:21:12,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-13 04:21:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-13 04:21:12,529 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-04-13 04:21:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:12,530 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-13 04:21:12,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 04:21:12,530 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-13 04:21:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 04:21:12,530 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:12,530 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:12,530 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:12,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1606378252, now seen corresponding path program 1 times [2018-04-13 04:21:12,530 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:12,530 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:12,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:12,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:12,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:12,541 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:12,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:12,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:21:12,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:21:12,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:21:12,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:21:12,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:21:12,585 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-04-13 04:21:12,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:12,610 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-04-13 04:21:12,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:21:12,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-13 04:21:12,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:12,611 INFO L225 Difference]: With dead ends: 35 [2018-04-13 04:21:12,611 INFO L226 Difference]: Without dead ends: 35 [2018-04-13 04:21:12,611 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:21:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-04-13 04:21:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-04-13 04:21:12,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-04-13 04:21:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-04-13 04:21:12,613 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-04-13 04:21:12,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:12,613 INFO L459 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-04-13 04:21:12,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:21:12,613 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-04-13 04:21:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 04:21:12,614 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:12,614 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:12,614 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:12,614 INFO L82 PathProgramCache]: Analyzing trace with hash -603948622, now seen corresponding path program 1 times [2018-04-13 04:21:12,614 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:12,614 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:12,615 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:12,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:12,615 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:12,623 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:12,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:21:12,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:21:12,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:21:12,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:21:12,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:21:12,649 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-04-13 04:21:12,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:12,695 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-04-13 04:21:12,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 04:21:12,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-13 04:21:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:12,696 INFO L225 Difference]: With dead ends: 34 [2018-04-13 04:21:12,696 INFO L226 Difference]: Without dead ends: 34 [2018-04-13 04:21:12,696 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:21:12,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-04-13 04:21:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-04-13 04:21:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-04-13 04:21:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-04-13 04:21:12,699 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-04-13 04:21:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:12,699 INFO L459 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-04-13 04:21:12,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:21:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-04-13 04:21:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 04:21:12,700 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:12,700 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:12,700 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:12,700 INFO L82 PathProgramCache]: Analyzing trace with hash -603948621, now seen corresponding path program 1 times [2018-04-13 04:21:12,700 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:12,700 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:12,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:12,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:12,701 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:12,711 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:12,762 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:21:12,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:21:12,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:21:12,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:21:12,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:21:12,763 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-04-13 04:21:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:12,849 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-04-13 04:21:12,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 04:21:12,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-13 04:21:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:12,851 INFO L225 Difference]: With dead ends: 44 [2018-04-13 04:21:12,851 INFO L226 Difference]: Without dead ends: 44 [2018-04-13 04:21:12,851 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-13 04:21:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-13 04:21:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-04-13 04:21:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-13 04:21:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-13 04:21:12,853 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-04-13 04:21:12,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:12,853 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-13 04:21:12,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:21:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-13 04:21:12,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-13 04:21:12,854 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:12,854 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:12,854 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:12,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1542538081, now seen corresponding path program 1 times [2018-04-13 04:21:12,854 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:12,854 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:12,855 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:12,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:12,855 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:12,864 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:12,868 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:12,868 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:12,868 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:12,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:12,904 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:12,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:12,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:12,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:12,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 04:21:12,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 14 [2018-04-13 04:21:12,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:12,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:12,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-04-13 04:21:13,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:13,035 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:21:13,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-13 04:21:13,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 04:21:13,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 04:21:13,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-13 04:21:13,036 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 11 states. [2018-04-13 04:21:13,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:13,247 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-04-13 04:21:13,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 04:21:13,247 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-04-13 04:21:13,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:13,249 INFO L225 Difference]: With dead ends: 86 [2018-04-13 04:21:13,249 INFO L226 Difference]: Without dead ends: 86 [2018-04-13 04:21:13,249 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-04-13 04:21:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-13 04:21:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2018-04-13 04:21:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-13 04:21:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-04-13 04:21:13,257 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 19 [2018-04-13 04:21:13,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:13,257 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-04-13 04:21:13,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 04:21:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-04-13 04:21:13,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-13 04:21:13,258 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:13,258 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:13,258 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:13,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1542538082, now seen corresponding path program 1 times [2018-04-13 04:21:13,258 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:13,259 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:13,259 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:13,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:13,259 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:13,269 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:13,271 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:13,271 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:13,271 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:13,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:13,293 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:13,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-13 04:21:13,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:13,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:13,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:21:13,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-04-13 04:21:13,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:13,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:21:13,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-13 04:21:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:13,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:21:13,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:21:13,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:21:13,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:21:13,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:21:13,327 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 6 states. [2018-04-13 04:21:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:13,362 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-04-13 04:21:13,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:21:13,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-04-13 04:21:13,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:13,363 INFO L225 Difference]: With dead ends: 55 [2018-04-13 04:21:13,363 INFO L226 Difference]: Without dead ends: 55 [2018-04-13 04:21:13,363 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:21:13,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-04-13 04:21:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-04-13 04:21:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-13 04:21:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-04-13 04:21:13,366 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 19 [2018-04-13 04:21:13,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:13,367 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-04-13 04:21:13,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:21:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-04-13 04:21:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-13 04:21:13,367 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:13,367 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:13,367 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:13,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1284372643, now seen corresponding path program 1 times [2018-04-13 04:21:13,367 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:13,367 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:13,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:13,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:13,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:13,374 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:13,377 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:13,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:13,377 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:13,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:13,401 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:13,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:13,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:13,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:13,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-13 04:21:13,446 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 04:21:13,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 14 [2018-04-13 04:21:13,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:13,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:13,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-13 04:21:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:13,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:21:13,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-13 04:21:13,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 04:21:13,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 04:21:13,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:21:13,516 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 12 states. [2018-04-13 04:21:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:13,738 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-04-13 04:21:13,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 04:21:13,738 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-04-13 04:21:13,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:13,739 INFO L225 Difference]: With dead ends: 93 [2018-04-13 04:21:13,739 INFO L226 Difference]: Without dead ends: 93 [2018-04-13 04:21:13,740 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:21:13,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-13 04:21:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 55. [2018-04-13 04:21:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-13 04:21:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-04-13 04:21:13,744 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 19 [2018-04-13 04:21:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:13,744 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-04-13 04:21:13,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 04:21:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-04-13 04:21:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-13 04:21:13,745 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:13,745 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:13,745 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:13,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2129344095, now seen corresponding path program 1 times [2018-04-13 04:21:13,745 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:13,746 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:13,746 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:13,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:13,746 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:13,754 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:13,756 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:13,756 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:13,756 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:13,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:13,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:13,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:13,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:13,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:13,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:13,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:13,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-04-13 04:21:13,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:13,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:13,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:13,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:13,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:13,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:13,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:13,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-13 04:21:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:13,928 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:21:13,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-13 04:21:13,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 04:21:13,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 04:21:13,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:21:13,929 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 12 states. [2018-04-13 04:21:14,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:14,201 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-04-13 04:21:14,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 04:21:14,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-04-13 04:21:14,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:14,203 INFO L225 Difference]: With dead ends: 112 [2018-04-13 04:21:14,203 INFO L226 Difference]: Without dead ends: 112 [2018-04-13 04:21:14,203 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-04-13 04:21:14,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-13 04:21:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 55. [2018-04-13 04:21:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-13 04:21:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-04-13 04:21:14,210 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 19 [2018-04-13 04:21:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:14,210 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-04-13 04:21:14,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 04:21:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-04-13 04:21:14,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-13 04:21:14,211 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:14,211 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:14,211 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:14,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1871178657, now seen corresponding path program 1 times [2018-04-13 04:21:14,212 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:14,212 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:14,212 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:14,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:14,213 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:14,220 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:14,222 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:14,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:14,223 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:14,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:14,244 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:14,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:14,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:14,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:14,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:14,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:14,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:14,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:14,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:14,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:14,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:14,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:14,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:14,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:14,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:14,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:21:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:14,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:21:14,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:21:14,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:21:14,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:21:14,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:21:14,314 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 8 states. [2018-04-13 04:21:14,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:14,390 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-04-13 04:21:14,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 04:21:14,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-04-13 04:21:14,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:14,391 INFO L225 Difference]: With dead ends: 66 [2018-04-13 04:21:14,391 INFO L226 Difference]: Without dead ends: 66 [2018-04-13 04:21:14,391 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:21:14,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-13 04:21:14,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 36. [2018-04-13 04:21:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-13 04:21:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-13 04:21:14,394 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-04-13 04:21:14,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:14,394 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-13 04:21:14,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:21:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-13 04:21:14,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 04:21:14,394 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:14,395 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] [2018-04-13 04:21:14,395 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:14,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1326322050, now seen corresponding path program 1 times [2018-04-13 04:21:14,395 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:14,395 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:14,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:14,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:14,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:14,404 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:14,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:21:14,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-13 04:21:14,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 04:21:14,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 04:21:14,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-13 04:21:14,493 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-04-13 04:21:14,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:14,571 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-04-13 04:21:14,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 04:21:14,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-04-13 04:21:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:14,572 INFO L225 Difference]: With dead ends: 58 [2018-04-13 04:21:14,572 INFO L226 Difference]: Without dead ends: 58 [2018-04-13 04:21:14,572 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-04-13 04:21:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-13 04:21:14,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-04-13 04:21:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-13 04:21:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-04-13 04:21:14,574 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 23 [2018-04-13 04:21:14,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:14,574 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-04-13 04:21:14,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 04:21:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-04-13 04:21:14,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 04:21:14,575 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:14,575 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] [2018-04-13 04:21:14,575 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:14,575 INFO L82 PathProgramCache]: Analyzing trace with hash 305253696, now seen corresponding path program 1 times [2018-04-13 04:21:14,575 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:14,575 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:14,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:14,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:14,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:14,582 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:14,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:21:14,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-13 04:21:14,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 04:21:14,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 04:21:14,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:21:14,677 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 12 states. [2018-04-13 04:21:14,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:14,793 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2018-04-13 04:21:14,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 04:21:14,794 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-04-13 04:21:14,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:14,794 INFO L225 Difference]: With dead ends: 88 [2018-04-13 04:21:14,794 INFO L226 Difference]: Without dead ends: 88 [2018-04-13 04:21:14,795 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-04-13 04:21:14,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-13 04:21:14,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2018-04-13 04:21:14,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-13 04:21:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-04-13 04:21:14,798 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 23 [2018-04-13 04:21:14,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:14,799 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-04-13 04:21:14,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 04:21:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-04-13 04:21:14,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 04:21:14,799 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:14,800 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] [2018-04-13 04:21:14,800 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:14,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1283094206, now seen corresponding path program 1 times [2018-04-13 04:21:14,800 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:14,800 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:14,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:14,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:14,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:14,808 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:14,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:14,963 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:14,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:15,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:15,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:15,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:15,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:15,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:21:15,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:21:15,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:21:15,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:15,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:15,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:15,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-13 04:21:15,121 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 20 treesize of output 16 [2018-04-13 04:21:15,126 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 16 treesize of output 13 [2018-04-13 04:21:15,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:21:15,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:21:15,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:21:15,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-04-13 04:21:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:15,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:21:15,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-04-13 04:21:15,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:21:15,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:21:15,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:21:15,195 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 19 states. [2018-04-13 04:21:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:15,485 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-04-13 04:21:15,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 04:21:15,486 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-04-13 04:21:15,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:15,486 INFO L225 Difference]: With dead ends: 66 [2018-04-13 04:21:15,486 INFO L226 Difference]: Without dead ends: 66 [2018-04-13 04:21:15,487 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2018-04-13 04:21:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-13 04:21:15,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-04-13 04:21:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-13 04:21:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-04-13 04:21:15,489 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 23 [2018-04-13 04:21:15,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:15,490 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-04-13 04:21:15,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:21:15,490 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-04-13 04:21:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-13 04:21:15,490 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:15,490 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] [2018-04-13 04:21:15,490 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:15,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1121214736, now seen corresponding path program 1 times [2018-04-13 04:21:15,491 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:15,491 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:15,491 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:15,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:15,491 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:15,498 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:15,500 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:15,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:15,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:15,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:15,519 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:15,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:15,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:15,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:15,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:15,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:15,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-04-13 04:21:15,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:15,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:15,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:15,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:15,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:15,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:15,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:15,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2018-04-13 04:21:15,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:15,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:15,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 04:21:15,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 04:21:15,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 04:21:15,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-04-13 04:21:15,686 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 14 states. [2018-04-13 04:21:16,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:16,013 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-04-13 04:21:16,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 04:21:16,014 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-04-13 04:21:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:16,014 INFO L225 Difference]: With dead ends: 65 [2018-04-13 04:21:16,014 INFO L226 Difference]: Without dead ends: 65 [2018-04-13 04:21:16,014 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2018-04-13 04:21:16,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-13 04:21:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-04-13 04:21:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-13 04:21:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-04-13 04:21:16,017 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 24 [2018-04-13 04:21:16,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:16,017 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-04-13 04:21:16,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 04:21:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-04-13 04:21:16,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 04:21:16,018 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:16,018 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] [2018-04-13 04:21:16,018 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:16,018 INFO L82 PathProgramCache]: Analyzing trace with hash -278961325, now seen corresponding path program 2 times [2018-04-13 04:21:16,018 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:16,018 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:16,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:16,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:16,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:16,027 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:16,032 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:16,032 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:16,032 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:16,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:21:16,054 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:21:16,054 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:16,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:16,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:16,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:16,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:16,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:21:16,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:16,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:16,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:16,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:16,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 6 treesize of output 5 [2018-04-13 04:21:16,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:16,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:16,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-13 04:21:16,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:21:16,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:21:16,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:16,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:16,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:16,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-04-13 04:21:16,196 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 31 treesize of output 32 [2018-04-13 04:21:16,198 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 8 treesize of output 7 [2018-04-13 04:21:16,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:16,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:16,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 04:21:16,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-13 04:21:16,328 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 43 treesize of output 37 [2018-04-13 04:21:16,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:16,335 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2018-04-13 04:21:16,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:21:16,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 19 [2018-04-13 04:21:16,350 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:16,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 27 treesize of output 25 [2018-04-13 04:21:16,364 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:16,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:21:16,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:21:16,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:65, output treesize:95 [2018-04-13 04:21:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:16,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:16,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 04:21:16,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:21:16,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:21:16,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:21:16,478 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 16 states. [2018-04-13 04:21:16,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:16,843 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-04-13 04:21:16,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 04:21:16,843 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-04-13 04:21:16,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:16,844 INFO L225 Difference]: With dead ends: 71 [2018-04-13 04:21:16,844 INFO L226 Difference]: Without dead ends: 71 [2018-04-13 04:21:16,844 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2018-04-13 04:21:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-13 04:21:16,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2018-04-13 04:21:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-04-13 04:21:16,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-04-13 04:21:16,847 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 28 [2018-04-13 04:21:16,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:16,847 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-04-13 04:21:16,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:21:16,847 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-04-13 04:21:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 04:21:16,848 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:16,848 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] [2018-04-13 04:21:16,848 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:16,848 INFO L82 PathProgramCache]: Analyzing trace with hash 2129258862, now seen corresponding path program 1 times [2018-04-13 04:21:16,848 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:16,848 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:16,849 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:16,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:16,849 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:16,856 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:16,859 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:16,859 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:16,859 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:16,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:16,874 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:16,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:16,893 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 27 [2018-04-13 04:21:16,896 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 23 treesize of output 15 [2018-04-13 04:21:16,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:16,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:16,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 04:21:16,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-13 04:21:16,937 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc7.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc7.base| 1))) (and (= (select |c_old(#valid)| |main_#t~malloc7.base|) 0) (= (store (store .cse0 |c_main_#t~malloc8.base| 1) |main_#t~malloc7.base| 0) |c_#valid|) (= (select .cse0 |c_main_#t~malloc8.base|) 0)))) is different from true [2018-04-13 04:21:16,942 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc7.base| Int) (|main_#t~malloc8.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc7.base| 1))) (and (= (select |c_old(#valid)| |main_#t~malloc7.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc8.base| 1) |main_#t~malloc7.base| 0) |main_#t~malloc8.base| 0)) (= (select .cse0 |main_#t~malloc8.base|) 0)))) is different from true [2018-04-13 04:21:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:16,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:21:16,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:21:16,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:21:16,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:21:16,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-13 04:21:16,947 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 8 states. [2018-04-13 04:21:17,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:17,002 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-04-13 04:21:17,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 04:21:17,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-04-13 04:21:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:17,003 INFO L225 Difference]: With dead ends: 60 [2018-04-13 04:21:17,003 INFO L226 Difference]: Without dead ends: 35 [2018-04-13 04:21:17,003 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-13 04:21:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-04-13 04:21:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-04-13 04:21:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-04-13 04:21:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-04-13 04:21:17,004 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 29 [2018-04-13 04:21:17,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:17,006 INFO L459 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-04-13 04:21:17,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:21:17,007 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-04-13 04:21:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 04:21:17,007 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:17,007 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] [2018-04-13 04:21:17,008 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:17,008 INFO L82 PathProgramCache]: Analyzing trace with hash -57866497, now seen corresponding path program 2 times [2018-04-13 04:21:17,008 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:17,008 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:17,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:17,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:17,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:17,021 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:17,025 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:17,025 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:17,025 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:17,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:21:17,056 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:21:17,056 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:17,060 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:17,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:17,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:17,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:17,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:17,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:17,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:17,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:17,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:21:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:17,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:17,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 04:21:17,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 04:21:17,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 04:21:17,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-13 04:21:17,225 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 13 states. [2018-04-13 04:21:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:17,473 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-04-13 04:21:17,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 04:21:17,473 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-04-13 04:21:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:17,473 INFO L225 Difference]: With dead ends: 38 [2018-04-13 04:21:17,473 INFO L226 Difference]: Without dead ends: 38 [2018-04-13 04:21:17,474 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-04-13 04:21:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-04-13 04:21:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-04-13 04:21:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-13 04:21:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-04-13 04:21:17,475 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 29 [2018-04-13 04:21:17,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:17,475 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-04-13 04:21:17,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 04:21:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-04-13 04:21:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 04:21:17,475 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:17,475 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] [2018-04-13 04:21:17,475 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:17,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1352674274, now seen corresponding path program 3 times [2018-04-13 04:21:17,476 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:17,476 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:17,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:17,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:17,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:17,482 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:17,486 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:17,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:17,487 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:17,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:21:17,518 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:21:17,518 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:17,520 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:17,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:17,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:21:17,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-13 04:21:17,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:17,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:17,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:17,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-13 04:21:17,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-13 04:21:17,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:21:17,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-13 04:21:17,607 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 23 treesize of output 24 [2018-04-13 04:21:17,610 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 8 treesize of output 7 [2018-04-13 04:21:17,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-13 04:21:17,651 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 23 treesize of output 24 [2018-04-13 04:21:17,653 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 8 treesize of output 7 [2018-04-13 04:21:17,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:17,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2018-04-13 04:21:17,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 04:21:17,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:21:17,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:21:17,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:21:17,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:21:17,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2018-04-13 04:21:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:17,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:17,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 04:21:17,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:21:17,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:21:17,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:21:17,766 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 16 states. [2018-04-13 04:21:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:18,013 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-04-13 04:21:18,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 04:21:18,013 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-04-13 04:21:18,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:18,013 INFO L225 Difference]: With dead ends: 44 [2018-04-13 04:21:18,013 INFO L226 Difference]: Without dead ends: 44 [2018-04-13 04:21:18,014 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-04-13 04:21:18,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-13 04:21:18,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-04-13 04:21:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-04-13 04:21:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-04-13 04:21:18,015 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 33 [2018-04-13 04:21:18,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:18,015 INFO L459 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-04-13 04:21:18,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:21:18,015 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-04-13 04:21:18,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 04:21:18,015 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:18,015 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:18,015 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:18,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1016770480, now seen corresponding path program 3 times [2018-04-13 04:21:18,016 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:18,016 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:18,016 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:18,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:18,016 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:18,023 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:18,025 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:18,026 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:18,026 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:18,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:21:18,053 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:21:18,054 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:18,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:18,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:18,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:21:18,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:21:18,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:21:18,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:21:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:18,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:18,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 04:21:18,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 04:21:18,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 04:21:18,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-04-13 04:21:18,215 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 14 states. [2018-04-13 04:21:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:18,456 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-04-13 04:21:18,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 04:21:18,456 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-04-13 04:21:18,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:18,456 INFO L225 Difference]: With dead ends: 43 [2018-04-13 04:21:18,456 INFO L226 Difference]: Without dead ends: 43 [2018-04-13 04:21:18,457 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-04-13 04:21:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-04-13 04:21:18,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-04-13 04:21:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-04-13 04:21:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-04-13 04:21:18,458 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 34 [2018-04-13 04:21:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:18,458 INFO L459 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-04-13 04:21:18,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 04:21:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-04-13 04:21:18,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 04:21:18,458 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:18,458 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:18,458 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:18,458 INFO L82 PathProgramCache]: Analyzing trace with hash -190749517, now seen corresponding path program 4 times [2018-04-13 04:21:18,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:18,459 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:18,459 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:18,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:18,459 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:18,470 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:18,477 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:18,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:18,477 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:18,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:21:18,510 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:21:18,510 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:18,514 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:18,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:18,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:21:18,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:18,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:18,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:18,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:18,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-13 04:21:18,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:21:18,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 04:21:18,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-13 04:21:18,609 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 23 treesize of output 24 [2018-04-13 04:21:18,611 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 8 treesize of output 7 [2018-04-13 04:21:18,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-13 04:21:18,639 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 23 treesize of output 24 [2018-04-13 04:21:18,640 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 8 treesize of output 7 [2018-04-13 04:21:18,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-13 04:21:18,662 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 23 treesize of output 24 [2018-04-13 04:21:18,665 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 8 treesize of output 7 [2018-04-13 04:21:18,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:18,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-13 04:21:18,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 04:21:18,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-13 04:21:18,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:21:18,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:21:18,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:21:18,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-13 04:21:18,753 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:18,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:18,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 04:21:18,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 04:21:18,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 04:21:18,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:21:18,754 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 17 states. [2018-04-13 04:21:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:19,033 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-04-13 04:21:19,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 04:21:19,033 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-04-13 04:21:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:19,033 INFO L225 Difference]: With dead ends: 42 [2018-04-13 04:21:19,034 INFO L226 Difference]: Without dead ends: 42 [2018-04-13 04:21:19,034 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2018-04-13 04:21:19,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-04-13 04:21:19,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-04-13 04:21:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-04-13 04:21:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-04-13 04:21:19,035 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-04-13 04:21:19,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:19,035 INFO L459 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-04-13 04:21:19,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 04:21:19,035 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-04-13 04:21:19,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 04:21:19,035 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:19,035 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:19,035 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:19,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1618267745, now seen corresponding path program 4 times [2018-04-13 04:21:19,036 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:19,036 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:19,036 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:19,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:19,036 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:19,044 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:19,049 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:19,049 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:19,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:19,050 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:21:19,078 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:21:19,078 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:19,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:19,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:19,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:19,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:19,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:19,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:19,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:19,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:19,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:19,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:19,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:19,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:19,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:19,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:19,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:19,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:21:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:19,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:19,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 04:21:19,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:21:19,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:21:19,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:21:19,358 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 16 states. [2018-04-13 04:21:19,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:19,706 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-04-13 04:21:19,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 04:21:19,708 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-04-13 04:21:19,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:19,709 INFO L225 Difference]: With dead ends: 47 [2018-04-13 04:21:19,709 INFO L226 Difference]: Without dead ends: 47 [2018-04-13 04:21:19,709 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-04-13 04:21:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-13 04:21:19,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-04-13 04:21:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-04-13 04:21:19,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-04-13 04:21:19,711 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 39 [2018-04-13 04:21:19,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:19,711 INFO L459 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-04-13 04:21:19,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:21:19,711 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-04-13 04:21:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 04:21:19,711 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:19,712 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:19,712 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:19,712 INFO L82 PathProgramCache]: Analyzing trace with hash 196659632, now seen corresponding path program 5 times [2018-04-13 04:21:19,712 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:19,712 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:19,713 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:19,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:19,713 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:19,720 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:19,726 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:19,726 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:19,726 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:19,727 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:21:19,799 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-13 04:21:19,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:19,805 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:19,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:19,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:19,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:19,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:19,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:19,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:19,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:19,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:19,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 04:21:19,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:19,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:19,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:19,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:19,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:21:19,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:19,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:19,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:19,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-04-13 04:21:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:20,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:20,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 04:21:20,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:21:20,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:21:20,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:21:20,047 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 16 states. [2018-04-13 04:21:20,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:20,425 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-04-13 04:21:20,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 04:21:20,425 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-04-13 04:21:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:20,426 INFO L225 Difference]: With dead ends: 52 [2018-04-13 04:21:20,426 INFO L226 Difference]: Without dead ends: 52 [2018-04-13 04:21:20,426 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2018-04-13 04:21:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-13 04:21:20,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-04-13 04:21:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-13 04:21:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-04-13 04:21:20,428 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 44 [2018-04-13 04:21:20,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:20,428 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-04-13 04:21:20,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:21:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-04-13 04:21:20,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 04:21:20,428 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:20,428 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:20,428 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:20,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1320381377, now seen corresponding path program 6 times [2018-04-13 04:21:20,429 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:20,429 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:20,429 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:20,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:20,429 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:20,439 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:20,442 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:20,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:20,443 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:20,443 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:21:20,483 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-13 04:21:20,483 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:20,486 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:20,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:20,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:20,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:20,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:20,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:20,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:20,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:20,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:20,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:20,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:20,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:20,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:20,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:20,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:21:20,770 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:20,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:20,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 04:21:20,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 04:21:20,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 04:21:20,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-04-13 04:21:20,771 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 18 states. [2018-04-13 04:21:21,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:21,318 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-04-13 04:21:21,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 04:21:21,318 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-04-13 04:21:21,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:21,319 INFO L225 Difference]: With dead ends: 57 [2018-04-13 04:21:21,319 INFO L226 Difference]: Without dead ends: 57 [2018-04-13 04:21:21,319 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2018-04-13 04:21:21,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-13 04:21:21,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-04-13 04:21:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-13 04:21:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-04-13 04:21:21,321 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 49 [2018-04-13 04:21:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:21,321 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-04-13 04:21:21,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 04:21:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-04-13 04:21:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 04:21:21,322 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:21,322 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:21,322 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:21,322 INFO L82 PathProgramCache]: Analyzing trace with hash 915147536, now seen corresponding path program 7 times [2018-04-13 04:21:21,322 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:21,322 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:21,323 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:21,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:21,323 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:21,333 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:21,339 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:21,339 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:21,339 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:21,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:21,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:21,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:21,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:21,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:21,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:21,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:21,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:21,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:21,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:21,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:21,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:21,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:21,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:21,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:21,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:21,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:21:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:21,696 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:21,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 04:21:21,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 04:21:21,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 04:21:21,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-04-13 04:21:21,697 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 18 states. [2018-04-13 04:21:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:22,168 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-04-13 04:21:22,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 04:21:22,168 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-04-13 04:21:22,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:22,168 INFO L225 Difference]: With dead ends: 62 [2018-04-13 04:21:22,169 INFO L226 Difference]: Without dead ends: 62 [2018-04-13 04:21:22,169 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2018-04-13 04:21:22,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-13 04:21:22,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-04-13 04:21:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-13 04:21:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-04-13 04:21:22,170 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 54 [2018-04-13 04:21:22,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:22,170 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-04-13 04:21:22,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 04:21:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-04-13 04:21:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-13 04:21:22,170 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:22,171 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:22,171 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:22,171 INFO L82 PathProgramCache]: Analyzing trace with hash -517263649, now seen corresponding path program 8 times [2018-04-13 04:21:22,171 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:22,171 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:22,171 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:22,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:22,171 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:22,183 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:22,188 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:22,188 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:22,188 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:22,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:21:22,246 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:21:22,247 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:22,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:22,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:22,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:22,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:22,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:21:22,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:21:22,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:21:22,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:22,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:21:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:22,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:22,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 04:21:22,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:21:22,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:21:22,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:21:22,561 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 19 states. [2018-04-13 04:21:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:23,069 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-04-13 04:21:23,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 04:21:23,070 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-04-13 04:21:23,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:23,070 INFO L225 Difference]: With dead ends: 67 [2018-04-13 04:21:23,070 INFO L226 Difference]: Without dead ends: 67 [2018-04-13 04:21:23,071 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 04:21:23,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-13 04:21:23,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-04-13 04:21:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-13 04:21:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-04-13 04:21:23,072 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 59 [2018-04-13 04:21:23,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:23,073 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-04-13 04:21:23,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:21:23,073 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-04-13 04:21:23,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-13 04:21:23,073 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:23,073 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:23,073 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:23,074 INFO L82 PathProgramCache]: Analyzing trace with hash 482677872, now seen corresponding path program 9 times [2018-04-13 04:21:23,074 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:23,074 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:23,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:23,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:23,075 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:23,089 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:23,095 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:23,095 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:23,095 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:23,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:21:23,183 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-13 04:21:23,183 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:23,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:23,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:23,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:23,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:23,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:21:23,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:21:23,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:21:23,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:23,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:21:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:23,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:23,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 04:21:23,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 04:21:23,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 04:21:23,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-04-13 04:21:23,491 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 21 states. [2018-04-13 04:21:23,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:23,935 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-04-13 04:21:23,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 04:21:23,936 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-04-13 04:21:23,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:23,936 INFO L225 Difference]: With dead ends: 72 [2018-04-13 04:21:23,936 INFO L226 Difference]: Without dead ends: 72 [2018-04-13 04:21:23,936 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=1279, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 04:21:23,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-13 04:21:23,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-04-13 04:21:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-13 04:21:23,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-04-13 04:21:23,938 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 64 [2018-04-13 04:21:23,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:23,938 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-04-13 04:21:23,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 04:21:23,938 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-04-13 04:21:23,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-13 04:21:23,938 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:23,938 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:23,938 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash -167706241, now seen corresponding path program 10 times [2018-04-13 04:21:23,939 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:23,939 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:23,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:23,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:23,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:23,947 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:23,951 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:23,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:23,951 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:23,951 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:21:23,975 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:21:23,975 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:23,979 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:23,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-13 04:21:23,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:24,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:24,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:24,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:24,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:24,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:24,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:24,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:24,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:24,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:24,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:24,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:24,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:24,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:21:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:24,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:24,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 04:21:24,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 04:21:24,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 04:21:24,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-04-13 04:21:24,449 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 22 states. [2018-04-13 04:21:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:25,207 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-04-13 04:21:25,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 04:21:25,207 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-04-13 04:21:25,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:25,208 INFO L225 Difference]: With dead ends: 77 [2018-04-13 04:21:25,208 INFO L226 Difference]: Without dead ends: 77 [2018-04-13 04:21:25,208 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=1427, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:21:25,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-13 04:21:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-04-13 04:21:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-13 04:21:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-04-13 04:21:25,210 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 69 [2018-04-13 04:21:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:25,210 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-04-13 04:21:25,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 04:21:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-04-13 04:21:25,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-13 04:21:25,210 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:25,210 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:25,210 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:25,210 INFO L82 PathProgramCache]: Analyzing trace with hash 801760720, now seen corresponding path program 11 times [2018-04-13 04:21:25,211 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:25,211 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:25,211 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:25,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:25,211 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:25,220 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:25,225 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:25,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:25,225 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:25,226 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:21:25,291 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-13 04:21:25,291 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:25,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:25,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:25,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:25,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-13 04:21:25,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:25,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:25,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:25,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:25,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:25,339 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 17 treesize of output 24 [2018-04-13 04:21:25,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:25,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:25,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:25,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:25,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:21:25,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 04:21:25,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:25,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:25,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-13 04:21:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:25,720 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:25,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 04:21:25,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 04:21:25,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 04:21:25,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-04-13 04:21:25,721 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 23 states. [2018-04-13 04:21:26,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:26,434 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-04-13 04:21:26,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 04:21:26,434 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2018-04-13 04:21:26,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:26,434 INFO L225 Difference]: With dead ends: 82 [2018-04-13 04:21:26,434 INFO L226 Difference]: Without dead ends: 82 [2018-04-13 04:21:26,435 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=1506, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 04:21:26,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-13 04:21:26,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-04-13 04:21:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-13 04:21:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-04-13 04:21:26,436 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 74 [2018-04-13 04:21:26,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:26,437 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-04-13 04:21:26,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 04:21:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-04-13 04:21:26,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-13 04:21:26,437 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:26,438 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:26,438 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:26,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1848118303, now seen corresponding path program 12 times [2018-04-13 04:21:26,438 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:26,438 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:26,438 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:26,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:26,439 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:26,453 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:26,460 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:26,460 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:26,460 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:26,461 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:21:26,538 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-13 04:21:26,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:26,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:26,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:26,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:26,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:26,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:21:26,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:21:26,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:21:26,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:26,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:21:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:26,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:26,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 04:21:26,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 04:21:26,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 04:21:26,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-04-13 04:21:26,922 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 23 states. [2018-04-13 04:21:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:27,551 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-04-13 04:21:27,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 04:21:27,551 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 79 [2018-04-13 04:21:27,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:27,551 INFO L225 Difference]: With dead ends: 87 [2018-04-13 04:21:27,551 INFO L226 Difference]: Without dead ends: 87 [2018-04-13 04:21:27,552 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=1586, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 04:21:27,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-13 04:21:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-04-13 04:21:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-13 04:21:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-04-13 04:21:27,553 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 79 [2018-04-13 04:21:27,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:27,553 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-04-13 04:21:27,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 04:21:27,553 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-04-13 04:21:27,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 04:21:27,554 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:27,554 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:27,554 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:27,554 INFO L82 PathProgramCache]: Analyzing trace with hash -645890256, now seen corresponding path program 13 times [2018-04-13 04:21:27,554 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:27,554 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:27,555 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:27,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:27,555 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:27,564 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:27,570 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:27,570 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:27,570 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:27,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:27,621 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:27,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:27,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:27,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:27,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:27,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:27,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:27,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:27,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:27,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:27,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:27,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:27,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:27,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:27,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:27,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:21:28,004 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:28,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:28,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 04:21:28,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 04:21:28,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 04:21:28,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-04-13 04:21:28,005 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 25 states. [2018-04-13 04:21:28,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:28,854 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-04-13 04:21:28,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 04:21:28,854 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 84 [2018-04-13 04:21:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:28,855 INFO L225 Difference]: With dead ends: 92 [2018-04-13 04:21:28,855 INFO L226 Difference]: Without dead ends: 92 [2018-04-13 04:21:28,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=1919, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 04:21:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-13 04:21:28,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-04-13 04:21:28,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-13 04:21:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-04-13 04:21:28,857 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 84 [2018-04-13 04:21:28,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:28,858 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-04-13 04:21:28,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 04:21:28,858 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-04-13 04:21:28,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 04:21:28,858 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:28,859 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:28,859 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:28,859 INFO L82 PathProgramCache]: Analyzing trace with hash 528109247, now seen corresponding path program 14 times [2018-04-13 04:21:28,859 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:28,859 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:28,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:28,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:28,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:28,877 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:28,888 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:28,888 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:28,888 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:28,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:21:29,014 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:21:29,014 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:29,023 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:29,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:29,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:29,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:29,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:29,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:29,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:29,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:29,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:29,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:29,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:29,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:29,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:29,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:29,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:29,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:21:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:29,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:29,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-13 04:21:29,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 04:21:29,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 04:21:29,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-04-13 04:21:29,434 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 26 states. [2018-04-13 04:21:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:30,265 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-04-13 04:21:30,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 04:21:30,265 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 89 [2018-04-13 04:21:30,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:30,265 INFO L225 Difference]: With dead ends: 97 [2018-04-13 04:21:30,265 INFO L226 Difference]: Without dead ends: 97 [2018-04-13 04:21:30,266 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=157, Invalid=2099, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 04:21:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-13 04:21:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-04-13 04:21:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-13 04:21:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-04-13 04:21:30,267 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 89 [2018-04-13 04:21:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:30,268 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-04-13 04:21:30,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 04:21:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-04-13 04:21:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 04:21:30,268 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:30,268 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:30,268 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:30,268 INFO L82 PathProgramCache]: Analyzing trace with hash -598810480, now seen corresponding path program 15 times [2018-04-13 04:21:30,269 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:30,269 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:30,269 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:30,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:30,269 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:30,285 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:30,295 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:30,296 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:30,296 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:30,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:21:30,461 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-13 04:21:30,461 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:30,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:30,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:30,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:30,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:30,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:21:30,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:21:30,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:21:30,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:30,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:21:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:30,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:30,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 04:21:30,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 04:21:30,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 04:21:30,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2018-04-13 04:21:30,979 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 28 states. [2018-04-13 04:21:31,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:31,890 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-04-13 04:21:31,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 04:21:31,890 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2018-04-13 04:21:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:31,891 INFO L225 Difference]: With dead ends: 102 [2018-04-13 04:21:31,891 INFO L226 Difference]: Without dead ends: 102 [2018-04-13 04:21:31,891 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=2477, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 04:21:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-13 04:21:31,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-04-13 04:21:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-13 04:21:31,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-04-13 04:21:31,893 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 94 [2018-04-13 04:21:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:31,893 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-04-13 04:21:31,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 04:21:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-04-13 04:21:31,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 04:21:31,894 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:31,894 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:31,894 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:31,894 INFO L82 PathProgramCache]: Analyzing trace with hash -682505889, now seen corresponding path program 16 times [2018-04-13 04:21:31,894 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:31,894 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:31,895 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:31,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:31,895 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:31,911 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:31,917 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:31,917 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:31,917 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:31,918 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:21:32,044 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:21:32,045 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:32,055 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:32,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:32,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:32,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:32,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:32,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:32,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:32,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:32,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:32,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:32,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:32,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:32,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:32,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:32,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:21:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:32,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:32,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 04:21:32,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 04:21:32,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 04:21:32,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=700, Unknown=0, NotChecked=0, Total=756 [2018-04-13 04:21:32,574 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 28 states. [2018-04-13 04:21:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:33,637 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-04-13 04:21:33,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 04:21:33,637 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 99 [2018-04-13 04:21:33,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:33,637 INFO L225 Difference]: With dead ends: 107 [2018-04-13 04:21:33,637 INFO L226 Difference]: Without dead ends: 107 [2018-04-13 04:21:33,638 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=2480, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 04:21:33,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-13 04:21:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-04-13 04:21:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-13 04:21:33,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-04-13 04:21:33,639 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 99 [2018-04-13 04:21:33,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:33,643 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-04-13 04:21:33,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 04:21:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-04-13 04:21:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 04:21:33,643 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:33,643 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:33,644 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:33,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1290073616, now seen corresponding path program 17 times [2018-04-13 04:21:33,644 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:33,644 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:33,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:33,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:33,645 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:33,662 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:33,669 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:33,670 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:33,670 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:33,670 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:21:33,841 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-13 04:21:33,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:33,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:33,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:33,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:33,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:33,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:33,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:33,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:33,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:33,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:33,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:33,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:33,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:33,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:33,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:33,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:33,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:21:33,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-04-13 04:21:33,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:33,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:33,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-04-13 04:21:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:34,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:34,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 04:21:34,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 04:21:34,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 04:21:34,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-04-13 04:21:34,313 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 28 states. [2018-04-13 04:21:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:35,457 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-04-13 04:21:35,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 04:21:35,457 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 104 [2018-04-13 04:21:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:35,458 INFO L225 Difference]: With dead ends: 112 [2018-04-13 04:21:35,458 INFO L226 Difference]: Without dead ends: 112 [2018-04-13 04:21:35,458 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=2486, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 04:21:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-13 04:21:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-04-13 04:21:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-13 04:21:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-04-13 04:21:35,460 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 104 [2018-04-13 04:21:35,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:35,460 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-04-13 04:21:35,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 04:21:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-04-13 04:21:35,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 04:21:35,460 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:35,460 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:35,460 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:35,461 INFO L82 PathProgramCache]: Analyzing trace with hash -91718657, now seen corresponding path program 18 times [2018-04-13 04:21:35,461 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:35,461 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:35,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:35,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:35,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:35,473 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:35,478 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:35,478 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:35,478 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:35,479 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:21:35,642 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-04-13 04:21:35,642 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:35,654 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:35,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:35,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:35,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:35,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:35,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:35,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:35,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:35,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:35,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:35,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:35,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:35,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:35,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:35,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:35,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:21:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:36,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:36,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-13 04:21:36,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 04:21:36,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 04:21:36,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-04-13 04:21:36,402 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 29 states. [2018-04-13 04:21:37,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:37,750 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-04-13 04:21:37,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 04:21:37,750 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 109 [2018-04-13 04:21:37,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:37,750 INFO L225 Difference]: With dead ends: 117 [2018-04-13 04:21:37,750 INFO L226 Difference]: Without dead ends: 117 [2018-04-13 04:21:37,751 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=172, Invalid=2690, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 04:21:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-13 04:21:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-04-13 04:21:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-13 04:21:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-04-13 04:21:37,752 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 109 [2018-04-13 04:21:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:37,753 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-04-13 04:21:37,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 04:21:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-04-13 04:21:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:21:37,753 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:37,753 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:37,753 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:37,753 INFO L82 PathProgramCache]: Analyzing trace with hash -246744240, now seen corresponding path program 19 times [2018-04-13 04:21:37,753 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:37,754 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:37,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:37,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:37,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:37,767 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:37,779 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:37,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:37,779 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:37,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:37,937 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:37,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:37,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:37,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:37,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:37,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:37,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:37,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:37,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:37,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:37,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:37,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:37,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:37,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:37,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:37,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:21:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:38,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:38,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 04:21:38,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 04:21:38,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 04:21:38,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-04-13 04:21:38,572 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 31 states. [2018-04-13 04:21:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:39,815 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-04-13 04:21:39,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 04:21:39,816 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 114 [2018-04-13 04:21:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:39,816 INFO L225 Difference]: With dead ends: 122 [2018-04-13 04:21:39,816 INFO L226 Difference]: Without dead ends: 122 [2018-04-13 04:21:39,817 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=187, Invalid=3119, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 04:21:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-04-13 04:21:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-04-13 04:21:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-13 04:21:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-04-13 04:21:39,818 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 114 [2018-04-13 04:21:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:39,818 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-04-13 04:21:39,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 04:21:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-04-13 04:21:39,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:21:39,819 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:39,819 INFO L355 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:39,819 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:39,819 INFO L82 PathProgramCache]: Analyzing trace with hash 628647583, now seen corresponding path program 20 times [2018-04-13 04:21:39,819 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:39,819 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:39,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:39,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:39,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:39,831 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:39,842 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:39,843 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:39,843 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:39,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:21:40,025 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:21:40,025 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:40,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:40,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:40,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:40,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:40,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:40,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:40,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:40,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:40,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:40,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:40,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:40,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:40,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:40,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:40,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:40,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:21:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:40,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:40,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-13 04:21:40,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 04:21:40,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 04:21:40,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2018-04-13 04:21:40,646 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 32 states. [2018-04-13 04:21:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:41,989 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-04-13 04:21:41,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 04:21:41,989 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 119 [2018-04-13 04:21:41,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:41,989 INFO L225 Difference]: With dead ends: 127 [2018-04-13 04:21:41,989 INFO L226 Difference]: Without dead ends: 127 [2018-04-13 04:21:41,990 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=3347, Unknown=0, NotChecked=0, Total=3540 [2018-04-13 04:21:41,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-13 04:21:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-04-13 04:21:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-13 04:21:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-04-13 04:21:41,991 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 119 [2018-04-13 04:21:41,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:41,992 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-04-13 04:21:41,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 04:21:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-04-13 04:21:41,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:21:41,992 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:41,992 INFO L355 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:41,992 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:41,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1564166992, now seen corresponding path program 21 times [2018-04-13 04:21:41,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:41,992 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:41,993 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:41,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:41,993 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:42,006 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:42,012 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:42,012 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:42,012 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:42,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:21:42,178 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-13 04:21:42,178 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:42,188 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:42,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:42,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:42,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:42,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:21:42,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:21:42,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:21:42,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:42,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:21:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:42,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:42,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 04:21:42,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 04:21:42,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 04:21:42,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 04:21:42,679 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 33 states. [2018-04-13 04:21:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:43,868 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-04-13 04:21:43,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 04:21:43,868 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2018-04-13 04:21:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:43,869 INFO L225 Difference]: With dead ends: 132 [2018-04-13 04:21:43,869 INFO L226 Difference]: Without dead ends: 132 [2018-04-13 04:21:43,870 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=3583, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 04:21:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-13 04:21:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-04-13 04:21:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-13 04:21:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-04-13 04:21:43,872 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 124 [2018-04-13 04:21:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:43,872 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-04-13 04:21:43,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 04:21:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-04-13 04:21:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-13 04:21:43,873 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:43,873 INFO L355 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:43,873 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:43,873 INFO L82 PathProgramCache]: Analyzing trace with hash -872707777, now seen corresponding path program 22 times [2018-04-13 04:21:43,873 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:43,873 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:43,873 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:43,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:43,873 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:43,886 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:43,891 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:43,892 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:43,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:43,892 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:21:44,130 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:21:44,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:44,157 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:44,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:44,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:44,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:44,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:21:44,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:21:44,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:21:44,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:44,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:21:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:44,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:44,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 04:21:44,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 04:21:44,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 04:21:44,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 04:21:44,642 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 33 states. [2018-04-13 04:21:45,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:45,910 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-04-13 04:21:45,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 04:21:45,927 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 129 [2018-04-13 04:21:45,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:45,928 INFO L225 Difference]: With dead ends: 137 [2018-04-13 04:21:45,928 INFO L226 Difference]: Without dead ends: 137 [2018-04-13 04:21:45,929 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=3586, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 04:21:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-13 04:21:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-04-13 04:21:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-13 04:21:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-04-13 04:21:45,930 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 129 [2018-04-13 04:21:45,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:45,930 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-04-13 04:21:45,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 04:21:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-04-13 04:21:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-04-13 04:21:45,931 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:45,931 INFO L355 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:45,931 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:45,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1410451952, now seen corresponding path program 23 times [2018-04-13 04:21:45,931 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:45,931 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:45,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:45,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:45,932 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:45,946 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:45,953 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:45,953 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:45,953 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:45,953 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:21:46,106 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-04-13 04:21:46,106 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:46,117 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:46,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:46,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:46,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:46,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:21:46,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:21:46,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:21:46,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:46,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:21:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:46,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:46,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 04:21:46,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 04:21:46,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 04:21:46,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 04:21:46,633 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 34 states. [2018-04-13 04:21:48,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:48,043 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-04-13 04:21:48,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 04:21:48,044 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 134 [2018-04-13 04:21:48,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:48,044 INFO L225 Difference]: With dead ends: 142 [2018-04-13 04:21:48,044 INFO L226 Difference]: Without dead ends: 142 [2018-04-13 04:21:48,045 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=202, Invalid=3830, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 04:21:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-13 04:21:48,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-04-13 04:21:48,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-13 04:21:48,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-04-13 04:21:48,046 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 134 [2018-04-13 04:21:48,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:48,047 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-04-13 04:21:48,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 04:21:48,047 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-04-13 04:21:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-04-13 04:21:48,047 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:48,047 INFO L355 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:48,047 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:48,047 INFO L82 PathProgramCache]: Analyzing trace with hash -647240737, now seen corresponding path program 24 times [2018-04-13 04:21:48,047 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:48,047 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:48,048 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:48,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:48,048 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:48,064 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:48,070 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:48,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:48,070 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:48,071 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:21:48,265 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-04-13 04:21:48,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:48,277 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:48,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-13 04:21:48,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:48,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:48,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:48,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:48,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:48,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:48,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:48,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:48,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:48,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:48,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:48,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:48,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:21:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:49,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:49,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-13 04:21:49,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 04:21:49,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 04:21:49,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 04:21:49,002 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 35 states. [2018-04-13 04:21:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:50,611 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-04-13 04:21:50,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 04:21:50,611 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 139 [2018-04-13 04:21:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:50,612 INFO L225 Difference]: With dead ends: 147 [2018-04-13 04:21:50,612 INFO L226 Difference]: Without dead ends: 147 [2018-04-13 04:21:50,612 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=208, Invalid=4082, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 04:21:50,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-13 04:21:50,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-04-13 04:21:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-13 04:21:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-04-13 04:21:50,614 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 139 [2018-04-13 04:21:50,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:50,614 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-04-13 04:21:50,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 04:21:50,614 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-04-13 04:21:50,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-04-13 04:21:50,614 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:50,615 INFO L355 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:50,615 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:50,615 INFO L82 PathProgramCache]: Analyzing trace with hash 699236208, now seen corresponding path program 25 times [2018-04-13 04:21:50,615 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:50,615 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:50,615 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:50,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:50,615 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:50,631 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:50,637 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:50,637 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:50,637 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:50,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:50,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:50,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:50,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:50,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:50,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:50,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:50,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:50,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:50,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:50,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:50,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:50,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:50,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:50,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:50,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:50,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:21:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:51,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:51,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-13 04:21:51,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 04:21:51,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 04:21:51,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 04:21:51,457 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 37 states. [2018-04-13 04:21:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:53,124 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-04-13 04:21:53,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 04:21:53,124 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 144 [2018-04-13 04:21:53,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:53,125 INFO L225 Difference]: With dead ends: 152 [2018-04-13 04:21:53,125 INFO L226 Difference]: Without dead ends: 152 [2018-04-13 04:21:53,126 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=223, Invalid=4607, Unknown=0, NotChecked=0, Total=4830 [2018-04-13 04:21:53,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-13 04:21:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-04-13 04:21:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-13 04:21:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-04-13 04:21:53,128 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 144 [2018-04-13 04:21:53,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:53,128 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-04-13 04:21:53,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 04:21:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-04-13 04:21:53,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-04-13 04:21:53,129 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:53,129 INFO L355 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:53,129 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:53,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1352889983, now seen corresponding path program 26 times [2018-04-13 04:21:53,129 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:53,130 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:53,130 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:53,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:21:53,130 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:53,159 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:53,167 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:53,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:53,168 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:53,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:21:53,599 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:21:53,599 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:53,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:53,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:53,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:53,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:53,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:53,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:53,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:53,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:53,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:53,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:53,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:53,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:53,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:21:53,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:53,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:53,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:21:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:54,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:54,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-13 04:21:54,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 04:21:54,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 04:21:54,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 04:21:54,280 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 38 states. [2018-04-13 04:21:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:56,167 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-04-13 04:21:56,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 04:21:56,167 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 149 [2018-04-13 04:21:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:56,167 INFO L225 Difference]: With dead ends: 157 [2018-04-13 04:21:56,168 INFO L226 Difference]: Without dead ends: 157 [2018-04-13 04:21:56,168 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=229, Invalid=4883, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 04:21:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-04-13 04:21:56,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-04-13 04:21:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-13 04:21:56,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-04-13 04:21:56,171 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 149 [2018-04-13 04:21:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:56,171 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-04-13 04:21:56,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 04:21:56,172 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-04-13 04:21:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-04-13 04:21:56,172 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:56,172 INFO L355 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:56,173 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:56,173 INFO L82 PathProgramCache]: Analyzing trace with hash -781676336, now seen corresponding path program 27 times [2018-04-13 04:21:56,173 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:56,173 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:56,173 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:56,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:56,174 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:56,191 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:56,196 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:56,196 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:56,196 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:56,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:21:56,510 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-04-13 04:21:56,510 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:56,527 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:56,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:56,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:56,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:56,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:21:56,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:21:56,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:21:56,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:56,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:21:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:21:57,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:21:57,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-13 04:21:57,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 04:21:57,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 04:21:57,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1479, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:21:57,177 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 40 states. [2018-04-13 04:21:58,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:21:58,957 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-04-13 04:21:58,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 04:21:58,957 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 154 [2018-04-13 04:21:58,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:21:58,958 INFO L225 Difference]: With dead ends: 162 [2018-04-13 04:21:58,958 INFO L226 Difference]: Without dead ends: 162 [2018-04-13 04:21:58,958 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=247, Invalid=5453, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 04:21:58,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-13 04:21:58,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-04-13 04:21:58,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-13 04:21:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-04-13 04:21:58,960 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 154 [2018-04-13 04:21:58,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:21:58,960 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-04-13 04:21:58,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 04:21:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-04-13 04:21:58,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-04-13 04:21:58,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:21:58,960 INFO L355 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:21:58,961 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:21:58,961 INFO L82 PathProgramCache]: Analyzing trace with hash -335789793, now seen corresponding path program 28 times [2018-04-13 04:21:58,961 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:21:58,961 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:21:58,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:58,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:21:58,962 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:21:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:21:58,981 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:21:58,988 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:21:58,988 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:21:58,988 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:21:58,988 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:21:59,247 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:21:59,247 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:21:59,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:21:59,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:59,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:59,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:21:59,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:59,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:59,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:21:59,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:59,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:21:59,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:59,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:59,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:21:59,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 04:21:59,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:21:59,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:21:59,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:22:00,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:22:00,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:00,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:00,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-04-13 04:22:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:22:00,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:22:00,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-13 04:22:00,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 04:22:00,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 04:22:00,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1481, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:22:00,354 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 40 states. [2018-04-13 04:22:03,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:22:03,209 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-04-13 04:22:03,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 04:22:03,209 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 159 [2018-04-13 04:22:03,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:22:03,210 INFO L225 Difference]: With dead ends: 167 [2018-04-13 04:22:03,210 INFO L226 Difference]: Without dead ends: 167 [2018-04-13 04:22:03,211 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=236, Invalid=5314, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 04:22:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-13 04:22:03,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-04-13 04:22:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-13 04:22:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-04-13 04:22:03,213 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 159 [2018-04-13 04:22:03,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:22:03,213 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-04-13 04:22:03,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 04:22:03,213 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-04-13 04:22:03,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-04-13 04:22:03,213 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:22:03,213 INFO L355 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:22:03,213 INFO L408 AbstractCegarLoop]: === Iteration 47 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:22:03,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1359309360, now seen corresponding path program 29 times [2018-04-13 04:22:03,214 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:22:03,214 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:22:03,214 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:03,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:22:03,214 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:22:03,234 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:22:03,243 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:22:03,243 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:22:03,243 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:22:03,244 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:22:03,491 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-04-13 04:22:03,491 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:22:03,519 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:22:03,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:03,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:03,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:03,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:03,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:03,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:22:03,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:03,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:22:03,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:03,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:03,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:03,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 04:22:03,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:03,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:03,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:22:03,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 04:22:03,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:03,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:03,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-13 04:22:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:22:04,430 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:22:04,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-13 04:22:04,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 04:22:04,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 04:22:04,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:22:04,431 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 40 states. [2018-04-13 04:22:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:22:06,752 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-04-13 04:22:06,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 04:22:06,752 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 164 [2018-04-13 04:22:06,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:22:06,753 INFO L225 Difference]: With dead ends: 172 [2018-04-13 04:22:06,753 INFO L226 Difference]: Without dead ends: 172 [2018-04-13 04:22:06,754 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=233, Invalid=5317, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 04:22:06,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-13 04:22:06,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-04-13 04:22:06,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-13 04:22:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-04-13 04:22:06,756 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 164 [2018-04-13 04:22:06,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:22:06,756 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-04-13 04:22:06,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 04:22:06,756 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-04-13 04:22:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-04-13 04:22:06,756 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:22:06,756 INFO L355 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:22:06,756 INFO L408 AbstractCegarLoop]: === Iteration 48 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:22:06,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1118813249, now seen corresponding path program 30 times [2018-04-13 04:22:06,757 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:22:06,757 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:22:06,757 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:06,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:22:06,757 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:22:06,779 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:22:06,787 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:22:06,787 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:22:06,787 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:22:06,787 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:22:07,253 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-04-13 04:22:07,253 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:22:07,279 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:22:07,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:07,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:07,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-13 04:22:07,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:07,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:07,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:22:07,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:07,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:07,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:22:07,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:07,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:22:07,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:07,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:07,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:22:08,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:22:08,142 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:22:08,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-13 04:22:08,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 04:22:08,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 04:22:08,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1719, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 04:22:08,143 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 43 states. [2018-04-13 04:22:10,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:22:10,477 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-04-13 04:22:10,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-13 04:22:10,477 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 169 [2018-04-13 04:22:10,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:22:10,478 INFO L225 Difference]: With dead ends: 177 [2018-04-13 04:22:10,478 INFO L226 Difference]: Without dead ends: 177 [2018-04-13 04:22:10,479 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=265, Invalid=6377, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 04:22:10,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-13 04:22:10,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-04-13 04:22:10,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-13 04:22:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-04-13 04:22:10,480 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 169 [2018-04-13 04:22:10,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:22:10,480 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-04-13 04:22:10,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 04:22:10,480 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-04-13 04:22:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-04-13 04:22:10,481 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:22:10,481 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:22:10,481 INFO L408 AbstractCegarLoop]: === Iteration 49 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:22:10,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1360393328, now seen corresponding path program 31 times [2018-04-13 04:22:10,481 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:22:10,481 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:22:10,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:10,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:22:10,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:22:10,503 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:22:10,511 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:22:10,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:22:10,511 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:22:10,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:22:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:22:10,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:22:10,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:10,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:10,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:10,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:10,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:10,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:22:10,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:10,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:22:10,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:10,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:10,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:10,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:22:10,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:10,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:10,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:22:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:22:11,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:22:11,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-13 04:22:11,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-13 04:22:11,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-13 04:22:11,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1721, Unknown=0, NotChecked=0, Total=1806 [2018-04-13 04:22:11,705 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 43 states. [2018-04-13 04:22:14,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:22:14,081 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-04-13 04:22:14,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-13 04:22:14,082 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 174 [2018-04-13 04:22:14,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:22:14,082 INFO L225 Difference]: With dead ends: 182 [2018-04-13 04:22:14,082 INFO L226 Difference]: Without dead ends: 182 [2018-04-13 04:22:14,083 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=259, Invalid=6383, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 04:22:14,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-13 04:22:14,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-04-13 04:22:14,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-13 04:22:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-04-13 04:22:14,084 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 174 [2018-04-13 04:22:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:22:14,085 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-04-13 04:22:14,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-13 04:22:14,085 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-04-13 04:22:14,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-04-13 04:22:14,085 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:22:14,085 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:22:14,085 INFO L408 AbstractCegarLoop]: === Iteration 50 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:22:14,085 INFO L82 PathProgramCache]: Analyzing trace with hash -839287201, now seen corresponding path program 32 times [2018-04-13 04:22:14,085 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:22:14,085 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:22:14,086 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:14,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:22:14,086 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:22:14,110 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:22:14,119 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:22:14,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:22:14,119 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:22:14,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:22:14,597 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:22:14,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:22:14,625 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:22:14,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:14,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:14,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:14,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:14,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:14,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:22:14,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:14,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:22:14,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:14,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:14,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:14,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 04:22:14,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:14,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:14,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:25 [2018-04-13 04:22:15,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 04:22:15,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:15,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:15,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-04-13 04:22:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:22:16,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:22:16,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-13 04:22:16,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-13 04:22:16,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-13 04:22:16,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1889, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 04:22:16,023 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 45 states. [2018-04-13 04:22:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:22:19,192 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-04-13 04:22:19,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 04:22:19,192 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 179 [2018-04-13 04:22:19,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:22:19,192 INFO L225 Difference]: With dead ends: 187 [2018-04-13 04:22:19,192 INFO L226 Difference]: Without dead ends: 187 [2018-04-13 04:22:19,193 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=272, Invalid=6868, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 04:22:19,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-04-13 04:22:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2018-04-13 04:22:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-13 04:22:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-04-13 04:22:19,194 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 179 [2018-04-13 04:22:19,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:22:19,194 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-04-13 04:22:19,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-13 04:22:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-04-13 04:22:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-04-13 04:22:19,195 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:22:19,195 INFO L355 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:22:19,195 INFO L408 AbstractCegarLoop]: === Iteration 51 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:22:19,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1443072784, now seen corresponding path program 33 times [2018-04-13 04:22:19,196 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:22:19,196 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:22:19,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:19,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:22:19,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:22:19,220 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:22:19,229 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:22:19,229 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:22:19,229 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:22:19,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:22:19,564 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-04-13 04:22:19,564 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:22:19,584 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:22:19,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-13 04:22:19,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:19,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:19,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:22:19,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:22:19,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:22:19,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:19,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:22:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:22:20,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:22:20,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-13 04:22:20,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-13 04:22:20,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-13 04:22:20,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1977, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 04:22:20,573 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 46 states. [2018-04-13 04:22:23,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:22:23,077 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-04-13 04:22:23,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-13 04:22:23,077 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 184 [2018-04-13 04:22:23,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:22:23,078 INFO L225 Difference]: With dead ends: 192 [2018-04-13 04:22:23,078 INFO L226 Difference]: Without dead ends: 192 [2018-04-13 04:22:23,078 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=283, Invalid=7373, Unknown=0, NotChecked=0, Total=7656 [2018-04-13 04:22:23,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-04-13 04:22:23,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2018-04-13 04:22:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-13 04:22:23,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-04-13 04:22:23,080 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 184 [2018-04-13 04:22:23,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:22:23,080 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-04-13 04:22:23,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-13 04:22:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-04-13 04:22:23,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-04-13 04:22:23,081 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:22:23,081 INFO L355 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:22:23,082 INFO L408 AbstractCegarLoop]: === Iteration 52 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:22:23,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1093537537, now seen corresponding path program 34 times [2018-04-13 04:22:23,082 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:22:23,082 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:22:23,082 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:23,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:22:23,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:22:23,108 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:22:23,115 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:22:23,115 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:22:23,116 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:22:23,116 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:22:23,433 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:22:23,433 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:22:23,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:22:23,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:23,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:23,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:23,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:23,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:23,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:22:23,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:23,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:22:23,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:23,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:23,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:23,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:22:23,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:23,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:23,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:22:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:22:24,463 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:22:24,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-13 04:22:24,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-13 04:22:24,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-13 04:22:24,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1979, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 04:22:24,597 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 46 states. [2018-04-13 04:22:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:22:27,593 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-04-13 04:22:27,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-13 04:22:27,593 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 189 [2018-04-13 04:22:27,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:22:27,594 INFO L225 Difference]: With dead ends: 197 [2018-04-13 04:22:27,594 INFO L226 Difference]: Without dead ends: 197 [2018-04-13 04:22:27,595 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=277, Invalid=7379, Unknown=0, NotChecked=0, Total=7656 [2018-04-13 04:22:27,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-13 04:22:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-04-13 04:22:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-13 04:22:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-04-13 04:22:27,597 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 189 [2018-04-13 04:22:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:22:27,597 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-04-13 04:22:27,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-13 04:22:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-04-13 04:22:27,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-04-13 04:22:27,597 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:22:27,598 INFO L355 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:22:27,598 INFO L408 AbstractCegarLoop]: === Iteration 53 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:22:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash 430089808, now seen corresponding path program 35 times [2018-04-13 04:22:27,598 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:22:27,598 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:22:27,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:27,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:22:27,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:22:27,625 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:22:27,635 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:22:27,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:22:27,635 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:22:27,635 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:22:28,123 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-04-13 04:22:28,123 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:22:28,152 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:22:28,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:28,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:28,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:28,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:28,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:28,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:22:28,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:28,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:22:28,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:28,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:28,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:28,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:22:28,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:28,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:28,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:22:28,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-04-13 04:22:28,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:28,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:28,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-04-13 04:22:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:22:29,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:22:29,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-13 04:22:29,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-13 04:22:29,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-13 04:22:29,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 04:22:29,099 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 45 states. [2018-04-13 04:22:31,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:22:31,944 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-04-13 04:22:31,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 04:22:31,944 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 194 [2018-04-13 04:22:31,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:22:31,945 INFO L225 Difference]: With dead ends: 202 [2018-04-13 04:22:31,945 INFO L226 Difference]: Without dead ends: 202 [2018-04-13 04:22:31,945 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=265, Invalid=7045, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 04:22:31,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-04-13 04:22:31,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-04-13 04:22:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-13 04:22:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-04-13 04:22:31,947 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 194 [2018-04-13 04:22:31,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:22:31,947 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-04-13 04:22:31,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-13 04:22:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-04-13 04:22:31,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-04-13 04:22:31,948 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:22:31,948 INFO L355 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:22:31,948 INFO L408 AbstractCegarLoop]: === Iteration 54 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:22:31,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1748212639, now seen corresponding path program 36 times [2018-04-13 04:22:31,948 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:22:31,948 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:22:31,948 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:31,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:22:31,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:22:31,976 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:22:31,983 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:22:31,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:22:31,984 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:22:31,984 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:22:32,439 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-04-13 04:22:32,439 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:22:32,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:22:32,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:32,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:32,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:32,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:32,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:32,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:22:32,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:32,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:22:32,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:32,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:32,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:32,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:22:32,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:32,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:32,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:22:33,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-04-13 04:22:33,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:33,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:33,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-04-13 04:22:33,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:22:33,734 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:22:33,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-13 04:22:33,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-13 04:22:33,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-13 04:22:33,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2254, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 04:22:33,735 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 49 states. [2018-04-13 04:22:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:22:37,026 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-04-13 04:22:37,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 04:22:37,053 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 199 [2018-04-13 04:22:37,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:22:37,054 INFO L225 Difference]: With dead ends: 207 [2018-04-13 04:22:37,054 INFO L226 Difference]: Without dead ends: 207 [2018-04-13 04:22:37,055 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=293, Invalid=8263, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 04:22:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-13 04:22:37,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-04-13 04:22:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-13 04:22:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-04-13 04:22:37,056 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 199 [2018-04-13 04:22:37,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:22:37,056 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-04-13 04:22:37,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-13 04:22:37,056 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-04-13 04:22:37,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-04-13 04:22:37,057 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:22:37,057 INFO L355 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:22:37,057 INFO L408 AbstractCegarLoop]: === Iteration 55 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:22:37,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1304600496, now seen corresponding path program 37 times [2018-04-13 04:22:37,057 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:22:37,057 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:22:37,058 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:37,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:22:37,058 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:22:37,085 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:22:37,092 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:22:37,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:22:37,092 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:22:37,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:22:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:22:37,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:22:37,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:37,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:37,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:37,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:37,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:37,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:22:37,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:37,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:37,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:22:37,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:37,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:22:37,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:37,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:37,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:22:38,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:22:38,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:22:38,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-13 04:22:38,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-13 04:22:38,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-13 04:22:38,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2255, Unknown=0, NotChecked=0, Total=2352 [2018-04-13 04:22:38,666 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 49 states. [2018-04-13 04:22:41,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:22:41,849 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-04-13 04:22:41,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-13 04:22:41,850 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 204 [2018-04-13 04:22:41,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:22:41,850 INFO L225 Difference]: With dead ends: 212 [2018-04-13 04:22:41,850 INFO L226 Difference]: Without dead ends: 212 [2018-04-13 04:22:41,851 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=295, Invalid=8447, Unknown=0, NotChecked=0, Total=8742 [2018-04-13 04:22:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-13 04:22:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-04-13 04:22:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-13 04:22:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-04-13 04:22:41,853 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 204 [2018-04-13 04:22:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:22:41,853 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-04-13 04:22:41,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-13 04:22:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-04-13 04:22:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-04-13 04:22:41,853 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:22:41,853 INFO L355 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:22:41,853 INFO L408 AbstractCegarLoop]: === Iteration 56 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:22:41,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2046328383, now seen corresponding path program 38 times [2018-04-13 04:22:41,854 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:22:41,854 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:22:41,854 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:41,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:22:41,854 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:22:41,904 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:22:41,919 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:22:41,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:22:41,920 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:22:41,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:22:42,644 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:22:42,644 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:22:42,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:22:42,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:42,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:42,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:42,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:22:42,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:22:42,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:22:42,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:42,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:22:43,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:22:43,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:22:43,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-13 04:22:43,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-13 04:22:43,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-13 04:22:43,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2351, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 04:22:43,659 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 50 states. [2018-04-13 04:22:46,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:22:46,761 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-04-13 04:22:46,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-13 04:22:46,761 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 209 [2018-04-13 04:22:46,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:22:46,762 INFO L225 Difference]: With dead ends: 217 [2018-04-13 04:22:46,762 INFO L226 Difference]: Without dead ends: 217 [2018-04-13 04:22:46,763 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=301, Invalid=8819, Unknown=0, NotChecked=0, Total=9120 [2018-04-13 04:22:46,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-13 04:22:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2018-04-13 04:22:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-04-13 04:22:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-04-13 04:22:46,764 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 209 [2018-04-13 04:22:46,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:22:46,764 INFO L459 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-04-13 04:22:46,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-13 04:22:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-04-13 04:22:46,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-04-13 04:22:46,765 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:22:46,765 INFO L355 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:22:46,765 INFO L408 AbstractCegarLoop]: === Iteration 57 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:22:46,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1858232592, now seen corresponding path program 39 times [2018-04-13 04:22:46,765 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:22:46,765 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:22:46,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:46,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:22:46,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:22:46,801 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:22:46,810 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:22:46,810 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:22:46,810 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:22:46,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:22:47,354 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-04-13 04:22:47,354 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:22:47,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:22:47,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:47,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:47,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 6 treesize of output 5 [2018-04-13 04:22:47,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:47,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:47,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:22:47,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:47,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:22:47,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:47,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:47,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:47,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:22:47,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:47,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:47,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:22:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:22:48,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:22:48,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-13 04:22:48,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-13 04:22:48,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-13 04:22:48,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 04:22:48,698 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 50 states. [2018-04-13 04:22:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:22:52,362 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-04-13 04:22:52,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-13 04:22:52,362 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 214 [2018-04-13 04:22:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:22:52,363 INFO L225 Difference]: With dead ends: 222 [2018-04-13 04:22:52,363 INFO L226 Difference]: Without dead ends: 222 [2018-04-13 04:22:52,364 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=298, Invalid=8822, Unknown=0, NotChecked=0, Total=9120 [2018-04-13 04:22:52,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-13 04:22:52,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2018-04-13 04:22:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-13 04:22:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-04-13 04:22:52,366 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 214 [2018-04-13 04:22:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:22:52,366 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-04-13 04:22:52,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-13 04:22:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-04-13 04:22:52,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-04-13 04:22:52,366 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:22:52,367 INFO L355 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:22:52,367 INFO L408 AbstractCegarLoop]: === Iteration 58 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:22:52,367 INFO L82 PathProgramCache]: Analyzing trace with hash 461019359, now seen corresponding path program 40 times [2018-04-13 04:22:52,367 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:22:52,367 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:22:52,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:52,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:22:52,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:22:52,405 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:22:52,412 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:22:52,412 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:22:52,412 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:22:52,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:22:52,896 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:22:52,986 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:22:53,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:22:53,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:53,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:53,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:53,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:53,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:53,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:22:53,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:53,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:22:53,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:53,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:53,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:53,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:22:53,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:53,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:53,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:22:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:22:54,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:22:54,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-13 04:22:54,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-13 04:22:54,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-13 04:22:54,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2549, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 04:22:54,323 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 52 states. [2018-04-13 04:22:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:22:57,968 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-04-13 04:22:57,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-13 04:22:57,968 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 219 [2018-04-13 04:22:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:22:57,969 INFO L225 Difference]: With dead ends: 227 [2018-04-13 04:22:57,969 INFO L226 Difference]: Without dead ends: 227 [2018-04-13 04:22:57,970 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=313, Invalid=9587, Unknown=0, NotChecked=0, Total=9900 [2018-04-13 04:22:57,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-13 04:22:57,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-04-13 04:22:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-13 04:22:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-04-13 04:22:57,971 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 219 [2018-04-13 04:22:57,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:22:57,971 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-04-13 04:22:57,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-13 04:22:57,971 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-04-13 04:22:57,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-04-13 04:22:57,972 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:22:57,972 INFO L355 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:22:57,972 INFO L408 AbstractCegarLoop]: === Iteration 59 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:22:57,972 INFO L82 PathProgramCache]: Analyzing trace with hash -578295184, now seen corresponding path program 41 times [2018-04-13 04:22:57,972 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:22:57,972 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:22:57,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:57,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:22:57,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:22:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:22:58,005 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:22:58,013 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:22:58,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:22:58,013 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:22:58,014 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:22:59,007 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-04-13 04:22:59,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:22:59,036 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:22:59,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:59,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:59,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:22:59,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:59,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:59,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:22:59,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:59,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:22:59,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 04:22:59,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:59,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:22:59,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:59,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:59,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:22:59,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:22:59,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:22:59,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:22:59,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-04-13 04:23:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:23:00,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:23:00,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-04-13 04:23:00,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-13 04:23:00,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-13 04:23:00,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2754, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 04:23:00,610 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 54 states. [2018-04-13 04:23:05,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:23:05,426 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-04-13 04:23:05,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-13 04:23:05,426 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 224 [2018-04-13 04:23:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:23:05,427 INFO L225 Difference]: With dead ends: 232 [2018-04-13 04:23:05,427 INFO L226 Difference]: Without dead ends: 232 [2018-04-13 04:23:05,428 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=323, Invalid=10183, Unknown=0, NotChecked=0, Total=10506 [2018-04-13 04:23:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-13 04:23:05,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2018-04-13 04:23:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-13 04:23:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-04-13 04:23:05,430 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 224 [2018-04-13 04:23:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:23:05,431 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-04-13 04:23:05,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-13 04:23:05,431 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-04-13 04:23:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-04-13 04:23:05,432 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:23:05,432 INFO L355 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:23:05,432 INFO L408 AbstractCegarLoop]: === Iteration 60 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:23:05,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1953240193, now seen corresponding path program 42 times [2018-04-13 04:23:05,432 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:23:05,432 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:23:05,433 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:23:05,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:23:05,433 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:23:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:23:05,481 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:23:05,495 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:23:05,495 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:23:05,495 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:23:05,496 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:23:06,318 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-04-13 04:23:06,319 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:23:06,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:23:06,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:23:06,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:06,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:23:06,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:06,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:23:06,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:23:06,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:06,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:23:06,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:06,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:06,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:06,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:23:06,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:06,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:23:06,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:23:07,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:23:07,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:07,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:23:07,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:23 [2018-04-13 04:23:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:23:07,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:23:07,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-13 04:23:07,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-13 04:23:07,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-13 04:23:07,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2860, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 04:23:07,967 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 55 states. [2018-04-13 04:23:12,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:23:12,325 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-04-13 04:23:12,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-13 04:23:12,326 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 229 [2018-04-13 04:23:12,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:23:12,326 INFO L225 Difference]: With dead ends: 237 [2018-04-13 04:23:12,326 INFO L226 Difference]: Without dead ends: 237 [2018-04-13 04:23:12,327 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=334, Invalid=10796, Unknown=0, NotChecked=0, Total=11130 [2018-04-13 04:23:12,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-13 04:23:12,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2018-04-13 04:23:12,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-13 04:23:12,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-04-13 04:23:12,330 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 229 [2018-04-13 04:23:12,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:23:12,330 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-04-13 04:23:12,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-13 04:23:12,330 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-04-13 04:23:12,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-04-13 04:23:12,331 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:23:12,331 INFO L355 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:23:12,331 INFO L408 AbstractCegarLoop]: === Iteration 61 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:23:12,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1820771376, now seen corresponding path program 43 times [2018-04-13 04:23:12,331 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:23:12,332 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:23:12,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:23:12,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:23:12,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:23:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:23:12,377 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:23:12,394 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:23:12,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:23:12,394 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:23:12,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:23:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:23:13,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:23:13,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:23:13,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:13,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:23:13,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:13,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:23:13,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:23:13,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:13,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:23:13,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:13,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:13,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:13,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:23:13,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:13,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:23:13,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:23:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:23:14,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:23:14,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-13 04:23:14,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-13 04:23:14,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-13 04:23:14,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2861, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 04:23:14,702 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 55 states. [2018-04-13 04:23:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:23:18,794 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-04-13 04:23:18,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-13 04:23:18,794 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 234 [2018-04-13 04:23:18,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:23:18,795 INFO L225 Difference]: With dead ends: 242 [2018-04-13 04:23:18,795 INFO L226 Difference]: Without dead ends: 242 [2018-04-13 04:23:18,796 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=331, Invalid=10799, Unknown=0, NotChecked=0, Total=11130 [2018-04-13 04:23:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-13 04:23:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-04-13 04:23:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-04-13 04:23:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-04-13 04:23:18,798 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 234 [2018-04-13 04:23:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:23:18,798 INFO L459 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-04-13 04:23:18,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-13 04:23:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-04-13 04:23:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-04-13 04:23:18,799 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:23:18,799 INFO L355 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:23:18,799 INFO L408 AbstractCegarLoop]: === Iteration 62 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:23:18,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1063356897, now seen corresponding path program 44 times [2018-04-13 04:23:18,800 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:23:18,800 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:23:18,800 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:23:18,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:23:18,800 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:23:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:23:18,837 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:23:18,847 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:23:18,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:23:18,847 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:23:18,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:23:19,709 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:23:19,709 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:23:19,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:23:19,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:23:19,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:19,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:23:19,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:19,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:23:19,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:23:19,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:19,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:19,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:23:19,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:19,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:23:19,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:19,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:23:19,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:23:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:23:21,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:23:21,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-13 04:23:21,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-13 04:23:21,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-13 04:23:21,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=2969, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 04:23:21,135 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 56 states. [2018-04-13 04:23:25,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:23:25,393 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-04-13 04:23:25,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-13 04:23:25,393 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 239 [2018-04-13 04:23:25,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:23:25,394 INFO L225 Difference]: With dead ends: 247 [2018-04-13 04:23:25,394 INFO L226 Difference]: Without dead ends: 247 [2018-04-13 04:23:25,395 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=337, Invalid=11219, Unknown=0, NotChecked=0, Total=11556 [2018-04-13 04:23:25,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-13 04:23:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-04-13 04:23:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-13 04:23:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-04-13 04:23:25,397 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 239 [2018-04-13 04:23:25,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:23:25,397 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-04-13 04:23:25,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-13 04:23:25,397 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-04-13 04:23:25,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-04-13 04:23:25,398 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:23:25,398 INFO L355 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:23:25,398 INFO L408 AbstractCegarLoop]: === Iteration 63 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:23:25,398 INFO L82 PathProgramCache]: Analyzing trace with hash -2105780944, now seen corresponding path program 45 times [2018-04-13 04:23:25,398 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:23:25,398 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:23:25,398 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:23:25,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:23:25,399 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:23:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:23:25,440 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:23:25,452 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:23:25,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:23:25,452 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:23:25,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:23:26,094 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-04-13 04:23:26,094 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:23:26,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:23:26,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:23:26,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:26,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:23:26,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:23:26,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:23:26,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:23:26,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:23:26,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:23:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:23:27,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:23:27,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-13 04:23:27,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-13 04:23:27,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-13 04:23:27,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=2970, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 04:23:27,394 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 56 states. [2018-04-13 04:23:31,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:23:31,406 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-04-13 04:23:31,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-13 04:23:31,407 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 244 [2018-04-13 04:23:31,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:23:31,407 INFO L225 Difference]: With dead ends: 252 [2018-04-13 04:23:31,407 INFO L226 Difference]: Without dead ends: 252 [2018-04-13 04:23:31,408 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1370 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=334, Invalid=11222, Unknown=0, NotChecked=0, Total=11556 [2018-04-13 04:23:31,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-13 04:23:31,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2018-04-13 04:23:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-13 04:23:31,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-04-13 04:23:31,410 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 244 [2018-04-13 04:23:31,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:23:31,410 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-04-13 04:23:31,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-13 04:23:31,410 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-04-13 04:23:31,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-04-13 04:23:31,412 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:23:31,412 INFO L355 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:23:31,412 INFO L408 AbstractCegarLoop]: === Iteration 64 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:23:31,412 INFO L82 PathProgramCache]: Analyzing trace with hash 141834431, now seen corresponding path program 46 times [2018-04-13 04:23:31,412 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:23:31,412 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:23:31,413 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:23:31,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:23:31,413 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:23:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:23:31,458 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:23:31,469 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:23:31,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:23:31,469 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:23:31,470 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:23:32,360 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:23:32,360 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:23:32,467 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:23:32,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:23:32,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:32,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:23:32,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:32,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:23:32,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:23:32,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:32,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:32,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:23:32,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:32,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:23:32,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:32,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:23:32,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:23:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:23:33,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:23:33,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-13 04:23:33,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-13 04:23:33,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-13 04:23:33,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=3080, Unknown=0, NotChecked=0, Total=3192 [2018-04-13 04:23:33,977 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 57 states. [2018-04-13 04:23:38,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:23:38,571 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-04-13 04:23:38,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-13 04:23:38,571 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 249 [2018-04-13 04:23:38,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:23:38,572 INFO L225 Difference]: With dead ends: 257 [2018-04-13 04:23:38,572 INFO L226 Difference]: Without dead ends: 257 [2018-04-13 04:23:38,573 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=340, Invalid=11650, Unknown=0, NotChecked=0, Total=11990 [2018-04-13 04:23:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-13 04:23:38,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-04-13 04:23:38,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-13 04:23:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-04-13 04:23:38,574 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 249 [2018-04-13 04:23:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:23:38,574 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-04-13 04:23:38,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-13 04:23:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-04-13 04:23:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-04-13 04:23:38,579 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:23:38,579 INFO L355 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:23:38,579 INFO L408 AbstractCegarLoop]: === Iteration 65 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:23:38,579 INFO L82 PathProgramCache]: Analyzing trace with hash -185125232, now seen corresponding path program 47 times [2018-04-13 04:23:38,580 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:23:38,580 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:23:38,580 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:23:38,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:23:38,580 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:23:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:23:38,625 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:23:38,635 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:23:38,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:23:38,635 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:23:38,635 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:23:39,686 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-04-13 04:23:39,686 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:23:39,757 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:23:39,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:23:39,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:39,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:23:39,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:39,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:23:39,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:23:39,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:39,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:39,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:23:39,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:39,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:23:39,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:39,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:23:39,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:23:39,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-04-13 04:23:39,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:39,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:23:39,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-04-13 04:23:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:23:41,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:23:41,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-13 04:23:41,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-13 04:23:41,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-13 04:23:41,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=3192, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 04:23:41,259 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 58 states. [2018-04-13 04:23:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:23:45,742 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-04-13 04:23:45,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-13 04:23:45,742 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 254 [2018-04-13 04:23:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:23:45,743 INFO L225 Difference]: With dead ends: 262 [2018-04-13 04:23:45,743 INFO L226 Difference]: Without dead ends: 262 [2018-04-13 04:23:45,744 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1523 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=346, Invalid=12086, Unknown=0, NotChecked=0, Total=12432 [2018-04-13 04:23:45,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-13 04:23:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-04-13 04:23:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-13 04:23:45,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-04-13 04:23:45,745 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 254 [2018-04-13 04:23:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:23:45,746 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-04-13 04:23:45,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-13 04:23:45,746 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-04-13 04:23:45,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-04-13 04:23:45,747 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:23:45,747 INFO L355 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:23:45,747 INFO L408 AbstractCegarLoop]: === Iteration 66 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:23:45,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1469107361, now seen corresponding path program 48 times [2018-04-13 04:23:45,747 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:23:45,747 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:23:45,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:23:45,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:23:45,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:23:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:23:45,790 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:23:45,798 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:23:45,798 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:23:45,799 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:23:45,799 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:23:47,300 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-04-13 04:23:47,300 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:23:47,401 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:23:47,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-13 04:23:47,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:47,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 6 treesize of output 5 [2018-04-13 04:23:47,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:47,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:23:47,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:23:47,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:47,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-13 04:23:47,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:47,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:47,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:47,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:23:47,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:47,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:23:47,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:23:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:23:49,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:23:49,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-13 04:23:49,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-13 04:23:49,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-13 04:23:49,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=3306, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 04:23:49,024 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 59 states. [2018-04-13 04:23:53,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:23:53,760 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-04-13 04:23:53,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-13 04:23:53,760 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 259 [2018-04-13 04:23:53,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:23:53,761 INFO L225 Difference]: With dead ends: 267 [2018-04-13 04:23:53,761 INFO L226 Difference]: Without dead ends: 267 [2018-04-13 04:23:53,761 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1532 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=352, Invalid=12530, Unknown=0, NotChecked=0, Total=12882 [2018-04-13 04:23:53,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-04-13 04:23:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-04-13 04:23:53,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-13 04:23:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-04-13 04:23:53,763 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 259 [2018-04-13 04:23:53,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:23:53,763 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-04-13 04:23:53,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-13 04:23:53,764 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-04-13 04:23:53,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-04-13 04:23:53,765 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:23:53,765 INFO L355 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:23:53,765 INFO L408 AbstractCegarLoop]: === Iteration 67 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:23:53,765 INFO L82 PathProgramCache]: Analyzing trace with hash -305143824, now seen corresponding path program 49 times [2018-04-13 04:23:53,765 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:23:53,765 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:23:53,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:23:53,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:23:53,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:23:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:23:53,821 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:23:53,832 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:23:53,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:23:53,832 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:23:53,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:23:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:23:54,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:23:54,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:23:54,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:54,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:23:54,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:54,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:23:54,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:23:54,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:54,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:23:54,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:54,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:54,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:23:54,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:23:54,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:23:54,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:23:54,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:23:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:23:55,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:23:55,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-13 04:23:55,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-13 04:23:55,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-13 04:23:55,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3539, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 04:23:55,973 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 61 states. [2018-04-13 04:24:00,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:24:00,959 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2018-04-13 04:24:00,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-13 04:24:00,959 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 264 [2018-04-13 04:24:00,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:24:00,960 INFO L225 Difference]: With dead ends: 272 [2018-04-13 04:24:00,960 INFO L226 Difference]: Without dead ends: 272 [2018-04-13 04:24:00,960 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1750 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=367, Invalid=13439, Unknown=0, NotChecked=0, Total=13806 [2018-04-13 04:24:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-04-13 04:24:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-04-13 04:24:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-04-13 04:24:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 270 transitions. [2018-04-13 04:24:00,962 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 270 transitions. Word has length 264 [2018-04-13 04:24:00,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:24:00,962 INFO L459 AbstractCegarLoop]: Abstraction has 270 states and 270 transitions. [2018-04-13 04:24:00,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-13 04:24:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 270 transitions. [2018-04-13 04:24:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-04-13 04:24:00,963 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:24:00,963 INFO L355 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:24:00,963 INFO L408 AbstractCegarLoop]: === Iteration 68 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:24:00,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2104059391, now seen corresponding path program 50 times [2018-04-13 04:24:00,964 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:24:00,964 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:24:00,964 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:24:00,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:24:00,964 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:24:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:24:01,027 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:24:01,038 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:24:01,038 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:24:01,038 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:24:01,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:24:01,874 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:24:01,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:24:01,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:24:01,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:24:01,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:01,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:24:01,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:01,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:24:01,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:24:02,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:24:02,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:24:02,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:02,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:24:02,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:24:02,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:24:02,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:02,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:24:02,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:24:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 6275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:24:03,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:24:03,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-13 04:24:03,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-13 04:24:03,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-13 04:24:03,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=3540, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 04:24:03,977 INFO L87 Difference]: Start difference. First operand 270 states and 270 transitions. Second operand 61 states. [2018-04-13 04:24:09,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:24:09,380 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-04-13 04:24:09,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-13 04:24:09,380 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 269 [2018-04-13 04:24:09,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:24:09,381 INFO L225 Difference]: With dead ends: 277 [2018-04-13 04:24:09,381 INFO L226 Difference]: Without dead ends: 277 [2018-04-13 04:24:09,382 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1646 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=364, Invalid=13442, Unknown=0, NotChecked=0, Total=13806 [2018-04-13 04:24:09,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-13 04:24:09,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2018-04-13 04:24:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-04-13 04:24:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-04-13 04:24:09,383 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 269 [2018-04-13 04:24:09,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:24:09,383 INFO L459 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-04-13 04:24:09,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-13 04:24:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-04-13 04:24:09,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-04-13 04:24:09,384 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:24:09,384 INFO L355 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:24:09,384 INFO L408 AbstractCegarLoop]: === Iteration 69 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:24:09,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2006167216, now seen corresponding path program 51 times [2018-04-13 04:24:09,384 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:24:09,385 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:24:09,385 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:24:09,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:24:09,385 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:24:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:24:09,441 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:24:09,450 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:24:09,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:24:09,450 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:24:09,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:24:10,303 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-04-13 04:24:10,303 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:24:10,343 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:24:10,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:24:10,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:10,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:24:10,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:24:10,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:24:10,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:24:10,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:24:10,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:24:11,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 6528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:24:11,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:24:11,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-04-13 04:24:11,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-13 04:24:11,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-13 04:24:11,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=3903, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 04:24:11,937 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 64 states. [2018-04-13 04:24:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:24:16,816 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2018-04-13 04:24:16,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-13 04:24:16,817 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 274 [2018-04-13 04:24:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:24:16,817 INFO L225 Difference]: With dead ends: 282 [2018-04-13 04:24:16,817 INFO L226 Difference]: Without dead ends: 282 [2018-04-13 04:24:16,818 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2040 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=391, Invalid=14861, Unknown=0, NotChecked=0, Total=15252 [2018-04-13 04:24:16,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-04-13 04:24:16,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2018-04-13 04:24:16,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-04-13 04:24:16,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2018-04-13 04:24:16,820 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 274 [2018-04-13 04:24:16,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:24:16,820 INFO L459 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2018-04-13 04:24:16,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-13 04:24:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2018-04-13 04:24:16,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-04-13 04:24:16,821 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:24:16,821 INFO L355 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:24:16,821 INFO L408 AbstractCegarLoop]: === Iteration 70 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:24:16,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1682124641, now seen corresponding path program 52 times [2018-04-13 04:24:16,821 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:24:16,821 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:24:16,821 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:24:16,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:24:16,821 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:24:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:24:16,872 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:24:16,887 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:24:16,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:24:16,887 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:24:16,888 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:24:17,311 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:24:17,311 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:24:17,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:24:17,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:24:17,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:17,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:24:17,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:17,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:24:17,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:24:17,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:24:17,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:24:17,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:24:17,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:17,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:24:17,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:17,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:24:17,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:24:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:24:19,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:24:19,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-04-13 04:24:19,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-13 04:24:19,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-13 04:24:19,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=3905, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 04:24:19,185 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 64 states. [2018-04-13 04:24:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:24:24,721 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-04-13 04:24:24,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-13 04:24:24,721 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 279 [2018-04-13 04:24:24,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:24:24,722 INFO L225 Difference]: With dead ends: 287 [2018-04-13 04:24:24,722 INFO L226 Difference]: Without dead ends: 287 [2018-04-13 04:24:24,722 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1936 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=385, Invalid=14867, Unknown=0, NotChecked=0, Total=15252 [2018-04-13 04:24:24,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-04-13 04:24:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2018-04-13 04:24:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-04-13 04:24:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-04-13 04:24:24,724 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 279 [2018-04-13 04:24:24,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:24:24,724 INFO L459 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-04-13 04:24:24,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-13 04:24:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-04-13 04:24:24,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-04-13 04:24:24,725 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:24:24,725 INFO L355 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:24:24,725 INFO L408 AbstractCegarLoop]: === Iteration 71 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:24:24,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1488095920, now seen corresponding path program 53 times [2018-04-13 04:24:24,725 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:24:24,725 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:24:24,725 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:24:24,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:24:24,725 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:24:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:24:24,778 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:24:24,795 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:24:24,795 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:24:24,795 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:24:24,796 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:24:25,961 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-04-13 04:24:25,961 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:24:26,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:24:26,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:24:26,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:26,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:24:26,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:26,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:24:26,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:24:26,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:24:26,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:24:26,055 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 17 treesize of output 24 [2018-04-13 04:24:26,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:26,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:24:26,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:26,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:24:26,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:24:26,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 04:24:26,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:26,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:24:26,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-13 04:24:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7049 backedges. 0 proven. 7049 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:24:27,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:24:27,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-04-13 04:24:27,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-13 04:24:27,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-13 04:24:27,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=3906, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 04:24:27,900 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 64 states. [2018-04-13 04:24:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:24:33,969 INFO L93 Difference]: Finished difference Result 292 states and 292 transitions. [2018-04-13 04:24:33,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-13 04:24:33,969 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 284 [2018-04-13 04:24:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:24:33,970 INFO L225 Difference]: With dead ends: 292 [2018-04-13 04:24:33,970 INFO L226 Difference]: Without dead ends: 292 [2018-04-13 04:24:33,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=377, Invalid=14629, Unknown=0, NotChecked=0, Total=15006 [2018-04-13 04:24:33,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-04-13 04:24:33,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2018-04-13 04:24:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-13 04:24:33,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-04-13 04:24:33,972 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 284 [2018-04-13 04:24:33,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:24:33,973 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-04-13 04:24:33,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-13 04:24:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-04-13 04:24:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-04-13 04:24:33,973 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:24:33,973 INFO L355 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:24:33,973 INFO L408 AbstractCegarLoop]: === Iteration 72 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:24:33,973 INFO L82 PathProgramCache]: Analyzing trace with hash -280792257, now seen corresponding path program 54 times [2018-04-13 04:24:33,974 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:24:33,974 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:24:33,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:24:33,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:24:33,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:24:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:24:34,028 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:24:34,036 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:24:34,036 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:24:34,036 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:24:34,037 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:24:35,977 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-04-13 04:24:35,978 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:24:36,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:24:36,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:24:36,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:36,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:24:36,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:36,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:24:36,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:24:36,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:24:36,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:24:36,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:36,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:24:36,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:24:36,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:24:36,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:36,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:24:36,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:24:38,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7317 backedges. 0 proven. 7317 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:24:38,007 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:24:38,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-04-13 04:24:38,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-13 04:24:38,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-13 04:24:38,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=4032, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 04:24:38,007 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 65 states. [2018-04-13 04:24:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:24:43,947 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-04-13 04:24:43,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-13 04:24:43,947 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 289 [2018-04-13 04:24:43,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:24:43,948 INFO L225 Difference]: With dead ends: 297 [2018-04-13 04:24:43,948 INFO L226 Difference]: Without dead ends: 297 [2018-04-13 04:24:43,948 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1883 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=388, Invalid=15362, Unknown=0, NotChecked=0, Total=15750 [2018-04-13 04:24:43,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-04-13 04:24:43,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2018-04-13 04:24:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-04-13 04:24:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-04-13 04:24:43,950 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 289 [2018-04-13 04:24:43,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:24:43,950 INFO L459 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-04-13 04:24:43,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-13 04:24:43,950 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-04-13 04:24:43,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-04-13 04:24:43,951 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:24:43,951 INFO L355 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:24:43,951 INFO L408 AbstractCegarLoop]: === Iteration 73 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:24:43,951 INFO L82 PathProgramCache]: Analyzing trace with hash -888632304, now seen corresponding path program 55 times [2018-04-13 04:24:43,951 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:24:43,951 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:24:43,951 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:24:43,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:24:43,951 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:24:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:24:44,008 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:24:44,019 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:24:44,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:24:44,019 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:24:44,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:24:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:24:44,500 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:24:44,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:24:44,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:44,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:24:44,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:44,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:24:44,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:24:44,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:24:44,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:24:44,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:44,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:24:44,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:24:44,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:24:44,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:44,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:24:44,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:24:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7590 backedges. 0 proven. 7590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:24:46,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:24:46,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-13 04:24:46,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-13 04:24:46,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-13 04:24:46,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4289, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 04:24:46,641 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 67 states. [2018-04-13 04:24:53,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:24:53,395 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2018-04-13 04:24:53,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-13 04:24:53,395 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 294 [2018-04-13 04:24:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:24:53,396 INFO L225 Difference]: With dead ends: 302 [2018-04-13 04:24:53,396 INFO L226 Difference]: Without dead ends: 302 [2018-04-13 04:24:53,397 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2125 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=403, Invalid=16367, Unknown=0, NotChecked=0, Total=16770 [2018-04-13 04:24:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-13 04:24:53,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2018-04-13 04:24:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-04-13 04:24:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 300 transitions. [2018-04-13 04:24:53,399 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 300 transitions. Word has length 294 [2018-04-13 04:24:53,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:24:53,399 INFO L459 AbstractCegarLoop]: Abstraction has 300 states and 300 transitions. [2018-04-13 04:24:53,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-13 04:24:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 300 transitions. [2018-04-13 04:24:53,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-04-13 04:24:53,400 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:24:53,400 INFO L355 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:24:53,400 INFO L408 AbstractCegarLoop]: === Iteration 74 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:24:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash -615035425, now seen corresponding path program 56 times [2018-04-13 04:24:53,400 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:24:53,400 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:24:53,400 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:24:53,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:24:53,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:24:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:24:53,468 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:24:53,486 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:24:53,486 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:24:53,486 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:24:53,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:24:54,640 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:24:54,640 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:24:54,696 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:24:54,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:24:54,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:54,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:24:54,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:54,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:24:54,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:24:54,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:24:54,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:24:54,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:54,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:24:54,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:24:54,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 04:24:54,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:54,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:24:54,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:24:55,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 04:24:55,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:24:55,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:24:55,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-13 04:24:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7868 backedges. 0 proven. 7868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:24:57,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:24:57,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-04-13 04:24:57,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-13 04:24:57,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-13 04:24:57,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=4554, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 04:24:57,481 INFO L87 Difference]: Start difference. First operand 300 states and 300 transitions. Second operand 69 states. [2018-04-13 04:25:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:06,106 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-04-13 04:25:06,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-13 04:25:06,106 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 299 [2018-04-13 04:25:06,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:06,107 INFO L225 Difference]: With dead ends: 307 [2018-04-13 04:25:06,107 INFO L226 Difference]: Without dead ends: 307 [2018-04-13 04:25:06,108 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2170 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=413, Invalid=17143, Unknown=0, NotChecked=0, Total=17556 [2018-04-13 04:25:06,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-13 04:25:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2018-04-13 04:25:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-04-13 04:25:06,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-04-13 04:25:06,110 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 299 [2018-04-13 04:25:06,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:06,110 INFO L459 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-04-13 04:25:06,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-13 04:25:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-04-13 04:25:06,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-04-13 04:25:06,111 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:06,111 INFO L355 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:06,111 INFO L408 AbstractCegarLoop]: === Iteration 75 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:06,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2074847888, now seen corresponding path program 57 times [2018-04-13 04:25:06,111 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:06,111 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:06,111 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:06,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:06,111 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:06,188 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:06,202 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:06,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:06,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:06,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:25:07,995 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-04-13 04:25:07,995 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:08,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:08,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:08,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:08,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:08,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:25:08,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:25:08,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:08,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:08,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:25:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8151 backedges. 0 proven. 8151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:10,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:10,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-04-13 04:25:10,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-13 04:25:10,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-13 04:25:10,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4555, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 04:25:10,101 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 69 states. [2018-04-13 04:25:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:16,495 INFO L93 Difference]: Finished difference Result 312 states and 312 transitions. [2018-04-13 04:25:16,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-13 04:25:16,496 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 304 [2018-04-13 04:25:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:16,496 INFO L225 Difference]: With dead ends: 312 [2018-04-13 04:25:16,496 INFO L226 Difference]: Without dead ends: 312 [2018-04-13 04:25:16,497 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2258 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=415, Invalid=17407, Unknown=0, NotChecked=0, Total=17822 [2018-04-13 04:25:16,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-04-13 04:25:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 310. [2018-04-13 04:25:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-04-13 04:25:16,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 310 transitions. [2018-04-13 04:25:16,499 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 310 transitions. Word has length 304 [2018-04-13 04:25:16,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:16,499 INFO L459 AbstractCegarLoop]: Abstraction has 310 states and 310 transitions. [2018-04-13 04:25:16,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-13 04:25:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 310 transitions. [2018-04-13 04:25:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-04-13 04:25:16,500 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:16,500 INFO L355 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:16,500 INFO L408 AbstractCegarLoop]: === Iteration 76 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:16,500 INFO L82 PathProgramCache]: Analyzing trace with hash -623746945, now seen corresponding path program 58 times [2018-04-13 04:25:16,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:16,500 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:16,500 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:16,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:16,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:16,570 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:16,589 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:16,589 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:16,589 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:16,589 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:25:17,193 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:25:17,194 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:17,244 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:17,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:17,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:17,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:17,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:17,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:17,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:25:17,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:17,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:17,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:17,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:17,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:25:17,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:17,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:17,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:25:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8439 backedges. 0 proven. 8439 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:19,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:19,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-04-13 04:25:19,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-13 04:25:19,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-13 04:25:19,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4691, Unknown=0, NotChecked=0, Total=4830 [2018-04-13 04:25:19,643 INFO L87 Difference]: Start difference. First operand 310 states and 310 transitions. Second operand 70 states. [2018-04-13 04:25:27,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:27,060 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-04-13 04:25:27,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-13 04:25:27,060 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 309 [2018-04-13 04:25:27,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:27,061 INFO L225 Difference]: With dead ends: 317 [2018-04-13 04:25:27,061 INFO L226 Difference]: Without dead ends: 317 [2018-04-13 04:25:27,062 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2327 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=421, Invalid=17939, Unknown=0, NotChecked=0, Total=18360 [2018-04-13 04:25:27,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-04-13 04:25:27,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2018-04-13 04:25:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-04-13 04:25:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-04-13 04:25:27,064 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 309 [2018-04-13 04:25:27,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:27,064 INFO L459 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-04-13 04:25:27,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-13 04:25:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-04-13 04:25:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-04-13 04:25:27,065 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:27,065 INFO L355 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:27,065 INFO L408 AbstractCegarLoop]: === Iteration 77 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:27,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1040455984, now seen corresponding path program 59 times [2018-04-13 04:25:27,065 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:27,065 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:27,066 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:27,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:27,066 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:27,153 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:27,165 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:27,165 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:27,165 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:27,166 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:25:28,503 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-04-13 04:25:28,503 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:28,563 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:28,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:28,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:28,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:25:28,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:28,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:28,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:28,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:25:28,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:25:28,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-04-13 04:25:28,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-04-13 04:25:31,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8732 backedges. 0 proven. 8732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:31,031 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:31,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-04-13 04:25:31,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-13 04:25:31,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-13 04:25:31,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 04:25:31,032 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 69 states. [2018-04-13 04:25:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:37,975 INFO L93 Difference]: Finished difference Result 322 states and 322 transitions. [2018-04-13 04:25:37,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-13 04:25:37,976 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 314 [2018-04-13 04:25:37,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:37,976 INFO L225 Difference]: With dead ends: 322 [2018-04-13 04:25:37,976 INFO L226 Difference]: Without dead ends: 322 [2018-04-13 04:25:37,977 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2073 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=409, Invalid=17413, Unknown=0, NotChecked=0, Total=17822 [2018-04-13 04:25:37,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-04-13 04:25:37,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2018-04-13 04:25:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-04-13 04:25:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2018-04-13 04:25:37,979 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 314 [2018-04-13 04:25:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:37,979 INFO L459 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2018-04-13 04:25:37,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-13 04:25:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2018-04-13 04:25:37,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-04-13 04:25:37,980 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:37,980 INFO L355 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:37,980 INFO L408 AbstractCegarLoop]: === Iteration 78 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:37,980 INFO L82 PathProgramCache]: Analyzing trace with hash 537832223, now seen corresponding path program 60 times [2018-04-13 04:25:37,980 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:37,980 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:37,980 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:37,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:37,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:38,052 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:38,060 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:38,061 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:38,061 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:38,061 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:25:40,659 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-04-13 04:25:40,659 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:40,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:40,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:40,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:40,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:40,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:40,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:40,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:25:40,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:40,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:25:40,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:40,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:40,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:40,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:40,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:40,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:40,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:25:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9030 backedges. 0 proven. 9030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:43,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:43,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-04-13 04:25:43,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-13 04:25:43,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-13 04:25:43,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=4830, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 04:25:43,172 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 71 states. [2018-04-13 04:25:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:51,051 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-04-13 04:25:51,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-13 04:25:51,051 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 319 [2018-04-13 04:25:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:51,052 INFO L225 Difference]: With dead ends: 327 [2018-04-13 04:25:51,052 INFO L226 Difference]: Without dead ends: 327 [2018-04-13 04:25:51,053 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2270 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=424, Invalid=18482, Unknown=0, NotChecked=0, Total=18906 [2018-04-13 04:25:51,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-13 04:25:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-04-13 04:25:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-04-13 04:25:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-04-13 04:25:51,055 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 319 [2018-04-13 04:25:51,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:51,055 INFO L459 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-04-13 04:25:51,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-13 04:25:51,055 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-04-13 04:25:51,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-04-13 04:25:51,056 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:51,056 INFO L355 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:51,056 INFO L408 AbstractCegarLoop]: === Iteration 79 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:51,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1176158160, now seen corresponding path program 61 times [2018-04-13 04:25:51,056 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:51,057 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:51,057 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:51,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:51,057 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:51,141 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:51,164 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:51,164 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:51,164 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:51,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:51,863 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:51,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:51,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:51,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:25:51,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:51,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:25:51,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:51,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:51,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:51,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:25:54,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9333 backedges. 0 proven. 9333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:54,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:54,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-04-13 04:25:54,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-13 04:25:54,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-13 04:25:54,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5111, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 04:25:54,465 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 73 states. [2018-04-13 04:26:02,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:02,561 INFO L93 Difference]: Finished difference Result 332 states and 332 transitions. [2018-04-13 04:26:02,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-13 04:26:02,561 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 324 [2018-04-13 04:26:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:02,562 INFO L225 Difference]: With dead ends: 332 [2018-04-13 04:26:02,562 INFO L226 Difference]: Without dead ends: 332 [2018-04-13 04:26:02,563 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2536 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=439, Invalid=19583, Unknown=0, NotChecked=0, Total=20022 [2018-04-13 04:26:02,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-04-13 04:26:02,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2018-04-13 04:26:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-04-13 04:26:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 330 transitions. [2018-04-13 04:26:02,565 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 330 transitions. Word has length 324 [2018-04-13 04:26:02,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:02,565 INFO L459 AbstractCegarLoop]: Abstraction has 330 states and 330 transitions. [2018-04-13 04:26:02,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-13 04:26:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 330 transitions. [2018-04-13 04:26:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-04-13 04:26:02,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:02,566 INFO L355 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:02,566 INFO L408 AbstractCegarLoop]: === Iteration 80 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:02,566 INFO L82 PathProgramCache]: Analyzing trace with hash 887500223, now seen corresponding path program 62 times [2018-04-13 04:26:02,566 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:02,566 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:02,566 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:02,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:02,566 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:02,661 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:26:02,682 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:26:02,682 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:26:02,682 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:26:02,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:26:05,053 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:26:05,053 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:26:05,091 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:26:05,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:26:05,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:05,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:26:05,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:05,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:05,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:26:05,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:05,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:26:05,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:05,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:05,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:05,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:26:05,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:05,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:05,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:26:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9641 backedges. 0 proven. 9641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:26:07,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:26:07,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-04-13 04:26:07,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-13 04:26:07,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-13 04:26:07,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5255, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 04:26:07,838 INFO L87 Difference]: Start difference. First operand 330 states and 330 transitions. Second operand 74 states. [2018-04-13 04:26:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:15,606 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-04-13 04:26:15,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-13 04:26:15,606 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 329 [2018-04-13 04:26:15,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:15,607 INFO L225 Difference]: With dead ends: 337 [2018-04-13 04:26:15,607 INFO L226 Difference]: Without dead ends: 337 [2018-04-13 04:26:15,608 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=445, Invalid=20147, Unknown=0, NotChecked=0, Total=20592 [2018-04-13 04:26:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-04-13 04:26:15,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2018-04-13 04:26:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-04-13 04:26:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-04-13 04:26:15,610 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 329 [2018-04-13 04:26:15,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:15,611 INFO L459 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-04-13 04:26:15,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-13 04:26:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-04-13 04:26:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-04-13 04:26:15,611 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:15,612 INFO L355 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:15,612 INFO L408 AbstractCegarLoop]: === Iteration 81 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:15,612 INFO L82 PathProgramCache]: Analyzing trace with hash -92905072, now seen corresponding path program 63 times [2018-04-13 04:26:15,612 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:15,612 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:15,612 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:15,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:26:15,612 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:15,696 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:26:15,711 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:26:15,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:26:15,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:26:15,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:26:18,113 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-04-13 04:26:18,113 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:26:18,208 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:26:18,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:26:18,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:18,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:26:18,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:18,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:18,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:26:18,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:18,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:18,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:26:18,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:18,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:26:18,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:18,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:18,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:26:20,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-04-13 04:26:20,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:20,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:20,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-04-13 04:26:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9954 backedges. 0 proven. 9954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:26:20,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:26:20,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-04-13 04:26:20,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-13 04:26:20,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-13 04:26:20,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5401, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 04:26:20,833 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 75 states. [2018-04-13 04:26:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:28,414 INFO L93 Difference]: Finished difference Result 342 states and 342 transitions. [2018-04-13 04:26:28,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-13 04:26:28,414 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 334 [2018-04-13 04:26:28,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:28,415 INFO L225 Difference]: With dead ends: 342 [2018-04-13 04:26:28,415 INFO L226 Difference]: Without dead ends: 342 [2018-04-13 04:26:28,416 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2681 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=451, Invalid=20719, Unknown=0, NotChecked=0, Total=21170 [2018-04-13 04:26:28,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-04-13 04:26:28,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2018-04-13 04:26:28,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-04-13 04:26:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 340 transitions. [2018-04-13 04:26:28,418 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 340 transitions. Word has length 334 [2018-04-13 04:26:28,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:28,418 INFO L459 AbstractCegarLoop]: Abstraction has 340 states and 340 transitions. [2018-04-13 04:26:28,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-13 04:26:28,419 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 340 transitions. [2018-04-13 04:26:28,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-04-13 04:26:28,419 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:28,419 INFO L355 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:28,419 INFO L408 AbstractCegarLoop]: === Iteration 82 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:28,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1699551137, now seen corresponding path program 64 times [2018-04-13 04:26:28,420 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:28,420 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:28,420 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:28,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:26:28,420 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:28,506 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:26:28,516 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:26:28,516 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:26:28,517 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:26:28,517 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:26:29,238 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:26:29,238 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:26:29,301 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:26:29,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:26:29,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:29,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:26:29,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:29,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:29,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:26:29,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:29,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:26:29,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:29,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:29,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:29,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:26:29,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:29,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:29,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:26:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10272 backedges. 0 proven. 10272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:26:32,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:26:32,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-04-13 04:26:32,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-13 04:26:32,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-13 04:26:32,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=5548, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 04:26:32,130 INFO L87 Difference]: Start difference. First operand 340 states and 340 transitions. Second operand 76 states. [2018-04-13 04:26:40,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:40,596 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-04-13 04:26:40,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-13 04:26:40,596 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 339 [2018-04-13 04:26:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:40,597 INFO L225 Difference]: With dead ends: 347 [2018-04-13 04:26:40,597 INFO L226 Difference]: Without dead ends: 347 [2018-04-13 04:26:40,597 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2815 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=460, Invalid=21296, Unknown=0, NotChecked=0, Total=21756 [2018-04-13 04:26:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-04-13 04:26:40,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2018-04-13 04:26:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-04-13 04:26:40,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2018-04-13 04:26:40,599 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 339 [2018-04-13 04:26:40,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:40,599 INFO L459 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2018-04-13 04:26:40,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-13 04:26:40,599 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2018-04-13 04:26:40,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-04-13 04:26:40,600 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:40,600 INFO L355 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:40,600 INFO L408 AbstractCegarLoop]: === Iteration 83 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:40,600 INFO L82 PathProgramCache]: Analyzing trace with hash -896185616, now seen corresponding path program 65 times [2018-04-13 04:26:40,600 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:40,601 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:40,601 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:40,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:26:40,601 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:40,681 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:26:40,701 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:26:40,701 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:26:40,701 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:26:40,702 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:26:42,526 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-04-13 04:26:42,527 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:26:42,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:26:42,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:26:42,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:42,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:26:42,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:42,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:42,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:26:42,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:42,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:26:42,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:42,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:42,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:42,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:26:42,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:42,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:42,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:26:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10595 backedges. 0 proven. 10595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:26:45,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:26:45,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-04-13 04:26:45,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-13 04:26:45,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-13 04:26:45,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 04:26:45,244 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 75 states. [2018-04-13 04:26:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:53,337 INFO L93 Difference]: Finished difference Result 352 states and 352 transitions. [2018-04-13 04:26:53,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-13 04:26:53,338 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 344 [2018-04-13 04:26:53,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:53,338 INFO L225 Difference]: With dead ends: 352 [2018-04-13 04:26:53,338 INFO L226 Difference]: Without dead ends: 352 [2018-04-13 04:26:53,339 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2478 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=445, Invalid=20725, Unknown=0, NotChecked=0, Total=21170 [2018-04-13 04:26:53,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-04-13 04:26:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 350. [2018-04-13 04:26:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-04-13 04:26:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 350 transitions. [2018-04-13 04:26:53,341 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 350 transitions. Word has length 344 [2018-04-13 04:26:53,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:53,341 INFO L459 AbstractCegarLoop]: Abstraction has 350 states and 350 transitions. [2018-04-13 04:26:53,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-13 04:26:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 350 transitions. [2018-04-13 04:26:53,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-04-13 04:26:53,342 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:53,342 INFO L355 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:53,342 INFO L408 AbstractCegarLoop]: === Iteration 84 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:53,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1783552767, now seen corresponding path program 66 times [2018-04-13 04:26:53,342 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:53,342 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:53,343 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:53,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:26:53,343 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:53,434 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:26:53,457 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:26:53,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:26:53,457 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:26:53,457 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:26:55,232 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-04-13 04:26:55,232 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:26:55,487 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:26:55,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:26:55,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:55,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:55,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:26:55,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:26:55,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:26:55,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:55,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:26:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 10923 backedges. 0 proven. 10923 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:26:57,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:26:57,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-04-13 04:26:57,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-13 04:26:57,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-13 04:26:57,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=5700, Unknown=0, NotChecked=0, Total=5852 [2018-04-13 04:26:57,841 INFO L87 Difference]: Start difference. First operand 350 states and 350 transitions. Second operand 77 states. [2018-04-13 04:27:05,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:27:05,627 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2018-04-13 04:27:05,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-13 04:27:05,627 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 349 [2018-04-13 04:27:05,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:27:05,628 INFO L225 Difference]: With dead ends: 357 [2018-04-13 04:27:05,628 INFO L226 Difference]: Without dead ends: 357 [2018-04-13 04:27:05,628 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2693 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=460, Invalid=21890, Unknown=0, NotChecked=0, Total=22350 [2018-04-13 04:27:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-04-13 04:27:05,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2018-04-13 04:27:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-04-13 04:27:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2018-04-13 04:27:05,630 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 349 [2018-04-13 04:27:05,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:27:05,630 INFO L459 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2018-04-13 04:27:05,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-13 04:27:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2018-04-13 04:27:05,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-04-13 04:27:05,631 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:27:05,631 INFO L355 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:27:05,631 INFO L408 AbstractCegarLoop]: === Iteration 85 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:27:05,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1985479600, now seen corresponding path program 67 times [2018-04-13 04:27:05,631 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:27:05,631 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:27:05,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:27:05,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:27:05,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:27:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:27:05,719 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:27:05,736 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:27:05,737 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:27:05,737 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:27:05,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:27:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:27:06,571 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:27:06,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:27:06,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:06,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:27:06,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:06,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:27:06,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:27:06,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:27:06,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:27:06,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:06,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:27:06,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:27:06,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:27:06,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:06,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:27:06,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:27:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 11256 backedges. 0 proven. 11256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:27:09,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:27:09,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-04-13 04:27:09,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-13 04:27:09,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-13 04:27:09,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6005, Unknown=0, NotChecked=0, Total=6162 [2018-04-13 04:27:09,467 INFO L87 Difference]: Start difference. First operand 355 states and 355 transitions. Second operand 79 states. [2018-04-13 04:27:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:27:18,081 INFO L93 Difference]: Finished difference Result 362 states and 362 transitions. [2018-04-13 04:27:18,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-13 04:27:18,082 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 354 [2018-04-13 04:27:18,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:27:18,082 INFO L225 Difference]: With dead ends: 362 [2018-04-13 04:27:18,083 INFO L226 Difference]: Without dead ends: 362 [2018-04-13 04:27:18,084 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2983 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=475, Invalid=23087, Unknown=0, NotChecked=0, Total=23562 [2018-04-13 04:27:18,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-04-13 04:27:18,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2018-04-13 04:27:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-04-13 04:27:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 360 transitions. [2018-04-13 04:27:18,086 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 360 transitions. Word has length 354 [2018-04-13 04:27:18,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:27:18,086 INFO L459 AbstractCegarLoop]: Abstraction has 360 states and 360 transitions. [2018-04-13 04:27:18,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-13 04:27:18,086 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 360 transitions. [2018-04-13 04:27:18,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-04-13 04:27:18,087 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:27:18,087 INFO L355 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:27:18,087 INFO L408 AbstractCegarLoop]: === Iteration 86 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:27:18,087 INFO L82 PathProgramCache]: Analyzing trace with hash -200014433, now seen corresponding path program 68 times [2018-04-13 04:27:18,087 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:27:18,087 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:27:18,087 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:27:18,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:27:18,088 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:27:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:27:18,194 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:27:18,225 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:27:18,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:27:18,225 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:27:18,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:27:21,547 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:27:21,547 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:27:21,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:27:21,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:27:21,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:21,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:27:21,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:21,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:27:21,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:27:21,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:27:21,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:27:21,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:21,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:27:21,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:27:21,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:27:21,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:21,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:27:21,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:27:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 11594 backedges. 0 proven. 11594 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:27:24,888 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:27:24,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-04-13 04:27:24,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-13 04:27:24,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-13 04:27:24,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6161, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 04:27:24,889 INFO L87 Difference]: Start difference. First operand 360 states and 360 transitions. Second operand 80 states. [2018-04-13 04:27:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:27:33,765 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2018-04-13 04:27:33,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-13 04:27:33,765 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 359 [2018-04-13 04:27:33,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:27:33,766 INFO L225 Difference]: With dead ends: 367 [2018-04-13 04:27:33,766 INFO L226 Difference]: Without dead ends: 367 [2018-04-13 04:27:33,767 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3064 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=481, Invalid=23699, Unknown=0, NotChecked=0, Total=24180 [2018-04-13 04:27:33,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-04-13 04:27:33,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2018-04-13 04:27:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-04-13 04:27:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2018-04-13 04:27:33,770 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 359 [2018-04-13 04:27:33,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:27:33,770 INFO L459 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2018-04-13 04:27:33,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-13 04:27:33,770 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2018-04-13 04:27:33,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-04-13 04:27:33,771 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:27:33,771 INFO L355 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:27:33,771 INFO L408 AbstractCegarLoop]: === Iteration 87 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:27:33,771 INFO L82 PathProgramCache]: Analyzing trace with hash 261387696, now seen corresponding path program 69 times [2018-04-13 04:27:33,771 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:27:33,771 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:27:33,772 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:27:33,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:27:33,772 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:27:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:27:33,927 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:27:33,949 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:27:33,949 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:27:33,949 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:27:33,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:27:36,871 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-04-13 04:27:36,871 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:27:36,980 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:27:36,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:27:36,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:36,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:27:36,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:36,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:27:36,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:27:37,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:27:37,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:27:37,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:27:37,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:37,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:27:37,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:37,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:27:37,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:27:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 11937 backedges. 0 proven. 11937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:27:39,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:27:39,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-04-13 04:27:39,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-13 04:27:39,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-13 04:27:39,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=6162, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 04:27:39,923 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 80 states. [2018-04-13 04:27:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:27:48,783 INFO L93 Difference]: Finished difference Result 372 states and 372 transitions. [2018-04-13 04:27:48,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-13 04:27:48,783 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 364 [2018-04-13 04:27:48,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:27:48,784 INFO L225 Difference]: With dead ends: 372 [2018-04-13 04:27:48,784 INFO L226 Difference]: Without dead ends: 372 [2018-04-13 04:27:48,785 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2918 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=478, Invalid=23702, Unknown=0, NotChecked=0, Total=24180 [2018-04-13 04:27:48,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-04-13 04:27:48,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 370. [2018-04-13 04:27:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-04-13 04:27:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 370 transitions. [2018-04-13 04:27:48,787 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 370 transitions. Word has length 364 [2018-04-13 04:27:48,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:27:48,787 INFO L459 AbstractCegarLoop]: Abstraction has 370 states and 370 transitions. [2018-04-13 04:27:48,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-13 04:27:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 370 transitions. [2018-04-13 04:27:48,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-04-13 04:27:48,788 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:27:48,788 INFO L355 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:27:48,788 INFO L408 AbstractCegarLoop]: === Iteration 88 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:27:48,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1608280127, now seen corresponding path program 70 times [2018-04-13 04:27:48,788 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:27:48,788 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:27:48,789 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:27:48,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:27:48,789 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:27:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:27:48,893 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:27:48,912 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:27:48,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:27:48,912 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:27:48,913 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:27:49,863 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:27:49,863 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:27:49,931 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:27:49,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:27:49,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:49,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:27:49,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:49,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:27:49,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:27:49,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:27:49,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:27:49,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:49,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:27:49,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:27:49,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:27:49,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:49,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:27:49,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:27:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 12285 backedges. 0 proven. 12285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:27:53,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:27:53,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-04-13 04:27:53,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-13 04:27:53,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-13 04:27:53,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6479, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 04:27:53,026 INFO L87 Difference]: Start difference. First operand 370 states and 370 transitions. Second operand 82 states. [2018-04-13 04:28:02,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:28:02,575 INFO L93 Difference]: Finished difference Result 377 states and 377 transitions. [2018-04-13 04:28:02,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-13 04:28:02,575 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 369 [2018-04-13 04:28:02,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:28:02,576 INFO L225 Difference]: With dead ends: 377 [2018-04-13 04:28:02,576 INFO L226 Difference]: Without dead ends: 377 [2018-04-13 04:28:02,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3221 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=493, Invalid=24947, Unknown=0, NotChecked=0, Total=25440 [2018-04-13 04:28:02,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-04-13 04:28:02,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2018-04-13 04:28:02,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-04-13 04:28:02,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 375 transitions. [2018-04-13 04:28:02,579 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 375 transitions. Word has length 369 [2018-04-13 04:28:02,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:28:02,579 INFO L459 AbstractCegarLoop]: Abstraction has 375 states and 375 transitions. [2018-04-13 04:28:02,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-04-13 04:28:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 375 transitions. [2018-04-13 04:28:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-04-13 04:28:02,580 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:28:02,580 INFO L355 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:28:02,580 INFO L408 AbstractCegarLoop]: === Iteration 89 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:28:02,581 INFO L82 PathProgramCache]: Analyzing trace with hash 213956368, now seen corresponding path program 71 times [2018-04-13 04:28:02,581 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:28:02,581 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:28:02,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:02,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:28:02,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:28:02,694 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:28:02,714 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:28:02,714 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:28:02,715 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:28:02,715 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:28:06,761 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-04-13 04:28:06,762 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:28:06,833 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:28:06,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:28:06,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:06,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:06,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:28:06,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:28:06,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:28:06,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:06,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:28:07,076 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 5 treesize of output 1 [2018-04-13 04:28:07,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:07,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:07,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:17 [2018-04-13 04:28:09,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12638 backedges. 0 proven. 12638 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:28:09,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:28:09,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-04-13 04:28:09,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-13 04:28:09,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-13 04:28:09,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=6480, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 04:28:09,851 INFO L87 Difference]: Start difference. First operand 375 states and 375 transitions. Second operand 82 states. [2018-04-13 04:28:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:28:19,363 INFO L93 Difference]: Finished difference Result 382 states and 382 transitions. [2018-04-13 04:28:19,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-13 04:28:19,363 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 374 [2018-04-13 04:28:19,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:28:19,364 INFO L225 Difference]: With dead ends: 382 [2018-04-13 04:28:19,364 INFO L226 Difference]: Without dead ends: 382 [2018-04-13 04:28:19,365 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3143 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=490, Invalid=24950, Unknown=0, NotChecked=0, Total=25440 [2018-04-13 04:28:19,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-04-13 04:28:19,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2018-04-13 04:28:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-04-13 04:28:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 380 transitions. [2018-04-13 04:28:19,367 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 380 transitions. Word has length 374 [2018-04-13 04:28:19,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:28:19,367 INFO L459 AbstractCegarLoop]: Abstraction has 380 states and 380 transitions. [2018-04-13 04:28:19,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-04-13 04:28:19,367 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 380 transitions. [2018-04-13 04:28:19,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-04-13 04:28:19,368 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:28:19,368 INFO L355 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:28:19,368 INFO L408 AbstractCegarLoop]: === Iteration 90 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:28:19,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1291977439, now seen corresponding path program 72 times [2018-04-13 04:28:19,368 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:28:19,368 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:28:19,369 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:19,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:28:19,369 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:28:19,477 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:28:19,499 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:28:19,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:28:19,499 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:28:19,499 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:28:22,527 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-04-13 04:28:22,527 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:28:22,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:28:22,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:28:22,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:22,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:28:22,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:22,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:22,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:28:22,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:22,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:28:22,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:22,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:22,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:22,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:28:22,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:22,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:22,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:28:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:28:25,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:28:25,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-04-13 04:28:25,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-13 04:28:25,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-13 04:28:25,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=6642, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 04:28:25,871 INFO L87 Difference]: Start difference. First operand 380 states and 380 transitions. Second operand 83 states. [2018-04-13 04:28:35,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:28:35,965 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2018-04-13 04:28:35,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-13 04:28:35,965 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 379 [2018-04-13 04:28:35,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:28:35,966 INFO L225 Difference]: With dead ends: 387 [2018-04-13 04:28:35,966 INFO L226 Difference]: Without dead ends: 387 [2018-04-13 04:28:35,967 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3152 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=496, Invalid=25586, Unknown=0, NotChecked=0, Total=26082 [2018-04-13 04:28:35,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-04-13 04:28:35,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2018-04-13 04:28:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-13 04:28:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2018-04-13 04:28:35,968 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 379 [2018-04-13 04:28:35,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:28:35,969 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2018-04-13 04:28:35,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-13 04:28:35,969 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2018-04-13 04:28:35,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-04-13 04:28:35,969 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:28:35,970 INFO L355 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:28:35,970 INFO L408 AbstractCegarLoop]: === Iteration 91 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:28:35,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1779613808, now seen corresponding path program 73 times [2018-04-13 04:28:35,970 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:28:35,970 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:28:35,970 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:35,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:28:35,970 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:28:36,082 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:28:36,106 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:28:36,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:28:36,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:28:36,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:28:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:28:37,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:28:37,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:28:37,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:37,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:28:37,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:37,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:37,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:28:37,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:37,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:37,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:28:37,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:37,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:28:37,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:37,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:37,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:28:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 13359 backedges. 0 proven. 13359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:28:40,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:28:40,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-04-13 04:28:40,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-13 04:28:40,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-13 04:28:40,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=6971, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 04:28:40,548 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 85 states. [2018-04-13 04:28:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:28:50,548 INFO L93 Difference]: Finished difference Result 392 states and 392 transitions. [2018-04-13 04:28:50,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-04-13 04:28:50,548 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 384 [2018-04-13 04:28:50,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:28:50,549 INFO L225 Difference]: With dead ends: 392 [2018-04-13 04:28:50,549 INFO L226 Difference]: Without dead ends: 392 [2018-04-13 04:28:50,550 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3466 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=511, Invalid=26879, Unknown=0, NotChecked=0, Total=27390 [2018-04-13 04:28:50,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-04-13 04:28:50,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2018-04-13 04:28:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-04-13 04:28:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 390 transitions. [2018-04-13 04:28:50,552 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 390 transitions. Word has length 384 [2018-04-13 04:28:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:28:50,552 INFO L459 AbstractCegarLoop]: Abstraction has 390 states and 390 transitions. [2018-04-13 04:28:50,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-13 04:28:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 390 transitions. [2018-04-13 04:28:50,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-04-13 04:28:50,553 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:28:50,553 INFO L355 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:28:50,553 INFO L408 AbstractCegarLoop]: === Iteration 92 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:28:50,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1918817663, now seen corresponding path program 74 times [2018-04-13 04:28:50,553 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:28:50,553 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:28:50,554 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:50,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:28:50,554 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:28:50,677 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:28:50,698 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:28:50,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:28:50,698 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:28:50,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:28:55,167 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:28:55,168 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:28:55,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:28:55,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:28:55,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:55,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:28:55,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:55,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:55,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:28:55,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:55,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:28:55,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:55,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:55,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:55,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:28:55,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:55,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:55,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:28:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 13727 backedges. 0 proven. 13727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:28:59,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:28:59,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-04-13 04:28:59,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-13 04:28:59,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-13 04:28:59,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=7308, Unknown=0, NotChecked=0, Total=7482 [2018-04-13 04:28:59,088 INFO L87 Difference]: Start difference. First operand 390 states and 390 transitions. Second operand 87 states. [2018-04-13 04:29:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:29:10,060 INFO L93 Difference]: Finished difference Result 397 states and 397 transitions. [2018-04-13 04:29:10,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-04-13 04:29:10,060 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 389 [2018-04-13 04:29:10,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:29:10,061 INFO L225 Difference]: With dead ends: 397 [2018-04-13 04:29:10,061 INFO L226 Difference]: Without dead ends: 397 [2018-04-13 04:29:10,062 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3719 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=526, Invalid=28204, Unknown=0, NotChecked=0, Total=28730 [2018-04-13 04:29:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-04-13 04:29:10,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 395. [2018-04-13 04:29:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-04-13 04:29:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-04-13 04:29:10,064 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 389 [2018-04-13 04:29:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:29:10,064 INFO L459 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-04-13 04:29:10,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-04-13 04:29:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-04-13 04:29:10,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-04-13 04:29:10,065 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:29:10,065 INFO L355 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:29:10,065 INFO L408 AbstractCegarLoop]: === Iteration 93 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:29:10,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1460629040, now seen corresponding path program 75 times [2018-04-13 04:29:10,065 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:29:10,065 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:29:10,066 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:29:10,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:29:10,066 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:29:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:29:10,183 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:29:10,201 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:29:10,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:29:10,201 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:29:10,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:29:15,075 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-04-13 04:29:15,075 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:29:15,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:29:15,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-13 04:29:15,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:15,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:15,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:29:15,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:29:15,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:29:15,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:15,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:29:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 14100 backedges. 0 proven. 14100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:29:18,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:29:18,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-04-13 04:29:18,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-13 04:29:18,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-13 04:29:18,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=7140, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 04:29:18,262 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 86 states. [2018-04-13 04:29:27,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:29:27,636 INFO L93 Difference]: Finished difference Result 402 states and 402 transitions. [2018-04-13 04:29:27,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-13 04:29:27,637 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 394 [2018-04-13 04:29:27,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:29:27,637 INFO L225 Difference]: With dead ends: 402 [2018-04-13 04:29:27,637 INFO L226 Difference]: Without dead ends: 402 [2018-04-13 04:29:27,638 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3395 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=514, Invalid=27542, Unknown=0, NotChecked=0, Total=28056 [2018-04-13 04:29:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-04-13 04:29:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2018-04-13 04:29:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-04-13 04:29:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 400 transitions. [2018-04-13 04:29:27,640 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 400 transitions. Word has length 394 [2018-04-13 04:29:27,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:29:27,640 INFO L459 AbstractCegarLoop]: Abstraction has 400 states and 400 transitions. [2018-04-13 04:29:27,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-13 04:29:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 400 transitions. [2018-04-13 04:29:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-04-13 04:29:27,641 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:29:27,641 INFO L355 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:29:27,641 INFO L408 AbstractCegarLoop]: === Iteration 94 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:29:27,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1045225503, now seen corresponding path program 76 times [2018-04-13 04:29:27,642 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:29:27,642 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:29:27,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:29:27,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:29:27,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:29:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:29:27,766 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:29:27,787 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:29:27,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:29:27,788 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:29:27,788 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:29:28,889 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:29:28,889 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:29:29,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:29:29,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:29:29,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:29,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:29:29,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:29,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:29,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:29:29,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:29,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:29:29,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:29,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:29,047 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:29,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:29:29,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:29,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:29,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:29:32,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14478 backedges. 0 proven. 14478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:29:32,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:29:32,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-04-13 04:29:32,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-04-13 04:29:32,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-04-13 04:29:32,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7481, Unknown=0, NotChecked=0, Total=7656 [2018-04-13 04:29:32,583 INFO L87 Difference]: Start difference. First operand 400 states and 400 transitions. Second operand 88 states. [2018-04-13 04:29:43,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:29:43,627 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2018-04-13 04:29:43,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-04-13 04:29:43,627 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 399 [2018-04-13 04:29:43,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:29:43,628 INFO L225 Difference]: With dead ends: 407 [2018-04-13 04:29:43,628 INFO L226 Difference]: Without dead ends: 407 [2018-04-13 04:29:43,629 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3724 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=529, Invalid=28883, Unknown=0, NotChecked=0, Total=29412 [2018-04-13 04:29:43,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-04-13 04:29:43,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2018-04-13 04:29:43,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-04-13 04:29:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2018-04-13 04:29:43,631 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 399 [2018-04-13 04:29:43,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:29:43,631 INFO L459 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2018-04-13 04:29:43,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-04-13 04:29:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2018-04-13 04:29:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-04-13 04:29:43,632 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:29:43,632 INFO L355 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:29:43,632 INFO L408 AbstractCegarLoop]: === Iteration 95 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:29:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1128278832, now seen corresponding path program 77 times [2018-04-13 04:29:43,632 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:29:43,633 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:29:43,633 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:29:43,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:29:43,633 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:29:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:29:43,761 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:29:43,789 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:29:43,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:29:43,789 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:29:43,789 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:29:48,388 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-04-13 04:29:48,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:29:48,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:29:48,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:29:48,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:48,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:29:48,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:48,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:48,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:29:48,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:48,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:48,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:29:48,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:48,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:29:48,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:48,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:48,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:29:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 14861 backedges. 0 proven. 14861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:29:52,042 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:29:52,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-04-13 04:29:52,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-04-13 04:29:52,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-04-13 04:29:52,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=7482, Unknown=0, NotChecked=0, Total=7656 [2018-04-13 04:29:52,043 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 88 states. [2018-04-13 04:30:03,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:30:03,346 INFO L93 Difference]: Finished difference Result 412 states and 412 transitions. [2018-04-13 04:30:03,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-04-13 04:30:03,347 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 404 [2018-04-13 04:30:03,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:30:03,348 INFO L225 Difference]: With dead ends: 412 [2018-04-13 04:30:03,348 INFO L226 Difference]: Without dead ends: 412 [2018-04-13 04:30:03,350 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3638 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=526, Invalid=28886, Unknown=0, NotChecked=0, Total=29412 [2018-04-13 04:30:03,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-04-13 04:30:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2018-04-13 04:30:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-13 04:30:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 410 transitions. [2018-04-13 04:30:03,352 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 410 transitions. Word has length 404 [2018-04-13 04:30:03,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:30:03,352 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 410 transitions. [2018-04-13 04:30:03,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-04-13 04:30:03,352 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 410 transitions. [2018-04-13 04:30:03,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-04-13 04:30:03,353 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:30:03,353 INFO L355 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:30:03,353 INFO L408 AbstractCegarLoop]: === Iteration 96 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:30:03,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1990599359, now seen corresponding path program 78 times [2018-04-13 04:30:03,353 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:30:03,354 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:30:03,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:30:03,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:30:03,354 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:30:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:30:03,492 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:30:03,512 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:30:03,512 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:30:03,512 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:30:03,513 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:30:06,812 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2018-04-13 04:30:06,812 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:30:06,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:30:06,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:30:06,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:30:06,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:30:06,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:30:06,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:30:06,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:30:06,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:30:06,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:30:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 15249 backedges. 0 proven. 15249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:30:10,149 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:30:10,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-04-13 04:30:10,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-04-13 04:30:10,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-04-13 04:30:10,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=7656, Unknown=0, NotChecked=0, Total=7832 [2018-04-13 04:30:10,150 INFO L87 Difference]: Start difference. First operand 410 states and 410 transitions. Second operand 89 states. [2018-04-13 04:30:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:30:20,842 INFO L93 Difference]: Finished difference Result 417 states and 417 transitions. [2018-04-13 04:30:20,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-04-13 04:30:20,842 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 409 [2018-04-13 04:30:20,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:30:20,843 INFO L225 Difference]: With dead ends: 417 [2018-04-13 04:30:20,843 INFO L226 Difference]: Without dead ends: 417 [2018-04-13 04:30:20,845 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3647 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=532, Invalid=29570, Unknown=0, NotChecked=0, Total=30102 [2018-04-13 04:30:20,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-04-13 04:30:20,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 415. [2018-04-13 04:30:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-04-13 04:30:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 415 transitions. [2018-04-13 04:30:20,847 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 415 transitions. Word has length 409 [2018-04-13 04:30:20,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:30:20,847 INFO L459 AbstractCegarLoop]: Abstraction has 415 states and 415 transitions. [2018-04-13 04:30:20,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-04-13 04:30:20,847 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 415 transitions. [2018-04-13 04:30:20,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-04-13 04:30:20,848 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:30:20,848 INFO L355 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:30:20,848 INFO L408 AbstractCegarLoop]: === Iteration 97 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:30:20,848 INFO L82 PathProgramCache]: Analyzing trace with hash 191335568, now seen corresponding path program 79 times [2018-04-13 04:30:20,848 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:30:20,848 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:30:20,849 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:30:20,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:30:20,849 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:30:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:30:21,006 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:30:21,028 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:30:21,028 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:30:21,029 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:30:21,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:30:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:30:22,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:30:22,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:30:22,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:30:22,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:30:22,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:30:22,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:30:22,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:30:22,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:30:22,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:30:22,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:30:22,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:30:22,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:30:22,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:30:22,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:30:22,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:30:22,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:30:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15642 backedges. 0 proven. 15642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:30:26,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:30:26,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-04-13 04:30:26,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-13 04:30:26,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-13 04:30:26,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8009, Unknown=0, NotChecked=0, Total=8190 [2018-04-13 04:30:26,316 INFO L87 Difference]: Start difference. First operand 415 states and 415 transitions. Second operand 91 states. [2018-04-13 04:30:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:30:38,048 INFO L93 Difference]: Finished difference Result 422 states and 422 transitions. [2018-04-13 04:30:38,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-13 04:30:38,048 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 414 [2018-04-13 04:30:38,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:30:38,049 INFO L225 Difference]: With dead ends: 422 [2018-04-13 04:30:38,049 INFO L226 Difference]: Without dead ends: 422 [2018-04-13 04:30:38,050 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3985 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=547, Invalid=30959, Unknown=0, NotChecked=0, Total=31506 [2018-04-13 04:30:38,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-04-13 04:30:38,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 420. [2018-04-13 04:30:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-04-13 04:30:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 420 transitions. [2018-04-13 04:30:38,052 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 420 transitions. Word has length 414 [2018-04-13 04:30:38,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:30:38,053 INFO L459 AbstractCegarLoop]: Abstraction has 420 states and 420 transitions. [2018-04-13 04:30:38,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-13 04:30:38,053 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 420 transitions. [2018-04-13 04:30:38,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-04-13 04:30:38,054 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:30:38,054 INFO L355 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:30:38,054 INFO L408 AbstractCegarLoop]: === Iteration 98 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:30:38,054 INFO L82 PathProgramCache]: Analyzing trace with hash -658203297, now seen corresponding path program 80 times [2018-04-13 04:30:38,054 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:30:38,054 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:30:38,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:30:38,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:30:38,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:30:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:30:38,205 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:30:38,222 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:30:38,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:30:38,223 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:30:38,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:30:41,297 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:30:41,297 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:30:41,516 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:30:41,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:30:41,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:30:41,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:30:41,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:30:41,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:30:41,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:30:41,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:30:41,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:30:41,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:30:41,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:30:41,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:30:41,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:30:41,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:30:41,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:30:45,499 INFO L134 CoverageAnalysis]: Checked inductivity of 16040 backedges. 0 proven. 16040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:30:45,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:30:45,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-04-13 04:30:45,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-13 04:30:45,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-13 04:30:45,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8189, Unknown=0, NotChecked=0, Total=8372 [2018-04-13 04:30:45,501 INFO L87 Difference]: Start difference. First operand 420 states and 420 transitions. Second operand 92 states. [2018-04-13 04:30:57,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:30:57,587 INFO L93 Difference]: Finished difference Result 427 states and 427 transitions. [2018-04-13 04:30:57,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-13 04:30:57,588 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 419 [2018-04-13 04:30:57,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:30:57,588 INFO L225 Difference]: With dead ends: 427 [2018-04-13 04:30:57,588 INFO L226 Difference]: Without dead ends: 427 [2018-04-13 04:30:57,590 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4090 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=553, Invalid=31667, Unknown=0, NotChecked=0, Total=32220 [2018-04-13 04:30:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-04-13 04:30:57,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2018-04-13 04:30:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-04-13 04:30:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 425 transitions. [2018-04-13 04:30:57,592 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 425 transitions. Word has length 419 [2018-04-13 04:30:57,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:30:57,592 INFO L459 AbstractCegarLoop]: Abstraction has 425 states and 425 transitions. [2018-04-13 04:30:57,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-13 04:30:57,592 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 425 transitions. [2018-04-13 04:30:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-04-13 04:30:57,593 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:30:57,594 INFO L355 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:30:57,594 INFO L408 AbstractCegarLoop]: === Iteration 99 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:30:57,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1941129744, now seen corresponding path program 81 times [2018-04-13 04:30:57,594 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:30:57,594 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:30:57,594 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:30:57,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:30:57,594 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:30:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:30:57,741 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:30:57,761 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:30:57,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:30:57,761 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:30:57,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:31:01,549 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-04-13 04:31:01,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:31:01,845 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:31:01,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:31:01,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:01,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-13 04:31:01,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:31:01,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:31:01,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:31:01,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:31:01,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:31:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 16443 backedges. 0 proven. 16443 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:31:05,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:31:05,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-04-13 04:31:05,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-13 04:31:05,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-13 04:31:05,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8371, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 04:31:05,891 INFO L87 Difference]: Start difference. First operand 425 states and 425 transitions. Second operand 93 states. [2018-04-13 04:31:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:31:17,469 INFO L93 Difference]: Finished difference Result 432 states and 432 transitions. [2018-04-13 04:31:17,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-13 04:31:17,470 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 424 [2018-04-13 04:31:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:31:17,471 INFO L225 Difference]: With dead ends: 432 [2018-04-13 04:31:17,471 INFO L226 Difference]: Without dead ends: 432 [2018-04-13 04:31:17,472 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4166 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=559, Invalid=32383, Unknown=0, NotChecked=0, Total=32942 [2018-04-13 04:31:17,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-04-13 04:31:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 430. [2018-04-13 04:31:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-04-13 04:31:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 430 transitions. [2018-04-13 04:31:17,474 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 430 transitions. Word has length 424 [2018-04-13 04:31:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:31:17,474 INFO L459 AbstractCegarLoop]: Abstraction has 430 states and 430 transitions. [2018-04-13 04:31:17,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-13 04:31:17,474 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 430 transitions. [2018-04-13 04:31:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-04-13 04:31:17,475 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:31:17,475 INFO L355 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:31:17,475 INFO L408 AbstractCegarLoop]: === Iteration 100 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:31:17,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1182642177, now seen corresponding path program 82 times [2018-04-13 04:31:17,476 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:31:17,476 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:31:17,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:31:17,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:31:17,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:31:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:31:17,644 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:31:17,674 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:31:17,674 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:31:17,674 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:31:17,675 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:31:19,158 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:31:19,159 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:31:19,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:31:19,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:31:19,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:19,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:31:19,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:19,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:31:19,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:31:19,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:19,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:31:19,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:19,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:19,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:19,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:31:19,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:19,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:31:19,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:31:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 16851 backedges. 0 proven. 16851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:31:24,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:31:24,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-04-13 04:31:24,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-04-13 04:31:24,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-04-13 04:31:24,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8555, Unknown=0, NotChecked=0, Total=8742 [2018-04-13 04:31:24,224 INFO L87 Difference]: Start difference. First operand 430 states and 430 transitions. Second operand 94 states. [2018-04-13 04:31:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:31:36,496 INFO L93 Difference]: Finished difference Result 437 states and 437 transitions. [2018-04-13 04:31:36,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-13 04:31:36,496 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 429 [2018-04-13 04:31:36,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:31:36,497 INFO L225 Difference]: With dead ends: 437 [2018-04-13 04:31:36,497 INFO L226 Difference]: Without dead ends: 437 [2018-04-13 04:31:36,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4259 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=565, Invalid=33107, Unknown=0, NotChecked=0, Total=33672 [2018-04-13 04:31:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-04-13 04:31:36,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 435. [2018-04-13 04:31:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-13 04:31:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 435 transitions. [2018-04-13 04:31:36,501 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 435 transitions. Word has length 429 [2018-04-13 04:31:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:31:36,501 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 435 transitions. [2018-04-13 04:31:36,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-04-13 04:31:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 435 transitions. [2018-04-13 04:31:36,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-04-13 04:31:36,503 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:31:36,503 INFO L355 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:31:36,503 INFO L408 AbstractCegarLoop]: === Iteration 101 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:31:36,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1767221072, now seen corresponding path program 83 times [2018-04-13 04:31:36,503 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:31:36,503 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:31:36,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:31:36,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:31:36,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:31:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:31:36,671 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:31:36,704 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:31:36,704 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:31:36,704 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:31:36,704 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:31:42,516 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2018-04-13 04:31:42,516 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:31:42,610 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:31:42,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:31:42,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:42,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:31:42,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:31:42,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:31:42,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:31:42,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:31:42,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:31:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 17264 backedges. 0 proven. 17264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:31:46,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:31:46,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-04-13 04:31:46,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-04-13 04:31:46,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-04-13 04:31:46,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=8556, Unknown=0, NotChecked=0, Total=8742 [2018-04-13 04:31:46,112 INFO L87 Difference]: Start difference. First operand 435 states and 435 transitions. Second operand 94 states. [2018-04-13 04:31:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:31:57,074 INFO L93 Difference]: Finished difference Result 442 states and 442 transitions. [2018-04-13 04:31:57,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-13 04:31:57,074 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 434 [2018-04-13 04:31:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:31:57,075 INFO L225 Difference]: With dead ends: 442 [2018-04-13 04:31:57,075 INFO L226 Difference]: Without dead ends: 442 [2018-04-13 04:31:57,076 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4169 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=562, Invalid=33110, Unknown=0, NotChecked=0, Total=33672 [2018-04-13 04:31:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-04-13 04:31:57,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2018-04-13 04:31:57,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-04-13 04:31:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 440 transitions. [2018-04-13 04:31:57,078 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 440 transitions. Word has length 434 [2018-04-13 04:31:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:31:57,078 INFO L459 AbstractCegarLoop]: Abstraction has 440 states and 440 transitions. [2018-04-13 04:31:57,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-04-13 04:31:57,078 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 440 transitions. [2018-04-13 04:31:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-04-13 04:31:57,079 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:31:57,079 INFO L355 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:31:57,079 INFO L408 AbstractCegarLoop]: === Iteration 102 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:31:57,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1522976097, now seen corresponding path program 84 times [2018-04-13 04:31:57,080 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:31:57,080 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:31:57,080 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:31:57,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:31:57,080 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:31:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:31:57,240 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:31:57,258 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:31:57,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:31:57,258 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:31:57,259 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:32:02,203 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2018-04-13 04:32:02,203 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:32:02,348 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:32:02,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:32:02,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:32:02,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:32:02,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:32:02,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:32:02,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:32:02,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:32:02,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:32:02,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:32:02,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:32:02,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:32:02,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:32:02,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:32:02,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:32:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 17682 backedges. 0 proven. 17682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:32:06,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:32:06,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-04-13 04:32:06,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-04-13 04:32:06,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-04-13 04:32:06,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=8742, Unknown=0, NotChecked=0, Total=8930 [2018-04-13 04:32:06,609 INFO L87 Difference]: Start difference. First operand 440 states and 440 transitions. Second operand 95 states. [2018-04-13 04:32:20,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:32:20,005 INFO L93 Difference]: Finished difference Result 447 states and 447 transitions. [2018-04-13 04:32:20,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-13 04:32:20,005 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 439 [2018-04-13 04:32:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:32:20,007 INFO L225 Difference]: With dead ends: 447 [2018-04-13 04:32:20,007 INFO L226 Difference]: Without dead ends: 447 [2018-04-13 04:32:20,009 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4178 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=568, Invalid=33842, Unknown=0, NotChecked=0, Total=34410 [2018-04-13 04:32:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-04-13 04:32:20,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2018-04-13 04:32:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-04-13 04:32:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 445 transitions. [2018-04-13 04:32:20,012 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 445 transitions. Word has length 439 [2018-04-13 04:32:20,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:32:20,012 INFO L459 AbstractCegarLoop]: Abstraction has 445 states and 445 transitions. [2018-04-13 04:32:20,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-04-13 04:32:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 445 transitions. [2018-04-13 04:32:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-04-13 04:32:20,013 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:32:20,013 INFO L355 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:32:20,013 INFO L408 AbstractCegarLoop]: === Iteration 103 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:32:20,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1100455760, now seen corresponding path program 85 times [2018-04-13 04:32:20,014 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:32:20,014 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:32:20,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:32:20,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:32:20,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:32:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:32:20,200 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:32:20,271 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:32:20,271 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:32:20,271 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:32:20,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:32:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:32:22,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:32:22,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:32:22,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:32:22,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:32:22,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:32:22,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:32:22,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:32:22,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:32:22,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:32:22,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:32:22,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:32:22,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:32:22,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:32:22,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:32:22,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:32:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 18105 backedges. 0 proven. 18105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:32:26,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:32:26,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-04-13 04:32:26,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-13 04:32:26,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-13 04:32:26,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9119, Unknown=0, NotChecked=0, Total=9312 [2018-04-13 04:32:26,274 INFO L87 Difference]: Start difference. First operand 445 states and 445 transitions. Second operand 97 states. [2018-04-13 04:32:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:32:39,491 INFO L93 Difference]: Finished difference Result 452 states and 452 transitions. [2018-04-13 04:32:39,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-13 04:32:39,491 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 444 [2018-04-13 04:32:39,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:32:39,492 INFO L225 Difference]: With dead ends: 452 [2018-04-13 04:32:39,492 INFO L226 Difference]: Without dead ends: 452 [2018-04-13 04:32:39,493 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4540 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=583, Invalid=35327, Unknown=0, NotChecked=0, Total=35910 [2018-04-13 04:32:39,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-04-13 04:32:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 450. [2018-04-13 04:32:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-04-13 04:32:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 450 transitions. [2018-04-13 04:32:39,495 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 450 transitions. Word has length 444 [2018-04-13 04:32:39,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:32:39,495 INFO L459 AbstractCegarLoop]: Abstraction has 450 states and 450 transitions. [2018-04-13 04:32:39,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-13 04:32:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 450 transitions. [2018-04-13 04:32:39,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-04-13 04:32:39,497 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:32:39,497 INFO L355 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:32:39,497 INFO L408 AbstractCegarLoop]: === Iteration 104 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:32:39,497 INFO L82 PathProgramCache]: Analyzing trace with hash -3973825, now seen corresponding path program 86 times [2018-04-13 04:32:39,497 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:32:39,497 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:32:39,497 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:32:39,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:32:39,497 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:32:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:32:39,708 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:32:39,737 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:32:39,737 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:32:39,737 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:32:39,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:32:45,681 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:32:45,681 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:32:45,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:32:45,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:32:45,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:32:45,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:32:45,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:32:45,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-13 04:32:45,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:32:45,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:32:45,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:32:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18533 backedges. 0 proven. 18533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:32:49,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:32:49,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-04-13 04:32:49,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-04-13 04:32:49,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-04-13 04:32:49,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9311, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 04:32:49,751 INFO L87 Difference]: Start difference. First operand 450 states and 450 transitions. Second operand 98 states. [2018-04-13 04:33:02,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:33:02,488 INFO L93 Difference]: Finished difference Result 457 states and 457 transitions. [2018-04-13 04:33:02,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-04-13 04:33:02,489 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 449 [2018-04-13 04:33:02,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:33:02,489 INFO L225 Difference]: With dead ends: 457 [2018-04-13 04:33:02,489 INFO L226 Difference]: Without dead ends: 457 [2018-04-13 04:33:02,490 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4637 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=589, Invalid=36083, Unknown=0, NotChecked=0, Total=36672 [2018-04-13 04:33:02,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-04-13 04:33:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 455. [2018-04-13 04:33:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-04-13 04:33:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 455 transitions. [2018-04-13 04:33:02,493 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 455 transitions. Word has length 449 [2018-04-13 04:33:02,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:33:02,493 INFO L459 AbstractCegarLoop]: Abstraction has 455 states and 455 transitions. [2018-04-13 04:33:02,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-04-13 04:33:02,493 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 455 transitions. [2018-04-13 04:33:02,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-04-13 04:33:02,495 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:33:02,496 INFO L355 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:33:02,496 INFO L408 AbstractCegarLoop]: === Iteration 105 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:33:02,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2146099728, now seen corresponding path program 87 times [2018-04-13 04:33:02,496 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:33:02,496 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:33:02,496 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:33:02,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:33:02,496 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:33:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:33:02,666 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:33:02,689 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:33:02,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:33:02,689 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:33:02,689 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:33:06,335 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-04-13 04:33:06,335 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:33:06,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:33:06,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:33:06,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:33:06,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:33:06,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:33:06,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:33:06,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:33:06,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:33:06,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:33:06,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:33:06,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:33:06,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:33:06,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:33:06,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:33:06,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:33:06,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:33:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 18966 backedges. 0 proven. 18966 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:33:10,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:33:10,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-04-13 04:33:10,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-13 04:33:10,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-13 04:33:10,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9505, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 04:33:10,983 INFO L87 Difference]: Start difference. First operand 455 states and 455 transitions. Second operand 99 states. [2018-04-13 04:33:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:33:24,651 INFO L93 Difference]: Finished difference Result 462 states and 462 transitions. [2018-04-13 04:33:24,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-13 04:33:24,651 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 454 [2018-04-13 04:33:24,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:33:24,652 INFO L225 Difference]: With dead ends: 462 [2018-04-13 04:33:24,652 INFO L226 Difference]: Without dead ends: 462 [2018-04-13 04:33:24,653 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4733 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=595, Invalid=36847, Unknown=0, NotChecked=0, Total=37442 [2018-04-13 04:33:24,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-04-13 04:33:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2018-04-13 04:33:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-04-13 04:33:24,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 460 transitions. [2018-04-13 04:33:24,655 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 460 transitions. Word has length 454 [2018-04-13 04:33:24,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:33:24,655 INFO L459 AbstractCegarLoop]: Abstraction has 460 states and 460 transitions. [2018-04-13 04:33:24,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-13 04:33:24,655 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 460 transitions. [2018-04-13 04:33:24,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-04-13 04:33:24,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:33:24,656 INFO L355 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:33:24,657 INFO L408 AbstractCegarLoop]: === Iteration 106 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:33:24,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1535461409, now seen corresponding path program 88 times [2018-04-13 04:33:24,657 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:33:24,657 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:33:24,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:33:24,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:33:24,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:33:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:33:24,856 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:33:24,893 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:33:24,893 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:33:24,893 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:33:24,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:33:26,633 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:33:26,633 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:33:26,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:33:26,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:33:26,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:33:26,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:33:26,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:33:26,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:33:26,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:33:26,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:33:26,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:33:26,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:33:26,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:33:26,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:33:26,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:33:26,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:33:26,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:33:26,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:33:31,349 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 19404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:33:31,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:33:31,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-04-13 04:33:31,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-04-13 04:33:31,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-04-13 04:33:31,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9701, Unknown=0, NotChecked=0, Total=9900 [2018-04-13 04:33:31,351 INFO L87 Difference]: Start difference. First operand 460 states and 460 transitions. Second operand 100 states. [2018-04-13 04:33:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:33:45,599 INFO L93 Difference]: Finished difference Result 467 states and 467 transitions. [2018-04-13 04:33:45,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-04-13 04:33:45,599 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 459 [2018-04-13 04:33:45,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:33:45,599 INFO L225 Difference]: With dead ends: 467 [2018-04-13 04:33:45,600 INFO L226 Difference]: Without dead ends: 467 [2018-04-13 04:33:45,601 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=601, Invalid=37619, Unknown=0, NotChecked=0, Total=38220 [2018-04-13 04:33:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-04-13 04:33:45,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 465. [2018-04-13 04:33:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-04-13 04:33:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 465 transitions. [2018-04-13 04:33:45,603 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 465 transitions. Word has length 459 [2018-04-13 04:33:45,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:33:45,603 INFO L459 AbstractCegarLoop]: Abstraction has 465 states and 465 transitions. [2018-04-13 04:33:45,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-04-13 04:33:45,603 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 465 transitions. [2018-04-13 04:33:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-04-13 04:33:45,604 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:33:45,604 INFO L355 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:33:45,604 INFO L408 AbstractCegarLoop]: === Iteration 107 === [__U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcpy_alloca_true_valid_memsafety_true_termination_i__cstrcpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:33:45,604 INFO L82 PathProgramCache]: Analyzing trace with hash -624743568, now seen corresponding path program 89 times [2018-04-13 04:33:45,604 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:33:45,605 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:33:45,605 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:33:45,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:33:45,605 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:33:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:33:45,777 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:33:45,888 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:33:45,888 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:33:45,888 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:33:45,888 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:33:49,575 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2018-04-13 04:33:49,575 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:33:49,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:33:49,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:33:49,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:33:49,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:33:49,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:33:49,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:33:49,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:33:49,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:33:49,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:33:49,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:33:49,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:33:49,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:33:49,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 04:33:49,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:33:49,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:33:49,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:33:50,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:33:50,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:33:50,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:33:50,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-04-13 04:33:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 19847 backedges. 0 proven. 19847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:33:54,527 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:33:54,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-04-13 04:33:54,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-04-13 04:33:54,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-04-13 04:33:54,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=9702, Unknown=0, NotChecked=0, Total=9900 [2018-04-13 04:33:54,528 INFO L87 Difference]: Start difference. First operand 465 states and 465 transitions. Second operand 100 states. Received shutdown request... [2018-04-13 04:33:58,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 04:33:58,538 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-13 04:33:58,542 WARN L197 ceAbstractionStarter]: Timeout [2018-04-13 04:33:58,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 04:33:58 BoogieIcfgContainer [2018-04-13 04:33:58,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 04:33:58,542 INFO L168 Benchmark]: Toolchain (without parser) took 766973.97 ms. Allocated memory was 396.4 MB in the beginning and 2.6 GB in the end (delta: 2.2 GB). Free memory was 332.2 MB in the beginning and 2.2 GB in the end (delta: -1.9 GB). Peak memory consumption was 391.7 MB. Max. memory is 5.3 GB. [2018-04-13 04:33:58,543 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 396.4 MB. Free memory is still 356.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 04:33:58,543 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.09 ms. Allocated memory is still 396.4 MB. Free memory was 330.8 MB in the beginning and 307.0 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-13 04:33:58,543 INFO L168 Benchmark]: Boogie Preprocessor took 32.69 ms. Allocated memory is still 396.4 MB. Free memory was 307.0 MB in the beginning and 305.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-13 04:33:58,544 INFO L168 Benchmark]: RCFGBuilder took 337.76 ms. Allocated memory was 396.4 MB in the beginning and 599.3 MB in the end (delta: 202.9 MB). Free memory was 305.7 MB in the beginning and 535.6 MB in the end (delta: -229.8 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-13 04:33:58,544 INFO L168 Benchmark]: TraceAbstraction took 766378.10 ms. Allocated memory was 599.3 MB in the beginning and 2.6 GB in the end (delta: 2.0 GB). Free memory was 535.6 MB in the beginning and 2.2 GB in the end (delta: -1.7 GB). Peak memory consumption was 392.2 MB. Max. memory is 5.3 GB. [2018-04-13 04:33:58,545 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.18 ms. Allocated memory is still 396.4 MB. Free memory is still 356.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 223.09 ms. Allocated memory is still 396.4 MB. Free memory was 330.8 MB in the beginning and 307.0 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.69 ms. Allocated memory is still 396.4 MB. Free memory was 307.0 MB in the beginning and 305.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 337.76 ms. Allocated memory was 396.4 MB in the beginning and 599.3 MB in the end (delta: 202.9 MB). Free memory was 305.7 MB in the beginning and 535.6 MB in the end (delta: -229.8 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 766378.10 ms. Allocated memory was 599.3 MB in the beginning and 2.6 GB in the end (delta: 2.0 GB). Free memory was 535.6 MB in the beginning and 2.2 GB in the end (delta: -1.7 GB). Peak memory consumption was 392.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (465states) and interpolant automaton (currently 29 states, 100 states before enhancement), while ReachableStatesComputation was computing reachable states (118 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (465states) and interpolant automaton (currently 29 states, 100 states before enhancement), while ReachableStatesComputation was computing reachable states (118 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (465states) and interpolant automaton (currently 29 states, 100 states before enhancement), while ReachableStatesComputation was computing reachable states (118 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (465states) and interpolant automaton (currently 29 states, 100 states before enhancement), while ReachableStatesComputation was computing reachable states (118 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (465states) and interpolant automaton (currently 29 states, 100 states before enhancement), while ReachableStatesComputation was computing reachable states (118 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (465states) and interpolant automaton (currently 29 states, 100 states before enhancement), while ReachableStatesComputation was computing reachable states (118 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (465states) and interpolant automaton (currently 29 states, 100 states before enhancement), while ReachableStatesComputation was computing reachable states (118 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 46 locations, 7 error locations. TIMEOUT Result, 766.3s OverallTime, 107 OverallIterations, 90 TraceHistogramMax, 474.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9424 SDtfs, 19311 SDslu, 567757 SDs, 0 SdLazy, 837775 SolverSat, 4526 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 257.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26619 GetRequests, 16904 SyntacticMatches, 6 SemanticMatches, 9709 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 156482 ImplicationChecksByTransitivity, 323.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=465occurred in iteration=106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 106 MinimizatonAttempts, 417 StatesRemovedByMinimization, 101 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 116.5s SatisfiabilityAnalysisTime, 173.4s InterpolantComputationTime, 44054 NumberOfCodeBlocks, 44038 NumberOfCodeBlocksAsserted, 2235 NumberOfCheckSat, 22007 ConstructedInterpolants, 121 QuantifiedInterpolants, 115884792 SizeOfPredicates, 1087 NumberOfNonLiveVariables, 93606 ConjunctsInSsa, 28596 ConjunctsInUnsatCore, 108 InterpolantComputations, 14 PerfectInterpolantSequences, 15/599491 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_cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_04-33-58-550.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_04-33-58-550.csv Completed graceful shutdown