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_cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:15:46,154 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:15:46,156 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:15:46,168 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:15:46,168 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:15:46,169 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:15:46,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:15:46,171 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:15:46,173 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:15:46,174 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:15:46,174 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:15:46,175 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:15:46,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:15:46,176 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:15:46,177 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:15:46,179 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:15:46,180 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:15:46,182 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:15:46,183 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:15:46,184 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:15:46,185 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:15:46,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:15:46,185 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:15:46,186 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:15:46,186 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:15:46,189 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:15:46,189 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:15:46,190 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:15:46,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:15:46,190 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:15:46,191 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:15:46,191 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-11 15:15:46,211 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:15:46,212 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:15:46,213 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:15:46,213 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:15:46,213 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:15:46,213 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:15:46,213 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:15:46,213 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:15:46,213 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:15:46,214 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:15:46,214 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:15:46,214 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:15:46,214 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:15:46,214 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:15:46,214 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:15:46,214 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:15:46,214 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:15:46,214 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:15:46,214 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:15:46,215 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:15:46,215 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:15:46,215 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:15:46,215 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:15:46,215 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 15:15:46,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:15:46,249 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:15:46,251 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:15:46,252 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:15:46,253 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:15:46,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,540 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG2bcbaca77 [2018-04-11 15:15:46,707 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:15:46,707 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:15:46,707 INFO L168 CDTParser]: Scanning openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,716 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:15:46,716 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:15:46,716 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:15:46,716 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcat ('cstrcat') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,716 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,717 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,717 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,717 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:15:46,717 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,717 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,717 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,717 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,717 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,727 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,727 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,727 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,727 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:46,740 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG2bcbaca77 [2018-04-11 15:15:46,746 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:15:46,747 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:15:46,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:15:46,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:15:46,751 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:15:46,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:15:46" (1/1) ... [2018-04-11 15:15:46,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d25f9f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:15:46, skipping insertion in model container [2018-04-11 15:15:46,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:15:46" (1/1) ... [2018-04-11 15:15:46,764 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:15:46,787 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:15:46,910 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:15:46,948 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:15:46,952 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 15:15:46,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:15:46 WrapperNode [2018-04-11 15:15:46,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:15:46,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:15:46,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:15:46,978 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:15:46,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:15:46" (1/1) ... [2018-04-11 15:15:46,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:15:46" (1/1) ... [2018-04-11 15:15:46,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:15:46" (1/1) ... [2018-04-11 15:15:46,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:15:46" (1/1) ... [2018-04-11 15:15:47,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:15:46" (1/1) ... [2018-04-11 15:15:47,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:15:46" (1/1) ... [2018-04-11 15:15:47,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:15:46" (1/1) ... [2018-04-11 15:15:47,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:15:47,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:15:47,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:15:47,014 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:15:47,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:15:46" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:15:47,103 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:15:47,103 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:15:47,103 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:15:47,103 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:15:47,103 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcat [2018-04-11 15:15:47,103 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:15:47,103 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:15:47,103 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:15:47,103 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:15:47,103 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:15:47,104 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:15:47,104 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:15:47,104 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:15:47,104 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:15:47,104 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:15:47,104 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:15:47,104 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:15:47,104 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:15:47,104 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:15:47,104 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:15:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:15:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:15:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:15:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:15:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:15:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:15:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:15:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:15:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:15:47,105 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:15:47,106 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:15:47,106 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:15:47,106 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:15:47,106 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:15:47,106 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:15:47,106 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:15:47,106 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:15:47,106 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:15:47,106 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:15:47,107 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:15:47,107 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:15:47,107 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:15:47,107 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:15:47,107 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:15:47,107 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:15:47,107 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:15:47,107 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:15:47,107 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:15:47,107 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:15:47,108 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:15:47,108 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:15:47,108 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:15:47,108 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:15:47,108 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:15:47,108 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:15:47,108 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:15:47,108 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:15:47,108 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:15:47,108 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:15:47,109 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:15:47,109 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:15:47,109 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:15:47,109 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:15:47,109 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:15:47,109 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:15:47,109 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:15:47,109 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:15:47,109 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:15:47,109 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:15:47,110 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:15:47,110 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:15:47,110 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:15:47,110 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:15:47,110 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:15:47,110 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:15:47,110 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:15:47,110 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:15:47,110 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:15:47,110 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:15:47,110 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:15:47,110 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:15:47,111 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:15:47,111 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:15:47,111 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:15:47,111 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:15:47,111 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:15:47,111 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:15:47,111 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:15:47,111 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:15:47,111 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:15:47,111 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:15:47,111 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:15:47,111 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:15:47,111 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:15:47,111 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:15:47,111 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:15:47,111 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:15:47,111 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:15:47,112 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:15:47,112 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:15:47,112 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:15:47,112 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:15:47,112 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:15:47,112 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:15:47,112 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:15:47,112 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:15:47,112 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:15:47,112 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:15:47,113 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:15:47,113 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcat [2018-04-11 15:15:47,113 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:15:47,113 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:15:47,113 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:15:47,113 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:15:47,113 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:15:47,113 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:15:47,113 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:15:47,114 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:15:47,376 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:15:47,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:15:47 BoogieIcfgContainer [2018-04-11 15:15:47,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:15:47,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:15:47,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:15:47,379 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:15:47,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:15:46" (1/3) ... [2018-04-11 15:15:47,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e75905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:15:47, skipping insertion in model container [2018-04-11 15:15:47,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:15:46" (2/3) ... [2018-04-11 15:15:47,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e75905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:15:47, skipping insertion in model container [2018-04-11 15:15:47,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:15:47" (3/3) ... [2018-04-11 15:15:47,381 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:15:47,386 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:15:47,392 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-04-11 15:15:47,415 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:15:47,415 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:15:47,416 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:15:47,416 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:15:47,416 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:15:47,416 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:15:47,416 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:15:47,416 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:15:47,416 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:15:47,416 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:15:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-04-11 15:15:47,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 15:15:47,433 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:47,433 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:47,433 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:47,436 INFO L82 PathProgramCache]: Analyzing trace with hash 428257112, now seen corresponding path program 1 times [2018-04-11 15:15:47,437 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:47,438 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:47,466 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:47,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:47,466 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:47,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:47,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-11 15:15:47,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:47,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:15:47,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:15:47,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:15:47,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:15:47,573 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 5 states. [2018-04-11 15:15:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:47,705 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-04-11 15:15:47,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:15:47,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-04-11 15:15:47,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:47,716 INFO L225 Difference]: With dead ends: 92 [2018-04-11 15:15:47,716 INFO L226 Difference]: Without dead ends: 87 [2018-04-11 15:15:47,717 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:15:47,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-11 15:15:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 50. [2018-04-11 15:15:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 15:15:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-04-11 15:15:47,747 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 11 [2018-04-11 15:15:47,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:47,747 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-04-11 15:15:47,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:15:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-04-11 15:15:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 15:15:47,747 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:47,747 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:47,748 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:47,748 INFO L82 PathProgramCache]: Analyzing trace with hash 428259034, now seen corresponding path program 1 times [2018-04-11 15:15:47,748 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:47,748 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:47,749 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:47,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:47,749 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:47,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:47,773 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:47,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 15:15:47,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:15:47,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:15:47,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:15:47,775 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 3 states. [2018-04-11 15:15:47,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:47,794 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-04-11 15:15:47,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:15:47,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-11 15:15:47,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:47,796 INFO L225 Difference]: With dead ends: 51 [2018-04-11 15:15:47,796 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 15:15:47,796 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:15:47,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 15:15:47,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-04-11 15:15:47,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-11 15:15:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-04-11 15:15:47,799 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 11 [2018-04-11 15:15:47,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:47,799 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-04-11 15:15:47,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:15:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-04-11 15:15:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 15:15:47,799 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:47,800 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:47,800 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:47,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1908357399, now seen corresponding path program 1 times [2018-04-11 15:15:47,800 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:47,800 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:47,800 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:47,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:47,800 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:47,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:47,826 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:47,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:47,826 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:47,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:47,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:47,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:47,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:47,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:15:47,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:15:47,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:47,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:47,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 15:15:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:47,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:47,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:15:47,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:15:47,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:15:47,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:15:47,900 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 4 states. [2018-04-11 15:15:47,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:47,950 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-04-11 15:15:47,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:15:47,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-11 15:15:47,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:47,951 INFO L225 Difference]: With dead ends: 46 [2018-04-11 15:15:47,951 INFO L226 Difference]: Without dead ends: 46 [2018-04-11 15:15:47,951 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:15:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-04-11 15:15:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-04-11 15:15:47,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-11 15:15:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-04-11 15:15:47,956 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2018-04-11 15:15:47,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:47,956 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-04-11 15:15:47,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:15:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-04-11 15:15:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 15:15:47,957 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:47,957 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:47,957 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:47,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1908357398, now seen corresponding path program 1 times [2018-04-11 15:15:47,957 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:47,958 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:47,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:47,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:47,959 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:47,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:47,972 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:47,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:47,972 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:47,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:47,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:48,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:48,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:48,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 6 treesize of output 5 [2018-04-11 15:15:48,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:48,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:48,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:15:48,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:48,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:15:48,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:48,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:48,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:48,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:15:48,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:48,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:48,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:15:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:48,106 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:48,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:15:48,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:15:48,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:15:48,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:15:48,106 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-04-11 15:15:48,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:48,187 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-04-11 15:15:48,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:15:48,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-04-11 15:15:48,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:48,188 INFO L225 Difference]: With dead ends: 65 [2018-04-11 15:15:48,188 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 15:15:48,188 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:15:48,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 15:15:48,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2018-04-11 15:15:48,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 15:15:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-04-11 15:15:48,191 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 15 [2018-04-11 15:15:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:48,191 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-04-11 15:15:48,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:15:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-04-11 15:15:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 15:15:48,191 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:48,192 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:48,192 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:48,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1228299028, now seen corresponding path program 1 times [2018-04-11 15:15:48,192 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:48,192 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:48,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:48,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:48,193 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:48,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:48,205 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:48,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:48,205 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:48,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:48,227 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:48,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:48,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:48,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:48,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:48,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:48,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:15:48,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:48,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:15:48,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:48,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:48,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:48,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:15:48,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:48,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:48,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:15:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:48,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:48,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:15:48,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:15:48,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:15:48,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:15:48,306 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 6 states. [2018-04-11 15:15:48,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:48,375 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-04-11 15:15:48,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:15:48,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-04-11 15:15:48,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:48,376 INFO L225 Difference]: With dead ends: 53 [2018-04-11 15:15:48,376 INFO L226 Difference]: Without dead ends: 53 [2018-04-11 15:15:48,376 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:15:48,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-11 15:15:48,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2018-04-11 15:15:48,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-04-11 15:15:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-04-11 15:15:48,378 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 15 [2018-04-11 15:15:48,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:48,379 INFO L459 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-04-11 15:15:48,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:15:48,379 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-04-11 15:15:48,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 15:15:48,379 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:48,379 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:48,379 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:48,379 INFO L82 PathProgramCache]: Analyzing trace with hash 970462777, now seen corresponding path program 1 times [2018-04-11 15:15:48,379 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:48,379 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:48,380 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:48,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:48,380 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:48,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:48,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:48,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:15:48,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:15:48,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:15:48,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:15:48,413 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 4 states. [2018-04-11 15:15:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:48,453 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-04-11 15:15:48,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:15:48,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 15:15:48,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:48,454 INFO L225 Difference]: With dead ends: 44 [2018-04-11 15:15:48,454 INFO L226 Difference]: Without dead ends: 44 [2018-04-11 15:15:48,454 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:15:48,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-11 15:15:48,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-04-11 15:15:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-04-11 15:15:48,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-04-11 15:15:48,456 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 16 [2018-04-11 15:15:48,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:48,456 INFO L459 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-04-11 15:15:48,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:15:48,456 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-04-11 15:15:48,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 15:15:48,456 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:48,456 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:48,456 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:48,457 INFO L82 PathProgramCache]: Analyzing trace with hash 970462778, now seen corresponding path program 1 times [2018-04-11 15:15:48,457 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:48,457 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:48,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:48,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:48,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:48,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:48,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:48,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:48,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:15:48,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:15:48,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:15:48,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:15:48,534 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-04-11 15:15:48,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:48,619 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-04-11 15:15:48,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:15:48,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-04-11 15:15:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:48,620 INFO L225 Difference]: With dead ends: 59 [2018-04-11 15:15:48,620 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 15:15:48,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:15:48,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 15:15:48,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2018-04-11 15:15:48,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 15:15:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-04-11 15:15:48,624 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 16 [2018-04-11 15:15:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:48,624 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-04-11 15:15:48,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:15:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-04-11 15:15:48,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 15:15:48,625 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:48,625 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:48,625 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:48,625 INFO L82 PathProgramCache]: Analyzing trace with hash 161116152, now seen corresponding path program 1 times [2018-04-11 15:15:48,625 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:48,625 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:48,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:48,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:48,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:48,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:48,674 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:48,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:15:48,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:15:48,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:15:48,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:15:48,675 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2018-04-11 15:15:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:48,708 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-04-11 15:15:48,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:15:48,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-04-11 15:15:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:48,709 INFO L225 Difference]: With dead ends: 50 [2018-04-11 15:15:48,709 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 15:15:48,709 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:15:48,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 15:15:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-04-11 15:15:48,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-11 15:15:48,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-04-11 15:15:48,713 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-04-11 15:15:48,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:48,713 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-04-11 15:15:48,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:15:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-04-11 15:15:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 15:15:48,714 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:48,714 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-11 15:15:48,714 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:48,714 INFO L82 PathProgramCache]: Analyzing trace with hash -954509684, now seen corresponding path program 1 times [2018-04-11 15:15:48,714 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:48,714 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:48,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:48,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:48,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:48,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:48,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:48,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:15:48,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:15:48,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:15:48,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:15:48,746 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-04-11 15:15:48,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:48,776 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-04-11 15:15:48,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:15:48,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-04-11 15:15:48,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:48,777 INFO L225 Difference]: With dead ends: 42 [2018-04-11 15:15:48,777 INFO L226 Difference]: Without dead ends: 42 [2018-04-11 15:15:48,777 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:15:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-04-11 15:15:48,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-04-11 15:15:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-04-11 15:15:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-04-11 15:15:48,779 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-04-11 15:15:48,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:48,779 INFO L459 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-04-11 15:15:48,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:15:48,779 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-04-11 15:15:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 15:15:48,779 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:48,779 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-11 15:15:48,779 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:48,779 INFO L82 PathProgramCache]: Analyzing trace with hash -954509683, now seen corresponding path program 1 times [2018-04-11 15:15:48,780 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:48,780 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:48,780 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:48,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:48,780 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:48,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:48,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:48,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:15:48,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:15:48,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:15:48,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:15:48,841 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2018-04-11 15:15:48,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:48,907 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-04-11 15:15:48,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:15:48,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-04-11 15:15:48,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:48,908 INFO L225 Difference]: With dead ends: 48 [2018-04-11 15:15:48,908 INFO L226 Difference]: Without dead ends: 48 [2018-04-11 15:15:48,908 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:15:48,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-11 15:15:48,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-04-11 15:15:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-04-11 15:15:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-04-11 15:15:48,911 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 20 [2018-04-11 15:15:48,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:48,911 INFO L459 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-04-11 15:15:48,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:15:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-04-11 15:15:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:15:48,912 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:48,912 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:48,912 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:48,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2059393705, now seen corresponding path program 1 times [2018-04-11 15:15:48,913 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:48,913 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:48,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:48,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:48,914 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:48,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:48,951 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:48,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:15:48,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:15:48,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:15:48,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:15:48,952 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-04-11 15:15:48,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:48,992 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-04-11 15:15:48,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:15:48,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-04-11 15:15:48,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:48,993 INFO L225 Difference]: With dead ends: 43 [2018-04-11 15:15:48,993 INFO L226 Difference]: Without dead ends: 43 [2018-04-11 15:15:48,993 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:15:48,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-04-11 15:15:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-04-11 15:15:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-11 15:15:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-04-11 15:15:48,996 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2018-04-11 15:15:48,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:48,996 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-04-11 15:15:48,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:15:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-04-11 15:15:48,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:15:48,997 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:48,997 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:48,997 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:48,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2059393704, now seen corresponding path program 1 times [2018-04-11 15:15:48,997 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:48,997 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:48,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:48,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:48,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:49,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:49,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:49,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:15:49,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:15:49,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:15:49,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:15:49,089 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2018-04-11 15:15:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:49,157 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-04-11 15:15:49,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:15:49,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-04-11 15:15:49,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:49,158 INFO L225 Difference]: With dead ends: 50 [2018-04-11 15:15:49,158 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 15:15:49,158 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-11 15:15:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 15:15:49,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-04-11 15:15:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-11 15:15:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-04-11 15:15:49,161 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 24 [2018-04-11 15:15:49,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:49,161 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-04-11 15:15:49,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:15:49,162 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-04-11 15:15:49,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:15:49,162 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:49,162 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:49,162 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:49,163 INFO L82 PathProgramCache]: Analyzing trace with hash -2059340464, now seen corresponding path program 1 times [2018-04-11 15:15:49,163 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:49,163 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:49,163 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:49,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:49,164 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:49,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:49,234 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:49,234 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:49,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:49,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:49,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:49,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:49,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:49,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:15:49,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:49,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:15:49,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-04-11 15:15:49,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:15:49,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:15:49,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:15:49,313 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 13 states. [2018-04-11 15:15:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:49,470 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-04-11 15:15:49,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:15:49,470 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-04-11 15:15:49,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:49,472 INFO L225 Difference]: With dead ends: 66 [2018-04-11 15:15:49,472 INFO L226 Difference]: Without dead ends: 66 [2018-04-11 15:15:49,472 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:15:49,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-11 15:15:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2018-04-11 15:15:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 15:15:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-11 15:15:49,474 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 24 [2018-04-11 15:15:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:49,474 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-11 15:15:49,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:15:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-11 15:15:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:15:49,475 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:49,475 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] [2018-04-11 15:15:49,475 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:49,475 INFO L82 PathProgramCache]: Analyzing trace with hash 583304624, now seen corresponding path program 1 times [2018-04-11 15:15:49,475 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:49,475 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:49,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:49,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:49,476 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:49,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:49,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:49,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:15:49,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:15:49,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:15:49,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:15:49,509 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 6 states. [2018-04-11 15:15:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:49,564 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-04-11 15:15:49,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:15:49,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-11 15:15:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:49,565 INFO L225 Difference]: With dead ends: 49 [2018-04-11 15:15:49,565 INFO L226 Difference]: Without dead ends: 49 [2018-04-11 15:15:49,565 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:15:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-11 15:15:49,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-11 15:15:49,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-11 15:15:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-04-11 15:15:49,567 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 25 [2018-04-11 15:15:49,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:49,568 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-04-11 15:15:49,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:15:49,568 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-04-11 15:15:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:15:49,568 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:49,569 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] [2018-04-11 15:15:49,569 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:49,569 INFO L82 PathProgramCache]: Analyzing trace with hash 583304625, now seen corresponding path program 1 times [2018-04-11 15:15:49,569 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:49,569 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:49,570 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:49,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:49,570 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:49,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:49,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:49,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:15:49,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:15:49,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:15:49,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:15:49,633 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-04-11 15:15:49,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:49,707 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-04-11 15:15:49,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:15:49,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-11 15:15:49,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:49,707 INFO L225 Difference]: With dead ends: 54 [2018-04-11 15:15:49,708 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 15:15:49,708 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:15:49,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 15:15:49,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-04-11 15:15:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-11 15:15:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-04-11 15:15:49,710 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 25 [2018-04-11 15:15:49,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:49,710 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-04-11 15:15:49,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:15:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-04-11 15:15:49,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:15:49,711 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:49,711 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:49,711 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:49,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1713601171, now seen corresponding path program 2 times [2018-04-11 15:15:49,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:49,711 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:49,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:49,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:49,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:49,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 15:15:49,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:49,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 15:15:49,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:15:49,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:15:49,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:15:49,795 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 9 states. [2018-04-11 15:15:49,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:49,869 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-04-11 15:15:49,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:15:49,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-04-11 15:15:49,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:49,870 INFO L225 Difference]: With dead ends: 76 [2018-04-11 15:15:49,870 INFO L226 Difference]: Without dead ends: 76 [2018-04-11 15:15:49,870 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:15:49,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-04-11 15:15:49,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2018-04-11 15:15:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-11 15:15:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-04-11 15:15:49,872 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 28 [2018-04-11 15:15:49,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:49,872 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-04-11 15:15:49,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:15:49,872 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-04-11 15:15:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:15:49,873 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:49,874 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:49,874 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:49,874 INFO L82 PathProgramCache]: Analyzing trace with hash 895952721, now seen corresponding path program 1 times [2018-04-11 15:15:49,874 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:49,874 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:49,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:49,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:15:49,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:49,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:49,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 15:15:49,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:49,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 15:15:49,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:15:49,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:15:49,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:15:49,999 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 12 states. [2018-04-11 15:15:50,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:50,217 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-04-11 15:15:50,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:15:50,217 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-04-11 15:15:50,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:50,217 INFO L225 Difference]: With dead ends: 104 [2018-04-11 15:15:50,217 INFO L226 Difference]: Without dead ends: 104 [2018-04-11 15:15:50,218 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:15:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-11 15:15:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 66. [2018-04-11 15:15:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-04-11 15:15:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-04-11 15:15:50,221 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 28 [2018-04-11 15:15:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:50,221 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-04-11 15:15:50,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:15:50,221 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-04-11 15:15:50,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:15:50,222 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:50,222 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:50,222 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:50,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1318654547, now seen corresponding path program 1 times [2018-04-11 15:15:50,222 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:50,223 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:50,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:50,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:50,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:50,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:50,424 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:50,424 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:50,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:50,444 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:50,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:50,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:50,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:50,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:15:50,513 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 14 treesize of output 11 [2018-04-11 15:15:50,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:15:50,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:50,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:50,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:50,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-11 15:15:50,596 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 18 treesize of output 14 [2018-04-11 15:15:50,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:15:50,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:15:50,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:15:50,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:15:50,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:49 [2018-04-11 15:15:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:50,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:15:50,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2018-04-11 15:15:50,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:15:50,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:15:50,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:15:50,704 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 23 states. [2018-04-11 15:15:51,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:51,206 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-04-11 15:15:51,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:15:51,206 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 28 [2018-04-11 15:15:51,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:51,206 INFO L225 Difference]: With dead ends: 87 [2018-04-11 15:15:51,207 INFO L226 Difference]: Without dead ends: 87 [2018-04-11 15:15:51,207 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:15:51,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-11 15:15:51,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2018-04-11 15:15:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-11 15:15:51,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-04-11 15:15:51,209 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 28 [2018-04-11 15:15:51,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:51,209 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-04-11 15:15:51,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:15:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-04-11 15:15:51,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:15:51,210 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:51,210 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-11 15:15:51,210 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:51,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2092930821, now seen corresponding path program 1 times [2018-04-11 15:15:51,211 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:51,211 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:51,211 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:51,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:51,211 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:51,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:51,226 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:51,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:51,226 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:51,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:51,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:51,292 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 14 treesize of output 11 [2018-04-11 15:15:51,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:15:51,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:51,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:51,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:51,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-11 15:15:51,318 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 25 treesize of output 37 [2018-04-11 15:15:51,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-11 15:15:51,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:51,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:51,347 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-11 15:15:51,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:43 [2018-04-11 15:15:51,441 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 18 treesize of output 14 [2018-04-11 15:15:51,443 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:15:51,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11 15:15:51,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:51,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:51,456 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-11 15:15:51,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2018-04-11 15:15:51,468 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-11 15:15:51,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:51,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-04-11 15:15:51,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:15:51,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:15:51,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:15:51,468 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 14 states. [2018-04-11 15:15:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:51,668 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2018-04-11 15:15:51,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:15:51,668 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-04-11 15:15:51,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:51,669 INFO L225 Difference]: With dead ends: 131 [2018-04-11 15:15:51,669 INFO L226 Difference]: Without dead ends: 131 [2018-04-11 15:15:51,669 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:15:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-11 15:15:51,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 101. [2018-04-11 15:15:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 15:15:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-04-11 15:15:51,671 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 29 [2018-04-11 15:15:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:51,671 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-04-11 15:15:51,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:15:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-04-11 15:15:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:15:51,671 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:51,671 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-11 15:15:51,671 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:51,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1779334649, now seen corresponding path program 1 times [2018-04-11 15:15:51,672 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:51,672 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:51,672 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:51,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:51,672 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:51,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:51,680 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:51,680 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:51,680 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:51,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:51,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:51,748 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 11 treesize of output 8 [2018-04-11 15:15:51,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 15:15:51,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:51,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:51,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:51,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 15:15:51,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 34 [2018-04-11 15:15:51,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-04-11 15:15:51,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:51,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:51,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:51,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-04-11 15:15:51,865 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 15 treesize of output 11 [2018-04-11 15:15:51,867 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:15:51,867 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 7 [2018-04-11 15:15:51,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:51,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:51,879 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-11 15:15:51,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2018-04-11 15:15:51,889 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-11 15:15:51,890 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:51,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-11 15:15:51,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:15:51,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:15:51,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:15:51,890 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 15 states. [2018-04-11 15:15:52,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:52,182 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2018-04-11 15:15:52,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:15:52,182 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-04-11 15:15:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:52,183 INFO L225 Difference]: With dead ends: 158 [2018-04-11 15:15:52,183 INFO L226 Difference]: Without dead ends: 158 [2018-04-11 15:15:52,183 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:15:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-11 15:15:52,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 101. [2018-04-11 15:15:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 15:15:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-04-11 15:15:52,187 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 29 [2018-04-11 15:15:52,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:52,187 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-04-11 15:15:52,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:15:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-04-11 15:15:52,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:15:52,187 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:52,187 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-11 15:15:52,188 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:52,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1560479931, now seen corresponding path program 1 times [2018-04-11 15:15:52,188 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:52,188 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:52,188 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:52,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:52,188 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:52,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:52,198 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:52,198 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:52,198 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:52,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:52,219 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:52,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:52,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:15:52,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:52,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:52,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:15:52,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 15:15:52,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:15:52,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:15:52,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:52,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-11 15:15:52,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-11 15:15:52,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:15:52,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:52,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:36 [2018-04-11 15:15:52,355 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-11 15:15:52,357 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:15:52,358 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-11 15:15:52,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 1 [2018-04-11 15:15:52,363 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,371 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2018-04-11 15:15:52,381 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-11 15:15:52,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:52,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-11 15:15:52,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:15:52,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:15:52,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:15:52,381 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 13 states. [2018-04-11 15:15:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:52,663 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2018-04-11 15:15:52,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:15:52,663 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-04-11 15:15:52,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:52,664 INFO L225 Difference]: With dead ends: 153 [2018-04-11 15:15:52,664 INFO L226 Difference]: Without dead ends: 153 [2018-04-11 15:15:52,664 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:15:52,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-11 15:15:52,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 136. [2018-04-11 15:15:52,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-11 15:15:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2018-04-11 15:15:52,666 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 29 [2018-04-11 15:15:52,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:52,666 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2018-04-11 15:15:52,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:15:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2018-04-11 15:15:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:15:52,667 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:52,667 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-11 15:15:52,667 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:52,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2073032434, now seen corresponding path program 1 times [2018-04-11 15:15:52,667 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:52,667 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:52,668 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:52,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:52,668 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:52,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:52,713 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:52,713 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:52,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:52,726 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:52,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:52,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-04-11 15:15:52,745 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-11 15:15:52,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:15:52,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2018-04-11 15:15:52,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:15:52,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:15:52,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:15:52,746 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand 10 states. [2018-04-11 15:15:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:52,800 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2018-04-11 15:15:52,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:15:52,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-04-11 15:15:52,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:52,824 INFO L225 Difference]: With dead ends: 139 [2018-04-11 15:15:52,824 INFO L226 Difference]: Without dead ends: 139 [2018-04-11 15:15:52,824 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:15:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-11 15:15:52,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 129. [2018-04-11 15:15:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 15:15:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2018-04-11 15:15:52,827 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 29 [2018-04-11 15:15:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:52,827 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2018-04-11 15:15:52,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:15:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2018-04-11 15:15:52,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:15:52,827 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:52,827 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-11 15:15:52,827 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:52,827 INFO L82 PathProgramCache]: Analyzing trace with hash 287492487, now seen corresponding path program 1 times [2018-04-11 15:15:52,827 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:52,827 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:52,828 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:52,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:52,828 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:52,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:52,835 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:52,835 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:52,835 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:52,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:52,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:52,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:52,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:52,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:15:52,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:52,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:52,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:15:52,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:15:52,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:16 [2018-04-11 15:15:52,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:15:52,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:15:52,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:27 [2018-04-11 15:15:52,930 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-11 15:15:52,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:15:52,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:52,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:52,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:37 [2018-04-11 15:15:53,031 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 32 treesize of output 30 [2018-04-11 15:15:53,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-04-11 15:15:53,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:15:53,041 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 8 treesize of output 1 [2018-04-11 15:15:53,041 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:53,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:15:53,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:15:53,051 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:54, output treesize:54 [2018-04-11 15:15:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:53,102 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:15:53,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:15:53,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:15:53,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:15:53,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:15:53,102 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand 15 states. [2018-04-11 15:15:53,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:53,403 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2018-04-11 15:15:53,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:15:53,403 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-04-11 15:15:53,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:53,404 INFO L225 Difference]: With dead ends: 136 [2018-04-11 15:15:53,404 INFO L226 Difference]: Without dead ends: 136 [2018-04-11 15:15:53,404 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:15:53,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-11 15:15:53,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2018-04-11 15:15:53,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-11 15:15:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 150 transitions. [2018-04-11 15:15:53,407 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 150 transitions. Word has length 29 [2018-04-11 15:15:53,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:53,407 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 150 transitions. [2018-04-11 15:15:53,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:15:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 150 transitions. [2018-04-11 15:15:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:15:53,407 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:53,408 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:53,408 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:53,408 INFO L82 PathProgramCache]: Analyzing trace with hash 322332514, now seen corresponding path program 1 times [2018-04-11 15:15:53,408 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:53,408 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:53,409 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:53,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:53,409 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:53,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:53,489 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-11 15:15:53,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:53,489 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:53,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:53,506 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:53,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:53,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:53,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:53,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:15:53,641 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-11 15:15:53,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:15:53,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-11 15:15:53,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:15:53,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:15:53,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:15:53,642 INFO L87 Difference]: Start difference. First operand 133 states and 150 transitions. Second operand 17 states. [2018-04-11 15:15:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:53,809 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2018-04-11 15:15:53,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:15:53,809 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-04-11 15:15:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:53,810 INFO L225 Difference]: With dead ends: 159 [2018-04-11 15:15:53,810 INFO L226 Difference]: Without dead ends: 159 [2018-04-11 15:15:53,811 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:15:53,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-11 15:15:53,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 142. [2018-04-11 15:15:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-11 15:15:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2018-04-11 15:15:53,813 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 30 [2018-04-11 15:15:53,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:53,813 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2018-04-11 15:15:53,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:15:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2018-04-11 15:15:53,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:15:53,813 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:53,813 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:53,813 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:53,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1548705302, now seen corresponding path program 2 times [2018-04-11 15:15:53,814 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:53,814 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:53,814 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:53,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:53,814 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:53,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:54,037 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:54,037 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:54,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:15:54,048 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:15:54,049 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:15:54,050 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:54,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:54,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:54,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:54,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:15:54,121 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 14 treesize of output 11 [2018-04-11 15:15:54,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:15:54,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:54,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:54,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:54,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-11 15:15:54,296 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 28 treesize of output 22 [2018-04-11 15:15:54,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:54,301 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 22 treesize of output 31 [2018-04-11 15:15:54,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:15:54,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:15:54,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:15:54,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:49 [2018-04-11 15:15:54,424 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:54,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:15:54,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2018-04-11 15:15:54,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 15:15:54,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 15:15:54,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=889, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:15:54,425 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand 32 states. [2018-04-11 15:15:55,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:55,742 INFO L93 Difference]: Finished difference Result 200 states and 223 transitions. [2018-04-11 15:15:55,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:15:55,743 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-04-11 15:15:55,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:55,744 INFO L225 Difference]: With dead ends: 200 [2018-04-11 15:15:55,744 INFO L226 Difference]: Without dead ends: 200 [2018-04-11 15:15:55,745 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=344, Invalid=2518, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 15:15:55,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-04-11 15:15:55,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 150. [2018-04-11 15:15:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-11 15:15:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2018-04-11 15:15:55,749 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 32 [2018-04-11 15:15:55,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:55,749 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2018-04-11 15:15:55,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 15:15:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2018-04-11 15:15:55,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:15:55,750 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:55,750 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:55,750 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:55,751 INFO L82 PathProgramCache]: Analyzing trace with hash 957823030, now seen corresponding path program 2 times [2018-04-11 15:15:55,751 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:55,751 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:55,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:55,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:15:55,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:55,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:55,767 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:55,767 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:55,767 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:55,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:15:55,787 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:15:55,787 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:15:55,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:55,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:55,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:55,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:55,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:55,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:55,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2018-04-11 15:15:55,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:55,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:55,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:15:55,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:55,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:55,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-04-11 15:15:55,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:55,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:55,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:20 [2018-04-11 15:15:55,979 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 15:15:55,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:55,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:55,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:1 [2018-04-11 15:15:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:55,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:15:55,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:15:55,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:15:55,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:15:55,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:15:55,983 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand 14 states. [2018-04-11 15:15:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:56,245 INFO L93 Difference]: Finished difference Result 200 states and 219 transitions. [2018-04-11 15:15:56,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:15:56,246 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-04-11 15:15:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:56,247 INFO L225 Difference]: With dead ends: 200 [2018-04-11 15:15:56,247 INFO L226 Difference]: Without dead ends: 197 [2018-04-11 15:15:56,247 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:15:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-11 15:15:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2018-04-11 15:15:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-11 15:15:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 168 transitions. [2018-04-11 15:15:56,251 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 168 transitions. Word has length 34 [2018-04-11 15:15:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:56,251 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 168 transitions. [2018-04-11 15:15:56,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:15:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 168 transitions. [2018-04-11 15:15:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:15:56,252 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:56,252 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:56,252 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:56,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1413916232, now seen corresponding path program 1 times [2018-04-11 15:15:56,252 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:56,252 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:56,253 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:56,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:15:56,253 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:56,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:56,264 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:56,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:56,264 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:56,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:56,285 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:56,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:56,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:56,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-11 15:15:56,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:56,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:56,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:15:56,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:56,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:15:56,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:56,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:56,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:56,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:15:56,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:56,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:56,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:16 [2018-04-11 15:15:56,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:15:56,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:15:56,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:56,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:56,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:56,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 15:15:56,386 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-11 15:15:56,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:15:56,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:56,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:56,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:56,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-04-11 15:15:56,502 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 33 treesize of output 32 [2018-04-11 15:15:56,509 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 17 treesize of output 25 [2018-04-11 15:15:56,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:15:56,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:15:56,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 15:15:56,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:65 [2018-04-11 15:15:56,598 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-11 15:15:56,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 15:15:56,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:15:56,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:15:56,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:15:56,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:38 [2018-04-11 15:15:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:56,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:15:56,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:15:56,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:15:56,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:15:56,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:15:56,683 INFO L87 Difference]: Start difference. First operand 149 states and 168 transitions. Second operand 18 states. [2018-04-11 15:15:57,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:57,158 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2018-04-11 15:15:57,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:15:57,158 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-04-11 15:15:57,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:57,158 INFO L225 Difference]: With dead ends: 161 [2018-04-11 15:15:57,159 INFO L226 Difference]: Without dead ends: 161 [2018-04-11 15:15:57,159 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:15:57,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-11 15:15:57,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2018-04-11 15:15:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-11 15:15:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2018-04-11 15:15:57,162 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 34 [2018-04-11 15:15:57,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:57,162 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2018-04-11 15:15:57,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:15:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2018-04-11 15:15:57,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:15:57,163 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:57,163 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:57,163 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:57,163 INFO L82 PathProgramCache]: Analyzing trace with hash 395732773, now seen corresponding path program 1 times [2018-04-11 15:15:57,163 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:57,164 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:57,164 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:57,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:57,164 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:57,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:57,176 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:57,176 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:57,176 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:57,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:57,196 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:57,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:57,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:57,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:57,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:57,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:57,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2018-04-11 15:15:57,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:57,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:57,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-04-11 15:15:57,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:57,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:57,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:57,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:15:57,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:57,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:57,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-04-11 15:15:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:57,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:15:57,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:15:57,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:15:57,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:15:57,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:15:57,386 INFO L87 Difference]: Start difference. First operand 154 states and 175 transitions. Second operand 17 states. [2018-04-11 15:15:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:57,776 INFO L93 Difference]: Finished difference Result 195 states and 222 transitions. [2018-04-11 15:15:57,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:15:57,776 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-04-11 15:15:57,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:57,777 INFO L225 Difference]: With dead ends: 195 [2018-04-11 15:15:57,778 INFO L226 Difference]: Without dead ends: 195 [2018-04-11 15:15:57,778 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:15:57,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-11 15:15:57,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 168. [2018-04-11 15:15:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 15:15:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 191 transitions. [2018-04-11 15:15:57,782 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 191 transitions. Word has length 34 [2018-04-11 15:15:57,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:57,782 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 191 transitions. [2018-04-11 15:15:57,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:15:57,783 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 191 transitions. [2018-04-11 15:15:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 15:15:57,783 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:57,783 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:57,783 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:57,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1068524766, now seen corresponding path program 1 times [2018-04-11 15:15:57,784 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:57,784 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:57,784 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:57,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:57,784 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:57,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:57,792 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:57,793 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:57,793 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:57,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:57,806 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:57,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:57,833 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-11 15:15:57,835 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-11 15:15:57,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:57,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:57,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:57,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 15:15:57,873 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-11 15:15:57,877 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-11 15:15:57,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:57,881 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:15:57,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:15:57,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:15:57,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:15:57,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-11 15:15:57,882 INFO L87 Difference]: Start difference. First operand 168 states and 191 transitions. Second operand 8 states. [2018-04-11 15:15:57,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:57,946 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2018-04-11 15:15:57,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:15:57,946 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-04-11 15:15:57,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:57,947 INFO L225 Difference]: With dead ends: 167 [2018-04-11 15:15:57,947 INFO L226 Difference]: Without dead ends: 126 [2018-04-11 15:15:57,947 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-11 15:15:57,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-11 15:15:57,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2018-04-11 15:15:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-11 15:15:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-04-11 15:15:57,949 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 35 [2018-04-11 15:15:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:57,950 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-04-11 15:15:57,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:15:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-04-11 15:15:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 15:15:57,950 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:57,950 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:57,950 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:15:57,951 INFO L82 PathProgramCache]: Analyzing trace with hash -895217575, now seen corresponding path program 3 times [2018-04-11 15:15:57,951 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:57,951 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:57,951 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:57,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:57,951 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:57,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:58,390 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:58,390 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:58,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:15:58,410 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-04-11 15:15:58,411 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:15:58,413 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:58,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:58,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:58,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:58,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:15:58,519 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 14 treesize of output 11 [2018-04-11 15:15:58,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:15:58,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:58,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:58,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:58,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-11 15:15:58,747 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-11 15:15:58,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:58,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:58,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:38 [2018-04-11 15:15:58,858 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 33 treesize of output 25 [2018-04-11 15:15:58,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 47 [2018-04-11 15:15:58,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 5 xjuncts. [2018-04-11 15:15:58,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:15:58,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:15:58,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:88 [2018-04-11 15:15:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:59,067 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:15:59,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-04-11 15:15:59,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 15:15:59,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 15:15:59,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1289, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:15:59,068 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 38 states. [2018-04-11 15:16:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:00,188 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2018-04-11 15:16:00,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:16:00,189 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 36 [2018-04-11 15:16:00,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:00,189 INFO L225 Difference]: With dead ends: 149 [2018-04-11 15:16:00,189 INFO L226 Difference]: Without dead ends: 149 [2018-04-11 15:16:00,190 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=361, Invalid=3421, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 15:16:00,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-04-11 15:16:00,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 129. [2018-04-11 15:16:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 15:16:00,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2018-04-11 15:16:00,192 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 36 [2018-04-11 15:16:00,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:00,192 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2018-04-11 15:16:00,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 15:16:00,192 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2018-04-11 15:16:00,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 15:16:00,192 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:00,192 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:00,193 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:00,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1917191592, now seen corresponding path program 2 times [2018-04-11 15:16:00,193 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:00,193 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:00,193 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:00,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:00,193 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:00,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:00,210 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:00,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:00,210 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:00,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:16:00,233 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:16:00,234 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:00,237 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:00,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:00,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:00,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:00,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-11 15:16:00,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:00,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:00,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:00,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:00,274 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-11 15:16:00,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:00,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:00,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:16:00,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:16:00,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 11 treesize of output 10 [2018-04-11 15:16:00,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:00,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:00,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:00,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-04-11 15:16:00,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-11 15:16:00,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-11 15:16:00,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:00,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:00,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:00,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-04-11 15:16:03,651 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 38 treesize of output 34 [2018-04-11 15:16:03,653 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:16:03,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:03,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:16:03,664 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:03,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:03,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:03,687 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:87, output treesize:81 [2018-04-11 15:16:03,779 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-11 15:16:03,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:03,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:16:03,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:16:03,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:16:03,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=331, Unknown=3, NotChecked=0, Total=380 [2018-04-11 15:16:03,780 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand 20 states. [2018-04-11 15:16:09,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:09,210 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2018-04-11 15:16:09,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:16:09,210 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-04-11 15:16:09,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:09,211 INFO L225 Difference]: With dead ends: 139 [2018-04-11 15:16:09,211 INFO L226 Difference]: Without dead ends: 139 [2018-04-11 15:16:09,211 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=134, Invalid=855, Unknown=3, NotChecked=0, Total=992 [2018-04-11 15:16:09,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-11 15:16:09,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 129. [2018-04-11 15:16:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 15:16:09,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2018-04-11 15:16:09,213 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 38 [2018-04-11 15:16:09,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:09,213 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2018-04-11 15:16:09,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:16:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2018-04-11 15:16:09,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:16:09,213 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:09,214 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:09,214 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:09,214 INFO L82 PathProgramCache]: Analyzing trace with hash -642244955, now seen corresponding path program 2 times [2018-04-11 15:16:09,214 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:09,214 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:09,214 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:09,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:09,214 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:09,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:09,226 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:09,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:09,226 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:09,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:16:09,248 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:16:09,248 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:09,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:09,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:09,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:09,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:09,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:09,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:09,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:16:09,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:09,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:16:09,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:09,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:09,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:09,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:09,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:09,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:09,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 15:16:09,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:16:09,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 12 treesize of output 11 [2018-04-11 15:16:09,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:09,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:09,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:09,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 15:16:09,360 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 26 treesize of output 27 [2018-04-11 15:16:09,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:16:09,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:09,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:09,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:09,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-11 15:16:09,444 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 33 treesize of output 32 [2018-04-11 15:16:09,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-04-11 15:16:09,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:09,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:09,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 15:16:09,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:43 [2018-04-11 15:16:09,528 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-11 15:16:09,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:16:09,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:09,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:09,541 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-11 15:16:09,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-04-11 15:16:09,576 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-11 15:16:09,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 17 treesize of output 14 [2018-04-11 15:16:09,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:09,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:09,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:09,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-11 15:16:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:09,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:09,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:16:09,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:16:09,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:16:09,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:16:09,671 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand 18 states. [2018-04-11 15:16:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:10,082 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-04-11 15:16:10,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:16:10,082 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-04-11 15:16:10,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:10,083 INFO L225 Difference]: With dead ends: 128 [2018-04-11 15:16:10,083 INFO L226 Difference]: Without dead ends: 128 [2018-04-11 15:16:10,083 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:16:10,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-11 15:16:10,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 106. [2018-04-11 15:16:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-11 15:16:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2018-04-11 15:16:10,085 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 39 [2018-04-11 15:16:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:10,085 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2018-04-11 15:16:10,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:16:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-04-11 15:16:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:16:10,085 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:10,085 INFO L355 BasicCegarLoop]: trace histogram [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-11 15:16:10,086 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:10,086 INFO L82 PathProgramCache]: Analyzing trace with hash 962080944, now seen corresponding path program 3 times [2018-04-11 15:16:10,086 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:10,086 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:10,086 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:10,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:10,086 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:10,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:10,103 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:10,103 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:10,103 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:10,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:16:10,126 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 15:16:10,126 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:10,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:10,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:10,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:10,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:10,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:10,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:10,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-11 15:16:10,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:10,161 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 14 treesize of output 17 [2018-04-11 15:16:10,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:10,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:10,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:10,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:10,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:10,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:10,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2018-04-11 15:16:10,344 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-11 15:16:10,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:10,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:16:10,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:16:10,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:16:10,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:16:10,345 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 18 states. [2018-04-11 15:16:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:11,078 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-04-11 15:16:11,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:16:11,079 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-04-11 15:16:11,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:11,079 INFO L225 Difference]: With dead ends: 131 [2018-04-11 15:16:11,079 INFO L226 Difference]: Without dead ends: 131 [2018-04-11 15:16:11,080 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=1428, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:16:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-11 15:16:11,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 111. [2018-04-11 15:16:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-11 15:16:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-04-11 15:16:11,082 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 39 [2018-04-11 15:16:11,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:11,083 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-04-11 15:16:11,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:16:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-04-11 15:16:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 15:16:11,083 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:11,083 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:11,084 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:11,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1090524900, now seen corresponding path program 4 times [2018-04-11 15:16:11,084 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:11,084 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:11,085 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:11,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:11,085 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:11,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:11,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:11,664 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:11,664 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:16:11,682 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:16:11,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:11,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:11,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:11,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:11,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:11,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:16:11,774 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 14 treesize of output 11 [2018-04-11 15:16:11,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:16:11,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:11,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:11,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:11,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-11 15:16:12,277 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 46 treesize of output 36 [2018-04-11 15:16:12,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:12,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:12,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 101 [2018-04-11 15:16:12,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 20 xjuncts. [2018-04-11 15:16:12,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:12,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:12,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:166 [2018-04-11 15:16:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:12,635 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:16:12,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 44 [2018-04-11 15:16:12,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 15:16:12,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 15:16:12,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1751, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:16:12,636 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 45 states. [2018-04-11 15:16:13,248 WARN L151 SmtUtils]: Spent 397ms on a formula simplification. DAG size of input: 63 DAG size of output 31 [2018-04-11 15:16:13,830 WARN L151 SmtUtils]: Spent 512ms on a formula simplification. DAG size of input: 46 DAG size of output 24 [2018-04-11 15:16:14,441 WARN L151 SmtUtils]: Spent 513ms on a formula simplification. DAG size of input: 60 DAG size of output 38 [2018-04-11 15:16:15,034 WARN L151 SmtUtils]: Spent 543ms on a formula simplification. DAG size of input: 60 DAG size of output 38 [2018-04-11 15:16:15,252 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 52 DAG size of output 30 [2018-04-11 15:16:15,835 WARN L151 SmtUtils]: Spent 534ms on a formula simplification. DAG size of input: 65 DAG size of output 43 [2018-04-11 15:16:16,799 WARN L151 SmtUtils]: Spent 470ms on a formula simplification. DAG size of input: 65 DAG size of output 43 [2018-04-11 15:16:18,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:18,758 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2018-04-11 15:16:18,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 15:16:18,758 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 40 [2018-04-11 15:16:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:18,759 INFO L225 Difference]: With dead ends: 167 [2018-04-11 15:16:18,759 INFO L226 Difference]: Without dead ends: 167 [2018-04-11 15:16:18,760 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1577 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=660, Invalid=4742, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 15:16:18,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-11 15:16:18,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 127. [2018-04-11 15:16:18,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-11 15:16:18,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2018-04-11 15:16:18,763 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 40 [2018-04-11 15:16:18,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:18,763 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2018-04-11 15:16:18,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 15:16:18,763 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2018-04-11 15:16:18,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 15:16:18,764 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:18,764 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:18,764 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:18,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1758680405, now seen corresponding path program 4 times [2018-04-11 15:16:18,764 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:18,764 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:18,765 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:18,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:18,765 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:18,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:18,786 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:18,786 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:18,786 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:18,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:16:18,806 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:16:18,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:18,810 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:18,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:18,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:18,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:18,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-11 15:16:18,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:18,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:18,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:18,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:18,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:18,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:18,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:18,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:16:18,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:16:18,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:16:18,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:18,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:18,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:18,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-04-11 15:16:18,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-11 15:16:18,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:16:18,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:18,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:18,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:18,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-04-11 15:16:20,482 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 46 treesize of output 40 [2018-04-11 15:16:20,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:20,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 31 [2018-04-11 15:16:20,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:20,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 14 treesize of output 11 [2018-04-11 15:16:20,498 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:20,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:20,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:20,528 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:97, output treesize:96 [2018-04-11 15:16:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:20,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:20,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:16:20,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:16:20,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:16:20,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=452, Unknown=1, NotChecked=0, Total=506 [2018-04-11 15:16:20,662 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 23 states. [2018-04-11 15:16:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:25,237 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2018-04-11 15:16:25,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:16:25,237 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2018-04-11 15:16:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:25,238 INFO L225 Difference]: With dead ends: 148 [2018-04-11 15:16:25,238 INFO L226 Difference]: Without dead ends: 148 [2018-04-11 15:16:25,238 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=116, Invalid=875, Unknown=1, NotChecked=0, Total=992 [2018-04-11 15:16:25,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-11 15:16:25,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 127. [2018-04-11 15:16:25,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-11 15:16:25,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2018-04-11 15:16:25,240 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 42 [2018-04-11 15:16:25,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:25,240 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2018-04-11 15:16:25,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:16:25,240 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2018-04-11 15:16:25,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 15:16:25,241 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:25,241 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:25,241 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:25,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1320801267, now seen corresponding path program 5 times [2018-04-11 15:16:25,241 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:25,241 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:25,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:25,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:25,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:25,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:25,266 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:25,266 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:25,266 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:25,267 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:16:25,321 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-04-11 15:16:25,321 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:25,325 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:25,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:25,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:25,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-11 15:16:25,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:25,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:25,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-11 15:16:25,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:25,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:25,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 15:16:25,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2018-04-11 15:16:25,408 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 14 treesize of output 11 [2018-04-11 15:16:25,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:16:25,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:25,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:36 [2018-04-11 15:16:25,507 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 25 treesize of output 19 [2018-04-11 15:16:25,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:25,512 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 19 treesize of output 25 [2018-04-11 15:16:25,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:25,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:25,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:25,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:105 [2018-04-11 15:16:25,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:25,691 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-11 15:16:25,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:25,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:25,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-04-11 15:16:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:25,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:25,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:16:25,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:16:25,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:16:25,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=453, Unknown=1, NotChecked=0, Total=506 [2018-04-11 15:16:25,747 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 23 states. [2018-04-11 15:16:26,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:26,397 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2018-04-11 15:16:26,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:16:26,397 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-04-11 15:16:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:26,398 INFO L225 Difference]: With dead ends: 154 [2018-04-11 15:16:26,398 INFO L226 Difference]: Without dead ends: 154 [2018-04-11 15:16:26,398 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=1326, Unknown=1, NotChecked=0, Total=1482 [2018-04-11 15:16:26,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-11 15:16:26,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 127. [2018-04-11 15:16:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-11 15:16:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2018-04-11 15:16:26,400 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 43 [2018-04-11 15:16:26,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:26,400 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2018-04-11 15:16:26,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:16:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2018-04-11 15:16:26,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:16:26,400 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:26,400 INFO L355 BasicCegarLoop]: trace histogram [4, 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] [2018-04-11 15:16:26,400 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:26,401 INFO L82 PathProgramCache]: Analyzing trace with hash -209869307, now seen corresponding path program 6 times [2018-04-11 15:16:26,401 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:26,401 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:26,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:26,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:26,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:26,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:26,410 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:26,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:26,410 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:26,410 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:16:26,446 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-11 15:16:26,447 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:26,449 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:26,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:26,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:26,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-11 15:16:26,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:26,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:26,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:26,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-11 15:16:26,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:26,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-04-11 15:16:26,687 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-11 15:16:26,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:26,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:16:26,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:16:26,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:16:26,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:16:26,688 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 17 states. [2018-04-11 15:16:27,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:27,347 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2018-04-11 15:16:27,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:16:27,347 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-04-11 15:16:27,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:27,347 INFO L225 Difference]: With dead ends: 162 [2018-04-11 15:16:27,347 INFO L226 Difference]: Without dead ends: 162 [2018-04-11 15:16:27,348 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=1228, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:16:27,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-11 15:16:27,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 132. [2018-04-11 15:16:27,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-11 15:16:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-04-11 15:16:27,349 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 44 [2018-04-11 15:16:27,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:27,349 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-04-11 15:16:27,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:16:27,349 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-04-11 15:16:27,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 15:16:27,350 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:27,350 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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-11 15:16:27,350 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:27,351 INFO L82 PathProgramCache]: Analyzing trace with hash -295496146, now seen corresponding path program 7 times [2018-04-11 15:16:27,351 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:27,351 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:27,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:27,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:27,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:27,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:27,375 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:27,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:27,375 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:27,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:27,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:27,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 6 treesize of output 5 [2018-04-11 15:16:27,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:27,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2018-04-11 15:16:27,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:27,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:27,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:27,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,461 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 19 treesize of output 22 [2018-04-11 15:16:27,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:25 [2018-04-11 15:16:27,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:16:27,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:16:27,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:27,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:27,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-11 15:16:27,807 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 38 treesize of output 30 [2018-04-11 15:16:27,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:27,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:27,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:27,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 58 [2018-04-11 15:16:27,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:27,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:27,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:27,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:144 [2018-04-11 15:16:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:28,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:28,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:16:28,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:16:28,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:16:28,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:16:28,136 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 25 states. [2018-04-11 15:16:29,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:29,654 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2018-04-11 15:16:29,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:16:29,654 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-04-11 15:16:29,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:29,655 INFO L225 Difference]: With dead ends: 164 [2018-04-11 15:16:29,655 INFO L226 Difference]: Without dead ends: 164 [2018-04-11 15:16:29,655 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=210, Invalid=2142, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 15:16:29,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-11 15:16:29,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 132. [2018-04-11 15:16:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-11 15:16:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-04-11 15:16:29,657 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 46 [2018-04-11 15:16:29,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:29,657 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-04-11 15:16:29,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:16:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-04-11 15:16:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 15:16:29,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:29,658 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:29,658 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:29,658 INFO L82 PathProgramCache]: Analyzing trace with hash 328207906, now seen corresponding path program 5 times [2018-04-11 15:16:29,658 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:29,658 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:29,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:29,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:29,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:29,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:30,840 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:30,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:30,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:30,841 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:16:30,870 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-04-11 15:16:30,870 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:30,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:30,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:30,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:30,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:30,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:16:30,920 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 14 treesize of output 11 [2018-04-11 15:16:30,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:16:30,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:30,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:30,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:30,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-11 15:16:31,934 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-11 15:16:31,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:31,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:31,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:46 [2018-04-11 15:16:32,314 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 57 treesize of output 43 [2018-04-11 15:16:32,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:32,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:32,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:32,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:32,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:32,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 81 [2018-04-11 15:16:32,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:32,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:32,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:32,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:130 [2018-04-11 15:16:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:32,518 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:16:32,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 52 [2018-04-11 15:16:32,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-11 15:16:32,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-11 15:16:32,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=2357, Unknown=1, NotChecked=0, Total=2756 [2018-04-11 15:16:32,519 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 53 states. [2018-04-11 15:16:34,613 WARN L151 SmtUtils]: Spent 1132ms on a formula simplification. DAG size of input: 75 DAG size of output 75 [2018-04-11 15:16:35,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:35,135 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-04-11 15:16:35,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 15:16:35,135 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 48 [2018-04-11 15:16:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:35,136 INFO L225 Difference]: With dead ends: 217 [2018-04-11 15:16:35,136 INFO L226 Difference]: Without dead ends: 217 [2018-04-11 15:16:35,138 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2525 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=983, Invalid=6498, Unknown=1, NotChecked=0, Total=7482 [2018-04-11 15:16:35,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-11 15:16:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 164. [2018-04-11 15:16:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-11 15:16:35,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 178 transitions. [2018-04-11 15:16:35,140 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 178 transitions. Word has length 48 [2018-04-11 15:16:35,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:35,141 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 178 transitions. [2018-04-11 15:16:35,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-11 15:16:35,141 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 178 transitions. [2018-04-11 15:16:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 15:16:35,141 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:35,142 INFO L355 BasicCegarLoop]: trace histogram [4, 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] [2018-04-11 15:16:35,142 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:35,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1455897800, now seen corresponding path program 8 times [2018-04-11 15:16:35,142 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:35,142 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:35,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:35,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:35,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:35,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:35,182 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:35,182 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:35,183 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:35,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:16:35,225 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:16:35,225 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:35,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:35,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:35,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:35,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:35,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:35,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:35,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-11 15:16:35,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:35,285 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 14 treesize of output 17 [2018-04-11 15:16:35,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:35,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:35,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:35,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:35,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:35,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:35,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2018-04-11 15:16:35,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:16:35,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:16:35,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:35,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:35,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:35,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-11 15:16:35,382 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 18 treesize of output 14 [2018-04-11 15:16:35,388 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 14 treesize of output 11 [2018-04-11 15:16:35,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:35,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:35,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:35,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:64 [2018-04-11 15:16:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:35,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:35,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:16:35,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:16:35,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:16:35,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:16:35,707 INFO L87 Difference]: Start difference. First operand 164 states and 178 transitions. Second operand 21 states. [2018-04-11 15:16:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:37,210 INFO L93 Difference]: Finished difference Result 216 states and 230 transitions. [2018-04-11 15:16:37,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 15:16:37,210 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2018-04-11 15:16:37,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:37,211 INFO L225 Difference]: With dead ends: 216 [2018-04-11 15:16:37,211 INFO L226 Difference]: Without dead ends: 216 [2018-04-11 15:16:37,212 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=211, Invalid=1949, Unknown=2, NotChecked=0, Total=2162 [2018-04-11 15:16:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-11 15:16:37,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 164. [2018-04-11 15:16:37,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-11 15:16:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 178 transitions. [2018-04-11 15:16:37,213 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 178 transitions. Word has length 48 [2018-04-11 15:16:37,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:37,213 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 178 transitions. [2018-04-11 15:16:37,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:16:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 178 transitions. [2018-04-11 15:16:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 15:16:37,214 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:37,214 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:37,214 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:37,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1130288604, now seen corresponding path program 1 times [2018-04-11 15:16:37,214 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:37,214 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:37,215 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:37,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:37,215 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:37,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:37,239 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:37,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:37,239 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:37,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:37,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:37,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:37,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:37,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:37,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:37,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:37,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-11 15:16:37,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:37,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:37,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-11 15:16:37,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:37,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:37,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:37,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:37,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:37,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:37,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-11 15:16:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:37,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:37,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:16:37,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:16:37,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:16:37,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:16:37,577 INFO L87 Difference]: Start difference. First operand 164 states and 178 transitions. Second operand 19 states. [2018-04-11 15:16:38,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:38,047 INFO L93 Difference]: Finished difference Result 194 states and 208 transitions. [2018-04-11 15:16:38,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:16:38,048 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2018-04-11 15:16:38,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:38,048 INFO L225 Difference]: With dead ends: 194 [2018-04-11 15:16:38,048 INFO L226 Difference]: Without dead ends: 194 [2018-04-11 15:16:38,049 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=1129, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:16:38,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-11 15:16:38,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 169. [2018-04-11 15:16:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-11 15:16:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 183 transitions. [2018-04-11 15:16:38,050 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 183 transitions. Word has length 50 [2018-04-11 15:16:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:38,050 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 183 transitions. [2018-04-11 15:16:38,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:16:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2018-04-11 15:16:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 15:16:38,051 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:38,051 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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-11 15:16:38,051 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:38,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1516107727, now seen corresponding path program 9 times [2018-04-11 15:16:38,051 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:38,051 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:38,051 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:38,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:38,052 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:38,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:38,171 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:38,171 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:38,171 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:38,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:16:38,223 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-11 15:16:38,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:38,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:38,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:38,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:38,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:38,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:38,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:38,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:21 [2018-04-11 15:16:38,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:38,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-04-11 15:16:38,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:38,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:38,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:38,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:38,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:38,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:38,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:25 [2018-04-11 15:16:38,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:16:38,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:16:38,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:38,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:38,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:38,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-11 15:16:38,628 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 41 treesize of output 31 [2018-04-11 15:16:38,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:38,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:38,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:38,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 53 [2018-04-11 15:16:38,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:38,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:38,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:38,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:161 [2018-04-11 15:16:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:38,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:38,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 15:16:38,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:16:38,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:16:38,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:16:38,928 INFO L87 Difference]: Start difference. First operand 169 states and 183 transitions. Second operand 29 states. [2018-04-11 15:16:40,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:40,026 INFO L93 Difference]: Finished difference Result 204 states and 218 transitions. [2018-04-11 15:16:40,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:16:40,026 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 50 [2018-04-11 15:16:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:40,027 INFO L225 Difference]: With dead ends: 204 [2018-04-11 15:16:40,027 INFO L226 Difference]: Without dead ends: 204 [2018-04-11 15:16:40,027 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=206, Invalid=2344, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 15:16:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-11 15:16:40,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 169. [2018-04-11 15:16:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-11 15:16:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 183 transitions. [2018-04-11 15:16:40,029 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 183 transitions. Word has length 50 [2018-04-11 15:16:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:40,030 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 183 transitions. [2018-04-11 15:16:40,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:16:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2018-04-11 15:16:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 15:16:40,030 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:40,030 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2018-04-11 15:16:40,030 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:40,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1903984455, now seen corresponding path program 10 times [2018-04-11 15:16:40,031 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:40,031 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:40,031 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:40,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:40,032 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:40,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:40,075 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:40,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:40,075 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:40,075 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:16:40,094 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:16:40,095 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:40,097 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:40,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:40,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:40,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:40,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:40,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:40,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-11 15:16:40,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:40,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:40,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:40,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:40,147 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 14 treesize of output 17 [2018-04-11 15:16:40,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:40,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:40,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2018-04-11 15:16:40,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:16:40,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 11 treesize of output 10 [2018-04-11 15:16:40,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:40,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:40,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:40,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-11 15:16:40,343 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 38 treesize of output 30 [2018-04-11 15:16:40,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:40,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:40,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:40,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 58 [2018-04-11 15:16:40,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:40,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:40,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:40,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:128 [2018-04-11 15:16:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:40,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:40,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:16:40,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:16:40,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:16:40,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:16:40,601 INFO L87 Difference]: Start difference. First operand 169 states and 183 transitions. Second operand 25 states. [2018-04-11 15:16:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:41,942 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2018-04-11 15:16:41,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:16:41,942 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 51 [2018-04-11 15:16:41,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:41,943 INFO L225 Difference]: With dead ends: 209 [2018-04-11 15:16:41,943 INFO L226 Difference]: Without dead ends: 209 [2018-04-11 15:16:41,943 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=1811, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:16:41,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-04-11 15:16:41,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 169. [2018-04-11 15:16:41,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-11 15:16:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 183 transitions. [2018-04-11 15:16:41,946 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 183 transitions. Word has length 51 [2018-04-11 15:16:41,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:41,946 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 183 transitions. [2018-04-11 15:16:41,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:16:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2018-04-11 15:16:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 15:16:41,946 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:41,946 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 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] [2018-04-11 15:16:41,946 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:41,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2037749523, now seen corresponding path program 11 times [2018-04-11 15:16:41,946 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:41,947 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:41,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:41,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:41,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:41,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:41,959 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:41,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:41,959 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:41,959 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:16:41,977 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-04-11 15:16:41,977 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:41,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:41,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:41,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:41,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:41,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:42,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:42,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-11 15:16:42,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:42,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:42,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:16:42,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:42,025 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 14 treesize of output 17 [2018-04-11 15:16:42,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:42,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:42,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:30 [2018-04-11 15:16:42,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:16:42,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:16:42,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:42,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:42,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:42,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-11 15:16:42,155 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 17 treesize of output 13 [2018-04-11 15:16:42,160 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 13 treesize of output 14 [2018-04-11 15:16:42,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:42,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:42,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:42,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:81 [2018-04-11 15:16:42,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:42,404 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-11 15:16:42,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:42,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:42,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-04-11 15:16:42,450 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-11 15:16:42,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:42,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:16:42,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:16:42,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:16:42,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:16:42,451 INFO L87 Difference]: Start difference. First operand 169 states and 183 transitions. Second operand 22 states. [2018-04-11 15:16:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:43,121 INFO L93 Difference]: Finished difference Result 214 states and 228 transitions. [2018-04-11 15:16:43,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:16:43,121 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-04-11 15:16:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:43,122 INFO L225 Difference]: With dead ends: 214 [2018-04-11 15:16:43,122 INFO L226 Difference]: Without dead ends: 214 [2018-04-11 15:16:43,122 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:16:43,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-11 15:16:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 169. [2018-04-11 15:16:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-11 15:16:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 183 transitions. [2018-04-11 15:16:43,124 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 183 transitions. Word has length 53 [2018-04-11 15:16:43,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:43,124 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 183 transitions. [2018-04-11 15:16:43,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:16:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2018-04-11 15:16:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:16:43,125 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:43,125 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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-11 15:16:43,125 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:43,125 INFO L82 PathProgramCache]: Analyzing trace with hash 101436645, now seen corresponding path program 12 times [2018-04-11 15:16:43,125 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:43,125 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:43,125 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:43,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:43,125 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:43,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:43,136 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:43,136 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:43,136 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:43,137 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:16:43,178 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-04-11 15:16:43,178 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:43,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:43,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:43,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:43,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:43,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:43,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:43,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-11 15:16:43,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:43,211 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 14 treesize of output 17 [2018-04-11 15:16:43,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:43,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:43,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:43,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:43,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:43,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:43,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-04-11 15:16:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:43,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:43,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:16:43,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:16:43,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:16:43,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:16:43,436 INFO L87 Difference]: Start difference. First operand 169 states and 183 transitions. Second operand 19 states. [2018-04-11 15:16:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:43,934 INFO L93 Difference]: Finished difference Result 223 states and 237 transitions. [2018-04-11 15:16:43,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:16:43,934 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-04-11 15:16:43,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:43,934 INFO L225 Difference]: With dead ends: 223 [2018-04-11 15:16:43,935 INFO L226 Difference]: Without dead ends: 223 [2018-04-11 15:16:43,935 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=1063, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:16:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-11 15:16:43,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 169. [2018-04-11 15:16:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-11 15:16:43,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 183 transitions. [2018-04-11 15:16:43,938 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 183 transitions. Word has length 54 [2018-04-11 15:16:43,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:43,938 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 183 transitions. [2018-04-11 15:16:43,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:16:43,938 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2018-04-11 15:16:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:16:43,938 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:43,939 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 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-11 15:16:43,939 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:43,939 INFO L82 PathProgramCache]: Analyzing trace with hash -532528972, now seen corresponding path program 13 times [2018-04-11 15:16:43,939 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:43,939 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:43,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:43,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:43,940 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:43,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:43,993 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:43,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:43,994 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:43,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:44,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:44,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:44,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:44,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:44,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-11 15:16:44,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:44,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:44,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:44,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:44,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:44,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:44,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:44,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:16:44,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:16:44,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:16:44,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:44,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:44,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:44,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-04-11 15:16:44,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-11 15:16:44,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:16:44,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:44,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:44,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:44,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-04-11 15:16:44,819 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 67 treesize of output 55 [2018-04-11 15:16:44,837 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 14 treesize of output 11 [2018-04-11 15:16:44,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:44,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 51 [2018-04-11 15:16:44,853 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:44,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:44,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:44,885 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:98, output treesize:85 [2018-04-11 15:16:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:45,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:45,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 15:16:45,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 15:16:45,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 15:16:45,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=858, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:16:45,007 INFO L87 Difference]: Start difference. First operand 169 states and 183 transitions. Second operand 31 states. [2018-04-11 15:16:46,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:46,794 INFO L93 Difference]: Finished difference Result 201 states and 215 transitions. [2018-04-11 15:16:46,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:16:46,794 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 54 [2018-04-11 15:16:46,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:46,795 INFO L225 Difference]: With dead ends: 201 [2018-04-11 15:16:46,795 INFO L226 Difference]: Without dead ends: 201 [2018-04-11 15:16:46,795 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=215, Invalid=2755, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 15:16:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-11 15:16:46,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 169. [2018-04-11 15:16:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-11 15:16:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 183 transitions. [2018-04-11 15:16:46,797 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 183 transitions. Word has length 54 [2018-04-11 15:16:46,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:46,797 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 183 transitions. [2018-04-11 15:16:46,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 15:16:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2018-04-11 15:16:46,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 15:16:46,798 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:46,798 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:46,798 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:46,798 INFO L82 PathProgramCache]: Analyzing trace with hash -371559151, now seen corresponding path program 2 times [2018-04-11 15:16:46,798 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:46,798 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:46,798 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:46,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:46,798 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:46,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:46,821 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:46,821 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:46,821 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:46,822 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:16:46,847 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:16:46,847 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:46,852 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:46,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:46,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:46,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:46,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:46,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:46,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-11 15:16:46,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:46,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:46,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-11 15:16:46,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:46,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:46,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:46,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:46,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:46,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:46,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-11 15:16:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:47,068 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:47,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:16:47,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:16:47,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:16:47,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:16:47,069 INFO L87 Difference]: Start difference. First operand 169 states and 183 transitions. Second operand 20 states. [2018-04-11 15:16:47,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:47,599 INFO L93 Difference]: Finished difference Result 204 states and 218 transitions. [2018-04-11 15:16:47,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:16:47,599 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-04-11 15:16:47,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:47,600 INFO L225 Difference]: With dead ends: 204 [2018-04-11 15:16:47,600 INFO L226 Difference]: Without dead ends: 204 [2018-04-11 15:16:47,601 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:16:47,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-11 15:16:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 174. [2018-04-11 15:16:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-04-11 15:16:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2018-04-11 15:16:47,603 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 55 [2018-04-11 15:16:47,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:47,603 INFO L459 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2018-04-11 15:16:47,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:16:47,603 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2018-04-11 15:16:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 15:16:47,604 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:47,604 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2018-04-11 15:16:47,604 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:47,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1964812508, now seen corresponding path program 14 times [2018-04-11 15:16:47,604 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:47,604 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:47,604 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:47,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:47,604 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:47,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:47,685 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:47,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:47,685 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:47,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:16:47,717 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:16:47,717 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:47,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:47,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:47,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:47,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:47,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:47,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:47,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-11 15:16:47,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:47,752 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 14 treesize of output 17 [2018-04-11 15:16:47,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:47,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:47,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:47,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:47,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:47,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:47,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-04-11 15:16:47,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:16:47,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 11 treesize of output 10 [2018-04-11 15:16:47,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:47,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:47,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:47,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-04-11 15:16:48,095 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 41 treesize of output 31 [2018-04-11 15:16:48,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:48,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:48,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:48,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 53 [2018-04-11 15:16:48,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:48,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:48,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:48,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:151 [2018-04-11 15:16:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:48,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:48,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 15:16:48,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:16:48,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:16:48,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:16:48,393 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand 29 states. [2018-04-11 15:16:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:49,601 INFO L93 Difference]: Finished difference Result 224 states and 238 transitions. [2018-04-11 15:16:49,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 15:16:49,601 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2018-04-11 15:16:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:49,602 INFO L225 Difference]: With dead ends: 224 [2018-04-11 15:16:49,602 INFO L226 Difference]: Without dead ends: 224 [2018-04-11 15:16:49,602 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=252, Invalid=3170, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 15:16:49,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-11 15:16:49,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 174. [2018-04-11 15:16:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-04-11 15:16:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2018-04-11 15:16:49,604 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 55 [2018-04-11 15:16:49,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:49,604 INFO L459 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2018-04-11 15:16:49,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:16:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2018-04-11 15:16:49,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 15:16:49,605 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:49,605 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:49,605 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:49,605 INFO L82 PathProgramCache]: Analyzing trace with hash -509952630, now seen corresponding path program 15 times [2018-04-11 15:16:49,605 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:49,605 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:49,605 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:49,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:49,606 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:49,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:49,631 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:49,631 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:49,631 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:49,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:16:49,660 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-04-11 15:16:49,660 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:49,663 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:49,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:49,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:49,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:49,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:49,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:49,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-11 15:16:49,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:49,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:49,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:49,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:49,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 14 treesize of output 17 [2018-04-11 15:16:49,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:49,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:49,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2018-04-11 15:16:49,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:16:49,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 11 treesize of output 10 [2018-04-11 15:16:49,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:49,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:49,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:49,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-11 15:16:49,903 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 25 treesize of output 19 [2018-04-11 15:16:49,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:49,908 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 19 treesize of output 25 [2018-04-11 15:16:49,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:49,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:49,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:49,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:85 [2018-04-11 15:16:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:50,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:50,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:16:50,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:16:50,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:16:50,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:16:50,144 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand 25 states. [2018-04-11 15:16:51,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:51,131 INFO L93 Difference]: Finished difference Result 244 states and 258 transitions. [2018-04-11 15:16:51,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 15:16:51,131 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-04-11 15:16:51,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:51,132 INFO L225 Difference]: With dead ends: 244 [2018-04-11 15:16:51,132 INFO L226 Difference]: Without dead ends: 244 [2018-04-11 15:16:51,132 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=241, Invalid=2729, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 15:16:51,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-11 15:16:51,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 174. [2018-04-11 15:16:51,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-04-11 15:16:51,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2018-04-11 15:16:51,134 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 57 [2018-04-11 15:16:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:51,134 INFO L459 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2018-04-11 15:16:51,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:16:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2018-04-11 15:16:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 15:16:51,135 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:51,135 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 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-11 15:16:51,135 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:51,135 INFO L82 PathProgramCache]: Analyzing trace with hash -415465545, now seen corresponding path program 16 times [2018-04-11 15:16:51,135 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:51,135 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:51,135 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:51,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:51,135 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:51,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:51,146 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:51,146 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:51,146 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:51,147 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:16:51,177 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:16:51,177 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:51,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:51,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:51,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:51,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:51,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:51,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:51,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:18 [2018-04-11 15:16:51,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:51,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:51,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:51,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:51,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-04-11 15:16:51,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:51,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:51,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-04-11 15:16:51,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:16:51,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:16:51,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:51,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:51,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:51,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-11 15:16:51,753 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 57 treesize of output 43 [2018-04-11 15:16:51,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:51,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:51,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:51,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:51,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:51,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 81 [2018-04-11 15:16:51,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:51,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:51,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:51,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:215 [2018-04-11 15:16:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:52,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:52,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-11 15:16:52,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 15:16:52,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 15:16:52,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1110, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:16:52,116 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand 35 states. [2018-04-11 15:16:53,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:53,647 INFO L93 Difference]: Finished difference Result 215 states and 229 transitions. [2018-04-11 15:16:53,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 15:16:53,647 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 58 [2018-04-11 15:16:53,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:53,648 INFO L225 Difference]: With dead ends: 215 [2018-04-11 15:16:53,648 INFO L226 Difference]: Without dead ends: 215 [2018-04-11 15:16:53,648 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=252, Invalid=3780, Unknown=0, NotChecked=0, Total=4032 [2018-04-11 15:16:53,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-11 15:16:53,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 174. [2018-04-11 15:16:53,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-04-11 15:16:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2018-04-11 15:16:53,650 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 58 [2018-04-11 15:16:53,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:53,651 INFO L459 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2018-04-11 15:16:53,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 15:16:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2018-04-11 15:16:53,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 15:16:53,651 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:53,651 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 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-11 15:16:53,651 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:53,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1390648592, now seen corresponding path program 17 times [2018-04-11 15:16:53,652 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:53,652 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:53,652 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:53,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:53,652 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:53,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:53,673 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:53,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:53,673 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:53,673 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:16:53,771 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-04-11 15:16:53,771 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:53,783 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:53,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:53,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:53,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:53,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:53,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:53,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-11 15:16:53,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:53,844 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 14 treesize of output 17 [2018-04-11 15:16:53,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:53,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:53,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:53,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:16:53,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:53,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:53,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:30 [2018-04-11 15:16:54,019 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 7 treesize of output 5 [2018-04-11 15:16:54,020 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-11 15:16:54,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:54,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:54,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:54,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:29 [2018-04-11 15:16:54,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:54,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 15:16:54,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:54,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:54,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2018-04-11 15:16:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:54,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:54,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:16:54,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:16:54,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:16:54,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:16:54,226 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand 21 states. [2018-04-11 15:16:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:54,856 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2018-04-11 15:16:54,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:16:54,856 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2018-04-11 15:16:54,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:54,856 INFO L225 Difference]: With dead ends: 209 [2018-04-11 15:16:54,857 INFO L226 Difference]: Without dead ends: 209 [2018-04-11 15:16:54,857 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=1271, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:16:54,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-04-11 15:16:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 174. [2018-04-11 15:16:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-04-11 15:16:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2018-04-11 15:16:54,858 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 59 [2018-04-11 15:16:54,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:54,859 INFO L459 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2018-04-11 15:16:54,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:16:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2018-04-11 15:16:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 15:16:54,859 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:54,859 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:54,859 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:54,859 INFO L82 PathProgramCache]: Analyzing trace with hash -213125564, now seen corresponding path program 3 times [2018-04-11 15:16:54,859 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:54,859 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:54,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:54,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:54,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:54,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:54,903 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:54,903 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:54,903 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:54,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:16:54,938 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-04-11 15:16:54,938 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:54,943 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:54,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:54,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:54,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:54,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:54,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:54,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-11 15:16:54,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:54,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:54,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-11 15:16:54,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:54,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:54,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:54,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:54,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:55,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:55,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-11 15:16:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:55,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:55,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:16:55,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:16:55,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:16:55,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:16:55,208 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand 20 states. [2018-04-11 15:16:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:55,752 INFO L93 Difference]: Finished difference Result 214 states and 228 transitions. [2018-04-11 15:16:55,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:16:55,752 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-04-11 15:16:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:55,753 INFO L225 Difference]: With dead ends: 214 [2018-04-11 15:16:55,753 INFO L226 Difference]: Without dead ends: 214 [2018-04-11 15:16:55,753 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=1202, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:16:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-11 15:16:55,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 179. [2018-04-11 15:16:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-11 15:16:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 193 transitions. [2018-04-11 15:16:55,755 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 193 transitions. Word has length 60 [2018-04-11 15:16:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:55,755 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 193 transitions. [2018-04-11 15:16:55,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:16:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2018-04-11 15:16:55,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 15:16:55,755 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:55,755 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:55,755 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:55,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2129422353, now seen corresponding path program 18 times [2018-04-11 15:16:55,756 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:55,756 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:55,756 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:55,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:55,756 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:55,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:55,943 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:55,943 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:55,943 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:55,943 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:16:55,986 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-04-11 15:16:55,986 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:16:55,989 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:55,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:55,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:55,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:55,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:56,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:56,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-11 15:16:56,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:56,017 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 14 treesize of output 17 [2018-04-11 15:16:56,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:56,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:56,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:56,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:56,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:56,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:56,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-04-11 15:16:56,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:16:56,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:16:56,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:56,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:56,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:56,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-04-11 15:16:56,398 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 41 treesize of output 31 [2018-04-11 15:16:56,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:56,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:56,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:56,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 53 [2018-04-11 15:16:56,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:56,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:56,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:56,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:151 [2018-04-11 15:16:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:56,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:56,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 15:16:56,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:16:56,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:16:56,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:16:56,692 INFO L87 Difference]: Start difference. First operand 179 states and 193 transitions. Second operand 29 states. [2018-04-11 15:16:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:16:57,718 INFO L93 Difference]: Finished difference Result 232 states and 246 transitions. [2018-04-11 15:16:57,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:16:57,718 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2018-04-11 15:16:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:16:57,719 INFO L225 Difference]: With dead ends: 232 [2018-04-11 15:16:57,719 INFO L226 Difference]: Without dead ends: 232 [2018-04-11 15:16:57,719 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=185, Invalid=2265, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 15:16:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-11 15:16:57,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 179. [2018-04-11 15:16:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-11 15:16:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 193 transitions. [2018-04-11 15:16:57,721 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 193 transitions. Word has length 60 [2018-04-11 15:16:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:16:57,721 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 193 transitions. [2018-04-11 15:16:57,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:16:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2018-04-11 15:16:57,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 15:16:57,721 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:16:57,722 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:16:57,722 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:16:57,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2129858923, now seen corresponding path program 19 times [2018-04-11 15:16:57,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:16:57,722 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:16:57,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:57,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:16:57,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:16:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:57,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:16:57,792 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:16:57,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:16:57,792 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:16:57,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:16:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:16:57,816 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:16:57,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:57,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:57,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:16:57,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:57,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:57,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-11 15:16:57,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:57,837 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 14 treesize of output 17 [2018-04-11 15:16:57,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:57,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:57,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:57,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:16:57,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:57,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:57,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2018-04-11 15:16:57,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:16:57,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:16:57,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:16:57,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:16:57,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:16:57,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-11 15:16:57,962 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 28 treesize of output 22 [2018-04-11 15:16:57,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:16:57,969 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 22 treesize of output 31 [2018-04-11 15:16:57,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:16:57,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:57,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:16:57,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:66 [2018-04-11 15:16:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:16:58,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:16:58,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 15:16:58,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:16:58,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:16:58,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:16:58,280 INFO L87 Difference]: Start difference. First operand 179 states and 193 transitions. Second operand 26 states. [2018-04-11 15:17:01,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:17:01,541 INFO L93 Difference]: Finished difference Result 263 states and 277 transitions. [2018-04-11 15:17:01,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-11 15:17:01,541 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-04-11 15:17:01,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:17:01,541 INFO L225 Difference]: With dead ends: 263 [2018-04-11 15:17:01,541 INFO L226 Difference]: Without dead ends: 263 [2018-04-11 15:17:01,542 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=247, Invalid=2942, Unknown=3, NotChecked=0, Total=3192 [2018-04-11 15:17:01,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-11 15:17:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 179. [2018-04-11 15:17:01,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-11 15:17:01,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 193 transitions. [2018-04-11 15:17:01,543 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 193 transitions. Word has length 62 [2018-04-11 15:17:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:17:01,544 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 193 transitions. [2018-04-11 15:17:01,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:17:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2018-04-11 15:17:01,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 15:17:01,544 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:17:01,544 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 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-11 15:17:01,544 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:17:01,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1495893306, now seen corresponding path program 20 times [2018-04-11 15:17:01,544 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:17:01,544 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:17:01,545 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:01,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:17:01,545 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:01,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:17:01,641 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:17:01,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:17:01,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:17:01,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:17:01,674 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:17:01,674 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:17:01,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:17:01,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:01,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:01,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:01,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:01,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:01,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-11 15:17:01,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:01,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:01,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:17:01,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:01,722 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 14 treesize of output 17 [2018-04-11 15:17:01,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:01,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:01,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-04-11 15:17:01,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:17:01,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:17:01,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:01,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:01,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:17:01,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-04-11 15:17:02,642 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 65 treesize of output 49 [2018-04-11 15:17:02,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:02,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:02,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:02,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:02,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:02,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:02,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 33 disjoint index pairs (out of 28 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 95 [2018-04-11 15:17:02,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:17:02,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:17:02,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:17:02,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:241 [2018-04-11 15:17:03,021 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:17:03,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:17:03,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-11 15:17:03,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 15:17:03,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 15:17:03,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1247, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:17:03,022 INFO L87 Difference]: Start difference. First operand 179 states and 193 transitions. Second operand 37 states. [2018-04-11 15:17:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:17:04,665 INFO L93 Difference]: Finished difference Result 219 states and 233 transitions. [2018-04-11 15:17:04,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 15:17:04,665 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 62 [2018-04-11 15:17:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:17:04,666 INFO L225 Difference]: With dead ends: 219 [2018-04-11 15:17:04,666 INFO L226 Difference]: Without dead ends: 219 [2018-04-11 15:17:04,667 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=267, Invalid=4425, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 15:17:04,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-11 15:17:04,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 179. [2018-04-11 15:17:04,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-11 15:17:04,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 193 transitions. [2018-04-11 15:17:04,668 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 193 transitions. Word has length 62 [2018-04-11 15:17:04,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:17:04,668 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 193 transitions. [2018-04-11 15:17:04,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 15:17:04,669 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2018-04-11 15:17:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 15:17:04,669 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:17:04,669 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 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] [2018-04-11 15:17:04,669 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:17:04,669 INFO L82 PathProgramCache]: Analyzing trace with hash 786735966, now seen corresponding path program 21 times [2018-04-11 15:17:04,669 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:17:04,669 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:17:04,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:04,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:17:04,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:04,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:17:04,725 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:17:04,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:17:04,725 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:17:04,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:17:04,800 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-04-11 15:17:04,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:17:04,806 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:17:04,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:04,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:04,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:04,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:04,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:04,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-04-11 15:17:04,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:04,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:17:04,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:04,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:04,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:04,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:17:04,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:04,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:04,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:23 [2018-04-11 15:17:04,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:17:04,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:17:04,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:04,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:04,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:17:04,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-04-11 15:17:05,418 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 57 treesize of output 43 [2018-04-11 15:17:05,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:05,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:05,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:05,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:05,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:17:05,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 81 [2018-04-11 15:17:05,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:17:05,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:17:05,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:17:05,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:211 [2018-04-11 15:17:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:17:05,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:17:05,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-11 15:17:05,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 15:17:05,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 15:17:05,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1243, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:17:05,859 INFO L87 Difference]: Start difference. First operand 179 states and 193 transitions. Second operand 37 states. [2018-04-11 15:17:07,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:17:07,329 INFO L93 Difference]: Finished difference Result 234 states and 248 transitions. [2018-04-11 15:17:07,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 15:17:07,330 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 63 [2018-04-11 15:17:07,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:17:07,330 INFO L225 Difference]: With dead ends: 234 [2018-04-11 15:17:07,330 INFO L226 Difference]: Without dead ends: 234 [2018-04-11 15:17:07,331 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=259, Invalid=4031, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 15:17:07,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-04-11 15:17:07,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 179. [2018-04-11 15:17:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-11 15:17:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 193 transitions. [2018-04-11 15:17:07,333 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 193 transitions. Word has length 63 [2018-04-11 15:17:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:17:07,333 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 193 transitions. [2018-04-11 15:17:07,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 15:17:07,333 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2018-04-11 15:17:07,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 15:17:07,333 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:17:07,333 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:17:07,333 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 15:17:07,333 INFO L82 PathProgramCache]: Analyzing trace with hash -613997010, now seen corresponding path program 6 times [2018-04-11 15:17:07,334 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:17:07,334 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:17:07,334 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:07,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:17:07,334 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:17:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:17:07,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:17:08,304 WARN L151 SmtUtils]: Spent 268ms on a formula simplification. DAG size of input: 371 DAG size of output 81 [2018-04-11 15:17:08,585 WARN L151 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 299 DAG size of output 74 [2018-04-11 15:17:08,881 WARN L151 SmtUtils]: Spent 261ms on a formula simplification. DAG size of input: 299 DAG size of output 74 [2018-04-11 15:17:09,179 WARN L151 SmtUtils]: Spent 257ms on a formula simplification. DAG size of input: 302 DAG size of output 77 [2018-04-11 15:17:09,456 WARN L151 SmtUtils]: Spent 233ms on a formula simplification. DAG size of input: 297 DAG size of output 72 [2018-04-11 15:17:09,803 WARN L151 SmtUtils]: Spent 298ms on a formula simplification. DAG size of input: 317 DAG size of output 83 [2018-04-11 15:17:10,217 WARN L151 SmtUtils]: Spent 360ms on a formula simplification. DAG size of input: 320 DAG size of output 86 [2018-04-11 15:17:10,608 WARN L151 SmtUtils]: Spent 324ms on a formula simplification. DAG size of input: 315 DAG size of output 81 [2018-04-11 15:17:10,842 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 212 DAG size of output 72 [2018-04-11 15:17:11,078 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 215 DAG size of output 75 [2018-04-11 15:17:11,315 WARN L151 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 210 DAG size of output 70 [2018-04-11 15:17:12,675 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:17:12,675 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:17:12,675 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:17:12,676 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:17:12,709 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-04-11 15:17:12,709 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:17:12,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:17:12,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:17:12,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:12,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:12,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:17:12,848 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 14 treesize of output 11 [2018-04-11 15:17:12,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:17:12,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:12,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:17:12,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:17:12,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-11 15:17:14,013 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-11 15:17:14,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:17:14,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 15:17:14,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:82, output treesize:77 Received shutdown request... [2018-04-11 15:19:05,560 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 15:19:05,560 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 15:19:05,562 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 15:19:05,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:19:05 BoogieIcfgContainer [2018-04-11 15:19:05,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:19:05,563 INFO L168 Benchmark]: Toolchain (without parser) took 198817.21 ms. Allocated memory was 399.0 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 332.7 MB in the beginning and 871.7 MB in the end (delta: -539.0 MB). Peak memory consumption was 487.1 MB. Max. memory is 5.3 GB. [2018-04-11 15:19:05,564 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 399.0 MB. Free memory is still 359.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:19:05,564 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.39 ms. Allocated memory is still 399.0 MB. Free memory was 331.4 MB in the beginning and 307.6 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-11 15:19:05,564 INFO L168 Benchmark]: Boogie Preprocessor took 35.33 ms. Allocated memory is still 399.0 MB. Free memory was 307.6 MB in the beginning and 305.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:19:05,564 INFO L168 Benchmark]: RCFGBuilder took 363.36 ms. Allocated memory was 399.0 MB in the beginning and 610.8 MB in the end (delta: 211.8 MB). Free memory was 305.0 MB in the beginning and 545.6 MB in the end (delta: -240.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. [2018-04-11 15:19:05,564 INFO L168 Benchmark]: TraceAbstraction took 198185.49 ms. Allocated memory was 610.8 MB in the beginning and 1.4 GB in the end (delta: 814.2 MB). Free memory was 545.6 MB in the beginning and 871.7 MB in the end (delta: -326.1 MB). Peak memory consumption was 488.1 MB. Max. memory is 5.3 GB. [2018-04-11 15:19:05,565 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.12 ms. Allocated memory is still 399.0 MB. Free memory is still 359.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 230.39 ms. Allocated memory is still 399.0 MB. Free memory was 331.4 MB in the beginning and 307.6 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.33 ms. Allocated memory is still 399.0 MB. Free memory was 307.6 MB in the beginning and 305.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 363.36 ms. Allocated memory was 399.0 MB in the beginning and 610.8 MB in the end (delta: 211.8 MB). Free memory was 305.0 MB in the beginning and 545.6 MB in the end (delta: -240.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 198185.49 ms. Allocated memory was 610.8 MB in the beginning and 1.4 GB in the end (delta: 814.2 MB). Free memory was 545.6 MB in the beginning and 871.7 MB in the end (delta: -326.1 MB). Peak memory consumption was 488.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 564]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 564]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 56 locations, 11 error locations. TIMEOUT Result, 198.1s OverallTime, 57 OverallIterations, 12 TraceHistogramMax, 49.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1881 SDtfs, 3787 SDslu, 18077 SDs, 0 SdLazy, 23455 SolverSat, 1358 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 23.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2748 GetRequests, 1043 SyntacticMatches, 6 SemanticMatches, 1699 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 16351 ImplicationChecksByTransitivity, 46.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=52, 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, 56 MinimizatonAttempts, 1479 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 28.1s InterpolantComputationTime, 3878 NumberOfCodeBlocks, 3874 NumberOfCodeBlocksAsserted, 168 NumberOfCheckSat, 2274 ConstructedInterpolants, 424 QuantifiedInterpolants, 1909368 SizeOfPredicates, 786 NumberOfNonLiveVariables, 8762 ConjunctsInSsa, 2979 ConjunctsInUnsatCore, 64 InterpolantComputations, 21 PerfectInterpolantSequences, 38/2094 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-19-05-569.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-19-05-569.csv Completed graceful shutdown