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_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 04:25:23,840 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 04:25:23,841 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 04:25:23,853 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 04:25:23,854 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 04:25:23,854 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 04:25:23,855 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 04:25:23,857 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 04:25:23,858 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 04:25:23,859 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 04:25:23,860 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 04:25:23,860 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 04:25:23,861 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 04:25:23,862 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 04:25:23,862 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 04:25:23,864 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 04:25:23,865 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 04:25:23,866 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 04:25:23,867 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 04:25:23,868 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 04:25:23,870 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 04:25:23,870 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 04:25:23,870 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 04:25:23,871 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 04:25:23,872 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 04:25:23,873 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 04:25:23,873 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 04:25:23,874 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 04:25:23,874 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 04:25:23,874 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 04:25:23,874 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 04:25:23,875 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:25:23,884 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 04:25:23,884 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 04:25:23,885 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 04:25:23,885 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 04:25:23,885 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 04:25:23,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 04:25:23,885 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 04:25:23,886 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 04:25:23,886 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 04:25:23,886 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 04:25:23,886 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 04:25:23,886 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 04:25:23,886 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 04:25:23,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 04:25:23,886 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 04:25:23,886 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 04:25:23,886 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 04:25:23,887 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 04:25:23,887 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 04:25:23,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 04:25:23,887 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 04:25:23,887 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 04:25:23,887 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 04:25:23,887 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:25:23,912 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 04:25:23,921 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 04:25:23,923 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 04:25:23,924 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 04:25:23,925 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 04:25:23,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,199 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe42de5465 [2018-04-13 04:25:24,346 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 04:25:24,346 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 04:25:24,347 INFO L168 CDTParser]: Scanning openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,355 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 04:25:24,355 INFO L215 ultiparseSymbolTable]: [2018-04-13 04:25:24,355 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 04:25:24,355 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,356 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpy ('cstrlcpy') in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,356 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,356 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,356 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 04:25:24,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,356 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,357 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,358 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,359 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,360 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,361 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,362 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,363 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,364 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:24,377 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe42de5465 [2018-04-13 04:25:24,381 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 04:25:24,382 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 04:25:24,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 04:25:24,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 04:25:24,388 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 04:25:24,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:25:24" (1/1) ... [2018-04-13 04:25:24,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1e2b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:25:24, skipping insertion in model container [2018-04-13 04:25:24,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:25:24" (1/1) ... [2018-04-13 04:25:24,404 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 04:25:24,425 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 04:25:24,573 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 04:25:24,611 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 04:25:24,617 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-13 04:25:24,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:25:24 WrapperNode [2018-04-13 04:25:24,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 04:25:24,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 04:25:24,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 04:25:24,654 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 04:25:24,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:25:24" (1/1) ... [2018-04-13 04:25:24,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:25:24" (1/1) ... [2018-04-13 04:25:24,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:25:24" (1/1) ... [2018-04-13 04:25:24,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:25:24" (1/1) ... [2018-04-13 04:25:24,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:25:24" (1/1) ... [2018-04-13 04:25:24,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:25:24" (1/1) ... [2018-04-13 04:25:24,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:25:24" (1/1) ... [2018-04-13 04:25:24,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 04:25:24,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 04:25:24,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 04:25:24,699 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 04:25:24,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:25:24" (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:25:24,780 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 04:25:24,780 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 04:25:24,780 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 04:25:24,781 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 04:25:24,781 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpy [2018-04-13 04:25:24,781 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 04:25:24,781 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 04:25:24,781 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 04:25:24,781 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 04:25:24,781 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 04:25:24,781 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 04:25:24,781 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 04:25:24,781 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 04:25:24,781 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 04:25:24,781 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 04:25:24,782 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 04:25:24,782 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 04:25:24,782 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 04:25:24,782 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 04:25:24,782 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 04:25:24,782 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 04:25:24,782 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 04:25:24,782 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 04:25:24,783 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 04:25:24,783 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 04:25:24,783 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 04:25:24,783 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 04:25:24,783 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 04:25:24,783 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 04:25:24,783 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 04:25:24,783 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 04:25:24,783 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 04:25:24,784 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 04:25:24,784 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 04:25:24,784 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 04:25:24,784 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 04:25:24,784 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 04:25:24,784 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 04:25:24,784 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 04:25:24,784 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 04:25:24,784 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 04:25:24,785 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 04:25:24,785 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 04:25:24,785 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 04:25:24,785 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 04:25:24,785 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 04:25:24,785 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 04:25:24,785 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 04:25:24,785 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 04:25:24,785 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 04:25:24,785 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 04:25:24,786 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 04:25:24,786 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 04:25:24,786 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 04:25:24,786 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 04:25:24,786 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 04:25:24,786 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 04:25:24,786 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 04:25:24,786 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 04:25:24,786 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 04:25:24,787 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 04:25:24,787 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 04:25:24,787 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 04:25:24,787 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 04:25:24,787 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 04:25:24,787 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 04:25:24,787 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 04:25:24,787 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 04:25:24,787 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 04:25:24,788 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 04:25:24,788 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 04:25:24,788 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 04:25:24,788 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 04:25:24,788 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 04:25:24,788 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 04:25:24,788 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 04:25:24,788 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 04:25:24,788 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 04:25:24,788 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 04:25:24,789 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 04:25:24,789 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 04:25:24,789 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 04:25:24,789 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 04:25:24,789 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 04:25:24,789 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 04:25:24,789 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 04:25:24,789 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 04:25:24,789 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 04:25:24,789 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 04:25:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 04:25:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 04:25:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 04:25:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 04:25:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 04:25:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 04:25:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 04:25:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 04:25:24,790 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 04:25:24,791 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 04:25:24,791 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 04:25:24,791 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 04:25:24,791 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 04:25:24,791 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 04:25:24,791 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 04:25:24,791 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 04:25:24,791 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 04:25:24,791 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 04:25:24,791 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 04:25:24,791 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 04:25:24,792 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpy [2018-04-13 04:25:24,792 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 04:25:24,792 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 04:25:24,792 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 04:25:24,792 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 04:25:24,792 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 04:25:24,792 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 04:25:24,792 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 04:25:24,792 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 04:25:25,084 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 04:25:25,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:25:25 BoogieIcfgContainer [2018-04-13 04:25:25,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 04:25:25,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 04:25:25,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 04:25:25,087 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 04:25:25,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 04:25:24" (1/3) ... [2018-04-13 04:25:25,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5983b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:25:25, skipping insertion in model container [2018-04-13 04:25:25,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:25:24" (2/3) ... [2018-04-13 04:25:25,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5983b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:25:25, skipping insertion in model container [2018-04-13 04:25:25,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:25:25" (3/3) ... [2018-04-13 04:25:25,089 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:25:25,095 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 04:25:25,099 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-04-13 04:25:25,123 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 04:25:25,124 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 04:25:25,124 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 04:25:25,124 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 04:25:25,124 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 04:25:25,124 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 04:25:25,124 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 04:25:25,124 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 04:25:25,124 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 04:25:25,125 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 04:25:25,133 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-04-13 04:25:25,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 04:25:25,140 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:25,141 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:25,141 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:25,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1063371436, now seen corresponding path program 1 times [2018-04-13 04:25:25,145 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:25,145 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:25,173 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:25,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:25,173 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:25,212 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:25,225 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:25,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:25,226 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:25,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:25,266 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:25,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:25,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:25,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:25,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:25:25,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:25,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:25,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 04:25:25,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:25,333 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:25:25,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-13 04:25:25,345 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:25:25,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:25,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:25:25,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:25:25,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:25:25,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:25:25,358 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 5 states. [2018-04-13 04:25:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:25,445 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-04-13 04:25:25,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 04:25:25,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-04-13 04:25:25,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:25,455 INFO L225 Difference]: With dead ends: 54 [2018-04-13 04:25:25,456 INFO L226 Difference]: Without dead ends: 51 [2018-04-13 04:25:25,457 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-13 04:25:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-13 04:25:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-13 04:25:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-13 04:25:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-04-13 04:25:25,487 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 13 [2018-04-13 04:25:25,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:25,487 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-04-13 04:25:25,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:25:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-04-13 04:25:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 04:25:25,488 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:25,488 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:25,488 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:25,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1063371435, now seen corresponding path program 1 times [2018-04-13 04:25:25,488 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:25,488 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:25,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:25,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:25,490 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:25,501 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:25,506 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:25,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:25,506 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:25,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:25,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:25,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:25,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:25,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:25,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:25,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:25,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:25:25,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:25,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:25:25,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:25,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:25,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:25,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:25,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:25,614 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:25:25,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 04:25:25,623 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:25:25,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:25,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:25:25,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:25:25,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:25:25,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:25:25,625 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2018-04-13 04:25:25,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:25,722 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-04-13 04:25:25,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:25:25,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-13 04:25:25,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:25,723 INFO L225 Difference]: With dead ends: 50 [2018-04-13 04:25:25,723 INFO L226 Difference]: Without dead ends: 50 [2018-04-13 04:25:25,724 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-13 04:25:25,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-13 04:25:25,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-13 04:25:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-13 04:25:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-04-13 04:25:25,729 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2018-04-13 04:25:25,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:25,729 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-04-13 04:25:25,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:25:25,729 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-04-13 04:25:25,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 04:25:25,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:25,729 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:25,729 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:25,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1395223911, now seen corresponding path program 1 times [2018-04-13 04:25:25,730 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:25,730 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:25,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:25,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:25,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:25,740 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:25,758 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:25:25,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:25,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 04:25:25,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 04:25:25,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 04:25:25,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 04:25:25,759 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-04-13 04:25:25,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:25,796 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-04-13 04:25:25,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 04:25:25,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-13 04:25:25,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:25,797 INFO L225 Difference]: With dead ends: 49 [2018-04-13 04:25:25,797 INFO L226 Difference]: Without dead ends: 49 [2018-04-13 04:25:25,797 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:25:25,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-13 04:25:25,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-13 04:25:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-13 04:25:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-04-13 04:25:25,800 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 14 [2018-04-13 04:25:25,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:25,800 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-04-13 04:25:25,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 04:25:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-04-13 04:25:25,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 04:25:25,800 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:25,800 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:25,800 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:25,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1395223912, now seen corresponding path program 1 times [2018-04-13 04:25:25,800 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:25,801 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:25,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:25,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:25,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:25,808 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:25,838 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:25:25,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:25,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:25:25,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:25:25,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:25:25,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:25:25,839 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-04-13 04:25:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:25,876 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-04-13 04:25:25,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:25:25,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-13 04:25:25,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:25,877 INFO L225 Difference]: With dead ends: 48 [2018-04-13 04:25:25,878 INFO L226 Difference]: Without dead ends: 48 [2018-04-13 04:25:25,878 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:25:25,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-13 04:25:25,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-13 04:25:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-13 04:25:25,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-04-13 04:25:25,881 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 14 [2018-04-13 04:25:25,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:25,882 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-04-13 04:25:25,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:25:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-04-13 04:25:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-13 04:25:25,882 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:25,882 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] [2018-04-13 04:25:25,883 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:25,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1589078277, now seen corresponding path program 1 times [2018-04-13 04:25:25,883 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:25,883 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:25,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:25,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:25,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:25,893 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:25,917 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:25:25,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:25,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:25:25,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:25:25,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:25:25,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:25:25,918 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 5 states. [2018-04-13 04:25:25,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:25,957 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-04-13 04:25:25,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 04:25:25,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-04-13 04:25:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:25,958 INFO L225 Difference]: With dead ends: 47 [2018-04-13 04:25:25,958 INFO L226 Difference]: Without dead ends: 47 [2018-04-13 04:25:25,958 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:25:25,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-13 04:25:25,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-13 04:25:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-13 04:25:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-04-13 04:25:25,962 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-04-13 04:25:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:25,962 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-04-13 04:25:25,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:25:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-04-13 04:25:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-13 04:25:25,963 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:25,963 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] [2018-04-13 04:25:25,963 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:25,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1589078278, now seen corresponding path program 1 times [2018-04-13 04:25:25,963 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:25,963 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:25,964 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:25,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:25,964 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:25,976 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:26,067 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:25:26,068 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:26,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:25:26,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:25:26,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:25:26,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:25:26,068 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 8 states. [2018-04-13 04:25:26,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:26,157 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-04-13 04:25:26,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 04:25:26,157 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-04-13 04:25:26,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:26,159 INFO L225 Difference]: With dead ends: 62 [2018-04-13 04:25:26,159 INFO L226 Difference]: Without dead ends: 62 [2018-04-13 04:25:26,160 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:25:26,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-13 04:25:26,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-04-13 04:25:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-13 04:25:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-04-13 04:25:26,162 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 20 [2018-04-13 04:25:26,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:26,163 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-04-13 04:25:26,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:25:26,163 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-04-13 04:25:26,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-13 04:25:26,163 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:26,163 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:25:26,163 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:26,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1991019242, now seen corresponding path program 1 times [2018-04-13 04:25:26,164 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:26,164 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:26,164 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:26,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:26,165 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:26,175 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:26,212 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:26,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:25:26,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:25:26,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:25:26,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:25:26,213 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-04-13 04:25:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:26,276 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-04-13 04:25:26,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:25:26,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-13 04:25:26,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:26,278 INFO L225 Difference]: With dead ends: 52 [2018-04-13 04:25:26,278 INFO L226 Difference]: Without dead ends: 52 [2018-04-13 04:25:26,278 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:25:26,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-13 04:25:26,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-13 04:25:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-13 04:25:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-04-13 04:25:26,280 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 21 [2018-04-13 04:25:26,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:26,280 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-04-13 04:25:26,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:25:26,282 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-04-13 04:25:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-13 04:25:26,282 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:26,283 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:25:26,283 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:26,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1991019243, now seen corresponding path program 1 times [2018-04-13 04:25:26,283 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:26,283 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:26,283 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:26,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:26,284 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:26,292 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:26,365 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:25:26,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:26,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 04:25:26,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 04:25:26,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 04:25:26,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-13 04:25:26,366 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-04-13 04:25:26,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:26,445 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-04-13 04:25:26,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 04:25:26,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-13 04:25:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:26,446 INFO L225 Difference]: With dead ends: 62 [2018-04-13 04:25:26,446 INFO L226 Difference]: Without dead ends: 62 [2018-04-13 04:25:26,446 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:25:26,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-13 04:25:26,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-04-13 04:25:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-13 04:25:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-04-13 04:25:26,450 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 21 [2018-04-13 04:25:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:26,450 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-04-13 04:25:26,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 04:25:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-04-13 04:25:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 04:25:26,451 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:26,451 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] [2018-04-13 04:25:26,451 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:26,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1903975895, now seen corresponding path program 1 times [2018-04-13 04:25:26,451 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:26,451 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:26,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:26,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:26,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:26,460 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:26,492 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:25:26,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:26,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:25:26,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:25:26,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:25:26,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:25:26,493 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-04-13 04:25:26,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:26,538 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-04-13 04:25:26,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:25:26,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-04-13 04:25:26,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:26,539 INFO L225 Difference]: With dead ends: 52 [2018-04-13 04:25:26,539 INFO L226 Difference]: Without dead ends: 52 [2018-04-13 04:25:26,539 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:25:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-13 04:25:26,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-13 04:25:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-13 04:25:26,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-04-13 04:25:26,542 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-04-13 04:25:26,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:26,542 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-04-13 04:25:26,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:25:26,542 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-04-13 04:25:26,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 04:25:26,543 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:26,543 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] [2018-04-13 04:25:26,543 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:26,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1903975894, now seen corresponding path program 1 times [2018-04-13 04:25:26,543 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:26,543 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:26,544 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:26,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:26,544 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:26,552 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:26,600 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:25:26,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:26,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 04:25:26,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 04:25:26,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 04:25:26,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-13 04:25:26,600 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-04-13 04:25:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:26,710 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-04-13 04:25:26,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 04:25:26,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-13 04:25:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:26,711 INFO L225 Difference]: With dead ends: 59 [2018-04-13 04:25:26,711 INFO L226 Difference]: Without dead ends: 59 [2018-04-13 04:25:26,712 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:25:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-13 04:25:26,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-04-13 04:25:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-13 04:25:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-04-13 04:25:26,715 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2018-04-13 04:25:26,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:26,715 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-04-13 04:25:26,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 04:25:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-04-13 04:25:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 04:25:26,716 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:26,716 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] [2018-04-13 04:25:26,716 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:26,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1592054348, now seen corresponding path program 1 times [2018-04-13 04:25:26,716 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:26,717 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:26,717 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:26,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:26,717 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:26,724 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:26,750 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:25:26,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:26,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:25:26,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:25:26,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:25:26,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:25:26,751 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 6 states. [2018-04-13 04:25:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:26,793 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-04-13 04:25:26,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:25:26,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-04-13 04:25:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:26,794 INFO L225 Difference]: With dead ends: 54 [2018-04-13 04:25:26,794 INFO L226 Difference]: Without dead ends: 54 [2018-04-13 04:25:26,794 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:25:26,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-13 04:25:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-13 04:25:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-13 04:25:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-04-13 04:25:26,797 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 22 [2018-04-13 04:25:26,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:26,797 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-04-13 04:25:26,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:25:26,798 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-04-13 04:25:26,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 04:25:26,798 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:26,798 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] [2018-04-13 04:25:26,798 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:26,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1592054349, now seen corresponding path program 1 times [2018-04-13 04:25:26,799 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:26,799 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:26,799 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:26,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:26,799 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:26,807 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:26,873 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:25:26,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:26,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-13 04:25:26,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 04:25:26,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 04:25:26,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-13 04:25:26,874 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 9 states. [2018-04-13 04:25:27,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:27,005 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-04-13 04:25:27,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 04:25:27,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-13 04:25:27,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:27,006 INFO L225 Difference]: With dead ends: 64 [2018-04-13 04:25:27,006 INFO L226 Difference]: Without dead ends: 64 [2018-04-13 04:25:27,006 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-04-13 04:25:27,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-13 04:25:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-04-13 04:25:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-13 04:25:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-04-13 04:25:27,009 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2018-04-13 04:25:27,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:27,009 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-04-13 04:25:27,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 04:25:27,009 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-04-13 04:25:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 04:25:27,010 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:27,010 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:27,010 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:27,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2110691807, now seen corresponding path program 1 times [2018-04-13 04:25:27,010 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:27,011 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:27,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:27,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:27,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:27,024 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 04:25:27,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:27,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 04:25:27,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:25:27,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:25:27,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:25:27,054 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 6 states. [2018-04-13 04:25:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:27,075 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-04-13 04:25:27,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:25:27,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-13 04:25:27,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:27,076 INFO L225 Difference]: With dead ends: 55 [2018-04-13 04:25:27,076 INFO L226 Difference]: Without dead ends: 55 [2018-04-13 04:25:27,076 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-13 04:25:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-04-13 04:25:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-04-13 04:25:27,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-13 04:25:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-04-13 04:25:27,078 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 26 [2018-04-13 04:25:27,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:27,079 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-04-13 04:25:27,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:25:27,079 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-04-13 04:25:27,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 04:25:27,079 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:27,079 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] [2018-04-13 04:25:27,080 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:27,080 INFO L82 PathProgramCache]: Analyzing trace with hash -531063271, now seen corresponding path program 1 times [2018-04-13 04:25:27,080 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:27,080 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:27,080 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:27,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:27,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:27,092 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:27,096 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:27,096 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:27,096 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:27,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:27,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:27,123 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:25:27,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:27,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:25:27,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 04:25:27,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 04:25:27,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 04:25:27,124 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 4 states. [2018-04-13 04:25:27,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:27,139 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-04-13 04:25:27,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 04:25:27,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-04-13 04:25:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:27,143 INFO L225 Difference]: With dead ends: 59 [2018-04-13 04:25:27,143 INFO L226 Difference]: Without dead ends: 59 [2018-04-13 04:25:27,144 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 04:25:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-13 04:25:27,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-04-13 04:25:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-13 04:25:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-04-13 04:25:27,149 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 26 [2018-04-13 04:25:27,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:27,149 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-04-13 04:25:27,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 04:25:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-04-13 04:25:27,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-13 04:25:27,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:27,150 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:27,150 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:27,151 INFO L82 PathProgramCache]: Analyzing trace with hash 867982438, now seen corresponding path program 1 times [2018-04-13 04:25:27,151 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:27,151 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:27,151 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:27,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:27,152 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:27,160 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 04:25:27,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:27,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 04:25:27,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:25:27,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:25:27,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:25:27,191 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 6 states. [2018-04-13 04:25:27,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:27,213 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-04-13 04:25:27,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:25:27,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-04-13 04:25:27,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:27,214 INFO L225 Difference]: With dead ends: 56 [2018-04-13 04:25:27,214 INFO L226 Difference]: Without dead ends: 56 [2018-04-13 04:25:27,214 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-13 04:25:27,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-04-13 04:25:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-04-13 04:25:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-13 04:25:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-04-13 04:25:27,217 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 27 [2018-04-13 04:25:27,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:27,217 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-04-13 04:25:27,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:25:27,217 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-04-13 04:25:27,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-13 04:25:27,218 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:27,218 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:27,218 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:27,218 INFO L82 PathProgramCache]: Analyzing trace with hash 717922773, now seen corresponding path program 1 times [2018-04-13 04:25:27,218 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:27,219 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:27,219 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:27,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:27,219 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:27,231 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:27,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:27,317 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:27,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-13 04:25:27,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 04:25:27,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 04:25:27,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-13 04:25:27,318 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 10 states. [2018-04-13 04:25:27,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:27,425 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2018-04-13 04:25:27,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 04:25:27,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-04-13 04:25:27,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:27,426 INFO L225 Difference]: With dead ends: 97 [2018-04-13 04:25:27,426 INFO L226 Difference]: Without dead ends: 97 [2018-04-13 04:25:27,426 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:25:27,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-13 04:25:27,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2018-04-13 04:25:27,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-13 04:25:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-04-13 04:25:27,429 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 27 [2018-04-13 04:25:27,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:27,429 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-04-13 04:25:27,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 04:25:27,429 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-04-13 04:25:27,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-13 04:25:27,430 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:27,430 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:27,430 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:27,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1140624599, now seen corresponding path program 1 times [2018-04-13 04:25:27,430 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:27,430 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:27,431 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:27,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:27,431 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:27,442 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:27,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:27,547 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:27,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:27,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:27,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:25:27,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:27,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:27,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:25:27,613 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:25:27,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:27,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:27,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:27,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:27,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-13 04:25:27,724 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:25:27,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:25:27,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:27,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:27,742 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:25:27,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:54 [2018-04-13 04:25:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:27,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:25:27,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-04-13 04:25:27,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 04:25:27,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 04:25:27,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-04-13 04:25:27,826 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 21 states. [2018-04-13 04:25:28,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:28,315 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2018-04-13 04:25:28,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 04:25:28,315 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-04-13 04:25:28,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:28,316 INFO L225 Difference]: With dead ends: 127 [2018-04-13 04:25:28,316 INFO L226 Difference]: Without dead ends: 127 [2018-04-13 04:25:28,317 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2018-04-13 04:25:28,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-13 04:25:28,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2018-04-13 04:25:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-13 04:25:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2018-04-13 04:25:28,320 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 27 [2018-04-13 04:25:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:28,320 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2018-04-13 04:25:28,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 04:25:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2018-04-13 04:25:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 04:25:28,321 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:28,321 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 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:25:28,321 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:28,321 INFO L82 PathProgramCache]: Analyzing trace with hash 999624161, now seen corresponding path program 1 times [2018-04-13 04:25:28,322 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:28,322 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:28,322 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:28,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:28,323 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:28,332 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:28,337 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:28,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:28,337 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:28,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:28,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:28,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:28,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:28,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:25:28,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:28,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:28,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:28,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:25:28,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,443 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:25:28,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 04:25:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:28,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:28,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 04:25:28,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 04:25:28,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 04:25:28,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-04-13 04:25:28,566 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand 13 states. [2018-04-13 04:25:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:28,844 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2018-04-13 04:25:28,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 04:25:28,844 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-04-13 04:25:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:28,844 INFO L225 Difference]: With dead ends: 100 [2018-04-13 04:25:28,844 INFO L226 Difference]: Without dead ends: 100 [2018-04-13 04:25:28,845 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-04-13 04:25:28,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-13 04:25:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2018-04-13 04:25:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-13 04:25:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2018-04-13 04:25:28,847 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 28 [2018-04-13 04:25:28,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:28,847 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2018-04-13 04:25:28,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 04:25:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2018-04-13 04:25:28,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 04:25:28,847 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:28,847 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:28,847 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:28,847 INFO L82 PathProgramCache]: Analyzing trace with hash 923537165, now seen corresponding path program 1 times [2018-04-13 04:25:28,848 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:28,848 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:28,848 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:28,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:28,848 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:28,854 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:28,859 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:28,859 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:28,859 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:28,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:28,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:28,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:28,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,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 6 treesize of output 5 [2018-04-13 04:25:28,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:25:28,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:28,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:28,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:28,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:25:28,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:28,967 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:25:28,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 04:25:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:29,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:29,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-13 04:25:29,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 04:25:29,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 04:25:29,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-13 04:25:29,076 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand 11 states. [2018-04-13 04:25:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:29,272 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2018-04-13 04:25:29,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 04:25:29,272 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-04-13 04:25:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:29,273 INFO L225 Difference]: With dead ends: 107 [2018-04-13 04:25:29,273 INFO L226 Difference]: Without dead ends: 107 [2018-04-13 04:25:29,274 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:25:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-13 04:25:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2018-04-13 04:25:29,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-13 04:25:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2018-04-13 04:25:29,276 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 29 [2018-04-13 04:25:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:29,276 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-04-13 04:25:29,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 04:25:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-04-13 04:25:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 04:25:29,276 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:29,276 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:29,277 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:29,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1163118827, now seen corresponding path program 1 times [2018-04-13 04:25:29,277 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:29,277 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:29,277 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:29,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:29,277 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:29,284 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:29,286 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:29,286 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:29,286 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:29,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:29,302 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:29,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:29,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:25:29,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:29,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:29,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:29,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-13 04:25:29,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 04:25:29,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 04:25:29,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,348 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:25:29,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-13 04:25:29,402 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 22 treesize of output 23 [2018-04-13 04:25:29,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:29,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,416 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 1 xjuncts. [2018-04-13 04:25:29,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:36 [2018-04-13 04:25:29,463 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 25 treesize of output 23 [2018-04-13 04:25:29,465 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:25:29,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,470 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 04:25:29,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-04-13 04:25:29,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,481 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:46, output treesize:3 [2018-04-13 04:25:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:29,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:29,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-13 04:25:29,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 04:25:29,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 04:25:29,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-04-13 04:25:29,493 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 13 states. [2018-04-13 04:25:29,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:29,816 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-04-13 04:25:29,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 04:25:29,817 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-04-13 04:25:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:29,817 INFO L225 Difference]: With dead ends: 112 [2018-04-13 04:25:29,817 INFO L226 Difference]: Without dead ends: 112 [2018-04-13 04:25:29,818 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2018-04-13 04:25:29,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-13 04:25:29,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-04-13 04:25:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-13 04:25:29,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2018-04-13 04:25:29,820 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 30 [2018-04-13 04:25:29,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:29,820 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2018-04-13 04:25:29,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 04:25:29,820 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2018-04-13 04:25:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 04:25:29,821 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:29,821 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] [2018-04-13 04:25:29,821 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:29,821 INFO L82 PathProgramCache]: Analyzing trace with hash -321005100, now seen corresponding path program 1 times [2018-04-13 04:25:29,821 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:29,821 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:29,822 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:29,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:29,822 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:29,829 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:29,831 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:29,831 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:29,831 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:29,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:29,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:29,854 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:25:29,855 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:29,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:25:29,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 04:25:29,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 04:25:29,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 04:25:29,855 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand 4 states. [2018-04-13 04:25:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:29,866 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2018-04-13 04:25:29,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 04:25:29,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-04-13 04:25:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:29,867 INFO L225 Difference]: With dead ends: 98 [2018-04-13 04:25:29,868 INFO L226 Difference]: Without dead ends: 98 [2018-04-13 04:25:29,868 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 04:25:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-13 04:25:29,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2018-04-13 04:25:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-13 04:25:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-04-13 04:25:29,870 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 30 [2018-04-13 04:25:29,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:29,871 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-04-13 04:25:29,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 04:25:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-04-13 04:25:29,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-13 04:25:29,871 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:29,871 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:29,871 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:29,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1029105321, now seen corresponding path program 1 times [2018-04-13 04:25:29,872 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:29,872 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:29,872 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:29,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:29,873 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:29,880 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:29,883 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:29,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:29,883 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:29,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:29,905 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:29,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:25:29,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:25:29,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:29,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:29,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:29,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:29,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-13 04:25:29,949 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:25:29,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:29,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:29,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-04-13 04:25:30,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 24 treesize of output 25 [2018-04-13 04:25:30,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:30,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:30,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:30,039 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:25:30,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 [2018-04-13 04:25:30,104 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 29 treesize of output 27 [2018-04-13 04:25:30,112 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:25:30,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:30,124 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:25:30,124 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:30,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:30,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:30,136 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:54 [2018-04-13 04:25:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:30,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:30,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 04:25:30,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 04:25:30,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 04:25:30,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-04-13 04:25:30,221 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 14 states. [2018-04-13 04:25:30,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:30,642 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-04-13 04:25:30,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 04:25:30,644 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-04-13 04:25:30,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:30,644 INFO L225 Difference]: With dead ends: 108 [2018-04-13 04:25:30,645 INFO L226 Difference]: Without dead ends: 108 [2018-04-13 04:25:30,645 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2018-04-13 04:25:30,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-13 04:25:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2018-04-13 04:25:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-13 04:25:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-04-13 04:25:30,646 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 30 [2018-04-13 04:25:30,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:30,647 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-04-13 04:25:30,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 04:25:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-04-13 04:25:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 04:25:30,647 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:30,647 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:30,647 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:30,647 INFO L82 PathProgramCache]: Analyzing trace with hash -464827512, now seen corresponding path program 1 times [2018-04-13 04:25:30,647 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:30,648 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:30,648 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:30,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:30,648 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:30,656 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:30,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:30,778 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:30,778 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:30,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:30,795 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:30,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:30,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:30,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:30,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 04:25:30,854 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:25:30,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:30,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:30,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:30,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:30,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:23 [2018-04-13 04:25:30,947 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:25:30,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-04-13 04:25:30,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:30,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:30,970 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:25:30,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:54 [2018-04-13 04:25:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:31,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:25:31,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-13 04:25:31,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 04:25:31,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 04:25:31,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-04-13 04:25:31,080 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 21 states. [2018-04-13 04:25:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:31,464 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2018-04-13 04:25:31,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 04:25:31,465 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2018-04-13 04:25:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:31,465 INFO L225 Difference]: With dead ends: 118 [2018-04-13 04:25:31,465 INFO L226 Difference]: Without dead ends: 118 [2018-04-13 04:25:31,466 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2018-04-13 04:25:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-04-13 04:25:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 96. [2018-04-13 04:25:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-13 04:25:31,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-04-13 04:25:31,468 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 32 [2018-04-13 04:25:31,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:31,468 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-04-13 04:25:31,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 04:25:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-04-13 04:25:31,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 04:25:31,469 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:31,469 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] [2018-04-13 04:25:31,469 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:31,469 INFO L82 PathProgramCache]: Analyzing trace with hash -964301604, now seen corresponding path program 1 times [2018-04-13 04:25:31,469 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:31,469 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:31,470 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:31,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:31,470 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:31,477 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:31,479 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:31,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:31,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:31,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:31,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:31,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:31,530 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:25:31,531 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:25:31,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:31,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:31,537 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:25:31,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-13 04:25:31,553 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-13 04:25:31,557 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-13 04:25:31,559 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:25:31,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:25:31,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:25:31,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:25:31,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:25:31,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-13 04:25:31,560 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 8 states. [2018-04-13 04:25:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:31,668 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2018-04-13 04:25:31,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 04:25:31,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-13 04:25:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:31,669 INFO L225 Difference]: With dead ends: 95 [2018-04-13 04:25:31,669 INFO L226 Difference]: Without dead ends: 58 [2018-04-13 04:25:31,669 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 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:25:31,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-13 04:25:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-04-13 04:25:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-13 04:25:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-04-13 04:25:31,671 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 33 [2018-04-13 04:25:31,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:31,671 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-04-13 04:25:31,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:25:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-04-13 04:25:31,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 04:25:31,672 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:31,672 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:31,672 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:31,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1721008833, now seen corresponding path program 2 times [2018-04-13 04:25:31,672 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:31,672 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:31,673 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:31,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:31,673 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:31,686 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:31,690 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:31,690 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:31,691 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:31,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:25:31,727 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:25:31,727 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:31,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:31,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:31,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:31,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:31,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:25:31,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:31,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:31,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:31,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:31,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:31,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:31,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:31,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-13 04:25:31,787 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:25:31,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:31,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:31,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:31,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:31,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-04-13 04:25:31,886 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:25:31,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 04:25:31,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:31,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:31,900 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:25:31,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:23 [2018-04-13 04:25:31,953 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:25:31,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:25:31,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:31,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:31,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:31,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-04-13 04:25:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:32,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:32,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 04:25:32,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:25:32,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:25:32,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:25:32,034 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 16 states. [2018-04-13 04:25:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:32,387 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-04-13 04:25:32,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 04:25:32,387 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-04-13 04:25:32,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:32,387 INFO L225 Difference]: With dead ends: 80 [2018-04-13 04:25:32,387 INFO L226 Difference]: Without dead ends: 80 [2018-04-13 04:25:32,387 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2018-04-13 04:25:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-13 04:25:32,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2018-04-13 04:25:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-13 04:25:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-04-13 04:25:32,389 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 33 [2018-04-13 04:25:32,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:32,389 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-04-13 04:25:32,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:25:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-04-13 04:25:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 04:25:32,390 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:32,390 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:32,390 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:32,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1811666231, now seen corresponding path program 2 times [2018-04-13 04:25:32,390 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:32,390 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:32,391 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:32,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:32,391 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:32,400 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:32,402 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:32,402 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:32,402 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:32,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:25:32,433 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:25:32,433 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:32,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:32,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:32,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:32,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:32,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 04:25:32,462 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:25:32,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:32,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:32,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:29 [2018-04-13 04:25:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:32,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:32,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 04:25:32,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 04:25:32,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 04:25:32,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:25:32,881 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 17 states. [2018-04-13 04:25:33,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:33,663 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-04-13 04:25:33,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 04:25:33,663 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-04-13 04:25:33,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:33,664 INFO L225 Difference]: With dead ends: 65 [2018-04-13 04:25:33,664 INFO L226 Difference]: Without dead ends: 65 [2018-04-13 04:25:33,664 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2018-04-13 04:25:33,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-13 04:25:33,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-04-13 04:25:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-13 04:25:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-04-13 04:25:33,665 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 34 [2018-04-13 04:25:33,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:33,666 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-04-13 04:25:33,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 04:25:33,666 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-04-13 04:25:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 04:25:33,666 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:33,666 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 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:25:33,666 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:33,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1421890336, now seen corresponding path program 2 times [2018-04-13 04:25:33,667 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:33,667 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:33,667 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:33,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:33,668 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:33,678 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:33,682 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:33,682 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:33,682 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:33,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:25:33,714 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:25:33,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:33,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:33,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:33,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:33,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:33,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 04:25:33,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:33,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:33,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:33,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:33,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:33,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:33,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:33,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-13 04:25:33,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-13 04:25:33,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 04:25:33,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:33,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:33,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:33,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-04-13 04:25:33,796 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 27 treesize of output 28 [2018-04-13 04:25:33,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 13 treesize of output 12 [2018-04-13 04:25:33,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:33,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:33,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:33,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-04-13 04:25:33,965 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 04:25:33,968 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 36 [2018-04-13 04:25:33,974 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 04:25:33,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-04-13 04:25:33,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:33,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:34,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 04:25:34,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:52 [2018-04-13 04:25:34,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:34,423 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 36 treesize of output 36 [2018-04-13 04:25:34,428 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 12 treesize of output 17 [2018-04-13 04:25:34,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:34,436 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 21 treesize of output 25 [2018-04-13 04:25:34,436 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:34,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:34,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:34,467 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:67, output treesize:46 [2018-04-13 04:25:34,533 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:25:34,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:34,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 04:25:34,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 04:25:34,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 04:25:34,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-04-13 04:25:34,534 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 21 states. [2018-04-13 04:25:39,186 WARN L151 SmtUtils]: Spent 2134ms on a formula simplification. DAG size of input: 78 DAG size of output 69 [2018-04-13 04:25:41,440 WARN L151 SmtUtils]: Spent 2123ms on a formula simplification. DAG size of input: 80 DAG size of output 74 [2018-04-13 04:25:41,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:41,563 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-04-13 04:25:41,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 04:25:41,563 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2018-04-13 04:25:41,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:41,563 INFO L225 Difference]: With dead ends: 77 [2018-04-13 04:25:41,563 INFO L226 Difference]: Without dead ends: 77 [2018-04-13 04:25:41,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=139, Invalid=1120, Unknown=1, NotChecked=0, Total=1260 [2018-04-13 04:25:41,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-13 04:25:41,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2018-04-13 04:25:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-13 04:25:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-04-13 04:25:41,565 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 34 [2018-04-13 04:25:41,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:41,565 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-04-13 04:25:41,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 04:25:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-04-13 04:25:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-13 04:25:41,565 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:41,566 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:41,566 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:41,566 INFO L82 PathProgramCache]: Analyzing trace with hash 327037559, now seen corresponding path program 2 times [2018-04-13 04:25:41,566 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:41,566 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:41,566 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:41,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:41,566 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:41,573 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:41,576 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:41,576 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:41,576 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:41,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:25:41,591 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:25:41,591 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:41,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:41,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:41,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:41,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:41,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:41,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:41,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:25:41,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:41,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:25:41,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:41,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:41,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:41,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:41,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:41,675 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:25:41,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 04:25:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:41,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:41,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 04:25:41,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 04:25:41,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 04:25:41,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-04-13 04:25:41,776 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 15 states. [2018-04-13 04:25:42,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:42,069 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-04-13 04:25:42,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 04:25:42,069 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-04-13 04:25:42,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:42,070 INFO L225 Difference]: With dead ends: 89 [2018-04-13 04:25:42,070 INFO L226 Difference]: Without dead ends: 89 [2018-04-13 04:25:42,070 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2018-04-13 04:25:42,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-13 04:25:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2018-04-13 04:25:42,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-13 04:25:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-04-13 04:25:42,072 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 35 [2018-04-13 04:25:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:42,072 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-04-13 04:25:42,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 04:25:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-04-13 04:25:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 04:25:42,073 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:42,073 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:42,073 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:42,073 INFO L82 PathProgramCache]: Analyzing trace with hash -282513281, now seen corresponding path program 1 times [2018-04-13 04:25:42,073 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:42,074 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:42,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:42,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:42,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:42,084 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:42,088 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:42,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:42,088 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:42,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:42,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:42,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:42,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:25:42,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:42,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:42,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:42,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:42,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-13 04:25:42,170 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:25:42,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:25:42,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-13 04:25:42,257 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:25:42,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:42,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,268 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:25:42,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-13 04:25:42,287 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:25:42,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 04:25:42,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,301 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:25:42,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2018-04-13 04:25:42,352 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 28 treesize of output 26 [2018-04-13 04:25:42,354 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:25:42,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,363 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:25:42,363 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:42,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:42,374 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:25:42,374 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-04-13 04:25:42,433 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:25:42,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:42,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-13 04:25:42,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-13 04:25:42,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-13 04:25:42,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-04-13 04:25:42,433 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 18 states. [2018-04-13 04:25:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:42,802 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-04-13 04:25:42,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 04:25:42,802 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-04-13 04:25:42,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:42,803 INFO L225 Difference]: With dead ends: 84 [2018-04-13 04:25:42,803 INFO L226 Difference]: Without dead ends: 84 [2018-04-13 04:25:42,803 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-04-13 04:25:42,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-13 04:25:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2018-04-13 04:25:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-13 04:25:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-04-13 04:25:42,804 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 36 [2018-04-13 04:25:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:42,804 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-04-13 04:25:42,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-13 04:25:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-04-13 04:25:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 04:25:42,805 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:42,805 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:42,805 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:42,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1790080990, now seen corresponding path program 2 times [2018-04-13 04:25:42,805 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:42,805 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:42,805 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:42,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:42,805 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:42,815 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:42,818 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:42,819 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:42,819 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:42,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:25:42,852 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:25:42,852 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:42,856 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:42,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:42,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:25:42,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:42,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:42,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:42,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:42,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-13 04:25:42,901 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:25:42,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:42,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:42,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:27 [2018-04-13 04:25:42,994 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:25:42,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:42,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:43,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:43,010 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:25:43,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-04-13 04:25:43,055 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:25:43,061 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:25:43,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:43,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:43,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:43,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-04-13 04:25:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:43,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:43,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 04:25:43,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:25:43,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:25:43,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:25:43,165 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 16 states. [2018-04-13 04:25:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:43,577 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-04-13 04:25:43,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 04:25:43,577 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-04-13 04:25:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:43,578 INFO L225 Difference]: With dead ends: 87 [2018-04-13 04:25:43,578 INFO L226 Difference]: Without dead ends: 87 [2018-04-13 04:25:43,579 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2018-04-13 04:25:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-13 04:25:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 71. [2018-04-13 04:25:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-13 04:25:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-04-13 04:25:43,580 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 38 [2018-04-13 04:25:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:43,595 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-04-13 04:25:43,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:25:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-04-13 04:25:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 04:25:43,596 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:43,596 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:43,596 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:43,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2011124713, now seen corresponding path program 3 times [2018-04-13 04:25:43,596 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:43,596 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:43,597 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:43,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:43,597 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:43,604 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:43,610 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:43,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:43,611 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:43,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:25:43,637 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:25:43,638 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:43,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:43,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:43,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:43,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:43,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:25:43,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:43,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:43,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:43,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:43,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:43,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:43,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:43,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-13 04:25:43,688 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:25:43,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:43,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:43,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:43,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:43,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-13 04:25:43,726 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:25:43,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 04:25:43,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:43,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:43,737 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:25:43,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-04-13 04:25:43,783 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 28 treesize of output 26 [2018-04-13 04:25:43,786 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:25:43,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:43,797 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:25:43,797 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:43,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:43,808 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:25:43,808 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-04-13 04:25:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-04-13 04:25:43,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:43,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 04:25:43,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 04:25:43,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 04:25:43,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-04-13 04:25:43,868 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 14 states. [2018-04-13 04:25:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:44,328 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-04-13 04:25:44,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 04:25:44,329 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-04-13 04:25:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:44,329 INFO L225 Difference]: With dead ends: 82 [2018-04-13 04:25:44,329 INFO L226 Difference]: Without dead ends: 64 [2018-04-13 04:25:44,330 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2018-04-13 04:25:44,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-13 04:25:44,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-04-13 04:25:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-13 04:25:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-04-13 04:25:44,331 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 38 [2018-04-13 04:25:44,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:44,332 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-04-13 04:25:44,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 04:25:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-04-13 04:25:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 04:25:44,332 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:44,332 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:44,332 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:44,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1391271637, now seen corresponding path program 3 times [2018-04-13 04:25:44,333 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:44,333 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:44,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:44,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:44,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:44,346 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:44,350 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:44,350 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:44,350 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:44,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:25:44,386 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:25:44,386 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:44,390 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:44,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:44,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:44,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:44,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:25:44,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:44,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:44,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:44,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:44,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:44,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:44,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:44,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-13 04:25:44,441 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:25:44,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:44,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:44,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:44,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:44,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-13 04:25:44,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-13 04:25:44,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 9 [2018-04-13 04:25:44,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:44,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:44,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:44,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:25 [2018-04-13 04:25:44,625 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:25:44,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:44,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:44,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:44,640 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:25:44,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:15 [2018-04-13 04:25:44,685 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:25:44,689 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:25:44,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:44,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:44,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:44,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:32 [2018-04-13 04:25:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:44,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:44,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 04:25:44,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:25:44,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:25:44,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:25:44,773 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 19 states. [2018-04-13 04:25:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:45,259 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-04-13 04:25:45,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 04:25:45,259 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2018-04-13 04:25:45,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:45,260 INFO L225 Difference]: With dead ends: 91 [2018-04-13 04:25:45,260 INFO L226 Difference]: Without dead ends: 91 [2018-04-13 04:25:45,260 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2018-04-13 04:25:45,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-13 04:25:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2018-04-13 04:25:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-13 04:25:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-04-13 04:25:45,262 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 39 [2018-04-13 04:25:45,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:45,263 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-04-13 04:25:45,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:25:45,263 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-04-13 04:25:45,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-13 04:25:45,263 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:45,263 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:45,263 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:45,264 INFO L82 PathProgramCache]: Analyzing trace with hash -179747827, now seen corresponding path program 3 times [2018-04-13 04:25:45,264 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:45,264 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:45,264 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:45,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:45,264 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:45,274 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:45,279 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:45,279 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:45,279 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:45,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:25:45,337 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:25:45,337 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:45,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:45,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:45,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:45,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:45,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:45,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:45,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 04:25:45,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:45,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:45,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:45,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:45,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:25:45,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:45,382 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:25:45,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:25:45,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-13 04:25:45,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:45,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:45,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:52 [2018-04-13 04:25:45,991 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:45,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:45,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 04:25:45,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 04:25:45,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 04:25:45,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-04-13 04:25:45,992 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 20 states. [2018-04-13 04:25:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:47,051 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-04-13 04:25:47,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 04:25:47,051 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-04-13 04:25:47,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:47,051 INFO L225 Difference]: With dead ends: 71 [2018-04-13 04:25:47,052 INFO L226 Difference]: Without dead ends: 71 [2018-04-13 04:25:47,052 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 04:25:47,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-13 04:25:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-04-13 04:25:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-13 04:25:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-04-13 04:25:47,053 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 40 [2018-04-13 04:25:47,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:47,053 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-04-13 04:25:47,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 04:25:47,053 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-04-13 04:25:47,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-13 04:25:47,053 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:47,053 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:47,053 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:47,054 INFO L82 PathProgramCache]: Analyzing trace with hash -569523722, now seen corresponding path program 2 times [2018-04-13 04:25:47,054 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:47,054 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:47,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:47,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:47,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:47,063 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:47,071 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:47,071 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:47,071 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:47,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:25:47,099 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:25:47,099 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:47,103 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:47,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:47,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:47,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:47,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:47,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:47,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:25:47,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:47,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:25:47,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:47,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:47,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:47,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:47,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:47,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:47,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-13 04:25:47,188 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:25:47,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:47,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:47,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:47,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:47,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-04-13 04:25:47,333 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:25:47,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:47,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:47,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:47,351 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:25:47,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2018-04-13 04:25:47,419 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:25:47,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:47,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:47,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:47,465 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:25:47,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:50 [2018-04-13 04:25:47,588 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 26 treesize of output 24 [2018-04-13 04:25:47,590 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:25:47,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:47,602 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:25:47,602 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:47,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:47,619 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 2 xjuncts. [2018-04-13 04:25:47,620 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:62, output treesize:68 [2018-04-13 04:25:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:47,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:47,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 04:25:47,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 04:25:47,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 04:25:47,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-04-13 04:25:47,744 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 22 states. [2018-04-13 04:25:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:48,346 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-04-13 04:25:48,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 04:25:48,347 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-04-13 04:25:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:48,347 INFO L225 Difference]: With dead ends: 78 [2018-04-13 04:25:48,347 INFO L226 Difference]: Without dead ends: 78 [2018-04-13 04:25:48,347 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2018-04-13 04:25:48,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-13 04:25:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-04-13 04:25:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-13 04:25:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-04-13 04:25:48,349 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 40 [2018-04-13 04:25:48,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:48,349 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-04-13 04:25:48,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 04:25:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-04-13 04:25:48,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-13 04:25:48,350 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:48,350 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:48,350 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:48,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1277256095, now seen corresponding path program 3 times [2018-04-13 04:25:48,350 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:48,351 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:48,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:48,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:48,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:48,360 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:48,366 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:48,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:48,366 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:48,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:25:48,395 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:25:48,395 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:48,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:48,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:48,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:48,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:48,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:48,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:48,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:25:48,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:48,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:25:48,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:48,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:48,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:48,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:48,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:48,467 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:25:48,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 04:25:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:48,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:48,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 04:25:48,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 04:25:48,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 04:25:48,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:25:48,637 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 17 states. [2018-04-13 04:25:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:49,110 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-04-13 04:25:49,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 04:25:49,111 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-04-13 04:25:49,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:49,111 INFO L225 Difference]: With dead ends: 95 [2018-04-13 04:25:49,111 INFO L226 Difference]: Without dead ends: 95 [2018-04-13 04:25:49,111 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2018-04-13 04:25:49,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-13 04:25:49,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2018-04-13 04:25:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-13 04:25:49,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-04-13 04:25:49,113 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 41 [2018-04-13 04:25:49,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:49,113 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-04-13 04:25:49,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 04:25:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-04-13 04:25:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 04:25:49,113 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:49,113 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:49,113 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:49,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1523990997, now seen corresponding path program 3 times [2018-04-13 04:25:49,113 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:49,113 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:49,114 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:49,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:49,114 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:49,125 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:49,131 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:49,131 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:49,131 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:49,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:25:49,167 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-13 04:25:49,167 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:49,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:49,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:49,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:49,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:49,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 04:25:49,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:49,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:49,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:49,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:49,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:49,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:49,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:49,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-13 04:25:49,252 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:25:49,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:25:49,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:49,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:49,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:49,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-04-13 04:25:49,332 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:25:49,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:49,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:49,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:49,357 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:25:49,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-04-13 04:25:49,415 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:25:49,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:49,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:49,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:49,425 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:25:49,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-13 04:25:49,509 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:25:49,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:49,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:49,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:49,519 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:25:49,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-13 04:25:49,573 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 26 treesize of output 24 [2018-04-13 04:25:49,574 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:25:49,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:49,581 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:25:49,582 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:49,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:49,590 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:25:49,590 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:30 [2018-04-13 04:25:49,653 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:25:49,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:49,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 04:25:49,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 04:25:49,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 04:25:49,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-04-13 04:25:49,654 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 24 states. [2018-04-13 04:25:50,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:50,191 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-04-13 04:25:50,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 04:25:50,191 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2018-04-13 04:25:50,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:50,192 INFO L225 Difference]: With dead ends: 85 [2018-04-13 04:25:50,192 INFO L226 Difference]: Without dead ends: 85 [2018-04-13 04:25:50,192 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=1063, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 04:25:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-13 04:25:50,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-04-13 04:25:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-13 04:25:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-04-13 04:25:50,194 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 42 [2018-04-13 04:25:50,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:50,194 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-04-13 04:25:50,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 04:25:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-04-13 04:25:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 04:25:50,194 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:50,194 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:50,194 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:50,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1621062732, now seen corresponding path program 3 times [2018-04-13 04:25:50,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:50,195 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:50,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:50,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:50,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:50,207 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:50,209 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:50,209 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:50,210 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:50,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:25:50,250 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:25:50,251 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:50,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:50,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:50,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:25:50,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:50,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:50,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:50,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:50,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-13 04:25:50,303 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:25:50,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:25:50,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-13 04:25:50,379 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:25:50,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:50,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-04-13 04:25:50,440 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:25:50,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:50,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,449 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:25:50,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-04-13 04:25:50,478 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:25:50,482 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:25:50,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:50,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:50,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:50,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-04-13 04:25:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:50,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:50,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 04:25:50,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:25:50,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:25:50,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:25:50,558 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 19 states. [2018-04-13 04:25:50,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:50,880 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-04-13 04:25:50,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 04:25:50,880 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-04-13 04:25:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:50,881 INFO L225 Difference]: With dead ends: 83 [2018-04-13 04:25:50,881 INFO L226 Difference]: Without dead ends: 83 [2018-04-13 04:25:50,881 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2018-04-13 04:25:50,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-13 04:25:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2018-04-13 04:25:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-13 04:25:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-04-13 04:25:50,882 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 44 [2018-04-13 04:25:50,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:50,883 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-04-13 04:25:50,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:25:50,883 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-04-13 04:25:50,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 04:25:50,883 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:50,883 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:50,883 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:50,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1127301139, now seen corresponding path program 4 times [2018-04-13 04:25:50,883 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:50,883 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:50,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:50,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:50,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:50,893 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:50,898 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:50,898 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:50,899 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:50,899 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:25:50,937 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:25:50,937 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:50,939 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:50,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:50,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:25:50,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:50,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:50,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:50,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:50,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-13 04:25:50,982 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:25:50,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-13 04:25:50,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:50,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-13 04:25:51,081 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:25:51,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:51,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,095 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:25:51,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-13 04:25:51,124 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:25:51,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:51,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,136 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:25:51,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-13 04:25:51,211 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 28 treesize of output 26 [2018-04-13 04:25:51,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-13 04:25:51,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,235 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:25:51,236 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:51,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:51,243 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:25:51,244 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-04-13 04:25:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 04:25:51,287 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:51,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 04:25:51,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 04:25:51,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 04:25:51,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:25:51,288 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 17 states. [2018-04-13 04:25:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:51,566 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-04-13 04:25:51,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 04:25:51,566 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-04-13 04:25:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:51,567 INFO L225 Difference]: With dead ends: 88 [2018-04-13 04:25:51,567 INFO L226 Difference]: Without dead ends: 70 [2018-04-13 04:25:51,567 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-04-13 04:25:51,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-13 04:25:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-04-13 04:25:51,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-13 04:25:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-04-13 04:25:51,568 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 44 [2018-04-13 04:25:51,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:51,568 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-04-13 04:25:51,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 04:25:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-04-13 04:25:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-13 04:25:51,569 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:51,569 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:51,569 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:51,569 INFO L82 PathProgramCache]: Analyzing trace with hash 237455381, now seen corresponding path program 4 times [2018-04-13 04:25:51,569 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:51,569 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:51,569 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:51,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:51,570 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:51,577 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:51,581 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:51,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:51,582 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:51,582 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:25:51,604 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:25:51,604 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:51,607 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:51,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:51,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:25:51,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:51,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:51,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:51,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:51,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-13 04:25:51,643 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:25:51,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:51,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-13 04:25:51,677 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:25:51,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:51,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,685 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:25:51,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-13 04:25:51,694 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:25:51,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 04:25:51,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,702 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:25:51,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-13 04:25:51,714 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:25:51,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:51,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:51,721 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:25:51,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-04-13 04:25:51,737 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:25:51,741 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:25:51,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:51,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:51,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:51,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-13 04:25:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-13 04:25:51,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:51,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 04:25:51,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:25:51,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:25:51,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:25:51,792 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 16 states. [2018-04-13 04:25:52,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:52,088 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-04-13 04:25:52,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 04:25:52,088 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-04-13 04:25:52,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:52,088 INFO L225 Difference]: With dead ends: 73 [2018-04-13 04:25:52,088 INFO L226 Difference]: Without dead ends: 73 [2018-04-13 04:25:52,088 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-04-13 04:25:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-13 04:25:52,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-04-13 04:25:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-13 04:25:52,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-04-13 04:25:52,090 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 45 [2018-04-13 04:25:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:52,090 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-04-13 04:25:52,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:25:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-04-13 04:25:52,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-13 04:25:52,090 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:52,091 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:52,091 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:52,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1228817821, now seen corresponding path program 4 times [2018-04-13 04:25:52,091 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:52,091 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:52,092 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:52,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:52,092 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:52,100 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:52,103 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:52,103 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:52,103 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:52,104 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:25:52,134 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:25:52,134 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:52,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:52,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:52,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:52,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:52,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:52,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:52,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:25:52,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:52,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:25:52,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:52,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:52,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:52,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:52,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:52,195 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:25:52,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 04:25:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:52,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:52,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 04:25:52,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:25:52,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:25:52,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:25:52,666 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 19 states. [2018-04-13 04:25:53,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:53,494 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-04-13 04:25:53,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 04:25:53,494 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-04-13 04:25:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:53,494 INFO L225 Difference]: With dead ends: 76 [2018-04-13 04:25:53,494 INFO L226 Difference]: Without dead ends: 76 [2018-04-13 04:25:53,495 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 04:25:53,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-04-13 04:25:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-04-13 04:25:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-13 04:25:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-04-13 04:25:53,496 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 46 [2018-04-13 04:25:53,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:53,496 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-04-13 04:25:53,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:25:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-04-13 04:25:53,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-13 04:25:53,497 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:53,497 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-04-13 04:25:53,497 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:53,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1618593716, now seen corresponding path program 5 times [2018-04-13 04:25:53,497 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:53,497 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:53,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:53,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:53,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:53,504 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:53,507 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:53,507 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:53,507 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:53,507 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:25:53,528 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-04-13 04:25:53,528 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:53,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:53,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:53,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:53,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:53,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-13 04:25:53,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:53,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:53,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:53,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:53,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 04:25:53,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:53,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:53,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-04-13 04:25:53,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:25:53,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:53,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:53,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:53,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:53,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-13 04:25:53,765 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:25:53,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:53,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:53,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:53,784 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:25:53,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:37 [2018-04-13 04:25:53,872 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:25:53,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:53,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:53,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:53,886 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:25:53,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:37 [2018-04-13 04:25:53,951 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:25:53,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:53,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:53,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:53,960 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:25:53,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-04-13 04:25:54,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:54,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:54,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 26 treesize of output 24 [2018-04-13 04:25:54,043 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:25:54,043 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:54,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:25:54,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:54,051 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:54,055 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:25:54,056 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:30 [2018-04-13 04:25:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:54,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:54,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 04:25:54,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 04:25:54,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 04:25:54,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2018-04-13 04:25:54,128 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 25 states. [2018-04-13 04:25:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:54,637 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-04-13 04:25:54,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 04:25:54,638 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-04-13 04:25:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:54,638 INFO L225 Difference]: With dead ends: 83 [2018-04-13 04:25:54,638 INFO L226 Difference]: Without dead ends: 83 [2018-04-13 04:25:54,638 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 04:25:54,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-13 04:25:54,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-04-13 04:25:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-13 04:25:54,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-04-13 04:25:54,640 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 46 [2018-04-13 04:25:54,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:54,640 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-04-13 04:25:54,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 04:25:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-04-13 04:25:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-13 04:25:54,640 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:54,640 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:54,640 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:54,640 INFO L82 PathProgramCache]: Analyzing trace with hash 561312459, now seen corresponding path program 4 times [2018-04-13 04:25:54,640 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:54,640 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:54,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:54,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:54,641 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:54,647 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:54,650 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:54,650 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:54,650 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:54,651 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:25:54,666 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:25:54,666 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:54,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:54,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:54,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:54,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:54,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:54,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:54,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-13 04:25:54,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:54,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:25:54,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:54,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:54,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:54,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:54,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:54,732 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:25:54,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-13 04:25:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:54,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:54,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 04:25:54,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:25:54,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:25:54,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:25:54,943 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 19 states. [2018-04-13 04:25:55,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:55,390 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-04-13 04:25:55,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 04:25:55,390 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-04-13 04:25:55,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:55,391 INFO L225 Difference]: With dead ends: 100 [2018-04-13 04:25:55,391 INFO L226 Difference]: Without dead ends: 100 [2018-04-13 04:25:55,391 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 04:25:55,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-13 04:25:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2018-04-13 04:25:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-13 04:25:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-04-13 04:25:55,392 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 47 [2018-04-13 04:25:55,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:55,392 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-04-13 04:25:55,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:25:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-04-13 04:25:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 04:25:55,393 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:55,393 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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:25:55,393 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:55,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1609925973, now seen corresponding path program 6 times [2018-04-13 04:25:55,393 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:55,393 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:55,394 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:55,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:55,394 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:55,400 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:55,406 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:55,406 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:55,406 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:55,407 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:25:55,435 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-13 04:25:55,435 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:55,438 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:55,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:55,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-13 04:25:55,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:55,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:55,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:55,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:55,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-13 04:25:55,524 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:25:55,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:55,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-04-13 04:25:55,635 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:25:55,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:55,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2018-04-13 04:25:55,714 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:25:55,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:55,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2018-04-13 04:25:55,785 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:25:55,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:55,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2018-04-13 04:25:55,883 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:25:55,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 04:25:55,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:55,891 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:25:55,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-13 04:25:55,944 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 26 treesize of output 24 [2018-04-13 04:25:55,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:25:55,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:55,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:55,960 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:25:55,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-04-13 04:25:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:56,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:56,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 04:25:56,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 04:25:56,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 04:25:56,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-04-13 04:25:56,027 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 28 states. [2018-04-13 04:25:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:56,717 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-04-13 04:25:56,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 04:25:56,717 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 48 [2018-04-13 04:25:56,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:56,718 INFO L225 Difference]: With dead ends: 90 [2018-04-13 04:25:56,718 INFO L226 Difference]: Without dead ends: 90 [2018-04-13 04:25:56,718 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 04:25:56,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-04-13 04:25:56,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2018-04-13 04:25:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-13 04:25:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-04-13 04:25:56,719 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 48 [2018-04-13 04:25:56,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:56,719 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-04-13 04:25:56,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 04:25:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-04-13 04:25:56,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 04:25:56,720 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:56,720 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:56,720 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:56,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1751770890, now seen corresponding path program 4 times [2018-04-13 04:25:56,720 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:56,720 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:56,720 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:56,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:56,720 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:56,731 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:56,735 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:56,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:56,736 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:56,736 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:25:56,775 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:25:56,775 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:56,780 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:56,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:56,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:56,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:56,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:25:56,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:56,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:56,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:56,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:56,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:56,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:56,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:56,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-13 04:25:56,817 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:25:56,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 12 treesize of output 11 [2018-04-13 04:25:56,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:56,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:56,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:56,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-13 04:25:56,870 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:25:56,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 04:25:56,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:56,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:56,881 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:25:56,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-13 04:25:56,887 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:25:56,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:56,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:56,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:56,898 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:25:56,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-13 04:25:56,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 23 treesize of output 24 [2018-04-13 04:25:56,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:56,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:56,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:56,926 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:25:56,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-04-13 04:25:56,953 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:25:56,959 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:25:56,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:56,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:56,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:56,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-13 04:25:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-13 04:25:57,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:57,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 04:25:57,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:25:57,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:25:57,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:25:57,024 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 16 states. [2018-04-13 04:25:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:57,311 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-04-13 04:25:57,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 04:25:57,311 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-13 04:25:57,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:57,312 INFO L225 Difference]: With dead ends: 90 [2018-04-13 04:25:57,312 INFO L226 Difference]: Without dead ends: 90 [2018-04-13 04:25:57,312 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2018-04-13 04:25:57,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-04-13 04:25:57,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2018-04-13 04:25:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-13 04:25:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-04-13 04:25:57,313 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 50 [2018-04-13 04:25:57,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:57,313 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-04-13 04:25:57,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:25:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-04-13 04:25:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 04:25:57,314 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:57,314 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:57,314 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:57,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2049434813, now seen corresponding path program 7 times [2018-04-13 04:25:57,314 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:57,314 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:57,314 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:57,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:25:57,314 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:57,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:25:57,324 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:57,324 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:57,324 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:57,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:57,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:57,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:57,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:57,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:57,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:25:57,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:25:57,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:57,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:57,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:25:57,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:25:57,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:57,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:57,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-13 04:25:57,379 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:25:57,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:57,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:57,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:57,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:57,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-13 04:25:57,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-13 04:25:57,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 04:25:57,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:57,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:57,424 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:25:57,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-13 04:25:57,436 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:25:57,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:25:57,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:57,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:57,443 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:25:57,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-04-13 04:25:57,459 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 23 treesize of output 35 [2018-04-13 04:25:57,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-13 04:25:57,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:25:57,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:25:57,475 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:25:57,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-04-13 04:25:57,494 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:25:57,498 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:25:57,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:25:57,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:57,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:25:57,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-13 04:25:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-04-13 04:25:57,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:57,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 04:25:57,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:25:57,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:25:57,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:25:57,543 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 16 states. [2018-04-13 04:25:57,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:57,812 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-04-13 04:25:57,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 04:25:57,812 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-13 04:25:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:57,813 INFO L225 Difference]: With dead ends: 89 [2018-04-13 04:25:57,813 INFO L226 Difference]: Without dead ends: 57 [2018-04-13 04:25:57,813 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2018-04-13 04:25:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-13 04:25:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-04-13 04:25:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-13 04:25:57,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-04-13 04:25:57,814 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 50 [2018-04-13 04:25:57,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:57,814 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-04-13 04:25:57,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:25:57,814 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-04-13 04:25:57,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-13 04:25:57,814 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:25:57,814 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:25:57,814 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-13 04:25:57,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1658951737, now seen corresponding path program 5 times [2018-04-13 04:25:57,815 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:25:57,815 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:25:57,815 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:57,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:25:57,815 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:25:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:25:57,821 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:25:57,825 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:25:57,825 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:25:57,826 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:25:57,826 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:25:57,863 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-13 04:25:57,864 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:25:57,868 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:25:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 44 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:25:58,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:25:58,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 04:25:58,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:25:58,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:25:58,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:25:58,285 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2018-04-13 04:25:59,234 WARN L151 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 74 DAG size of output 69 [2018-04-13 04:25:59,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:25:59,333 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-04-13 04:25:59,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 04:25:59,334 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-04-13 04:25:59,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:25:59,334 INFO L225 Difference]: With dead ends: 56 [2018-04-13 04:25:59,334 INFO L226 Difference]: Without dead ends: 0 [2018-04-13 04:25:59,334 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 04:25:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-13 04:25:59,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-13 04:25:59,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-13 04:25:59,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-13 04:25:59,335 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-04-13 04:25:59,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:25:59,335 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-13 04:25:59,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:25:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-13 04:25:59,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-13 04:25:59,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 04:25:59 BoogieIcfgContainer [2018-04-13 04:25:59,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 04:25:59,339 INFO L168 Benchmark]: Toolchain (without parser) took 34957.33 ms. Allocated memory was 405.8 MB in the beginning and 1.0 GB in the end (delta: 616.6 MB). Free memory was 342.2 MB in the beginning and 878.2 MB in the end (delta: -536.0 MB). Peak memory consumption was 80.6 MB. Max. memory is 5.3 GB. [2018-04-13 04:25:59,340 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 405.8 MB. Free memory is still 367.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 04:25:59,340 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.00 ms. Allocated memory is still 405.8 MB. Free memory was 340.9 MB in the beginning and 316.9 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-13 04:25:59,340 INFO L168 Benchmark]: Boogie Preprocessor took 44.87 ms. Allocated memory is still 405.8 MB. Free memory was 316.9 MB in the beginning and 314.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-13 04:25:59,340 INFO L168 Benchmark]: RCFGBuilder took 386.19 ms. Allocated memory was 405.8 MB in the beginning and 615.5 MB in the end (delta: 209.7 MB). Free memory was 314.3 MB in the beginning and 548.0 MB in the end (delta: -233.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-04-13 04:25:59,340 INFO L168 Benchmark]: TraceAbstraction took 34253.17 ms. Allocated memory was 615.5 MB in the beginning and 1.0 GB in the end (delta: 406.8 MB). Free memory was 548.0 MB in the beginning and 878.2 MB in the end (delta: -330.2 MB). Peak memory consumption was 76.7 MB. Max. memory is 5.3 GB. [2018-04-13 04:25:59,341 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 405.8 MB. Free memory is still 367.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 270.00 ms. Allocated memory is still 405.8 MB. Free memory was 340.9 MB in the beginning and 316.9 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.87 ms. Allocated memory is still 405.8 MB. Free memory was 316.9 MB in the beginning and 314.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 386.19 ms. Allocated memory was 405.8 MB in the beginning and 615.5 MB in the end (delta: 209.7 MB). Free memory was 314.3 MB in the beginning and 548.0 MB in the end (delta: -233.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 34253.17 ms. Allocated memory was 615.5 MB in the beginning and 1.0 GB in the end (delta: 406.8 MB). Free memory was 548.0 MB in the beginning and 878.2 MB in the end (delta: -330.2 MB). Peak memory consumption was 76.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 13 error locations. SAFE Result, 34.2s OverallTime, 46 OverallIterations, 6 TraceHistogramMax, 21.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1605 SDtfs, 2409 SDslu, 10487 SDs, 0 SdLazy, 12213 SolverSat, 512 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1618 GetRequests, 749 SyntacticMatches, 3 SemanticMatches, 866 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3598 ImplicationChecksByTransitivity, 22.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 46 MinimizatonAttempts, 337 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 2704 NumberOfCodeBlocks, 2704 NumberOfCodeBlocksAsserted, 117 NumberOfCheckSat, 1502 ConstructedInterpolants, 133 QuantifiedInterpolants, 880446 SizeOfPredicates, 596 NumberOfNonLiveVariables, 6315 ConjunctsInSsa, 2007 ConjunctsInUnsatCore, 48 InterpolantComputations, 19 PerfectInterpolantSequences, 110/672 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_04-25-59-346.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_04-25-59-346.csv Received shutdown request...