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_cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 04:26:06,235 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 04:26:06,237 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 04:26:06,249 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 04:26:06,250 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 04:26:06,250 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 04:26:06,251 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 04:26:06,253 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 04:26:06,254 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 04:26:06,255 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 04:26:06,256 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 04:26:06,256 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 04:26:06,257 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 04:26:06,258 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 04:26:06,258 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 04:26:06,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 04:26:06,262 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 04:26:06,263 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 04:26:06,264 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 04:26:06,265 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 04:26:06,267 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 04:26:06,267 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 04:26:06,267 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 04:26:06,268 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 04:26:06,269 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 04:26:06,269 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 04:26:06,270 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 04:26:06,270 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 04:26:06,270 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 04:26:06,271 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 04:26:06,271 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 04:26:06,271 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:26:06,280 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 04:26:06,281 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 04:26:06,282 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 04:26:06,282 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 04:26:06,282 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 04:26:06,282 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 04:26:06,282 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 04:26:06,283 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 04:26:06,283 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 04:26:06,283 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 04:26:06,283 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 04:26:06,283 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 04:26:06,283 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 04:26:06,284 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 04:26:06,284 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 04:26:06,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 04:26:06,284 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 04:26:06,284 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 04:26:06,284 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 04:26:06,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 04:26:06,284 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 04:26:06,285 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 04:26:06,285 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 04:26:06,285 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:26:06,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 04:26:06,325 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 04:26:06,328 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 04:26:06,329 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 04:26:06,330 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 04:26:06,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,615 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG810c9e981 [2018-04-13 04:26:06,757 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 04:26:06,757 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 04:26:06,758 INFO L168 CDTParser]: Scanning openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,767 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 04:26:06,767 INFO L215 ultiparseSymbolTable]: [2018-04-13 04:26:06,767 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 04:26:06,767 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,767 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,767 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,768 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncat ('cstrncat') in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,768 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 04:26:06,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,768 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,769 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,770 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,771 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,772 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,773 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,774 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,775 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,776 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,777 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,778 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:06,790 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG810c9e981 [2018-04-13 04:26:06,794 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 04:26:06,795 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 04:26:06,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 04:26:06,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 04:26:06,799 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 04:26:06,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:26:06" (1/1) ... [2018-04-13 04:26:06,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7519cf8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:26:06, skipping insertion in model container [2018-04-13 04:26:06,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:26:06" (1/1) ... [2018-04-13 04:26:06,812 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 04:26:06,833 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 04:26:06,960 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 04:26:07,000 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 04:26:07,006 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-13 04:26:07,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:26:07 WrapperNode [2018-04-13 04:26:07,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 04:26:07,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 04:26:07,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 04:26:07,036 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 04:26:07,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:26:07" (1/1) ... [2018-04-13 04:26:07,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:26:07" (1/1) ... [2018-04-13 04:26:07,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:26:07" (1/1) ... [2018-04-13 04:26:07,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:26:07" (1/1) ... [2018-04-13 04:26:07,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:26:07" (1/1) ... [2018-04-13 04:26:07,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:26:07" (1/1) ... [2018-04-13 04:26:07,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:26:07" (1/1) ... [2018-04-13 04:26:07,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 04:26:07,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 04:26:07,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 04:26:07,076 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 04:26:07,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:26:07" (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:26:07,174 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 04:26:07,174 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 04:26:07,175 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 04:26:07,175 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 04:26:07,175 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncat [2018-04-13 04:26:07,175 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 04:26:07,175 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 04:26:07,175 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 04:26:07,175 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 04:26:07,175 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 04:26:07,175 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 04:26:07,175 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 04:26:07,176 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 04:26:07,176 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 04:26:07,176 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 04:26:07,176 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 04:26:07,176 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 04:26:07,176 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 04:26:07,176 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 04:26:07,176 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 04:26:07,176 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 04:26:07,176 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 04:26:07,177 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 04:26:07,177 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 04:26:07,177 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 04:26:07,177 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 04:26:07,177 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 04:26:07,177 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 04:26:07,177 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 04:26:07,177 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 04:26:07,177 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 04:26:07,177 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 04:26:07,177 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 04:26:07,178 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 04:26:07,178 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 04:26:07,178 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 04:26:07,178 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 04:26:07,178 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 04:26:07,178 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 04:26:07,178 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 04:26:07,178 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 04:26:07,178 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 04:26:07,178 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 04:26:07,179 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 04:26:07,179 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 04:26:07,179 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 04:26:07,179 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 04:26:07,179 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 04:26:07,179 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 04:26:07,179 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 04:26:07,179 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 04:26:07,180 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 04:26:07,180 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 04:26:07,180 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 04:26:07,180 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 04:26:07,180 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 04:26:07,180 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 04:26:07,180 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 04:26:07,180 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 04:26:07,180 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 04:26:07,180 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 04:26:07,180 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 04:26:07,180 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 04:26:07,180 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 04:26:07,181 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 04:26:07,181 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 04:26:07,181 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 04:26:07,181 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 04:26:07,181 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 04:26:07,181 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 04:26:07,181 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 04:26:07,181 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 04:26:07,181 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 04:26:07,181 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 04:26:07,181 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 04:26:07,182 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 04:26:07,182 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 04:26:07,182 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 04:26:07,182 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 04:26:07,182 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 04:26:07,182 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 04:26:07,182 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 04:26:07,182 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 04:26:07,182 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 04:26:07,182 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 04:26:07,182 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 04:26:07,182 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 04:26:07,182 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 04:26:07,182 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 04:26:07,182 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 04:26:07,182 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 04:26:07,182 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 04:26:07,183 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 04:26:07,183 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 04:26:07,183 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 04:26:07,183 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 04:26:07,183 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 04:26:07,183 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 04:26:07,183 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 04:26:07,183 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 04:26:07,183 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 04:26:07,183 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 04:26:07,183 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 04:26:07,184 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 04:26:07,184 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 04:26:07,184 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 04:26:07,184 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 04:26:07,184 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 04:26:07,184 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 04:26:07,184 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncat [2018-04-13 04:26:07,184 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 04:26:07,184 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 04:26:07,184 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 04:26:07,185 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 04:26:07,185 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 04:26:07,185 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 04:26:07,185 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 04:26:07,185 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 04:26:07,471 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 04:26:07,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:26:07 BoogieIcfgContainer [2018-04-13 04:26:07,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 04:26:07,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 04:26:07,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 04:26:07,475 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 04:26:07,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 04:26:06" (1/3) ... [2018-04-13 04:26:07,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be9f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:26:07, skipping insertion in model container [2018-04-13 04:26:07,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:26:07" (2/3) ... [2018-04-13 04:26:07,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be9f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:26:07, skipping insertion in model container [2018-04-13 04:26:07,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:26:07" (3/3) ... [2018-04-13 04:26:07,477 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:26:07,482 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 04:26:07,487 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-04-13 04:26:07,510 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 04:26:07,510 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 04:26:07,510 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 04:26:07,511 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 04:26:07,511 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 04:26:07,511 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 04:26:07,511 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 04:26:07,511 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 04:26:07,511 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 04:26:07,511 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 04:26:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-04-13 04:26:07,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-13 04:26:07,527 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:07,527 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:07,527 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:07,530 INFO L82 PathProgramCache]: Analyzing trace with hash 320774661, now seen corresponding path program 1 times [2018-04-13 04:26:07,531 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:07,531 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:07,558 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:07,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:07,559 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:07,593 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:26:07,624 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:26:07,626 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:26:07,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 04:26:07,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 04:26:07,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 04:26:07,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 04:26:07,637 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2018-04-13 04:26:07,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:07,697 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-04-13 04:26:07,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 04:26:07,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-13 04:26:07,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:07,705 INFO L225 Difference]: With dead ends: 55 [2018-04-13 04:26:07,705 INFO L226 Difference]: Without dead ends: 51 [2018-04-13 04:26:07,707 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:26:07,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-13 04:26:07,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-13 04:26:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-13 04:26:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-04-13 04:26:07,733 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 11 [2018-04-13 04:26:07,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:07,733 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-04-13 04:26:07,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 04:26:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-04-13 04:26:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-13 04:26:07,734 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:07,734 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:07,734 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:07,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1076881686, now seen corresponding path program 1 times [2018-04-13 04:26:07,734 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:07,734 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:07,735 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:07,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:07,735 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:07,744 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:07,769 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:26:07,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:26:07,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:26:07,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:26:07,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:26:07,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:26:07,771 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-04-13 04:26:07,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:07,816 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-04-13 04:26:07,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 04:26:07,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-13 04:26:07,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:07,817 INFO L225 Difference]: With dead ends: 54 [2018-04-13 04:26:07,817 INFO L226 Difference]: Without dead ends: 51 [2018-04-13 04:26:07,818 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 04:26:07,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-13 04:26:07,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-13 04:26:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-13 04:26:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-13 04:26:07,822 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 15 [2018-04-13 04:26:07,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:07,822 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-13 04:26:07,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:26:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-13 04:26:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-13 04:26:07,823 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:07,823 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:07,823 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:07,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1756940056, now seen corresponding path program 1 times [2018-04-13 04:26:07,824 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:07,824 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:07,824 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:07,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:07,825 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:07,840 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:26:07,848 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:26:07,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:26:07,848 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:26:07,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:07,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:26:07,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:07,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:07,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:07,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:26:07,916 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:26:07,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:07,923 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:26:07,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-13 04:26:07,934 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:26:07,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:26:07,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 04:26:07,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 04:26:07,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 04:26:07,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 04:26:07,935 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-04-13 04:26:07,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:07,985 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-04-13 04:26:07,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 04:26:07,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-13 04:26:07,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:07,986 INFO L225 Difference]: With dead ends: 50 [2018-04-13 04:26:07,986 INFO L226 Difference]: Without dead ends: 50 [2018-04-13 04:26:07,986 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 1 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:26:07,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-13 04:26:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-13 04:26:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-13 04:26:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-13 04:26:07,990 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 15 [2018-04-13 04:26:07,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:07,990 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-13 04:26:07,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 04:26:07,990 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-13 04:26:07,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-13 04:26:07,991 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:07,991 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:07,991 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:07,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1756940057, now seen corresponding path program 1 times [2018-04-13 04:26:07,991 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:07,991 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:07,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:07,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:07,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:08,003 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:26:08,007 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:26:08,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:26:08,007 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:26:08,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:08,029 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:26:08,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:26:08,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:08,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:08,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:08,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:08,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-13 04:26:08,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:08,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:08,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-13 04:26:08,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:08,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:08,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:08,146 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:08,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:08,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:26:08,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:24 [2018-04-13 04:26:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:26:08,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:26:08,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:26:08,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:26:08,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:26:08,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:26:08,174 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 8 states. [2018-04-13 04:26:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:08,308 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-04-13 04:26:08,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 04:26:08,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-04-13 04:26:08,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:08,309 INFO L225 Difference]: With dead ends: 49 [2018-04-13 04:26:08,309 INFO L226 Difference]: Without dead ends: 49 [2018-04-13 04:26:08,309 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-04-13 04:26:08,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-13 04:26:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-13 04:26:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-13 04:26:08,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-04-13 04:26:08,311 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 15 [2018-04-13 04:26:08,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:08,311 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-04-13 04:26:08,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:26:08,312 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-04-13 04:26:08,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 04:26:08,312 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:08,312 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:08,312 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:08,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1369433054, now seen corresponding path program 1 times [2018-04-13 04:26:08,312 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:08,312 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:08,313 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:08,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:08,313 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:08,321 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:08,338 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:26:08,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:26:08,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 04:26:08,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 04:26:08,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 04:26:08,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 04:26:08,339 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 4 states. [2018-04-13 04:26:08,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:08,372 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-04-13 04:26:08,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 04:26:08,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-13 04:26:08,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:08,374 INFO L225 Difference]: With dead ends: 48 [2018-04-13 04:26:08,374 INFO L226 Difference]: Without dead ends: 48 [2018-04-13 04:26:08,374 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:26:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-13 04:26:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-13 04:26:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-13 04:26:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-04-13 04:26:08,377 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 16 [2018-04-13 04:26:08,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:08,377 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-04-13 04:26:08,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 04:26:08,377 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-04-13 04:26:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 04:26:08,378 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:08,378 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:08,378 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:08,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1369433053, now seen corresponding path program 1 times [2018-04-13 04:26:08,378 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:08,378 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:08,379 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:08,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:08,379 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:08,387 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:08,421 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:26:08,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:26:08,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:26:08,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:26:08,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:26:08,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:26:08,422 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-04-13 04:26:08,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:08,451 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-04-13 04:26:08,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:26:08,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-13 04:26:08,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:08,452 INFO L225 Difference]: With dead ends: 47 [2018-04-13 04:26:08,452 INFO L226 Difference]: Without dead ends: 47 [2018-04-13 04:26:08,453 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:26:08,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-13 04:26:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-13 04:26:08,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-13 04:26:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-04-13 04:26:08,456 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 16 [2018-04-13 04:26:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:08,456 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-04-13 04:26:08,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:26:08,456 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-04-13 04:26:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-13 04:26:08,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:08,457 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] [2018-04-13 04:26:08,457 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:08,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1396804491, now seen corresponding path program 1 times [2018-04-13 04:26:08,457 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:08,457 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:08,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:08,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:08,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:08,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:26:08,495 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:26:08,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:26:08,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:26:08,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:26:08,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:26:08,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:26:08,496 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 6 states. [2018-04-13 04:26:08,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:08,552 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-04-13 04:26:08,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:26:08,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-13 04:26:08,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:08,554 INFO L225 Difference]: With dead ends: 47 [2018-04-13 04:26:08,554 INFO L226 Difference]: Without dead ends: 47 [2018-04-13 04:26:08,554 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:26:08,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-13 04:26:08,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-04-13 04:26:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-04-13 04:26:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-04-13 04:26:08,556 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 21 [2018-04-13 04:26:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:08,557 INFO L459 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-04-13 04:26:08,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:26:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-04-13 04:26:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-13 04:26:08,557 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:08,557 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] [2018-04-13 04:26:08,557 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:08,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1396804492, now seen corresponding path program 1 times [2018-04-13 04:26:08,557 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:08,557 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:08,558 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:08,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:08,558 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:08,568 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:08,639 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:26:08,639 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:26:08,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-13 04:26:08,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 04:26:08,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 04:26:08,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-13 04:26:08,640 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-04-13 04:26:08,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:08,760 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-04-13 04:26:08,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 04:26:08,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-04-13 04:26:08,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:08,761 INFO L225 Difference]: With dead ends: 57 [2018-04-13 04:26:08,761 INFO L226 Difference]: Without dead ends: 57 [2018-04-13 04:26:08,761 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:26:08,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-13 04:26:08,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-04-13 04:26:08,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-13 04:26:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-04-13 04:26:08,764 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 21 [2018-04-13 04:26:08,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:08,764 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-04-13 04:26:08,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 04:26:08,765 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-04-13 04:26:08,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-13 04:26:08,765 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:08,765 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] [2018-04-13 04:26:08,765 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:08,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1735549236, now seen corresponding path program 1 times [2018-04-13 04:26:08,765 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:08,765 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:08,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:08,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:08,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:08,774 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:08,805 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:26:08,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:26:08,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 04:26:08,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 04:26:08,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 04:26:08,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-13 04:26:08,806 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 7 states. [2018-04-13 04:26:08,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:08,851 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-04-13 04:26:08,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 04:26:08,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-04-13 04:26:08,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:08,852 INFO L225 Difference]: With dead ends: 54 [2018-04-13 04:26:08,852 INFO L226 Difference]: Without dead ends: 54 [2018-04-13 04:26:08,852 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-13 04:26:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-13 04:26:08,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-04-13 04:26:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-13 04:26:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-04-13 04:26:08,855 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 24 [2018-04-13 04:26:08,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:08,856 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-04-13 04:26:08,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 04:26:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-04-13 04:26:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-13 04:26:08,856 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:08,856 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] [2018-04-13 04:26:08,856 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:08,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1735549235, now seen corresponding path program 1 times [2018-04-13 04:26:08,856 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:08,856 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:08,857 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:08,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:08,857 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:08,862 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:08,927 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:26:08,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:26:08,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-13 04:26:08,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 04:26:08,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 04:26:08,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-13 04:26:08,928 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 10 states. [2018-04-13 04:26:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:09,021 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-04-13 04:26:09,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 04:26:09,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-04-13 04:26:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:09,022 INFO L225 Difference]: With dead ends: 56 [2018-04-13 04:26:09,022 INFO L226 Difference]: Without dead ends: 56 [2018-04-13 04:26:09,022 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-04-13 04:26:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-04-13 04:26:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-04-13 04:26:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-13 04:26:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-04-13 04:26:09,025 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 24 [2018-04-13 04:26:09,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:09,025 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-04-13 04:26:09,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 04:26:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-04-13 04:26:09,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-13 04:26:09,026 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:09,026 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:09,026 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:09,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1735547792, now seen corresponding path program 1 times [2018-04-13 04:26:09,027 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:09,027 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:09,027 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:09,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:09,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:09,036 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:09,040 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:26:09,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:26:09,040 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:26:09,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:09,065 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:26:09,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:26:09,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:09,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:09,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:09,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:09,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:26:09,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:09,103 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:09,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:09,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:09,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:09,114 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:09,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:09,129 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:26:09,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 04:26:09,176 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:26:09,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:26:09,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-13 04:26:09,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 04:26:09,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 04:26:09,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:26:09,177 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 12 states. [2018-04-13 04:26:09,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:09,420 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-04-13 04:26:09,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 04:26:09,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-04-13 04:26:09,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:09,420 INFO L225 Difference]: With dead ends: 72 [2018-04-13 04:26:09,420 INFO L226 Difference]: Without dead ends: 72 [2018-04-13 04:26:09,421 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:26:09,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-13 04:26:09,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2018-04-13 04:26:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-13 04:26:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-04-13 04:26:09,424 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 24 [2018-04-13 04:26:09,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:09,425 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-04-13 04:26:09,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 04:26:09,425 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-04-13 04:26:09,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-13 04:26:09,426 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:09,426 INFO L355 BasicCegarLoop]: trace histogram [3, 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:26:09,426 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:09,426 INFO L82 PathProgramCache]: Analyzing trace with hash -888000244, now seen corresponding path program 2 times [2018-04-13 04:26:09,426 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:09,426 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:09,427 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:09,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:09,427 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:09,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:26:09,445 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:26:09,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:26:09,446 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:26:09,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:26:09,474 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:26:09,474 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:26:09,478 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:26:09,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:26:09,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:09,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:09,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:09,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:09,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:26:09,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:09,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:09,518 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:09,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:09,535 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:09,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:09,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:09,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 04:26:09,567 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 19 treesize of output 16 [2018-04-13 04:26:09,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-13 04:26:09,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:09,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:09,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:26:09,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-13 04:26:09,605 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 32 treesize of output 33 [2018-04-13 04:26:09,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:09,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:09,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:09,618 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:26:09,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-13 04:26:09,720 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 35 treesize of output 33 [2018-04-13 04:26:09,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 04:26:09,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:09,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2018-04-13 04:26:09,737 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:26:09,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:26:09,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:26:09,750 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:60, output treesize:35 [2018-04-13 04:26:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:26:09,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:26:09,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 04:26:09,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 04:26:09,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 04:26:09,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-04-13 04:26:09,819 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 15 states. [2018-04-13 04:26:14,031 WARN L148 SmtUtils]: Spent 4033ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-13 04:26:20,076 WARN L148 SmtUtils]: Spent 6024ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-13 04:26:32,180 WARN L151 SmtUtils]: Spent 12073ms on a formula simplification. DAG size of input: 79 DAG size of output 76 [2018-04-13 04:26:40,294 WARN L148 SmtUtils]: Spent 4014ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-13 04:26:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:42,639 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2018-04-13 04:26:42,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 04:26:42,639 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-04-13 04:26:42,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:42,640 INFO L225 Difference]: With dead ends: 90 [2018-04-13 04:26:42,640 INFO L226 Difference]: Without dead ends: 90 [2018-04-13 04:26:42,640 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2018-04-13 04:26:42,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-04-13 04:26:42,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2018-04-13 04:26:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-13 04:26:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2018-04-13 04:26:42,642 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 27 [2018-04-13 04:26:42,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:42,642 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2018-04-13 04:26:42,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 04:26:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2018-04-13 04:26:42,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 04:26:42,643 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:42,643 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:42,643 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:42,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1029599467, now seen corresponding path program 1 times [2018-04-13 04:26:42,643 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:42,643 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:42,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:42,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:26:42,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:42,650 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:42,679 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:26:42,679 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:26:42,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:26:42,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:26:42,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:26:42,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:26:42,680 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 5 states. [2018-04-13 04:26:42,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:42,714 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2018-04-13 04:26:42,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 04:26:42,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-13 04:26:42,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:42,716 INFO L225 Difference]: With dead ends: 97 [2018-04-13 04:26:42,716 INFO L226 Difference]: Without dead ends: 97 [2018-04-13 04:26:42,717 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:26:42,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-13 04:26:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-04-13 04:26:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-13 04:26:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-04-13 04:26:42,724 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 28 [2018-04-13 04:26:42,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:42,724 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-04-13 04:26:42,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:26:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2018-04-13 04:26:42,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 04:26:42,725 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:42,725 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:42,725 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:42,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1847247917, now seen corresponding path program 1 times [2018-04-13 04:26:42,725 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:42,725 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:42,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:42,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:42,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:42,736 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:42,738 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:26:42,738 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:26:42,738 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:26:42,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:42,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:26:42,789 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:26:42,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:26:42,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 04:26:42,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:26:42,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:26:42,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:26:42,790 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 8 states. [2018-04-13 04:26:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:42,843 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2018-04-13 04:26:42,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 04:26:42,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-13 04:26:42,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:42,844 INFO L225 Difference]: With dead ends: 90 [2018-04-13 04:26:42,844 INFO L226 Difference]: Without dead ends: 87 [2018-04-13 04:26:42,844 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-13 04:26:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-13 04:26:42,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2018-04-13 04:26:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-13 04:26:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-04-13 04:26:42,847 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 28 [2018-04-13 04:26:42,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:42,848 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-04-13 04:26:42,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:26:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-04-13 04:26:42,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 04:26:42,848 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:42,848 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:42,849 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:42,849 INFO L82 PathProgramCache]: Analyzing trace with hash 2126780026, now seen corresponding path program 1 times [2018-04-13 04:26:42,849 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:42,849 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:42,850 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:42,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:42,850 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:42,860 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:26:43,667 WARN L151 SmtUtils]: Spent 682ms on a formula simplification. DAG size of input: 15 DAG size of output 7 [2018-04-13 04:26:43,669 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:26:43,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:26:43,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 04:26:43,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:26:43,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:26:43,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:26:43,670 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 6 states. [2018-04-13 04:26:43,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:43,743 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2018-04-13 04:26:43,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:26:43,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-13 04:26:43,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:43,745 INFO L225 Difference]: With dead ends: 126 [2018-04-13 04:26:43,745 INFO L226 Difference]: Without dead ends: 126 [2018-04-13 04:26:43,745 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:26:43,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-13 04:26:43,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2018-04-13 04:26:43,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-13 04:26:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2018-04-13 04:26:43,749 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 30 [2018-04-13 04:26:43,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:43,749 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2018-04-13 04:26:43,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:26:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2018-04-13 04:26:43,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 04:26:43,750 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:43,750 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:43,750 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:43,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1711730960, now seen corresponding path program 3 times [2018-04-13 04:26:43,750 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:43,750 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:43,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:43,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:43,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:43,762 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:43,767 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:26:43,768 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:26:43,768 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:26:43,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:26:43,795 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:26:43,795 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:26:43,799 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:26:43,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:26:43,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:43,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:26:43,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:43,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:43,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:26:43,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:43,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:43,840 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:43,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:43,853 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:43,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:43,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:43,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 04:26:43,889 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:26:43,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:43,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:43,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:43,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:43,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-13 04:26:43,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-13 04:26:43,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:43,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:43,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:43,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 04:26:43,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-04-13 04:26:44,067 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:44,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:44,081 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 31 treesize of output 29 [2018-04-13 04:26:44,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 04:26:44,084 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:44,094 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:26:44,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-13 04:26:44,097 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:26:44,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:26:44,104 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:30 [2018-04-13 04:26:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:26:44,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:26:44,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 04:26:44,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 04:26:44,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 04:26:44,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:26:44,185 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand 17 states. [2018-04-13 04:26:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:47,357 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2018-04-13 04:26:47,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 04:26:47,358 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-04-13 04:26:47,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:47,359 INFO L225 Difference]: With dead ends: 137 [2018-04-13 04:26:47,359 INFO L226 Difference]: Without dead ends: 137 [2018-04-13 04:26:47,360 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-04-13 04:26:47,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-13 04:26:47,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 113. [2018-04-13 04:26:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-13 04:26:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2018-04-13 04:26:47,364 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 30 [2018-04-13 04:26:47,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:47,365 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2018-04-13 04:26:47,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 04:26:47,365 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2018-04-13 04:26:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 04:26:47,365 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:47,365 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:47,366 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:47,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1949332552, now seen corresponding path program 1 times [2018-04-13 04:26:47,366 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:47,366 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:47,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:47,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:26:47,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:47,382 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:47,476 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:26:47,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:26:47,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-13 04:26:47,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 04:26:47,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 04:26:47,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-13 04:26:47,478 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand 11 states. [2018-04-13 04:26:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:26:47,640 INFO L93 Difference]: Finished difference Result 205 states and 239 transitions. [2018-04-13 04:26:47,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 04:26:47,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-04-13 04:26:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:26:47,642 INFO L225 Difference]: With dead ends: 205 [2018-04-13 04:26:47,642 INFO L226 Difference]: Without dead ends: 205 [2018-04-13 04:26:47,642 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-04-13 04:26:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-13 04:26:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 187. [2018-04-13 04:26:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-04-13 04:26:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 225 transitions. [2018-04-13 04:26:47,648 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 225 transitions. Word has length 30 [2018-04-13 04:26:47,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:26:47,649 INFO L459 AbstractCegarLoop]: Abstraction has 187 states and 225 transitions. [2018-04-13 04:26:47,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 04:26:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 225 transitions. [2018-04-13 04:26:47,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 04:26:47,650 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:26:47,650 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:26:47,650 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:26:47,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1492876242, now seen corresponding path program 1 times [2018-04-13 04:26:47,650 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:26:47,650 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:26:47,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:47,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:47,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:26:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:47,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:47,671 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:26:47,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:26:47,672 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:26:47,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:26:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:26:47,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:26:47,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:26:47,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:47,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:47,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-13 04:26:47,743 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:26:47,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:26:47,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:26:47,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:39 [2018-04-13 04:26:47,814 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 42 treesize of output 39 [2018-04-13 04:26:47,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 14 treesize of output 13 [2018-04-13 04:26:47,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:47,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:47,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 40 [2018-04-13 04:26:47,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-13 04:26:47,845 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:47,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:47,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-13 04:26:47,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:86, output treesize:78 [2018-04-13 04:26:47,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:47,904 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 62 treesize of output 63 [2018-04-13 04:26:47,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:47,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:47,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:47,938 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 58 treesize of output 53 [2018-04-13 04:26:47,942 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 25 treesize of output 26 [2018-04-13 04:26:47,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:47,951 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:26:47,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-13 04:26:47,970 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:121, output treesize:113 [2018-04-13 04:26:49,999 WARN L148 SmtUtils]: Spent 2018ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-13 04:26:50,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:50,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:50,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-04-13 04:26:50,747 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2018-04-13 04:26:50,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:26:50,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:26:50,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2018-04-13 04:26:50,759 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:26:50,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:26:50,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 04:26:50,784 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:90, output treesize:69 [2018-04-13 04:26:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:26:50,924 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:26:50,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 04:26:50,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:26:50,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:26:50,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:26:50,925 INFO L87 Difference]: Start difference. First operand 187 states and 225 transitions. Second operand 19 states. [2018-04-13 04:26:59,361 WARN L151 SmtUtils]: Spent 8160ms on a formula simplification. DAG size of input: 82 DAG size of output 78 [2018-04-13 04:27:01,234 WARN L151 SmtUtils]: Spent 1666ms on a formula simplification. DAG size of input: 121 DAG size of output 119 [2018-04-13 04:27:04,723 WARN L151 SmtUtils]: Spent 842ms on a formula simplification. DAG size of input: 125 DAG size of output 124 [2018-04-13 04:27:08,054 WARN L151 SmtUtils]: Spent 522ms on a formula simplification. DAG size of input: 93 DAG size of output 92 [2018-04-13 04:27:09,820 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 111 DAG size of output 110 [2018-04-13 04:27:14,449 WARN L151 SmtUtils]: Spent 560ms on a formula simplification. DAG size of input: 132 DAG size of output 116 [2018-04-13 04:27:18,035 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 107 DAG size of output 100 [2018-04-13 04:27:21,111 WARN L151 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 104 DAG size of output 100 [2018-04-13 04:27:21,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:27:21,741 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2018-04-13 04:27:21,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 04:27:21,741 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-04-13 04:27:21,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:27:21,743 INFO L225 Difference]: With dead ends: 237 [2018-04-13 04:27:21,743 INFO L226 Difference]: Without dead ends: 237 [2018-04-13 04:27:21,743 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=133, Invalid=856, Unknown=3, NotChecked=0, Total=992 [2018-04-13 04:27:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-13 04:27:21,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 152. [2018-04-13 04:27:21,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-13 04:27:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 183 transitions. [2018-04-13 04:27:21,749 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 183 transitions. Word has length 30 [2018-04-13 04:27:21,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:27:21,749 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 183 transitions. [2018-04-13 04:27:21,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:27:21,749 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 183 transitions. [2018-04-13 04:27:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 04:27:21,749 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:27:21,749 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:27:21,750 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:27:21,750 INFO L82 PathProgramCache]: Analyzing trace with hash 540196410, now seen corresponding path program 1 times [2018-04-13 04:27:21,750 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:27:21,750 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:27:21,750 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:27:21,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:27:21,750 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:27:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:27:21,758 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:21,922 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:27:21,922 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:27:21,922 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:27:21,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:27:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:27:21,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:27:21,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:21,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:27:21,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:27:21,987 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:27:21,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:27:21,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:21,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:27:21,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:27:21,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-13 04:27:22,143 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 22 treesize of output 18 [2018-04-13 04:27:22,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-04-13 04:27:22,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:27:22,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:27:22,166 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:27:22,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:54 [2018-04-13 04:27:22,281 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:27:22,281 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:27:22,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-04-13 04:27:22,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 04:27:22,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 04:27:22,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-04-13 04:27:22,282 INFO L87 Difference]: Start difference. First operand 152 states and 183 transitions. Second operand 23 states. [2018-04-13 04:27:22,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:27:22,770 INFO L93 Difference]: Finished difference Result 175 states and 210 transitions. [2018-04-13 04:27:22,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 04:27:22,770 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-04-13 04:27:22,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:27:22,771 INFO L225 Difference]: With dead ends: 175 [2018-04-13 04:27:22,771 INFO L226 Difference]: Without dead ends: 175 [2018-04-13 04:27:22,771 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2018-04-13 04:27:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-04-13 04:27:22,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 160. [2018-04-13 04:27:22,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-13 04:27:22,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 194 transitions. [2018-04-13 04:27:22,774 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 194 transitions. Word has length 30 [2018-04-13 04:27:22,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:27:22,774 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 194 transitions. [2018-04-13 04:27:22,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 04:27:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 194 transitions. [2018-04-13 04:27:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 04:27:22,775 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:27:22,775 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:27:22,775 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:27:22,775 INFO L82 PathProgramCache]: Analyzing trace with hash 996652720, now seen corresponding path program 1 times [2018-04-13 04:27:22,775 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:27:22,775 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:27:22,775 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:27:22,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:27:22,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:27:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:27:22,784 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:22,791 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:27:22,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:27:22,791 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:27:22,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:27:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:27:22,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:27:22,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:27:22,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:22,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:27:22,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:22,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:27:22,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:27:22,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:27:22,842 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:22,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:22,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:27:22,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:27:22,859 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:22,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:22,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:27:22,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 04:27:22,885 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 19 treesize of output 16 [2018-04-13 04:27:22,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-13 04:27:22,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:22,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:27:22,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:27:22,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-13 04:27:22,916 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 32 treesize of output 33 [2018-04-13 04:27:22,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:27:22,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:22,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:27:22,931 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:27:22,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-13 04:27:23,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-04-13 04:27:23,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:27:23,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2018-04-13 04:27:23,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:27:23,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 04:27:23,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:27:23,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:27:23,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:27:23,132 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:72, output treesize:49 [2018-04-13 04:27:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:27:23,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:27:23,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 04:27:23,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 04:27:23,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 04:27:23,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-04-13 04:27:23,220 INFO L87 Difference]: Start difference. First operand 160 states and 194 transitions. Second operand 18 states. [2018-04-13 04:27:27,441 WARN L148 SmtUtils]: Spent 4016ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-13 04:27:33,497 WARN L148 SmtUtils]: Spent 6032ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-13 04:27:39,548 WARN L148 SmtUtils]: Spent 6030ms on a formula simplification that was a NOOP. DAG size: 71 [2018-04-13 04:27:46,603 WARN L148 SmtUtils]: Spent 3915ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-13 04:27:54,866 WARN L151 SmtUtils]: Spent 8085ms on a formula simplification. DAG size of input: 73 DAG size of output 69 [2018-04-13 04:28:06,964 WARN L151 SmtUtils]: Spent 12062ms on a formula simplification. DAG size of input: 85 DAG size of output 79 [2018-04-13 04:28:17,257 WARN L151 SmtUtils]: Spent 8035ms on a formula simplification. DAG size of input: 62 DAG size of output 59 [2018-04-13 04:28:23,706 WARN L148 SmtUtils]: Spent 4019ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-13 04:28:24,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:28:24,181 INFO L93 Difference]: Finished difference Result 221 states and 259 transitions. [2018-04-13 04:28:24,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 04:28:24,181 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-04-13 04:28:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:28:24,182 INFO L225 Difference]: With dead ends: 221 [2018-04-13 04:28:24,182 INFO L226 Difference]: Without dead ends: 221 [2018-04-13 04:28:24,183 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 52.7s TimeCoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 04:28:24,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-13 04:28:24,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 163. [2018-04-13 04:28:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-13 04:28:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2018-04-13 04:28:24,187 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 30 [2018-04-13 04:28:24,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:28:24,188 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2018-04-13 04:28:24,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 04:28:24,188 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2018-04-13 04:28:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 04:28:24,188 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:28:24,189 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:28:24,189 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:28:24,189 INFO L82 PathProgramCache]: Analyzing trace with hash -30361972, now seen corresponding path program 4 times [2018-04-13 04:28:24,189 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:28:24,189 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:28:24,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:24,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:28:24,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:28:24,198 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:24,202 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:28:24,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:28:24,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:28:24,203 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:28:24,226 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:28:24,226 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:28:24,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:28:24,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:24,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:24,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:28:24,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:24,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:24,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:28:24,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:24,274 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:24,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:24,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:24,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:24,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:28:24,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:24,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:24,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 04:28:24,326 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:28:24,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:28:24,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:24,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:24,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:24,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-13 04:28:24,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-13 04:28:24,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 13 treesize of output 12 [2018-04-13 04:28:24,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:24,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:24,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 04:28:24,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-13 04:28:24,511 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 31 treesize of output 29 [2018-04-13 04:28:24,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 04:28:24,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:24,520 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:28:24,521 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:28:24,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:28:24,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:28:24,529 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-04-13 04:28:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:28:24,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:28:24,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 04:28:24,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:28:24,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:28:24,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:28:24,598 INFO L87 Difference]: Start difference. First operand 163 states and 198 transitions. Second operand 19 states. [2018-04-13 04:28:25,006 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 43 DAG size of output 35 [2018-04-13 04:28:25,252 WARN L151 SmtUtils]: Spent 229ms on a formula simplification. DAG size of input: 45 DAG size of output 37 [2018-04-13 04:28:27,462 WARN L151 SmtUtils]: Spent 2120ms on a formula simplification. DAG size of input: 46 DAG size of output 38 [2018-04-13 04:28:27,661 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 46 DAG size of output 38 [2018-04-13 04:28:27,822 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 54 DAG size of output 46 [2018-04-13 04:28:28,000 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 52 DAG size of output 42 [2018-04-13 04:28:28,172 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 61 DAG size of output 50 [2018-04-13 04:28:28,368 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 53 DAG size of output 43 [2018-04-13 04:28:28,542 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 58 DAG size of output 43 [2018-04-13 04:28:28,725 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 66 DAG size of output 50 [2018-04-13 04:28:28,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:28:28,844 INFO L93 Difference]: Finished difference Result 237 states and 274 transitions. [2018-04-13 04:28:28,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 04:28:28,845 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-04-13 04:28:28,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:28:28,845 INFO L225 Difference]: With dead ends: 237 [2018-04-13 04:28:28,846 INFO L226 Difference]: Without dead ends: 237 [2018-04-13 04:28:28,846 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=249, Invalid=1083, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 04:28:28,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-13 04:28:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 170. [2018-04-13 04:28:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-13 04:28:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 201 transitions. [2018-04-13 04:28:28,852 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 201 transitions. Word has length 33 [2018-04-13 04:28:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:28:28,852 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 201 transitions. [2018-04-13 04:28:28,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:28:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 201 transitions. [2018-04-13 04:28:28,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 04:28:28,853 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:28:28,853 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:28:28,853 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:28:28,854 INFO L82 PathProgramCache]: Analyzing trace with hash 110186638, now seen corresponding path program 2 times [2018-04-13 04:28:28,854 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:28:28,854 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:28:28,854 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:28,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:28:28,855 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:28:28,867 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:28,875 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:28:28,875 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:28:28,875 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:28:28,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:28:28,908 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:28:28,908 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:28:28,912 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:28:28,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:28,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:28,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:28,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:28,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:28,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:28:28,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:28,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:28,949 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:28,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:28,958 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:28,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:28,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:28,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 04:28:28,993 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 19 treesize of output 16 [2018-04-13 04:28:28,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-13 04:28:28,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:28,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:29,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:29,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-04-13 04:28:29,021 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 32 treesize of output 33 [2018-04-13 04:28:29,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:28:29,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:29,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:29,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 04:28:29,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2018-04-13 04:28:29,322 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 55 treesize of output 49 [2018-04-13 04:28:29,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 04:28:29,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:29,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:29,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:29,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:29,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 73 [2018-04-13 04:28:29,346 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:28:29,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:28:29,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-13 04:28:29,384 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:88, output treesize:178 [2018-04-13 04:28:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:28:29,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:28:29,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 04:28:29,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:28:29,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:28:29,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:28:29,537 INFO L87 Difference]: Start difference. First operand 170 states and 201 transitions. Second operand 19 states. [2018-04-13 04:28:33,775 WARN L148 SmtUtils]: Spent 4017ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-13 04:28:39,825 WARN L148 SmtUtils]: Spent 6024ms on a formula simplification that was a NOOP. DAG size: 75 [2018-04-13 04:28:43,992 WARN L151 SmtUtils]: Spent 4142ms on a formula simplification. DAG size of input: 79 DAG size of output 71 [2018-04-13 04:28:50,221 WARN L148 SmtUtils]: Spent 4018ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-13 04:28:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:28:56,834 INFO L93 Difference]: Finished difference Result 286 states and 331 transitions. [2018-04-13 04:28:56,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 04:28:56,835 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-04-13 04:28:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:28:56,835 INFO L225 Difference]: With dead ends: 286 [2018-04-13 04:28:56,835 INFO L226 Difference]: Without dead ends: 286 [2018-04-13 04:28:56,836 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2018-04-13 04:28:56,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-04-13 04:28:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 184. [2018-04-13 04:28:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-13 04:28:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 217 transitions. [2018-04-13 04:28:56,839 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 217 transitions. Word has length 33 [2018-04-13 04:28:56,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:28:56,839 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 217 transitions. [2018-04-13 04:28:56,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:28:56,839 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 217 transitions. [2018-04-13 04:28:56,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 04:28:56,839 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:28:56,839 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:28:56,839 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:28:56,840 INFO L82 PathProgramCache]: Analyzing trace with hash -919032110, now seen corresponding path program 1 times [2018-04-13 04:28:56,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:28:56,840 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:28:56,840 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:56,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:28:56,840 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:28:56,848 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:56,852 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:28:56,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:28:56,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:28:56,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:28:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:28:56,876 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:28:56,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:56,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:56,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:28:56,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:56,918 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:56,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:22 [2018-04-13 04:28:56,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:56,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:56,948 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:56,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:56,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:56,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-13 04:28:56,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:56,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:28:56,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:21 [2018-04-13 04:28:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:28:57,140 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:28:57,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 04:28:57,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:28:57,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:28:57,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:28:57,141 INFO L87 Difference]: Start difference. First operand 184 states and 217 transitions. Second operand 16 states. [2018-04-13 04:28:58,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:28:58,104 INFO L93 Difference]: Finished difference Result 272 states and 316 transitions. [2018-04-13 04:28:58,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 04:28:58,104 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-04-13 04:28:58,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:28:58,105 INFO L225 Difference]: With dead ends: 272 [2018-04-13 04:28:58,105 INFO L226 Difference]: Without dead ends: 272 [2018-04-13 04:28:58,105 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2018-04-13 04:28:58,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-04-13 04:28:58,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 198. [2018-04-13 04:28:58,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 04:28:58,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 236 transitions. [2018-04-13 04:28:58,109 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 236 transitions. Word has length 35 [2018-04-13 04:28:58,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:28:58,109 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 236 transitions. [2018-04-13 04:28:58,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:28:58,110 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 236 transitions. [2018-04-13 04:28:58,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 04:28:58,110 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:28:58,110 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:28:58,110 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:28:58,110 INFO L82 PathProgramCache]: Analyzing trace with hash -644412504, now seen corresponding path program 1 times [2018-04-13 04:28:58,110 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:28:58,110 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:28:58,111 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:58,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:28:58,111 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:28:58,117 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:58,118 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:28:58,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:28:58,118 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:28:58,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:28:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:28:58,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:28:58,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:58,154 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:28:58,155 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:28:58,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:58,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:58,162 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:28:58,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-13 04:28:58,211 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc11.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc11.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc12.base| 1) |main_#t~malloc11.base| 0)) (= (select .cse0 |c_main_#t~malloc12.base|) 0)))) is different from true [2018-04-13 04:28:58,223 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc11.base| 1))) (and (= |c_#valid| (store (store (store .cse0 |main_#t~malloc12.base| 1) |main_#t~malloc11.base| 0) |main_#t~malloc12.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc11.base|)) (= (select .cse0 |main_#t~malloc12.base|) 0)))) is different from true [2018-04-13 04:28:58,228 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:28:58,228 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:28:58,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:28:58,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:28:58,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:28:58,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-13 04:28:58,229 INFO L87 Difference]: Start difference. First operand 198 states and 236 transitions. Second operand 8 states. [2018-04-13 04:28:58,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:28:58,324 INFO L93 Difference]: Finished difference Result 197 states and 235 transitions. [2018-04-13 04:28:58,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 04:28:58,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-04-13 04:28:58,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:28:58,325 INFO L225 Difference]: With dead ends: 197 [2018-04-13 04:28:58,325 INFO L226 Difference]: Without dead ends: 118 [2018-04-13 04:28:58,325 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-13 04:28:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-04-13 04:28:58,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-04-13 04:28:58,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-13 04:28:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 132 transitions. [2018-04-13 04:28:58,328 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 132 transitions. Word has length 36 [2018-04-13 04:28:58,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:28:58,329 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 132 transitions. [2018-04-13 04:28:58,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:28:58,329 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 132 transitions. [2018-04-13 04:28:58,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 04:28:58,329 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:28:58,329 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:28:58,329 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:28:58,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1215080494, now seen corresponding path program 3 times [2018-04-13 04:28:58,330 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:28:58,330 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:28:58,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:58,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:28:58,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:28:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:28:58,341 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:58,354 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:28:58,354 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:28:58,354 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:28:58,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:28:58,384 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-13 04:28:58,384 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:28:58,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:28:58,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:58,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:58,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:28:58,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:58,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:58,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-04-13 04:28:58,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:58,437 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:58,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:58,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:58,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:58,452 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:58,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:58,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:28:58,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-04-13 04:28:58,494 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 19 treesize of output 16 [2018-04-13 04:28:58,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-13 04:28:58,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:58,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:58,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:28:58,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-13 04:28:58,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 44 [2018-04-13 04:28:58,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-13 04:28:58,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:58,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:28:58,585 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:28:58,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:58 [2018-04-13 04:28:59,054 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:59,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:59,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:59,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:59,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-04-13 04:28:59,088 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2018-04-13 04:28:59,088 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:28:59,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:28:59,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 117 [2018-04-13 04:28:59,123 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 04:28:59,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 36 xjuncts. [2018-04-13 04:28:59,256 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 04:28:59,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 2 xjuncts. [2018-04-13 04:28:59,312 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:120, output treesize:824 [2018-04-13 04:28:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:28:59,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:28:59,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 04:28:59,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 04:28:59,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 04:28:59,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2018-04-13 04:28:59,692 INFO L87 Difference]: Start difference. First operand 117 states and 132 transitions. Second operand 23 states. [2018-04-13 04:29:01,955 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 193 DAG size of output 119 [2018-04-13 04:29:02,214 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 101 DAG size of output 84 [2018-04-13 04:29:02,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:29:02,819 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2018-04-13 04:29:02,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 04:29:02,819 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2018-04-13 04:29:02,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:29:02,819 INFO L225 Difference]: With dead ends: 127 [2018-04-13 04:29:02,819 INFO L226 Difference]: Without dead ends: 122 [2018-04-13 04:29:02,820 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=216, Invalid=1266, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 04:29:02,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-04-13 04:29:02,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-04-13 04:29:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-13 04:29:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2018-04-13 04:29:02,821 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 36 [2018-04-13 04:29:02,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:29:02,822 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2018-04-13 04:29:02,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 04:29:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2018-04-13 04:29:02,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 04:29:02,822 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:29:02,822 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:29:02,822 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:29:02,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1574776871, now seen corresponding path program 2 times [2018-04-13 04:29:02,822 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:29:02,822 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:29:02,823 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:29:02,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:29:02,823 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:29:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:29:02,830 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:02,833 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:29:02,833 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:29:02,833 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:29:02,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:29:02,852 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:29:02,852 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:29:02,854 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:29:02,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:29:02,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:02,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:02,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:29:02,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:02,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:02,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:02,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:02,877 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:02,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:02,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:02,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-13 04:29:02,898 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:29:02,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:29:02,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:02,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:02,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:02,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-04-13 04:29:03,039 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:29:03,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:29:03,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:03,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:03,058 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:29:03,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-04-13 04:29:03,109 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 21 treesize of output 17 [2018-04-13 04:29:03,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-13 04:29:03,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:29:03,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:29:03,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:29:03,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-04-13 04:29:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:29:03,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:29:03,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 04:29:03,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 04:29:03,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 04:29:03,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-04-13 04:29:03,216 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand 18 states. [2018-04-13 04:29:03,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:29:03,656 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2018-04-13 04:29:03,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 04:29:03,657 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-04-13 04:29:03,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:29:03,657 INFO L225 Difference]: With dead ends: 137 [2018-04-13 04:29:03,657 INFO L226 Difference]: Without dead ends: 137 [2018-04-13 04:29:03,658 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2018-04-13 04:29:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-13 04:29:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2018-04-13 04:29:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-13 04:29:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2018-04-13 04:29:03,660 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 36 [2018-04-13 04:29:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:29:03,661 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2018-04-13 04:29:03,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 04:29:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2018-04-13 04:29:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 04:29:03,661 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:29:03,661 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:29:03,661 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:29:03,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1693683408, now seen corresponding path program 2 times [2018-04-13 04:29:03,662 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:29:03,662 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:29:03,662 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:29:03,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:29:03,662 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:29:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:29:03,676 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:29:03,679 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:29:03,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:29:03,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:29:03,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:29:03,703 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:29:03,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:29:03,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:29:03,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:03,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:03,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:03,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:03,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:03,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:29:03,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:03,754 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:03,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:03,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:03,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:03,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:29:03,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:03,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:03,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 04:29:03,796 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 19 treesize of output 16 [2018-04-13 04:29:03,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-13 04:29:03,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:03,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:03,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:03,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-04-13 04:29:03,839 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 32 treesize of output 33 [2018-04-13 04:29:03,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:29:03,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:03,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:03,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 04:29:03,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2018-04-13 04:29:04,427 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 61 treesize of output 53 [2018-04-13 04:29:04,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 04:29:04,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:04,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:04,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 117 [2018-04-13 04:29:04,471 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-13 04:29:04,475 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 36 xjuncts. [2018-04-13 04:29:04,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:29:04,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-13 04:29:04,600 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:104, output treesize:230 [2018-04-13 04:29:04,798 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:29:04,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:29:04,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 04:29:04,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 04:29:04,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 04:29:04,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-04-13 04:29:04,799 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand 22 states. [2018-04-13 04:29:09,149 WARN L148 SmtUtils]: Spent 4019ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-13 04:29:15,224 WARN L148 SmtUtils]: Spent 6038ms on a formula simplification that was a NOOP. DAG size: 75 [2018-04-13 04:29:24,220 WARN L151 SmtUtils]: Spent 8472ms on a formula simplification. DAG size of input: 79 DAG size of output 75 [2018-04-13 04:29:30,591 WARN L148 SmtUtils]: Spent 4028ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-13 04:29:36,859 WARN L148 SmtUtils]: Spent 4017ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-13 04:29:41,231 WARN L151 SmtUtils]: Spent 4091ms on a formula simplification. DAG size of input: 64 DAG size of output 60 [2018-04-13 04:29:50,030 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 143 DAG size of output 88 [2018-04-13 04:29:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:29:51,221 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2018-04-13 04:29:51,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 04:29:51,221 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-04-13 04:29:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:29:51,221 INFO L225 Difference]: With dead ends: 155 [2018-04-13 04:29:51,222 INFO L226 Difference]: Without dead ends: 154 [2018-04-13 04:29:51,222 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 33.2s TimeCoverageRelationStatistics Valid=180, Invalid=1226, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 04:29:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-13 04:29:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 131. [2018-04-13 04:29:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-13 04:29:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2018-04-13 04:29:51,224 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 36 [2018-04-13 04:29:51,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:29:51,224 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2018-04-13 04:29:51,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 04:29:51,224 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2018-04-13 04:29:51,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 04:29:51,225 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:29:51,225 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:29:51,225 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:29:51,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1238114358, now seen corresponding path program 1 times [2018-04-13 04:29:51,225 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:29:51,225 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:29:51,225 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:29:51,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:29:51,226 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:29:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:29:51,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:29:51,238 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:29:51,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:29:51,238 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:29:51,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:29:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:29:51,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:29:51,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:51,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:51,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:51,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:51,297 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:51,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-13 04:29:51,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:51,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:51,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:29:51,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:51,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:51,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-13 04:29:51,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:51,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:29:51,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-04-13 04:29:51,563 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:29:51,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:29:51,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 04:29:51,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 04:29:51,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 04:29:51,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-04-13 04:29:51,564 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand 20 states. [2018-04-13 04:29:52,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:29:52,381 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2018-04-13 04:29:52,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 04:29:52,381 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-04-13 04:29:52,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:29:52,382 INFO L225 Difference]: With dead ends: 151 [2018-04-13 04:29:52,382 INFO L226 Difference]: Without dead ends: 150 [2018-04-13 04:29:52,382 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 04:29:52,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-13 04:29:52,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 131. [2018-04-13 04:29:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-13 04:29:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2018-04-13 04:29:52,385 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 38 [2018-04-13 04:29:52,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:29:52,385 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2018-04-13 04:29:52,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 04:29:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2018-04-13 04:29:52,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 04:29:52,386 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:29:52,386 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:29:52,386 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:29:52,386 INFO L82 PathProgramCache]: Analyzing trace with hash 478588046, now seen corresponding path program 4 times [2018-04-13 04:29:52,386 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:29:52,386 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:29:52,387 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:29:52,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:29:52,387 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:29:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:29:52,401 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:52,412 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:29:52,412 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:29:52,412 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:29:52,413 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:29:52,440 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:29:52,440 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:29:52,444 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:29:52,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:52,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:52,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:52,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:52,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:52,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:29:52,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:52,481 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:52,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:52,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:52,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:52,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:29:52,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:52,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:52,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 04:29:52,526 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 19 treesize of output 16 [2018-04-13 04:29:52,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 16 treesize of output 15 [2018-04-13 04:29:52,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:52,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:52,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:29:52,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-13 04:29:52,559 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 32 treesize of output 33 [2018-04-13 04:29:52,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 13 treesize of output 12 [2018-04-13 04:29:52,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:52,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:29:52,576 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:29:52,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-13 04:29:54,459 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 69 treesize of output 59 [2018-04-13 04:29:54,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 04:29:54,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:29:54,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:29:54,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 45 treesize of output 167 [2018-04-13 04:29:54,522 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-04-13 04:29:54,758 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 544 xjuncts. [2018-04-13 04:29:58,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:29:58,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:29:58,418 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:114, output treesize:193 [2018-04-13 04:29:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:29:58,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:29:58,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 04:29:58,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 04:29:58,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 04:29:58,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-04-13 04:29:58,536 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand 23 states. [2018-04-13 04:30:03,321 WARN L148 SmtUtils]: Spent 4034ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-13 04:30:09,521 WARN L148 SmtUtils]: Spent 6073ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-13 04:30:15,781 WARN L148 SmtUtils]: Spent 6022ms on a formula simplification that was a NOOP. DAG size: 71 [2018-04-13 04:30:24,918 WARN L151 SmtUtils]: Spent 8666ms on a formula simplification. DAG size of input: 73 DAG size of output 69 [2018-04-13 04:30:32,533 WARN L148 SmtUtils]: Spent 6025ms on a formula simplification that was a NOOP. DAG size: 76 [2018-04-13 04:30:38,813 WARN L151 SmtUtils]: Spent 3442ms on a formula simplification. DAG size of input: 76 DAG size of output 61 [2018-04-13 04:30:50,222 WARN L151 SmtUtils]: Spent 8053ms on a formula simplification. DAG size of input: 89 DAG size of output 68 [2018-04-13 04:30:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:30:57,773 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2018-04-13 04:30:57,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 04:30:57,773 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2018-04-13 04:30:57,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:30:57,774 INFO L225 Difference]: With dead ends: 161 [2018-04-13 04:30:57,774 INFO L226 Difference]: Without dead ends: 156 [2018-04-13 04:30:57,774 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 46.3s TimeCoverageRelationStatistics Valid=201, Invalid=1359, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:30:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-13 04:30:57,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2018-04-13 04:30:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-13 04:30:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2018-04-13 04:30:57,777 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 39 [2018-04-13 04:30:57,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:30:57,777 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2018-04-13 04:30:57,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 04:30:57,777 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2018-04-13 04:30:57,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-13 04:30:57,777 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:30:57,777 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:30:57,778 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:30:57,778 INFO L82 PathProgramCache]: Analyzing trace with hash -304518907, now seen corresponding path program 2 times [2018-04-13 04:30:57,778 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:30:57,778 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:30:57,778 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:30:57,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:30:57,778 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:30:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:30:57,785 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,786 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:30:57,786 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:30:57,786 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:30:57,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:30:57,803 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:30:57,803 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:30:57,805 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:30:57,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:30:57,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:30:57,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:57,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:30:57,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:30:57,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-13 04:30:57,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:30:57,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:30:57,851 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:57,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:30:57,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:30:57,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:30:57,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:30:57,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:25 [2018-04-13 04:30:58,372 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:30:58,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:30:58,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 04:30:58,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:30:58,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:30:58,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:30:58,373 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand 19 states. [2018-04-13 04:31:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:31:03,506 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2018-04-13 04:31:03,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 04:31:03,507 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2018-04-13 04:31:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:31:03,507 INFO L225 Difference]: With dead ends: 159 [2018-04-13 04:31:03,507 INFO L226 Difference]: Without dead ends: 158 [2018-04-13 04:31:03,508 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=121, Invalid=870, Unknown=1, NotChecked=0, Total=992 [2018-04-13 04:31:03,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-13 04:31:03,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2018-04-13 04:31:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-13 04:31:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2018-04-13 04:31:03,510 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 41 [2018-04-13 04:31:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:31:03,510 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2018-04-13 04:31:03,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:31:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2018-04-13 04:31:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-13 04:31:03,511 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:31:03,511 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:31:03,511 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:31:03,511 INFO L82 PathProgramCache]: Analyzing trace with hash -807107502, now seen corresponding path program 2 times [2018-04-13 04:31:03,511 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:31:03,511 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:31:03,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:31:03,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:31:03,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:31:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:31:03,521 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:03,527 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:31:03,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:31:03,527 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:31:03,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:31:03,558 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:31:03,558 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:31:03,562 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:31:03,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:31:03,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:03,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:03,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:03,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:31:03,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-13 04:31:03,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:03,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:03,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-13 04:31:03,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:03,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:03,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:03,628 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:03,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:03,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:31:03,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-04-13 04:31:03,666 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 19 treesize of output 16 [2018-04-13 04:31:03,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-13 04:31:03,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:03,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:31:03,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:31:03,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-04-13 04:31:03,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:03,699 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 32 treesize of output 33 [2018-04-13 04:31:03,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:31:03,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:03,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:31:03,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 04:31:03,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-04-13 04:31:04,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:04,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-04-13 04:31:04,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 04:31:04,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:04,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-04-13 04:31:04,051 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:31:04,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:31:04,061 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:31:04,061 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:58, output treesize:65 [2018-04-13 04:31:04,588 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:31:04,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:31:04,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 04:31:04,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 04:31:04,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 04:31:04,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2018-04-13 04:31:04,589 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand 27 states. [2018-04-13 04:31:05,758 WARN L151 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 77 DAG size of output 77 [2018-04-13 04:31:06,020 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 68 DAG size of output 68 [2018-04-13 04:31:09,107 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 72 DAG size of output 72 [2018-04-13 04:31:09,291 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 73 DAG size of output 73 [2018-04-13 04:31:12,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:31:12,278 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-04-13 04:31:12,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 04:31:12,278 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 41 [2018-04-13 04:31:12,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:31:12,279 INFO L225 Difference]: With dead ends: 169 [2018-04-13 04:31:12,283 INFO L226 Difference]: Without dead ends: 168 [2018-04-13 04:31:12,283 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=199, Invalid=1693, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 04:31:12,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-13 04:31:12,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-04-13 04:31:12,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-13 04:31:12,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 186 transitions. [2018-04-13 04:31:12,285 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 186 transitions. Word has length 41 [2018-04-13 04:31:12,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:31:12,286 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 186 transitions. [2018-04-13 04:31:12,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 04:31:12,286 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 186 transitions. [2018-04-13 04:31:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 04:31:12,286 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:31:12,286 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:31:12,287 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:31:12,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1674982354, now seen corresponding path program 5 times [2018-04-13 04:31:12,287 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:31:12,287 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:31:12,288 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:31:12,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:31:12,288 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:31:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:31:12,302 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:12,318 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:31:12,318 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:31:12,318 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:31:12,319 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:31:12,354 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-04-13 04:31:12,354 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:31:12,357 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:31:12,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:12,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:12,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:31:12,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-13 04:31:12,393 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:31:12,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:31:12,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:31:12,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:39 [2018-04-13 04:31:12,451 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 43 treesize of output 40 [2018-04-13 04:31:12,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-13 04:31:12,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:12,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:31:12,488 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 42 treesize of output 39 [2018-04-13 04:31:12,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 14 treesize of output 13 [2018-04-13 04:31:12,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:12,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:31:12,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-13 04:31:12,522 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:86, output treesize:78 [2018-04-13 04:31:12,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:12,646 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 52 treesize of output 53 [2018-04-13 04:31:12,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:31:12,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:12,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:31:12,686 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 48 treesize of output 43 [2018-04-13 04:31:12,689 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 25 treesize of output 26 [2018-04-13 04:31:12,690 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:12,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:31:12,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-13 04:31:12,719 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:101, output treesize:93 [2018-04-13 04:31:15,120 WARN L148 SmtUtils]: Spent 2281ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-13 04:31:17,241 WARN L148 SmtUtils]: Spent 2108ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-13 04:31:19,425 WARN L148 SmtUtils]: Spent 2168ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-13 04:31:21,562 WARN L148 SmtUtils]: Spent 2110ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-13 04:31:29,464 WARN L151 SmtUtils]: Spent 5879ms on a formula simplification. DAG size of input: 56 DAG size of output 55 [2018-04-13 04:31:31,605 WARN L148 SmtUtils]: Spent 2114ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-13 04:31:35,772 WARN L148 SmtUtils]: Spent 2137ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-13 04:31:37,956 WARN L148 SmtUtils]: Spent 2133ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-13 04:31:37,969 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 80 treesize of output 75 [2018-04-13 04:31:37,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:37,971 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 76 treesize of output 71 [2018-04-13 04:31:37,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:37,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-13 04:31:37,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:157, output treesize:147 [2018-04-13 04:31:42,252 WARN L148 SmtUtils]: Spent 2217ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-13 04:31:44,449 WARN L148 SmtUtils]: Spent 2159ms on a formula simplification that was a NOOP. DAG size: 69 [2018-04-13 04:31:48,683 WARN L148 SmtUtils]: Spent 2187ms on a formula simplification that was a NOOP. DAG size: 72 [2018-04-13 04:31:50,815 WARN L148 SmtUtils]: Spent 2086ms on a formula simplification that was a NOOP. DAG size: 74 [2018-04-13 04:31:55,039 WARN L148 SmtUtils]: Spent 2156ms on a formula simplification that was a NOOP. DAG size: 77 [2018-04-13 04:31:57,455 WARN L148 SmtUtils]: Spent 2360ms on a formula simplification that was a NOOP. DAG size: 79 [2018-04-13 04:31:57,459 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 04:31:57,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:57,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:57,483 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 85 treesize of output 73 [2018-04-13 04:31:57,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:57,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:57,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:57,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:57,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:57,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:57,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:57,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:57,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:57,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:57,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:57,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:57,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:57,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:57,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:31:57,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 217 [2018-04-13 04:31:57,504 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:31:57,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 04:31:57,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 04:31:57,584 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:31:57,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 04:31:57,613 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:221, output treesize:144 [2018-04-13 04:31:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:31:57,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:31:57,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-13 04:31:57,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 04:31:57,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 04:31:57,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=586, Unknown=5, NotChecked=0, Total=650 [2018-04-13 04:31:57,772 INFO L87 Difference]: Start difference. First operand 167 states and 186 transitions. Second operand 26 states. [2018-04-13 04:32:00,327 WARN L151 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 55 DAG size of output 52 [2018-04-13 04:32:23,366 WARN L151 SmtUtils]: Spent 20971ms on a formula simplification. DAG size of input: 75 DAG size of output 72 [2018-04-13 04:32:34,285 WARN L148 SmtUtils]: Spent 10843ms on a formula simplification that was a NOOP. DAG size: 80 [2018-04-13 04:32:47,402 WARN L148 SmtUtils]: Spent 13061ms on a formula simplification that was a NOOP. DAG size: 107 [2018-04-13 04:33:54,112 WARN L151 SmtUtils]: Spent 66651ms on a formula simplification. DAG size of input: 113 DAG size of output 112 [2018-04-13 04:34:44,595 WARN L151 SmtUtils]: Spent 44392ms on a formula simplification. DAG size of input: 65 DAG size of output 65 [2018-04-13 04:35:45,000 WARN L151 SmtUtils]: Spent 58281ms on a formula simplification. DAG size of input: 71 DAG size of output 71 [2018-04-13 04:36:32,741 WARN L151 SmtUtils]: Spent 45677ms on a formula simplification. DAG size of input: 76 DAG size of output 75 [2018-04-13 04:37:20,516 WARN L151 SmtUtils]: Spent 45689ms on a formula simplification. DAG size of input: 81 DAG size of output 81 [2018-04-13 04:37:20,691 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 94 DAG size of output 67 [2018-04-13 04:37:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:37:20,853 INFO L93 Difference]: Finished difference Result 175 states and 194 transitions. [2018-04-13 04:37:20,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 04:37:20,853 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2018-04-13 04:37:20,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:37:20,854 INFO L225 Difference]: With dead ends: 175 [2018-04-13 04:37:20,854 INFO L226 Difference]: Without dead ends: 170 [2018-04-13 04:37:20,854 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 363.3s TimeCoverageRelationStatistics Valid=127, Invalid=1268, Unknown=11, NotChecked=0, Total=1406 [2018-04-13 04:37:20,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-13 04:37:20,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-04-13 04:37:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-13 04:37:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 189 transitions. [2018-04-13 04:37:20,857 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 189 transitions. Word has length 42 [2018-04-13 04:37:20,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:37:20,857 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 189 transitions. [2018-04-13 04:37:20,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 04:37:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 189 transitions. [2018-04-13 04:37:20,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 04:37:20,857 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:37:20,858 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:37:20,858 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:37:20,858 INFO L82 PathProgramCache]: Analyzing trace with hash -850150316, now seen corresponding path program 3 times [2018-04-13 04:37:20,858 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:37:20,858 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:37:20,859 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:37:20,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:37:20,859 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:37:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:37:20,870 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:37:20,872 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:37:20,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:37:20,872 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:37:20,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:37:20,906 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:37:20,906 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:37:20,909 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:37:20,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:37:20,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:37:20,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:37:20,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:37:20,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:37:20,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:37:20,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:37:20,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:37:20,938 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:37:20,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:37:20,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:37:20,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-13 04:37:20,959 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:37:20,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:37:20,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:37:20,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:37:20,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:37:20,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-13 04:37:21,033 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:37:21,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:37:21,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:37:21,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:37:21,050 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:37:21,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-13 04:37:21,073 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:37:21,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 8 treesize of output 7 [2018-04-13 04:37:21,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:37:21,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:37:21,085 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:37:21,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-13 04:37:21,122 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:37:21,127 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:37:21,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:37:21,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:37:21,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:37:21,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-04-13 04:37:21,203 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:37:21,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:37:21,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 04:37:21,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 04:37:21,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 04:37:21,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:37:21,204 INFO L87 Difference]: Start difference. First operand 170 states and 189 transitions. Second operand 17 states. [2018-04-13 04:37:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:37:21,537 INFO L93 Difference]: Finished difference Result 188 states and 205 transitions. [2018-04-13 04:37:21,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 04:37:21,537 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-04-13 04:37:21,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:37:21,538 INFO L225 Difference]: With dead ends: 188 [2018-04-13 04:37:21,538 INFO L226 Difference]: Without dead ends: 188 [2018-04-13 04:37:21,538 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2018-04-13 04:37:21,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-13 04:37:21,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 176. [2018-04-13 04:37:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-13 04:37:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 198 transitions. [2018-04-13 04:37:21,540 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 198 transitions. Word has length 42 [2018-04-13 04:37:21,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:37:21,540 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 198 transitions. [2018-04-13 04:37:21,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 04:37:21,540 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 198 transitions. [2018-04-13 04:37:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 04:37:21,540 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:37:21,540 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:37:21,540 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:37:21,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1775979440, now seen corresponding path program 3 times [2018-04-13 04:37:21,540 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:37:21,541 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:37:21,541 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:37:21,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:37:21,541 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:37:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:37:21,556 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:37:21,560 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:37:21,560 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:37:21,560 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:37:21,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:37:21,596 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-04-13 04:37:21,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:37:21,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:37:21,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 6 treesize of output 5 [2018-04-13 04:37:21,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:37:21,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:37:21,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:37:21,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:37:21,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:37:21,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:37:21,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:37:21,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:37:21,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:37:21,646 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:37:21,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:37:21,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:37:21,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-13 04:37:21,675 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 19 treesize of output 16 [2018-04-13 04:37:21,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-13 04:37:21,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:37:21,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:37:21,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:37:21,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-04-13 04:37:21,706 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 32 treesize of output 33 [2018-04-13 04:37:21,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:37:21,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:37:21,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:37:21,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 04:37:21,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2018-04-13 04:37:22,937 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 74 treesize of output 62 [2018-04-13 04:37:22,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-13 04:37:22,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:37:23,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 48 treesize of output 203 [2018-04-13 04:37:23,023 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-04-13 04:37:23,296 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 32768 conjuctions. This might take some time... [2018-04-13 04:40:07,612 INFO L170 XnfTransformerHelper]: Simplified to disjunction of 32768 conjuctions. [2018-04-13 04:40:10,726 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 16896 xjuncts. Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown