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_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-12 10:24:09,117 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 10:24:09,118 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 10:24:09,130 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 10:24:09,130 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 10:24:09,131 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 10:24:09,132 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 10:24:09,133 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 10:24:09,135 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 10:24:09,135 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 10:24:09,136 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 10:24:09,136 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 10:24:09,137 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 10:24:09,138 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 10:24:09,139 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 10:24:09,140 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 10:24:09,141 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 10:24:09,143 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 10:24:09,144 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 10:24:09,145 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 10:24:09,147 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 10:24:09,147 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 10:24:09,147 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 10:24:09,148 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 10:24:09,148 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 10:24:09,149 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 10:24:09,149 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 10:24:09,150 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 10:24:09,150 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 10:24:09,150 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 10:24:09,151 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 10:24:09,151 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-12 10:24:09,160 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 10:24:09,160 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 10:24:09,161 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 10:24:09,161 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 10:24:09,161 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 10:24:09,162 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 10:24:09,162 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 10:24:09,162 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 10:24:09,162 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 10:24:09,162 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 10:24:09,162 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 10:24:09,162 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 10:24:09,163 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 10:24:09,163 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 10:24:09,163 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 10:24:09,163 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 10:24:09,163 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 10:24:09,163 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 10:24:09,163 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 10:24:09,163 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 10:24:09,163 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 10:24:09,164 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 10:24:09,164 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 10:24:09,164 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 10:24:09,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 10:24:09,197 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 10:24:09,200 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 10:24:09,201 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 10:24:09,201 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 10:24:09,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,475 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6c6a5937d [2018-04-12 10:24:09,630 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 10:24:09,630 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 10:24:09,631 INFO L168 CDTParser]: Scanning openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,645 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 10:24:09,645 INFO L215 ultiparseSymbolTable]: [2018-04-12 10:24:09,645 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 10:24:09,645 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,645 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,645 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,645 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncat ('cstrncat') in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,645 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 10:24:09,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:09,665 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6c6a5937d [2018-04-12 10:24:09,669 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 10:24:09,669 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 10:24:09,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 10:24:09,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 10:24:09,673 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 10:24:09,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 10:24:09" (1/1) ... [2018-04-12 10:24:09,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e7d49f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 10:24:09, skipping insertion in model container [2018-04-12 10:24:09,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 10:24:09" (1/1) ... [2018-04-12 10:24:09,689 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 10:24:09,709 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 10:24:09,834 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 10:24:09,865 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 10:24:09,870 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-12 10:24:09,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 10:24:09 WrapperNode [2018-04-12 10:24:09,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 10:24:09,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 10:24:09,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 10:24:09,904 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 10:24:09,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 10:24:09" (1/1) ... [2018-04-12 10:24:09,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 10:24:09" (1/1) ... [2018-04-12 10:24:09,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 10:24:09" (1/1) ... [2018-04-12 10:24:09,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 10:24:09" (1/1) ... [2018-04-12 10:24:09,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 10:24:09" (1/1) ... [2018-04-12 10:24:09,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 10:24:09" (1/1) ... [2018-04-12 10:24:09,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 10:24:09" (1/1) ... [2018-04-12 10:24:09,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 10:24:09,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 10:24:09,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 10:24:09,946 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 10:24:09,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 10:24:09" (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-12 10:24:10,038 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 10:24:10,038 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 10:24:10,038 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-12 10:24:10,038 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-12 10:24:10,038 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncat [2018-04-12 10:24:10,038 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 10:24:10,038 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-12 10:24:10,038 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-12 10:24:10,039 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 10:24:10,039 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 10:24:10,039 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 10:24:10,039 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 10:24:10,039 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 10:24:10,039 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 10:24:10,039 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 10:24:10,039 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 10:24:10,039 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 10:24:10,039 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 10:24:10,040 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 10:24:10,040 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 10:24:10,040 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 10:24:10,040 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 10:24:10,040 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 10:24:10,040 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 10:24:10,040 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 10:24:10,040 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 10:24:10,040 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 10:24:10,041 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 10:24:10,041 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 10:24:10,041 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 10:24:10,041 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 10:24:10,041 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 10:24:10,041 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 10:24:10,041 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 10:24:10,041 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 10:24:10,042 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 10:24:10,042 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 10:24:10,042 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 10:24:10,042 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 10:24:10,042 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 10:24:10,042 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 10:24:10,042 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 10:24:10,042 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 10:24:10,042 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 10:24:10,042 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 10:24:10,043 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 10:24:10,043 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 10:24:10,043 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 10:24:10,043 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 10:24:10,043 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 10:24:10,043 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 10:24:10,043 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 10:24:10,043 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 10:24:10,043 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 10:24:10,043 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 10:24:10,044 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 10:24:10,044 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 10:24:10,044 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 10:24:10,044 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 10:24:10,044 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 10:24:10,044 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 10:24:10,044 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 10:24:10,044 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 10:24:10,044 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 10:24:10,044 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 10:24:10,045 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 10:24:10,045 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 10:24:10,045 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 10:24:10,045 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 10:24:10,045 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 10:24:10,045 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 10:24:10,045 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 10:24:10,045 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 10:24:10,045 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 10:24:10,045 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 10:24:10,045 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 10:24:10,046 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 10:24:10,046 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 10:24:10,046 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 10:24:10,046 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 10:24:10,046 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 10:24:10,046 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 10:24:10,046 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 10:24:10,046 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 10:24:10,046 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 10:24:10,046 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 10:24:10,047 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 10:24:10,047 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 10:24:10,047 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 10:24:10,047 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 10:24:10,047 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 10:24:10,047 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 10:24:10,047 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 10:24:10,047 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 10:24:10,047 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 10:24:10,047 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 10:24:10,048 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 10:24:10,048 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 10:24:10,048 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 10:24:10,048 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 10:24:10,048 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 10:24:10,048 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 10:24:10,048 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 10:24:10,048 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 10:24:10,048 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 10:24:10,048 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 10:24:10,049 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 10:24:10,049 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 10:24:10,049 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 10:24:10,049 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncat [2018-04-12 10:24:10,049 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 10:24:10,049 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 10:24:10,049 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 10:24:10,049 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 10:24:10,049 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 10:24:10,049 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 10:24:10,050 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 10:24:10,050 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 10:24:10,315 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 10:24:10,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 10:24:10 BoogieIcfgContainer [2018-04-12 10:24:10,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 10:24:10,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 10:24:10,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 10:24:10,318 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 10:24:10,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 10:24:09" (1/3) ... [2018-04-12 10:24:10,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3e9325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 10:24:10, skipping insertion in model container [2018-04-12 10:24:10,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 10:24:09" (2/3) ... [2018-04-12 10:24:10,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3e9325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 10:24:10, skipping insertion in model container [2018-04-12 10:24:10,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 10:24:10" (3/3) ... [2018-04-12 10:24:10,321 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-12 10:24:10,325 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 10:24:10,329 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-04-12 10:24:10,350 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 10:24:10,350 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 10:24:10,350 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 10:24:10,351 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 10:24:10,351 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 10:24:10,351 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 10:24:10,351 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 10:24:10,351 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 10:24:10,351 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 10:24:10,351 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 10:24:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-04-12 10:24:10,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-12 10:24:10,365 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:10,366 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:10,366 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:10,368 INFO L82 PathProgramCache]: Analyzing trace with hash 320774661, now seen corresponding path program 1 times [2018-04-12 10:24:10,369 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:10,370 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:10,398 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:10,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:10,398 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:10,432 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:10,463 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-12 10:24:10,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 10:24:10,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-12 10:24:10,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 10:24:10,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 10:24:10,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 10:24:10,475 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2018-04-12 10:24:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:10,526 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-04-12 10:24:10,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 10:24:10,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-12 10:24:10,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:10,533 INFO L225 Difference]: With dead ends: 55 [2018-04-12 10:24:10,533 INFO L226 Difference]: Without dead ends: 51 [2018-04-12 10:24:10,534 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-12 10:24:10,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-12 10:24:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-12 10:24:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-12 10:24:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-04-12 10:24:10,556 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 11 [2018-04-12 10:24:10,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:10,557 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-04-12 10:24:10,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 10:24:10,557 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-04-12 10:24:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-12 10:24:10,557 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:10,558 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:10,558 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:10,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1076881686, now seen corresponding path program 1 times [2018-04-12 10:24:10,558 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:10,558 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:10,559 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:10,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:10,559 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:10,568 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:10,598 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-12 10:24:10,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 10:24:10,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 10:24:10,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 10:24:10,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 10:24:10,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 10:24:10,600 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-04-12 10:24:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:10,650 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-04-12 10:24:10,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 10:24:10,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-12 10:24:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:10,652 INFO L225 Difference]: With dead ends: 54 [2018-04-12 10:24:10,652 INFO L226 Difference]: Without dead ends: 51 [2018-04-12 10:24:10,652 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-12 10:24:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-12 10:24:10,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-12 10:24:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-12 10:24:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-12 10:24:10,656 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 15 [2018-04-12 10:24:10,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:10,656 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-12 10:24:10,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 10:24:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-12 10:24:10,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-12 10:24:10,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:10,656 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:10,656 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:10,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1756940056, now seen corresponding path program 1 times [2018-04-12 10:24:10,657 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:10,657 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:10,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:10,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:10,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:10,670 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:10,722 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-12 10:24:10,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 10:24:10,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 10:24:10,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 10:24:10,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 10:24:10,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 10:24:10,723 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-04-12 10:24:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:10,751 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-04-12 10:24:10,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 10:24:10,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-12 10:24:10,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:10,752 INFO L225 Difference]: With dead ends: 50 [2018-04-12 10:24:10,753 INFO L226 Difference]: Without dead ends: 50 [2018-04-12 10:24:10,753 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 10:24:10,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-12 10:24:10,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-12 10:24:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-12 10:24:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-12 10:24:10,757 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 15 [2018-04-12 10:24:10,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:10,757 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-12 10:24:10,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 10:24:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-12 10:24:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-12 10:24:10,758 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:10,758 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:10,758 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:10,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1756940057, now seen corresponding path program 1 times [2018-04-12 10:24:10,758 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:10,758 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:10,759 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:10,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:10,760 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:10,771 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:10,841 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-12 10:24:10,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 10:24:10,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 10:24:10,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 10:24:10,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 10:24:10,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-12 10:24:10,843 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 8 states. [2018-04-12 10:24:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:10,952 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-04-12 10:24:10,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 10:24:10,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-04-12 10:24:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:10,953 INFO L225 Difference]: With dead ends: 49 [2018-04-12 10:24:10,953 INFO L226 Difference]: Without dead ends: 49 [2018-04-12 10:24:10,953 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-04-12 10:24:10,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-12 10:24:10,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-12 10:24:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-12 10:24:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-04-12 10:24:10,957 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 15 [2018-04-12 10:24:10,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:10,957 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-04-12 10:24:10,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 10:24:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-04-12 10:24:10,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-12 10:24:10,958 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:10,958 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:10,958 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:10,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1369433054, now seen corresponding path program 1 times [2018-04-12 10:24:10,958 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:10,958 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:10,959 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:10,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:10,960 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:10,969 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:10,989 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-12 10:24:10,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 10:24:10,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 10:24:10,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 10:24:10,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 10:24:10,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 10:24:10,990 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 4 states. [2018-04-12 10:24:11,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:11,018 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-04-12 10:24:11,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 10:24:11,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-12 10:24:11,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:11,019 INFO L225 Difference]: With dead ends: 48 [2018-04-12 10:24:11,019 INFO L226 Difference]: Without dead ends: 48 [2018-04-12 10:24:11,019 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-12 10:24:11,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-12 10:24:11,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-12 10:24:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-12 10:24:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-04-12 10:24:11,021 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 16 [2018-04-12 10:24:11,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:11,021 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-04-12 10:24:11,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 10:24:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-04-12 10:24:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-12 10:24:11,022 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:11,022 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:11,022 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:11,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1369433053, now seen corresponding path program 1 times [2018-04-12 10:24:11,022 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:11,022 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:11,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:11,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:11,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:11,030 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:11,054 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-12 10:24:11,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 10:24:11,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 10:24:11,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 10:24:11,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 10:24:11,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 10:24:11,055 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-04-12 10:24:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:11,080 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-04-12 10:24:11,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 10:24:11,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-12 10:24:11,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:11,082 INFO L225 Difference]: With dead ends: 47 [2018-04-12 10:24:11,082 INFO L226 Difference]: Without dead ends: 47 [2018-04-12 10:24:11,082 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-12 10:24:11,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-12 10:24:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-12 10:24:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-12 10:24:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-04-12 10:24:11,085 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 16 [2018-04-12 10:24:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:11,085 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-04-12 10:24:11,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 10:24:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-04-12 10:24:11,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 10:24:11,085 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:11,086 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:11,086 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:11,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1396804491, now seen corresponding path program 1 times [2018-04-12 10:24:11,086 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:11,086 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:11,087 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:11,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:11,087 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:11,097 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:11,118 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-12 10:24:11,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 10:24:11,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 10:24:11,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 10:24:11,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 10:24:11,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 10:24:11,119 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 6 states. [2018-04-12 10:24:11,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:11,183 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-04-12 10:24:11,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 10:24:11,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-12 10:24:11,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:11,185 INFO L225 Difference]: With dead ends: 47 [2018-04-12 10:24:11,185 INFO L226 Difference]: Without dead ends: 47 [2018-04-12 10:24:11,186 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-12 10:24:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-12 10:24:11,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-04-12 10:24:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-04-12 10:24:11,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-04-12 10:24:11,188 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 21 [2018-04-12 10:24:11,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:11,189 INFO L459 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-04-12 10:24:11,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 10:24:11,189 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-04-12 10:24:11,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-12 10:24:11,189 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:11,189 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:11,189 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:11,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1396804492, now seen corresponding path program 1 times [2018-04-12 10:24:11,190 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:11,190 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:11,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:11,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:11,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:11,199 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:11,285 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-12 10:24:11,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 10:24:11,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-12 10:24:11,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 10:24:11,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 10:24:11,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-12 10:24:11,286 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-04-12 10:24:11,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:11,396 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-04-12 10:24:11,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 10:24:11,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-04-12 10:24:11,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:11,397 INFO L225 Difference]: With dead ends: 57 [2018-04-12 10:24:11,397 INFO L226 Difference]: Without dead ends: 57 [2018-04-12 10:24:11,398 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-04-12 10:24:11,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-12 10:24:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-04-12 10:24:11,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-12 10:24:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-04-12 10:24:11,400 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 21 [2018-04-12 10:24:11,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:11,400 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-04-12 10:24:11,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 10:24:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-04-12 10:24:11,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-12 10:24:11,400 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:11,400 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-12 10:24:11,400 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:11,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1735549236, now seen corresponding path program 1 times [2018-04-12 10:24:11,401 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:11,401 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:11,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:11,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:11,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:11,410 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:11,445 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-12 10:24:11,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 10:24:11,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 10:24:11,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 10:24:11,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 10:24:11,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-12 10:24:11,446 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 7 states. [2018-04-12 10:24:11,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:11,503 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-04-12 10:24:11,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 10:24:11,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-04-12 10:24:11,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:11,504 INFO L225 Difference]: With dead ends: 54 [2018-04-12 10:24:11,504 INFO L226 Difference]: Without dead ends: 54 [2018-04-12 10:24:11,504 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-12 10:24:11,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-12 10:24:11,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-04-12 10:24:11,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-12 10:24:11,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-04-12 10:24:11,507 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 24 [2018-04-12 10:24:11,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:11,507 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-04-12 10:24:11,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 10:24:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-04-12 10:24:11,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-12 10:24:11,508 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:11,508 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:11,508 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:11,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1735549235, now seen corresponding path program 1 times [2018-04-12 10:24:11,509 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:11,509 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:11,509 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:11,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:11,510 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:11,518 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:24:11,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 10:24:11,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-12 10:24:11,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 10:24:11,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 10:24:11,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-12 10:24:11,611 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 10 states. [2018-04-12 10:24:11,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:11,700 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-04-12 10:24:11,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 10:24:11,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-04-12 10:24:11,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:11,701 INFO L225 Difference]: With dead ends: 56 [2018-04-12 10:24:11,701 INFO L226 Difference]: Without dead ends: 56 [2018-04-12 10:24:11,702 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-04-12 10:24:11,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-04-12 10:24:11,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-04-12 10:24:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-12 10:24:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-04-12 10:24:11,704 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 24 [2018-04-12 10:24:11,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:11,705 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-04-12 10:24:11,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 10:24:11,705 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-04-12 10:24:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-12 10:24:11,705 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:11,705 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-12 10:24:11,706 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:11,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1735547792, now seen corresponding path program 1 times [2018-04-12 10:24:11,706 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:11,706 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:11,707 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:11,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:11,707 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:11,716 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:11,824 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-12 10:24:11,825 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:24:11,825 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:24:11,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:11,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:24:11,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:24:11,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:11,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:24:11,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:11,915 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-12 10:24:11,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-12 10:24:11,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:11,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:11,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 10:24:11,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:11,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:11,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:11,967 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-12 10:24:11,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:11,972 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-12 10:24:11,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-04-12 10:24:12,161 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-12 10:24:12,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:24:12,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-04-12 10:24:12,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-12 10:24:12,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-12 10:24:12,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-04-12 10:24:12,184 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 24 states. [2018-04-12 10:24:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:12,714 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-04-12 10:24:12,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-12 10:24:12,715 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-04-12 10:24:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:12,716 INFO L225 Difference]: With dead ends: 72 [2018-04-12 10:24:12,716 INFO L226 Difference]: Without dead ends: 72 [2018-04-12 10:24:12,716 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=953, Unknown=0, NotChecked=0, Total=1122 [2018-04-12 10:24:12,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-12 10:24:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2018-04-12 10:24:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-12 10:24:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-04-12 10:24:12,720 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 24 [2018-04-12 10:24:12,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:12,721 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-04-12 10:24:12,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-12 10:24:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-04-12 10:24:12,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-12 10:24:12,722 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:12,722 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:12,722 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash -888000244, now seen corresponding path program 2 times [2018-04-12 10:24:12,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:12,722 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:12,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:12,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:12,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:12,736 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:12,913 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-12 10:24:12,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:24:12,914 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:24:12,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 10:24:12,941 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 10:24:12,941 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 10:24:12,943 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:24:12,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:24:12,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:12,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:24:12,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:13,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:13,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-12 10:24:13,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:13,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:13,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-12 10:24:13,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:13,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:13,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:13,070 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-12 10:24:13,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:13,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:13,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-12 10:24:13,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 19 treesize of output 16 [2018-04-12 10:24:13,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 10:24:13,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:13,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:13,136 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-12 10:24:13,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-12 10:24:13,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:13,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-12 10:24:13,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:24:13,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:13,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:13,179 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-12 10:24:13,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-04-12 10:24:13,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:13,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-04-12 10:24:13,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-12 10:24:13,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:13,325 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 19 [2018-04-12 10:24:13,326 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 10:24:13,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:24:13,339 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 2 xjuncts. [2018-04-12 10:24:13,339 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:69 [2018-04-12 10:24:13,443 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-12 10:24:13,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:24:13,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 28 [2018-04-12 10:24:13,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 10:24:13,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 10:24:13,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2018-04-12 10:24:13,461 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 29 states. [2018-04-12 10:24:16,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:16,292 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2018-04-12 10:24:16,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-12 10:24:16,319 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 27 [2018-04-12 10:24:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:16,319 INFO L225 Difference]: With dead ends: 118 [2018-04-12 10:24:16,319 INFO L226 Difference]: Without dead ends: 118 [2018-04-12 10:24:16,320 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=355, Invalid=1997, Unknown=0, NotChecked=0, Total=2352 [2018-04-12 10:24:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-04-12 10:24:16,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 67. [2018-04-12 10:24:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-12 10:24:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2018-04-12 10:24:16,324 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 27 [2018-04-12 10:24:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:16,324 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2018-04-12 10:24:16,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 10:24:16,324 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2018-04-12 10:24:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 10:24:16,324 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:16,325 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:16,325 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:16,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1029599467, now seen corresponding path program 1 times [2018-04-12 10:24:16,325 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:16,325 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:16,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:16,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 10:24:16,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:16,332 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:16,361 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-12 10:24:16,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 10:24:16,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 10:24:16,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 10:24:16,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 10:24:16,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 10:24:16,362 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 5 states. [2018-04-12 10:24:16,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:16,383 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2018-04-12 10:24:16,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 10:24:16,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-12 10:24:16,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:16,385 INFO L225 Difference]: With dead ends: 97 [2018-04-12 10:24:16,385 INFO L226 Difference]: Without dead ends: 97 [2018-04-12 10:24:16,385 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-12 10:24:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-12 10:24:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-04-12 10:24:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-12 10:24:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-04-12 10:24:16,394 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 28 [2018-04-12 10:24:16,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:16,394 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-04-12 10:24:16,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 10:24:16,395 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2018-04-12 10:24:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 10:24:16,395 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:16,395 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:16,395 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:16,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1847247917, now seen corresponding path program 1 times [2018-04-12 10:24:16,396 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:16,396 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:16,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:16,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:16,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:16,406 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:16,447 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-12 10:24:16,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 10:24:16,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 10:24:16,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 10:24:16,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 10:24:16,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 10:24:16,448 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 6 states. [2018-04-12 10:24:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:16,527 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2018-04-12 10:24:16,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 10:24:16,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-12 10:24:16,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:16,528 INFO L225 Difference]: With dead ends: 77 [2018-04-12 10:24:16,528 INFO L226 Difference]: Without dead ends: 64 [2018-04-12 10:24:16,528 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-12 10:24:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-12 10:24:16,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-04-12 10:24:16,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-12 10:24:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-04-12 10:24:16,529 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 28 [2018-04-12 10:24:16,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:16,529 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-04-12 10:24:16,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 10:24:16,529 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-04-12 10:24:16,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 10:24:16,530 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:16,530 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:16,530 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:16,530 INFO L82 PathProgramCache]: Analyzing trace with hash 2126780026, now seen corresponding path program 1 times [2018-04-12 10:24:16,530 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:16,530 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:16,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:16,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:16,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:16,541 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:24:16,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 10:24:16,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 10:24:16,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 10:24:16,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 10:24:16,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 10:24:16,615 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 6 states. [2018-04-12 10:24:16,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:16,655 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-04-12 10:24:16,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 10:24:16,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-12 10:24:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:16,656 INFO L225 Difference]: With dead ends: 100 [2018-04-12 10:24:16,656 INFO L226 Difference]: Without dead ends: 94 [2018-04-12 10:24:16,656 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-12 10:24:16,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-04-12 10:24:16,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2018-04-12 10:24:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-12 10:24:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2018-04-12 10:24:16,659 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 30 [2018-04-12 10:24:16,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:16,659 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2018-04-12 10:24:16,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 10:24:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2018-04-12 10:24:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 10:24:16,660 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:16,660 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:16,660 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:16,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1711730960, now seen corresponding path program 3 times [2018-04-12 10:24:16,661 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:16,661 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:16,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:16,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:16,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:16,679 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:16,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:24:16,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:24:16,983 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:24:16,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-12 10:24:17,007 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-12 10:24:17,007 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 10:24:17,009 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:24:17,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:24:17,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:17,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:24:17,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:17,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:17,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-04-12 10:24:17,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:17,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:17,071 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-12 10:24:17,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:17,078 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-12 10:24:17,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:17,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:17,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-12 10:24:17,118 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 18 treesize of output 15 [2018-04-12 10:24:17,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-12 10:24:17,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:17,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:17,124 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-12 10:24:17,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-04-12 10:24:17,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-04-12 10:24:17,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-12 10:24:17,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:17,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:17,176 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-12 10:24:17,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 [2018-04-12 10:24:17,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-04-12 10:24:17,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-12 10:24:17,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:17,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 10:24:17,323 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 10:24:17,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:24:17,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-12 10:24:17,333 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-04-12 10:24:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-12 10:24:17,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:24:17,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2018-04-12 10:24:17,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-12 10:24:17,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-12 10:24:17,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-04-12 10:24:17,389 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 25 states. [2018-04-12 10:24:19,700 WARN L151 SmtUtils]: Spent 2026ms on a formula simplification. DAG size of input: 57 DAG size of output 41 [2018-04-12 10:24:21,874 WARN L151 SmtUtils]: Spent 2141ms on a formula simplification. DAG size of input: 76 DAG size of output 51 [2018-04-12 10:24:22,720 WARN L151 SmtUtils]: Spent 800ms on a formula simplification. DAG size of input: 84 DAG size of output 59 [2018-04-12 10:24:24,994 WARN L151 SmtUtils]: Spent 2192ms on a formula simplification. DAG size of input: 84 DAG size of output 62 [2018-04-12 10:24:29,336 WARN L151 SmtUtils]: Spent 4292ms on a formula simplification. DAG size of input: 85 DAG size of output 63 [2018-04-12 10:24:34,146 WARN L151 SmtUtils]: Spent 4677ms on a formula simplification. DAG size of input: 76 DAG size of output 54 [2018-04-12 10:24:36,390 WARN L151 SmtUtils]: Spent 2184ms on a formula simplification. DAG size of input: 83 DAG size of output 60 [2018-04-12 10:24:36,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:36,830 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2018-04-12 10:24:36,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-12 10:24:36,830 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2018-04-12 10:24:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:36,830 INFO L225 Difference]: With dead ends: 90 [2018-04-12 10:24:36,830 INFO L226 Difference]: Without dead ends: 56 [2018-04-12 10:24:36,831 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=208, Invalid=1274, Unknown=0, NotChecked=0, Total=1482 [2018-04-12 10:24:36,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-04-12 10:24:36,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-04-12 10:24:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-12 10:24:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-04-12 10:24:36,832 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 30 [2018-04-12 10:24:36,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:36,832 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-04-12 10:24:36,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-12 10:24:36,832 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-04-12 10:24:36,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 10:24:36,833 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:36,833 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:36,833 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:36,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1949332552, now seen corresponding path program 1 times [2018-04-12 10:24:36,833 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:36,833 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:36,834 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:36,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 10:24:36,834 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:36,842 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:24:36,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 10:24:36,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-12 10:24:36,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-12 10:24:36,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-12 10:24:36,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-12 10:24:36,923 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 11 states. [2018-04-12 10:24:37,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:37,016 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2018-04-12 10:24:37,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-12 10:24:37,016 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-04-12 10:24:37,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:37,016 INFO L225 Difference]: With dead ends: 95 [2018-04-12 10:24:37,017 INFO L226 Difference]: Without dead ends: 87 [2018-04-12 10:24:37,017 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-04-12 10:24:37,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-12 10:24:37,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-04-12 10:24:37,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-12 10:24:37,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-04-12 10:24:37,019 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 30 [2018-04-12 10:24:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:37,019 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-04-12 10:24:37,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-12 10:24:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-04-12 10:24:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 10:24:37,020 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:37,020 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:37,020 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:37,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1492876242, now seen corresponding path program 1 times [2018-04-12 10:24:37,020 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:37,020 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:37,021 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:37,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:37,021 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:37,032 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:24:37,297 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:24:37,298 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:24:37,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:37,321 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:24:37,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:24:37,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:37,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:24:37,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:37,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:37,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-12 10:24:37,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:37,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:37,446 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-12 10:24:37,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:37,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:37,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-12 10:24:37,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:37,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:37,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-12 10:24:37,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-04-12 10:24:37,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 10:24:37,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:37,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:37,536 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-12 10:24:37,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-12 10:24:37,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:37,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-12 10:24:37,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-12 10:24:37,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:37,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:37,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 10:24:37,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-04-12 10:24:37,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:37,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-04-12 10:24:37,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-12 10:24:37,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:37,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:37,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2018-04-12 10:24:37,843 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 10:24:37,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:24:37,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-12 10:24:37,864 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:73, output treesize:122 [2018-04-12 10:24:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:24:38,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:24:38,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2018-04-12 10:24:38,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-12 10:24:38,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-12 10:24:38,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1011, Unknown=0, NotChecked=0, Total=1122 [2018-04-12 10:24:38,034 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 34 states. [2018-04-12 10:24:41,620 WARN L151 SmtUtils]: Spent 3306ms on a formula simplification. DAG size of input: 81 DAG size of output 66 [2018-04-12 10:24:46,729 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 106 DAG size of output 68 [2018-04-12 10:24:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:49,806 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2018-04-12 10:24:49,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-12 10:24:49,806 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 30 [2018-04-12 10:24:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:49,807 INFO L225 Difference]: With dead ends: 122 [2018-04-12 10:24:49,807 INFO L226 Difference]: Without dead ends: 117 [2018-04-12 10:24:49,808 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=336, Invalid=2316, Unknown=0, NotChecked=0, Total=2652 [2018-04-12 10:24:49,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-12 10:24:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 89. [2018-04-12 10:24:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-12 10:24:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-04-12 10:24:49,811 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 30 [2018-04-12 10:24:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:49,811 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-04-12 10:24:49,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-12 10:24:49,811 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-04-12 10:24:49,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 10:24:49,811 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:49,812 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:49,812 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:49,812 INFO L82 PathProgramCache]: Analyzing trace with hash 540196410, now seen corresponding path program 1 times [2018-04-12 10:24:49,812 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:49,812 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:49,813 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:49,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:49,813 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:49,823 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:24:49,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:24:49,963 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:24:49,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:49,989 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:24:49,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 10:24:49,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:24:49,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:49,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:49,999 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-12 10:24:50,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-04-12 10:24:50,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-12 10:24:50,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 10:24:50,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 10:24:50,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:24:50,147 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-12 10:24:50,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-04-12 10:24:50,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:24:50,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:24:50,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-04-12 10:24:50,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-12 10:24:50,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-12 10:24:50,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-04-12 10:24:50,195 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 19 states. [2018-04-12 10:24:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:52,480 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2018-04-12 10:24:52,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-12 10:24:52,480 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-04-12 10:24:52,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:52,481 INFO L225 Difference]: With dead ends: 103 [2018-04-12 10:24:52,481 INFO L226 Difference]: Without dead ends: 103 [2018-04-12 10:24:52,481 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2018-04-12 10:24:52,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-12 10:24:52,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2018-04-12 10:24:52,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-04-12 10:24:52,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-04-12 10:24:52,484 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 30 [2018-04-12 10:24:52,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:52,484 INFO L459 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-04-12 10:24:52,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-12 10:24:52,484 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-04-12 10:24:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-12 10:24:52,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:52,485 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:52,485 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:52,485 INFO L82 PathProgramCache]: Analyzing trace with hash 110186638, now seen corresponding path program 2 times [2018-04-12 10:24:52,485 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:52,485 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:52,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:52,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:52,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:52,498 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:24:53,067 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:24:53,067 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:24:53,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 10:24:53,088 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 10:24:53,088 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 10:24:53,090 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:24:53,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:24:53,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:53,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:24:53,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:53,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:53,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-12 10:24:53,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:53,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:53,207 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-12 10:24:53,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:53,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:53,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-12 10:24:53,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:53,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:53,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-12 10:24:53,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-04-12 10:24:53,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 10:24:53,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:53,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:53,283 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-12 10:24:53,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-12 10:24:53,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:53,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-12 10:24:53,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-12 10:24:53,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:53,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:53,335 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-12 10:24:53,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-04-12 10:24:53,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:53,643 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 50 treesize of output 44 [2018-04-12 10:24:53,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:53,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:53,654 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 54 [2018-04-12 10:24:53,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 10:24:53,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-12 10:24:53,671 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:53,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:24:53,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-12 10:24:53,696 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:70, output treesize:204 [2018-04-12 10:24:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:24:53,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:24:53,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 37 [2018-04-12 10:24:53,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-12 10:24:53,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-12 10:24:53,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 10:24:53,884 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 38 states. [2018-04-12 10:24:54,305 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 76 DAG size of output 70 [2018-04-12 10:24:57,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:57,659 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2018-04-12 10:24:57,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-12 10:24:57,683 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 33 [2018-04-12 10:24:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:57,683 INFO L225 Difference]: With dead ends: 138 [2018-04-12 10:24:57,683 INFO L226 Difference]: Without dead ends: 133 [2018-04-12 10:24:57,684 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=315, Invalid=2655, Unknown=0, NotChecked=0, Total=2970 [2018-04-12 10:24:57,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-12 10:24:57,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 103. [2018-04-12 10:24:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-12 10:24:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2018-04-12 10:24:57,686 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 33 [2018-04-12 10:24:57,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:57,686 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2018-04-12 10:24:57,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-12 10:24:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2018-04-12 10:24:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-12 10:24:57,687 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:57,687 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:57,687 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:57,687 INFO L82 PathProgramCache]: Analyzing trace with hash -919032110, now seen corresponding path program 1 times [2018-04-12 10:24:57,687 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:57,687 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:57,688 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:57,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 10:24:57,688 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:57,696 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:24:57,862 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:24:57,862 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:24:57,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:57,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:24:57,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:24:57,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:57,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:24:57,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:57,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-12 10:24:57,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-12 10:24:57,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:57,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:57,923 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-12 10:24:57,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:57,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:57,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:57,931 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-12 10:24:57,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:57,934 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-12 10:24:57,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-12 10:24:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:24:58,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:24:58,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2018-04-12 10:24:58,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-12 10:24:58,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-12 10:24:58,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2018-04-12 10:24:58,193 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 33 states. [2018-04-12 10:24:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:24:58,799 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2018-04-12 10:24:58,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 10:24:58,799 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 35 [2018-04-12 10:24:58,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:24:58,800 INFO L225 Difference]: With dead ends: 121 [2018-04-12 10:24:58,800 INFO L226 Difference]: Without dead ends: 120 [2018-04-12 10:24:58,801 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=1763, Unknown=0, NotChecked=0, Total=1980 [2018-04-12 10:24:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-04-12 10:24:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-04-12 10:24:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-12 10:24:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 132 transitions. [2018-04-12 10:24:58,804 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 132 transitions. Word has length 35 [2018-04-12 10:24:58,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:24:58,804 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 132 transitions. [2018-04-12 10:24:58,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-12 10:24:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 132 transitions. [2018-04-12 10:24:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-12 10:24:58,805 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:24:58,805 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:24:58,805 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:24:58,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1215080494, now seen corresponding path program 3 times [2018-04-12 10:24:58,805 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:24:58,806 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:24:58,806 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:58,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:24:58,806 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:24:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:24:58,820 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:24:59,549 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-12 10:24:59,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:24:59,549 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:24:59,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-12 10:24:59,575 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-12 10:24:59,575 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 10:24:59,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:24:59,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:24:59,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:59,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:24:59,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:59,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:59,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-12 10:24:59,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:59,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:59,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-12 10:24:59,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:59,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:59,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:59,729 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-12 10:24:59,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:59,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:59,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-12 10:24:59,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-04-12 10:24:59,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 10:24:59,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:59,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:59,807 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-12 10:24:59,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-12 10:24:59,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:24:59,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-12 10:24:59,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:24:59,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:24:59,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:24:59,856 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-12 10:24:59,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-04-12 10:25:14,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:25:14,707 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 59 treesize of output 51 [2018-04-12 10:25:14,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-12 10:25:14,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:14,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 37 treesize of output 113 [2018-04-12 10:25:14,747 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-12 10:25:14,771 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 72 xjuncts. [2018-04-12 10:25:14,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:25:14,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 13 dim-0 vars, and 2 xjuncts. [2018-04-12 10:25:14,984 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:97, output treesize:705 [2018-04-12 10:25:15,313 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-12 10:25:15,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:25:15,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 42 [2018-04-12 10:25:15,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-12 10:25:15,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-12 10:25:15,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1631, Unknown=5, NotChecked=0, Total=1806 [2018-04-12 10:25:15,331 INFO L87 Difference]: Start difference. First operand 117 states and 132 transitions. Second operand 43 states. [2018-04-12 10:25:15,808 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 101 DAG size of output 52 [2018-04-12 10:25:19,619 WARN L151 SmtUtils]: Spent 441ms on a formula simplification. DAG size of input: 153 DAG size of output 62 [2018-04-12 10:25:30,587 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 129 DAG size of output 71 [2018-04-12 10:25:39,073 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 162 DAG size of output 94 [2018-04-12 10:25:40,966 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 116 DAG size of output 70 [2018-04-12 10:25:44,952 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 105 DAG size of output 60 [2018-04-12 10:25:45,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:25:45,933 INFO L93 Difference]: Finished difference Result 169 states and 190 transitions. [2018-04-12 10:25:45,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 10:25:45,934 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 36 [2018-04-12 10:25:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:25:45,935 INFO L225 Difference]: With dead ends: 169 [2018-04-12 10:25:45,935 INFO L226 Difference]: Without dead ends: 158 [2018-04-12 10:25:45,936 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=554, Invalid=3598, Unknown=8, NotChecked=0, Total=4160 [2018-04-12 10:25:45,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-12 10:25:45,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 129. [2018-04-12 10:25:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-12 10:25:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 146 transitions. [2018-04-12 10:25:45,938 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 146 transitions. Word has length 36 [2018-04-12 10:25:45,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:25:45,938 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 146 transitions. [2018-04-12 10:25:45,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-12 10:25:45,938 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 146 transitions. [2018-04-12 10:25:45,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-12 10:25:45,938 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:25:45,938 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:25:45,938 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:25:45,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1574776871, now seen corresponding path program 2 times [2018-04-12 10:25:45,938 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:25:45,938 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:25:45,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:25:45,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 10:25:45,939 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:25:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:25:45,948 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:25:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:25:46,309 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:25:46,309 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:25:46,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 10:25:46,342 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 10:25:46,342 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 10:25:46,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:25:46,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:25:46,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:46,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:25:46,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 10:25:46,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:25:46,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:25:46,422 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-12 10:25:46,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:46,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:25:46,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-12 10:25:46,463 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-12 10:25:46,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:25:46,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:46,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:25:46,471 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-12 10:25:46,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-12 10:25:46,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-04-12 10:25:46,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:25:46,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:46,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:25:46,749 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-12 10:25:46,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:49 [2018-04-12 10:25:46,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-04-12 10:25:46,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:25:46,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2018-04-12 10:25:46,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 10:25:46,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-12 10:25:46,955 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:46,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-04-12 10:25:46,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:46,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:25:46,978 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-12 10:25:46,978 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:43 [2018-04-12 10:25:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:25:47,057 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:25:47,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2018-04-12 10:25:47,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 10:25:47,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 10:25:47,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992 [2018-04-12 10:25:47,058 INFO L87 Difference]: Start difference. First operand 129 states and 146 transitions. Second operand 32 states. [2018-04-12 10:25:47,607 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 76 DAG size of output 69 [2018-04-12 10:25:48,176 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 105 DAG size of output 83 [2018-04-12 10:25:50,888 WARN L151 SmtUtils]: Spent 421ms on a formula simplification. DAG size of input: 55 DAG size of output 46 [2018-04-12 10:25:51,218 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 65 DAG size of output 45 [2018-04-12 10:25:52,399 WARN L151 SmtUtils]: Spent 961ms on a formula simplification. DAG size of input: 70 DAG size of output 47 [2018-04-12 10:25:52,852 WARN L151 SmtUtils]: Spent 293ms on a formula simplification. DAG size of input: 61 DAG size of output 41 [2018-04-12 10:25:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:25:53,060 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2018-04-12 10:25:53,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-12 10:25:53,060 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 36 [2018-04-12 10:25:53,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:25:53,061 INFO L225 Difference]: With dead ends: 140 [2018-04-12 10:25:53,061 INFO L226 Difference]: Without dead ends: 140 [2018-04-12 10:25:53,062 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=234, Invalid=2215, Unknown=1, NotChecked=0, Total=2450 [2018-04-12 10:25:53,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-12 10:25:53,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 108. [2018-04-12 10:25:53,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-12 10:25:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2018-04-12 10:25:53,065 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 36 [2018-04-12 10:25:53,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:25:53,065 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2018-04-12 10:25:53,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 10:25:53,065 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2018-04-12 10:25:53,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-12 10:25:53,066 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:25:53,066 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:25:53,066 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:25:53,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1238114358, now seen corresponding path program 1 times [2018-04-12 10:25:53,066 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:25:53,066 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:25:53,067 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:25:53,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 10:25:53,067 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:25:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:25:53,077 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:25:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:25:53,360 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:25:53,360 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:25:53,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:25:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:25:53,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:25:53,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:25:53,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:53,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:25:53,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:53,405 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-12 10:25:53,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-12 10:25:53,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:25:53,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:25:53,439 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-12 10:25:53,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:53,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:25:53,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 10:25:53,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:53,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:25:53,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-04-12 10:25:53,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 10:25:53,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:25:53,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:53,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:25:53,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:25:53,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-12 10:25:53,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:25:53,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-12 10:25:53,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:25:53,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:53,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:25:53,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:25:53,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2018-04-12 10:25:53,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-12 10:25:53,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 10:25:53,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 10:25:53,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:25:53,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 10:25:53,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:51 [2018-04-12 10:25:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:25:53,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:25:53,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 39 [2018-04-12 10:25:53,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-12 10:25:53,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-12 10:25:53,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560 [2018-04-12 10:25:53,915 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 40 states. [2018-04-12 10:25:55,719 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 70 DAG size of output 69 [2018-04-12 10:25:56,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:25:56,246 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2018-04-12 10:25:56,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-12 10:25:56,246 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 38 [2018-04-12 10:25:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:25:56,247 INFO L225 Difference]: With dead ends: 153 [2018-04-12 10:25:56,247 INFO L226 Difference]: Without dead ends: 151 [2018-04-12 10:25:56,248 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=446, Invalid=4246, Unknown=0, NotChecked=0, Total=4692 [2018-04-12 10:25:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-12 10:25:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 114. [2018-04-12 10:25:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-12 10:25:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2018-04-12 10:25:56,251 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 38 [2018-04-12 10:25:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:25:56,251 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2018-04-12 10:25:56,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-12 10:25:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2018-04-12 10:25:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-12 10:25:56,251 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:25:56,252 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:25:56,252 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:25:56,252 INFO L82 PathProgramCache]: Analyzing trace with hash -807107502, now seen corresponding path program 2 times [2018-04-12 10:25:56,252 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:25:56,252 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:25:56,252 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:25:56,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:25:56,253 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:25:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:25:56,263 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:25:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:25:56,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:25:56,755 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:25:56,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 10:25:56,778 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 10:25:56,778 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 10:25:56,780 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:25:56,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:25:56,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:56,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:25:56,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:56,795 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-12 10:25:56,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-12 10:25:56,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:25:56,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:25:56,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 10:25:56,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:56,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:25:56,846 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-12 10:25:56,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:56,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:25:56,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-04-12 10:25:56,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 10:25:56,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:25:56,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:56,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:25:56,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:25:56,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-04-12 10:25:57,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:25:57,144 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-12 10:25:57,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 8 treesize of output 7 [2018-04-12 10:25:57,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:25:57,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:25:57,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:25:57,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2018-04-12 10:25:57,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 19 treesize of output 15 [2018-04-12 10:25:57,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 10:25:57,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 10:25:57,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:25:57,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-12 10:25:57,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:65 [2018-04-12 10:25:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:25:57,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:25:57,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2018-04-12 10:25:57,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-12 10:25:57,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-12 10:25:57,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1702, Unknown=0, NotChecked=0, Total=1806 [2018-04-12 10:25:57,584 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 43 states. [2018-04-12 10:26:00,258 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 82 DAG size of output 81 [2018-04-12 10:26:00,489 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 64 DAG size of output 64 [2018-04-12 10:26:01,001 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 63 DAG size of output 62 [2018-04-12 10:26:01,592 WARN L151 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 86 DAG size of output 84 [2018-04-12 10:26:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:26:01,881 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2018-04-12 10:26:01,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-12 10:26:01,881 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 41 [2018-04-12 10:26:01,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:26:01,881 INFO L225 Difference]: With dead ends: 166 [2018-04-12 10:26:01,881 INFO L226 Difference]: Without dead ends: 165 [2018-04-12 10:26:01,882 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=410, Invalid=4992, Unknown=0, NotChecked=0, Total=5402 [2018-04-12 10:26:01,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-04-12 10:26:01,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 114. [2018-04-12 10:26:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-12 10:26:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2018-04-12 10:26:01,884 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 41 [2018-04-12 10:26:01,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:26:01,884 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2018-04-12 10:26:01,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-12 10:26:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2018-04-12 10:26:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-12 10:26:01,885 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:26:01,885 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:26:01,885 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:26:01,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1674982354, now seen corresponding path program 4 times [2018-04-12 10:26:01,885 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:26:01,885 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:26:01,886 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:26:01,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 10:26:01,886 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:26:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:26:01,900 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:26:02,351 WARN L151 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 41 DAG size of output 21 [2018-04-12 10:26:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:26:03,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:26:03,301 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:26:03,306 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-12 10:26:03,324 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-12 10:26:03,324 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 10:26:03,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:26:03,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:26:03,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:26:03,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:26:03,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:26:03,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:26:03,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-12 10:26:03,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:03,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:03,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-12 10:26:03,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:26:03,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:03,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:03,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 10:26:03,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:26:03,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:26:03,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-12 10:26:03,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-04-12 10:26:03,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 10:26:03,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:26:03,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:26:03,550 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-12 10:26:03,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-12 10:26:03,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:03,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-12 10:26:03,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-12 10:26:03,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:26:03,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:26:03,599 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-12 10:26:03,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-04-12 10:26:04,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:04,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 73 [2018-04-12 10:26:04,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:04,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:04,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:04,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:04,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:04,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:04,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:04,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:04,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:04,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:04,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:04,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:04,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:04,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:04,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:04,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 217 [2018-04-12 10:26:04,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 10:26:04,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-12 10:26:04,589 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 10:26:04,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:26:04,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-12 10:26:04,642 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:113, output treesize:214 [2018-04-12 10:26:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:26:04,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:26:04,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 49 [2018-04-12 10:26:04,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-12 10:26:04,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-12 10:26:04,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=2185, Unknown=0, NotChecked=0, Total=2450 [2018-04-12 10:26:04,913 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 50 states. [2018-04-12 10:26:07,506 WARN L151 SmtUtils]: Spent 2201ms on a formula simplification. DAG size of input: 108 DAG size of output 95 [2018-04-12 10:26:14,650 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 130 DAG size of output 64 [2018-04-12 10:26:28,739 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 137 DAG size of output 106 [2018-04-12 10:26:29,060 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 140 DAG size of output 109 [2018-04-12 10:26:32,867 WARN L151 SmtUtils]: Spent 2214ms on a formula simplification. DAG size of input: 192 DAG size of output 142 [2018-04-12 10:26:33,181 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 140 DAG size of output 106 [2018-04-12 10:26:34,162 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 146 DAG size of output 112 [2018-04-12 10:26:34,457 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 136 DAG size of output 97 [2018-04-12 10:26:34,989 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 139 DAG size of output 103 [2018-04-12 10:26:55,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:26:55,459 INFO L93 Difference]: Finished difference Result 234 states and 257 transitions. [2018-04-12 10:26:55,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-12 10:26:55,460 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 42 [2018-04-12 10:26:55,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:26:55,460 INFO L225 Difference]: With dead ends: 234 [2018-04-12 10:26:55,460 INFO L226 Difference]: Without dead ends: 214 [2018-04-12 10:26:55,461 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2085 ImplicationChecksByTransitivity, 41.3s TimeCoverageRelationStatistics Valid=900, Invalid=6407, Unknown=3, NotChecked=0, Total=7310 [2018-04-12 10:26:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-12 10:26:55,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 138. [2018-04-12 10:26:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-12 10:26:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2018-04-12 10:26:55,463 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 42 [2018-04-12 10:26:55,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:26:55,463 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2018-04-12 10:26:55,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-12 10:26:55,464 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2018-04-12 10:26:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-12 10:26:55,464 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:26:55,464 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:26:55,464 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:26:55,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1102889111, now seen corresponding path program 3 times [2018-04-12 10:26:55,464 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:26:55,464 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:26:55,465 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:26:55,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 10:26:55,465 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:26:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:26:55,472 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:26:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:26:55,751 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:26:55,751 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:26:55,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-12 10:26:55,777 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-12 10:26:55,777 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 10:26:55,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:26:55,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:26:55,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:26:55,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:26:55,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:26:55,804 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-12 10:26:55,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-12 10:26:55,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:55,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:55,841 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-12 10:26:55,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:26:55,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:55,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:55,850 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-12 10:26:55,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:26:55,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:26:55,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-04-12 10:26:55,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 10:26:55,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:26:55,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:26:55,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:26:55,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:26:55,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-04-12 10:26:56,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:56,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-04-12 10:26:56,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:26:56,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:26:56,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:26:56,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 10:26:56,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2018-04-12 10:26:56,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:26:56,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-04-12 10:26:56,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 10:26:56,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:26:56,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:26:56,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 10:26:56,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2018-04-12 10:26:56,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-12 10:26:56,262 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-12 10:26:56,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 10:26:56,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:26:56,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 10:26:56,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:45 [2018-04-12 10:26:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:26:56,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:26:56,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 41 [2018-04-12 10:26:56,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-12 10:26:56,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-12 10:26:56,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1608, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 10:26:56,434 INFO L87 Difference]: Start difference. First operand 138 states and 155 transitions. Second operand 42 states. [2018-04-12 10:26:59,558 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 69 DAG size of output 67 [2018-04-12 10:26:59,735 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 70 DAG size of output 69 [2018-04-12 10:27:00,147 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 81 DAG size of output 76 [2018-04-12 10:27:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:27:00,994 INFO L93 Difference]: Finished difference Result 210 states and 228 transitions. [2018-04-12 10:27:00,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-12 10:27:00,994 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 44 [2018-04-12 10:27:00,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:27:00,995 INFO L225 Difference]: With dead ends: 210 [2018-04-12 10:27:00,995 INFO L226 Difference]: Without dead ends: 177 [2018-04-12 10:27:00,996 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=495, Invalid=5825, Unknown=0, NotChecked=0, Total=6320 [2018-04-12 10:27:00,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-12 10:27:00,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 144. [2018-04-12 10:27:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-12 10:27:00,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 160 transitions. [2018-04-12 10:27:00,999 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 160 transitions. Word has length 44 [2018-04-12 10:27:00,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:27:00,999 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 160 transitions. [2018-04-12 10:27:00,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-12 10:27:00,999 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 160 transitions. [2018-04-12 10:27:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-12 10:27:00,999 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:27:00,999 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:27:00,999 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:27:01,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1605477706, now seen corresponding path program 4 times [2018-04-12 10:27:01,000 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:27:01,000 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:27:01,000 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:27:01,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 10:27:01,000 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:27:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:27:01,013 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:27:01,578 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-12 10:27:01,578 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:27:01,579 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:27:01,585 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-12 10:27:01,607 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-12 10:27:01,607 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 10:27:01,610 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:27:01,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:27:01,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:01,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:27:01,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:01,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:01,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-12 10:27:01,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:01,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:01,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-12 10:27:01,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:01,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:01,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:01,729 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-12 10:27:01,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:01,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:01,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-12 10:27:01,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-04-12 10:27:01,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 16 treesize of output 15 [2018-04-12 10:27:01,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:01,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:01,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:01,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-04-12 10:27:01,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:01,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-12 10:27:01,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:27:01,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:01,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:02,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:02,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2018-04-12 10:27:02,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:02,680 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 58 treesize of output 55 [2018-04-12 10:27:02,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:02,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 65 [2018-04-12 10:27:02,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 10:27:02,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:27:02,737 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 2 xjuncts. [2018-04-12 10:27:02,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:167 [2018-04-12 10:27:03,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:03,153 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 104 treesize of output 94 [2018-04-12 10:27:03,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:03,156 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 49 [2018-04-12 10:27:03,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:03,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:03,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 35 [2018-04-12 10:27:03,179 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 10:27:03,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:27:03,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:03,244 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 96 treesize of output 88 [2018-04-12 10:27:03,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:03,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:03,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:03,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2018-04-12 10:27:03,252 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-12 10:27:03,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:03,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-04-12 10:27:03,276 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:03,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:03,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-04-12 10:27:03,280 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:03,296 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:27:03,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-04-12 10:27:03,356 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:201, output treesize:285 [2018-04-12 10:27:04,007 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-12 10:27:04,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:27:04,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 48 [2018-04-12 10:27:04,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-12 10:27:04,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-12 10:27:04,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2210, Unknown=0, NotChecked=0, Total=2352 [2018-04-12 10:27:04,026 INFO L87 Difference]: Start difference. First operand 144 states and 160 transitions. Second operand 49 states. [2018-04-12 10:27:04,870 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 139 DAG size of output 86 [2018-04-12 10:27:05,070 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 142 DAG size of output 96 [2018-04-12 10:27:05,277 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 134 DAG size of output 95 [2018-04-12 10:27:05,555 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 129 DAG size of output 110 [2018-04-12 10:27:05,769 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 137 DAG size of output 101 [2018-04-12 10:27:05,993 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 134 DAG size of output 96 [2018-04-12 10:27:06,386 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 141 DAG size of output 98 [2018-04-12 10:27:06,678 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 137 DAG size of output 103 [2018-04-12 10:27:06,967 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 137 DAG size of output 95 [2018-04-12 10:27:07,188 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 117 DAG size of output 92 [2018-04-12 10:27:07,423 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 152 DAG size of output 106 [2018-04-12 10:27:07,700 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 123 DAG size of output 107 [2018-04-12 10:27:08,011 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 149 DAG size of output 101 [2018-04-12 10:27:08,268 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 154 DAG size of output 106 [2018-04-12 10:27:08,481 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 126 DAG size of output 110 [2018-04-12 10:27:08,735 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 169 DAG size of output 111 [2018-04-12 10:27:08,968 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 106 DAG size of output 90 [2018-04-12 10:27:09,209 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 87 DAG size of output 65 [2018-04-12 10:27:09,592 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 109 DAG size of output 93 [2018-04-12 10:27:09,984 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 99 DAG size of output 84 [2018-04-12 10:27:10,691 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 129 DAG size of output 78 [2018-04-12 10:27:11,118 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 97 DAG size of output 89 [2018-04-12 10:27:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:27:13,777 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2018-04-12 10:27:13,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-12 10:27:13,777 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 44 [2018-04-12 10:27:13,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:27:13,778 INFO L225 Difference]: With dead ends: 207 [2018-04-12 10:27:13,778 INFO L226 Difference]: Without dead ends: 205 [2018-04-12 10:27:13,779 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2413 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=831, Invalid=7910, Unknown=1, NotChecked=0, Total=8742 [2018-04-12 10:27:13,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-12 10:27:13,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 156. [2018-04-12 10:27:13,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-12 10:27:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 172 transitions. [2018-04-12 10:27:13,782 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 172 transitions. Word has length 44 [2018-04-12 10:27:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:27:13,782 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 172 transitions. [2018-04-12 10:27:13,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-12 10:27:13,782 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 172 transitions. [2018-04-12 10:27:13,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-12 10:27:13,783 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:27:13,783 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:27:13,783 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:27:13,783 INFO L82 PathProgramCache]: Analyzing trace with hash 179248773, now seen corresponding path program 5 times [2018-04-12 10:27:13,783 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:27:13,783 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:27:13,784 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:27:13,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 10:27:13,784 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:27:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:27:13,796 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:27:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:27:14,527 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:27:14,527 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:27:14,532 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-12 10:27:14,557 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-04-12 10:27:14,557 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 10:27:14,560 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:27:14,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:27:14,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:14,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:27:14,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:14,610 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-12 10:27:14,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-12 10:27:14,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:14,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:14,656 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-12 10:27:14,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:14,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:14,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:14,666 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-12 10:27:14,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:14,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:14,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-04-12 10:27:14,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 10:27:14,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:27:14,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:14,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:14,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:14,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-04-12 10:27:15,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:15,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-04-12 10:27:15,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:27:15,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:15,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:15,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 10:27:15,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:39 [2018-04-12 10:27:15,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:15,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-04-12 10:27:15,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 10:27:15,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:15,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:15,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 10:27:15,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:46 [2018-04-12 10:27:15,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-12 10:27:15,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-12 10:27:15,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 10:27:15,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:27:15,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-12 10:27:15,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:71 [2018-04-12 10:27:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:27:15,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:27:15,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 49 [2018-04-12 10:27:15,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-12 10:27:15,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-12 10:27:15,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2283, Unknown=0, NotChecked=0, Total=2450 [2018-04-12 10:27:15,648 INFO L87 Difference]: Start difference. First operand 156 states and 172 transitions. Second operand 50 states. [2018-04-12 10:27:16,414 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 85 DAG size of output 85 [2018-04-12 10:27:16,561 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 86 DAG size of output 82 [2018-04-12 10:27:16,722 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 86 DAG size of output 83 [2018-04-12 10:27:16,889 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 95 DAG size of output 90 [2018-04-12 10:27:17,049 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 88 DAG size of output 85 [2018-04-12 10:27:17,205 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 91 DAG size of output 86 [2018-04-12 10:27:17,526 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 81 DAG size of output 81 [2018-04-12 10:27:17,708 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 89 DAG size of output 85 [2018-04-12 10:27:19,715 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 93 DAG size of output 87 [2018-04-12 10:27:24,527 WARN L151 SmtUtils]: Spent 2058ms on a formula simplification. DAG size of input: 73 DAG size of output 72 [2018-04-12 10:27:25,223 WARN L151 SmtUtils]: Spent 278ms on a formula simplification. DAG size of input: 109 DAG size of output 108 [2018-04-12 10:27:27,889 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 67 DAG size of output 66 [2018-04-12 10:27:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:27:29,410 INFO L93 Difference]: Finished difference Result 229 states and 245 transitions. [2018-04-12 10:27:29,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-12 10:27:29,410 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 47 [2018-04-12 10:27:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:27:29,411 INFO L225 Difference]: With dead ends: 229 [2018-04-12 10:27:29,411 INFO L226 Difference]: Without dead ends: 161 [2018-04-12 10:27:29,412 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2662 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=789, Invalid=8522, Unknown=1, NotChecked=0, Total=9312 [2018-04-12 10:27:29,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-12 10:27:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 144. [2018-04-12 10:27:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-12 10:27:29,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2018-04-12 10:27:29,414 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 47 [2018-04-12 10:27:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:27:29,414 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2018-04-12 10:27:29,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-12 10:27:29,414 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2018-04-12 10:27:29,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-12 10:27:29,415 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:27:29,415 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:27:29,415 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:27:29,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1491886179, now seen corresponding path program 1 times [2018-04-12 10:27:29,415 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:27:29,415 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:27:29,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:27:29,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 10:27:29,416 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:27:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:27:29,424 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:27:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:27:29,965 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:27:29,965 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:27:29,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:27:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:27:29,991 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:27:29,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-12 10:27:29,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:29,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:27:29,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:30,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:30,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-12 10:27:30,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:30,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:30,050 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-12 10:27:30,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:30,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:30,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-12 10:27:30,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:30,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:30,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-04-12 10:27:30,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-04-12 10:27:30,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 10:27:30,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:30,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:30,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:30,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-04-12 10:27:30,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:30,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-12 10:27:30,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:27:30,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:30,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:30,164 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-12 10:27:30,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-04-12 10:27:30,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:30,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-04-12 10:27:30,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-12 10:27:30,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:30,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:30,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2018-04-12 10:27:30,654 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 10:27:30,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:27:30,673 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-12 10:27:30,673 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:99 [2018-04-12 10:27:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:27:31,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:27:31,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 54 [2018-04-12 10:27:31,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-12 10:27:31,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-12 10:27:31,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2807, Unknown=0, NotChecked=0, Total=2970 [2018-04-12 10:27:31,509 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand 55 states. [2018-04-12 10:27:32,295 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 100 DAG size of output 81 [2018-04-12 10:27:32,567 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 110 DAG size of output 83 [2018-04-12 10:27:32,805 WARN L151 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 108 DAG size of output 83 [2018-04-12 10:27:32,984 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 114 DAG size of output 88 [2018-04-12 10:27:33,163 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 113 DAG size of output 87 [2018-04-12 10:27:33,362 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 129 DAG size of output 100 [2018-04-12 10:27:33,577 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 103 DAG size of output 86 [2018-04-12 10:27:33,778 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 116 DAG size of output 89 [2018-04-12 10:27:33,985 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 127 DAG size of output 91 [2018-04-12 10:27:34,226 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 109 DAG size of output 91 [2018-04-12 10:27:34,784 WARN L151 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 106 DAG size of output 88 [2018-04-12 10:27:35,015 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 103 DAG size of output 83 [2018-04-12 10:27:37,663 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 87 DAG size of output 75 [2018-04-12 10:27:37,968 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 63 DAG size of output 48 [2018-04-12 10:27:42,526 WARN L151 SmtUtils]: Spent 4143ms on a formula simplification. DAG size of input: 76 DAG size of output 50 [2018-04-12 10:27:44,738 WARN L151 SmtUtils]: Spent 2086ms on a formula simplification. DAG size of input: 62 DAG size of output 49 [2018-04-12 10:27:44,979 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 62 DAG size of output 50 [2018-04-12 10:27:45,193 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 74 DAG size of output 48 [2018-04-12 10:27:47,610 WARN L151 SmtUtils]: Spent 2316ms on a formula simplification. DAG size of input: 89 DAG size of output 61 [2018-04-12 10:27:50,084 WARN L151 SmtUtils]: Spent 2366ms on a formula simplification. DAG size of input: 92 DAG size of output 46 [2018-04-12 10:27:50,319 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 81 DAG size of output 41 [2018-04-12 10:27:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:27:50,435 INFO L93 Difference]: Finished difference Result 186 states and 201 transitions. [2018-04-12 10:27:50,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-12 10:27:50,435 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 49 [2018-04-12 10:27:50,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:27:50,436 INFO L225 Difference]: With dead ends: 186 [2018-04-12 10:27:50,436 INFO L226 Difference]: Without dead ends: 184 [2018-04-12 10:27:50,436 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2610 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=714, Invalid=8598, Unknown=0, NotChecked=0, Total=9312 [2018-04-12 10:27:50,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-12 10:27:50,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 144. [2018-04-12 10:27:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-12 10:27:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2018-04-12 10:27:50,438 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 49 [2018-04-12 10:27:50,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:27:50,438 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2018-04-12 10:27:50,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-12 10:27:50,438 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2018-04-12 10:27:50,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 10:27:50,439 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:27:50,439 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:27:50,439 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:27:50,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1204787689, now seen corresponding path program 6 times [2018-04-12 10:27:50,439 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:27:50,439 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:27:50,440 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:27:50,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:27:50,440 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:27:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:27:50,447 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:27:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:27:51,188 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:27:51,188 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:27:51,193 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-12 10:27:51,225 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-12 10:27:51,225 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 10:27:51,228 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:27:51,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:27:51,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:51,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:27:51,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:51,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:51,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-12 10:27:51,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:51,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:51,315 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-12 10:27:51,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:51,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:51,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-12 10:27:51,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:51,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:51,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-12 10:27:51,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-04-12 10:27:51,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 10:27:51,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:51,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:51,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:51,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-04-12 10:27:51,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:51,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-12 10:27:51,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:27:51,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:51,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:51,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:27:51,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-04-12 10:27:51,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:27:51,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-04-12 10:27:51,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-12 10:27:51,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:27:51,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2018-04-12 10:27:51,908 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 10:27:51,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:27:51,919 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-12 10:27:51,919 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:63 [2018-04-12 10:27:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:27:55,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:27:55,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 54 [2018-04-12 10:27:55,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-12 10:27:55,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-12 10:27:55,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2791, Unknown=1, NotChecked=0, Total=2970 [2018-04-12 10:27:55,401 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand 55 states. [2018-04-12 10:27:56,192 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 106 DAG size of output 88 [2018-04-12 10:27:56,508 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 110 DAG size of output 88 [2018-04-12 10:27:56,787 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 110 DAG size of output 89 [2018-04-12 10:27:57,071 WARN L151 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 124 DAG size of output 99 [2018-04-12 10:27:57,313 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 98 DAG size of output 83 [2018-04-12 10:27:59,608 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 101 DAG size of output 86 [2018-04-12 10:28:04,828 WARN L151 SmtUtils]: Spent 2203ms on a formula simplification. DAG size of input: 79 DAG size of output 56 [2018-04-12 10:28:05,399 WARN L151 SmtUtils]: Spent 444ms on a formula simplification. DAG size of input: 96 DAG size of output 69 [2018-04-12 10:28:08,004 WARN L151 SmtUtils]: Spent 2400ms on a formula simplification. DAG size of input: 106 DAG size of output 52 [2018-04-12 10:28:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:28:09,030 INFO L93 Difference]: Finished difference Result 181 states and 196 transitions. [2018-04-12 10:28:09,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-12 10:28:09,031 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 50 [2018-04-12 10:28:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:28:09,031 INFO L225 Difference]: With dead ends: 181 [2018-04-12 10:28:09,031 INFO L226 Difference]: Without dead ends: 151 [2018-04-12 10:28:09,032 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2017 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=549, Invalid=6759, Unknown=2, NotChecked=0, Total=7310 [2018-04-12 10:28:09,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-12 10:28:09,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2018-04-12 10:28:09,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-12 10:28:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2018-04-12 10:28:09,034 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 50 [2018-04-12 10:28:09,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:28:09,034 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2018-04-12 10:28:09,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-12 10:28:09,034 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2018-04-12 10:28:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-12 10:28:09,034 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:28:09,034 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:28:09,034 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:28:09,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1362709499, now seen corresponding path program 7 times [2018-04-12 10:28:09,034 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:28:09,035 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:28:09,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:28:09,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 10:28:09,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:28:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:28:09,049 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:28:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:28:09,845 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:28:09,880 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:28:09,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:28:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:28:09,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:28:09,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:28:09,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:28:09,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-12 10:28:09,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:28:09,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:28:09,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:24 [2018-04-12 10:28:10,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:10,033 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-12 10:28:10,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:28:10,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:10,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:10,042 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-12 10:28:10,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:28:10,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:28:10,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:28 [2018-04-12 10:28:10,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-04-12 10:28:10,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 16 treesize of output 15 [2018-04-12 10:28:10,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:28:10,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:28:10,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:28:10,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-04-12 10:28:10,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-12 10:28:10,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:28:10,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:28:10,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:28:10,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-12 10:28:10,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:49 [2018-04-12 10:28:10,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-04-12 10:28:10,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-12 10:28:10,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:28:10,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:10,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2018-04-12 10:28:10,784 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 10:28:10,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:28:10,804 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-12 10:28:10,804 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:111 [2018-04-12 10:28:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:28:11,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:28:11,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31] total 56 [2018-04-12 10:28:11,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-12 10:28:11,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-12 10:28:11,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=3051, Unknown=0, NotChecked=0, Total=3192 [2018-04-12 10:28:11,916 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand 57 states. [2018-04-12 10:28:12,879 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 100 DAG size of output 81 [2018-04-12 10:28:13,214 WARN L151 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 175 DAG size of output 109 [2018-04-12 10:28:13,574 WARN L151 SmtUtils]: Spent 244ms on a formula simplification. DAG size of input: 178 DAG size of output 127 [2018-04-12 10:28:13,943 WARN L151 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 173 DAG size of output 130 [2018-04-12 10:28:14,344 WARN L151 SmtUtils]: Spent 279ms on a formula simplification. DAG size of input: 178 DAG size of output 148 [2018-04-12 10:28:14,735 WARN L151 SmtUtils]: Spent 250ms on a formula simplification. DAG size of input: 184 DAG size of output 129 [2018-04-12 10:28:15,113 WARN L151 SmtUtils]: Spent 250ms on a formula simplification. DAG size of input: 191 DAG size of output 148 [2018-04-12 10:28:15,443 WARN L151 SmtUtils]: Spent 202ms on a formula simplification. DAG size of input: 167 DAG size of output 129 [2018-04-12 10:28:15,840 WARN L151 SmtUtils]: Spent 272ms on a formula simplification. DAG size of input: 187 DAG size of output 144 [2018-04-12 10:28:16,187 WARN L151 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 145 DAG size of output 103 [2018-04-12 10:28:16,531 WARN L151 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 148 DAG size of output 105 [2018-04-12 10:28:16,827 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 119 DAG size of output 100 [2018-04-12 10:28:17,199 WARN L151 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 152 DAG size of output 109 [2018-04-12 10:28:17,565 WARN L151 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 153 DAG size of output 110 [2018-04-12 10:28:19,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:28:19,423 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2018-04-12 10:28:19,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-12 10:28:19,423 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2018-04-12 10:28:19,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:28:19,423 INFO L225 Difference]: With dead ends: 174 [2018-04-12 10:28:19,423 INFO L226 Difference]: Without dead ends: 173 [2018-04-12 10:28:19,424 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=546, Invalid=8196, Unknown=0, NotChecked=0, Total=8742 [2018-04-12 10:28:19,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-12 10:28:19,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 150. [2018-04-12 10:28:19,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-12 10:28:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2018-04-12 10:28:19,427 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 53 [2018-04-12 10:28:19,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:28:19,427 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2018-04-12 10:28:19,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-12 10:28:19,427 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2018-04-12 10:28:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-12 10:28:19,427 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:28:19,428 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:28:19,428 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:28:19,428 INFO L82 PathProgramCache]: Analyzing trace with hash -610069458, now seen corresponding path program 5 times [2018-04-12 10:28:19,428 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:28:19,428 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:28:19,428 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:28:19,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 10:28:19,428 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:28:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:28:19,445 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:28:20,199 WARN L151 SmtUtils]: Spent 322ms on a formula simplification. DAG size of input: 156 DAG size of output 125 [2018-04-12 10:28:20,619 WARN L151 SmtUtils]: Spent 392ms on a formula simplification. DAG size of input: 163 DAG size of output 84 [2018-04-12 10:28:21,012 WARN L151 SmtUtils]: Spent 359ms on a formula simplification. DAG size of input: 163 DAG size of output 83 [2018-04-12 10:28:21,342 WARN L151 SmtUtils]: Spent 297ms on a formula simplification. DAG size of input: 163 DAG size of output 85 [2018-04-12 10:28:21,748 WARN L151 SmtUtils]: Spent 361ms on a formula simplification. DAG size of input: 166 DAG size of output 86 [2018-04-12 10:28:22,198 WARN L151 SmtUtils]: Spent 405ms on a formula simplification. DAG size of input: 183 DAG size of output 95 [2018-04-12 10:28:22,665 WARN L151 SmtUtils]: Spent 413ms on a formula simplification. DAG size of input: 186 DAG size of output 98 [2018-04-12 10:28:22,883 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 113 DAG size of output 70 [2018-04-12 10:28:23,115 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 116 DAG size of output 73 [2018-04-12 10:28:23,287 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 94 DAG size of output 61 [2018-04-12 10:28:23,469 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 97 DAG size of output 64 [2018-04-12 10:28:24,389 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:28:24,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:28:24,389 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:28:24,393 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-12 10:28:24,420 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-12 10:28:24,420 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 10:28:24,423 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:28:24,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:28:24,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:28:24,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:28:24,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:28:24,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:28:24,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-12 10:28:24,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:24,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:24,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-12 10:28:24,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:28:24,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:24,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:24,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 10:28:24,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:28:24,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:28:24,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-12 10:28:24,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-04-12 10:28:24,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 10:28:24,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:28:24,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:28:24,685 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-12 10:28:24,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-12 10:28:24,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:24,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-12 10:28:24,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-12 10:28:24,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:28:24,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:28:24,737 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-12 10:28:24,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-04-12 10:28:26,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,945 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 125 treesize of output 105 [2018-04-12 10:28:26,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:26,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:28:27,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 63 disjoint index pairs (out of 55 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 521 [2018-04-12 10:28:27,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 10:28:27,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-12 10:28:27,258 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 10:28:27,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:28:27,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-12 10:28:27,589 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:153, output treesize:310 [2018-04-12 10:28:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:28:27,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:28:27,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 65 [2018-04-12 10:28:27,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-12 10:28:27,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-12 10:28:27,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=3745, Unknown=0, NotChecked=0, Total=4290 [2018-04-12 10:28:27,928 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand 66 states. [2018-04-12 10:28:28,532 WARN L151 SmtUtils]: Spent 244ms on a formula simplification. DAG size of input: 169 DAG size of output 131 [2018-04-12 10:28:29,273 WARN L151 SmtUtils]: Spent 666ms on a formula simplification. DAG size of input: 179 DAG size of output 141 [2018-04-12 10:28:30,191 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 264 DAG size of output 56 [2018-04-12 10:28:34,239 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 197 DAG size of output 59 [2018-04-12 10:28:40,439 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 202 DAG size of output 64 [2018-04-12 10:28:49,893 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 207 DAG size of output 72 [2018-04-12 10:28:52,791 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 210 DAG size of output 75 [2018-04-12 10:28:54,961 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 212 DAG size of output 77 [2018-04-12 10:28:55,192 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 215 DAG size of output 80 [2018-04-12 10:28:55,762 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 217 DAG size of output 82 [2018-04-12 10:28:56,211 WARN L151 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 220 DAG size of output 85 [2018-04-12 10:28:56,627 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 223 DAG size of output 87 [2018-04-12 10:28:58,137 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 226 DAG size of output 90 [2018-04-12 10:28:59,323 WARN L151 SmtUtils]: Spent 381ms on a formula simplification. DAG size of input: 228 DAG size of output 92 [2018-04-12 10:29:00,054 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 231 DAG size of output 95 [2018-04-12 10:29:00,768 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 233 DAG size of output 97 [2018-04-12 10:29:01,708 WARN L151 SmtUtils]: Spent 374ms on a formula simplification. DAG size of input: 236 DAG size of output 100 [2018-04-12 10:29:02,228 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 238 DAG size of output 102 [2018-04-12 10:29:04,569 WARN L151 SmtUtils]: Spent 543ms on a formula simplification. DAG size of input: 317 DAG size of output 158 [2018-04-12 10:29:05,123 WARN L151 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 243 DAG size of output 108 [2018-04-12 10:29:05,968 WARN L151 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 255 DAG size of output 111 [2018-04-12 10:29:06,498 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 250 DAG size of output 102 [2018-04-12 10:29:07,213 WARN L151 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 264 DAG size of output 112 [2018-04-12 10:29:26,844 WARN L151 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 232 DAG size of output 81 [2018-04-12 10:29:27,278 WARN L148 SmtUtils]: Spent 194ms on a formula simplification that was a NOOP. DAG size: 169 [2018-04-12 10:29:27,753 WARN L148 SmtUtils]: Spent 193ms on a formula simplification that was a NOOP. DAG size: 169 [2018-04-12 10:29:41,422 WARN L151 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 239 DAG size of output 95 [2018-04-12 10:29:42,117 WARN L151 SmtUtils]: Spent 408ms on a formula simplification. DAG size of input: 172 DAG size of output 169 [2018-04-12 10:30:05,901 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 222 DAG size of output 74 [2018-04-12 10:30:07,794 WARN L148 SmtUtils]: Spent 184ms on a formula simplification that was a NOOP. DAG size: 160 [2018-04-12 10:30:23,232 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 225 DAG size of output 81 [2018-04-12 10:30:49,416 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 213 DAG size of output 69 [2018-04-12 10:30:49,941 WARN L148 SmtUtils]: Spent 164ms on a formula simplification that was a NOOP. DAG size: 154 [2018-04-12 10:31:01,154 WARN L151 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 216 DAG size of output 72 [2018-04-12 10:31:39,739 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 209 DAG size of output 69 [2018-04-12 10:32:02,200 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 198 DAG size of output 58 [2018-04-12 10:32:15,830 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 201 DAG size of output 61 [2018-04-12 10:32:41,319 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 191 DAG size of output 51 [2018-04-12 10:33:03,348 WARN L151 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 188 DAG size of output 50 [2018-04-12 10:33:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:33:04,211 INFO L93 Difference]: Finished difference Result 308 states and 340 transitions. [2018-04-12 10:33:04,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-12 10:33:04,212 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 54 [2018-04-12 10:33:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:33:04,212 INFO L225 Difference]: With dead ends: 308 [2018-04-12 10:33:04,212 INFO L226 Difference]: Without dead ends: 276 [2018-04-12 10:33:04,213 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4207 ImplicationChecksByTransitivity, 271.1s TimeCoverageRelationStatistics Valid=1813, Invalid=11484, Unknown=43, NotChecked=0, Total=13340 [2018-04-12 10:33:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-04-12 10:33:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 198. [2018-04-12 10:33:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-12 10:33:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 220 transitions. [2018-04-12 10:33:04,215 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 220 transitions. Word has length 54 [2018-04-12 10:33:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:33:04,215 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 220 transitions. [2018-04-12 10:33:04,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-12 10:33:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2018-04-12 10:33:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 10:33:04,216 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:33:04,216 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:33:04,216 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:33:04,216 INFO L82 PathProgramCache]: Analyzing trace with hash -598862743, now seen corresponding path program 8 times [2018-04-12 10:33:04,216 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:33:04,216 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:33:04,217 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:33:04,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 10:33:04,217 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:33:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:33:04,237 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:33:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 9 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:33:04,704 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:33:04,704 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:33:04,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 10:33:04,733 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 10:33:04,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 10:33:04,736 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:33:04,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:33:04,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:33:04,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:33:04,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:33:04,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:33:04,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:24 [2018-04-12 10:33:04,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:33:04,854 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-12 10:33:04,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:33:04,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:33:04,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:33:04,863 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-12 10:33:04,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:33:04,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:33:04,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-04-12 10:33:04,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-04-12 10:33:04,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 10:33:04,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:33:04,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:33:04,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:33:04,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-04-12 10:33:04,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-04-12 10:33:04,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:33:04,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:33:04,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:33:04,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:33:04,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-04-12 10:33:06,413 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 54 treesize of output 49 [2018-04-12 10:33:06,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 34 treesize of output 97 [2018-04-12 10:33:06,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2018-04-12 10:33:06,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-12 10:33:06,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 5 xjuncts. [2018-04-12 10:33:06,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:93, output treesize:400 [2018-04-12 10:33:07,278 WARN L151 SmtUtils]: Spent 525ms on a formula simplification. DAG size of input: 130 DAG size of output 88 [2018-04-12 10:33:08,091 WARN L151 SmtUtils]: Spent 290ms on a formula simplification. DAG size of input: 113 DAG size of output 95 [2018-04-12 10:33:08,352 WARN L148 SmtUtils]: Spent 157ms on a formula simplification that was a NOOP. DAG size: 103 [2018-04-12 10:33:09,107 WARN L148 SmtUtils]: Spent 275ms on a formula simplification that was a NOOP. DAG size: 103 [2018-04-12 10:33:09,115 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 103 treesize of output 96 [2018-04-12 10:33:09,130 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 46 [2018-04-12 10:33:09,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-04-12 10:33:09,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-12 10:33:09,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2018-04-12 10:33:09,372 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 22 treesize of output 35 [2018-04-12 10:33:09,372 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 10:33:09,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:33:09,577 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 94 treesize of output 85 [2018-04-12 10:33:09,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 34 treesize of output 97 [2018-04-12 10:33:09,602 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 16 xjuncts. [2018-04-12 10:33:09,688 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-12 10:33:09,985 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 78 treesize of output 73 [2018-04-12 10:33:09,993 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 22 treesize of output 35 [2018-04-12 10:33:09,999 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-12 10:33:10,015 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:33:10,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-2 vars, End of recursive call: 16 dim-0 vars, and 13 xjuncts. [2018-04-12 10:33:10,291 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 15 variables, input treesize:351, output treesize:900 [2018-04-12 10:33:16,055 WARN L151 SmtUtils]: Spent 5123ms on a formula simplification. DAG size of input: 213 DAG size of output 157 [2018-04-12 10:33:19,486 WARN L151 SmtUtils]: Spent 1608ms on a formula simplification. DAG size of input: 178 DAG size of output 126 [2018-04-12 10:33:20,104 WARN L148 SmtUtils]: Spent 475ms on a formula simplification that was a NOOP. DAG size: 126 [2018-04-12 10:33:20,785 WARN L148 SmtUtils]: Spent 534ms on a formula simplification that was a NOOP. DAG size: 126 [2018-04-12 10:33:20,792 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 97 treesize of output 87 [2018-04-12 10:33:20,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 41 [2018-04-12 10:33:20,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 10:33:20,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 10:33:20,845 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 10:33:20,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:33:21,004 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 78 treesize of output 72 [2018-04-12 10:33:21,006 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 10:33:21,006 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 15 treesize of output 11 [2018-04-12 10:33:21,006 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 10:33:21,017 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 13 treesize of output 1 [2018-04-12 10:33:21,017 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 10:33:21,025 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:33:21,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2018-04-12 10:33:21,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 10:33:21,157 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-12 10:33:21,166 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:33:21,311 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 86 treesize of output 80 [2018-04-12 10:33:21,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-12 10:33:21,313 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 10:33:21,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 10:33:21,330 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-12 10:33:21,341 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:33:21,509 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 81 treesize of output 75 [2018-04-12 10:33:21,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 10:33:21,514 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-12 10:33:21,526 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 13 treesize of output 1 [2018-04-12 10:33:21,527 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 10:33:21,537 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:33:21,717 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 108 treesize of output 100 [2018-04-12 10:33:21,722 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2018-04-12 10:33:21,723 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-12 10:33:21,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 10:33:21,743 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-04-12 10:33:21,757 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 10:33:21,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 6 dim-2 vars, End of recursive call: 11 dim-0 vars, and 11 xjuncts. [2018-04-12 10:33:21,953 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 26 variables, input treesize:514, output treesize:581 [2018-04-12 10:33:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 10:33:22,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 10:33:22,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 34] total 58 [2018-04-12 10:33:22,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-12 10:33:22,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-12 10:33:22,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3254, Unknown=0, NotChecked=0, Total=3422 [2018-04-12 10:33:22,683 INFO L87 Difference]: Start difference. First operand 198 states and 220 transitions. Second operand 59 states. [2018-04-12 10:33:24,485 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 117 DAG size of output 86 [2018-04-12 10:33:24,953 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 118 DAG size of output 87 [2018-04-12 10:33:25,407 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 113 DAG size of output 85 [2018-04-12 10:33:25,635 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 120 DAG size of output 91 [2018-04-12 10:33:25,936 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 124 DAG size of output 93 [2018-04-12 10:33:26,504 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 133 DAG size of output 95 [2018-04-12 10:33:26,741 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 137 DAG size of output 104 [2018-04-12 10:33:26,996 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 134 DAG size of output 96 [2018-04-12 10:33:29,753 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 138 DAG size of output 99 [2018-04-12 10:33:30,224 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 139 DAG size of output 100 [2018-04-12 10:33:30,876 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 99 DAG size of output 99 [2018-04-12 10:33:31,714 WARN L151 SmtUtils]: Spent 311ms on a formula simplification. DAG size of input: 117 DAG size of output 98 [2018-04-12 10:33:32,009 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 115 DAG size of output 98 [2018-04-12 10:33:34,453 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 115 DAG size of output 98 [2018-04-12 10:33:35,668 WARN L151 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 169 DAG size of output 120 [2018-04-12 10:33:37,355 WARN L151 SmtUtils]: Spent 1318ms on a formula simplification. DAG size of input: 146 DAG size of output 140 [2018-04-12 10:33:37,681 WARN L151 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 137 DAG size of output 99 [2018-04-12 10:33:39,201 WARN L151 SmtUtils]: Spent 1397ms on a formula simplification. DAG size of input: 176 DAG size of output 163 [2018-04-12 10:33:39,470 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 139 DAG size of output 102 [2018-04-12 10:33:42,555 WARN L151 SmtUtils]: Spent 454ms on a formula simplification. DAG size of input: 158 DAG size of output 115 [2018-04-12 10:33:43,187 WARN L151 SmtUtils]: Spent 392ms on a formula simplification. DAG size of input: 185 DAG size of output 127 [2018-04-12 10:33:44,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 10:33:44,401 INFO L93 Difference]: Finished difference Result 273 states and 297 transitions. [2018-04-12 10:33:44,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-12 10:33:44,401 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 56 [2018-04-12 10:33:44,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 10:33:44,402 INFO L225 Difference]: With dead ends: 273 [2018-04-12 10:33:44,402 INFO L226 Difference]: Without dead ends: 271 [2018-04-12 10:33:44,402 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2759 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=698, Invalid=10432, Unknown=0, NotChecked=0, Total=11130 [2018-04-12 10:33:44,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-04-12 10:33:44,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 220. [2018-04-12 10:33:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-12 10:33:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 250 transitions. [2018-04-12 10:33:44,406 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 250 transitions. Word has length 56 [2018-04-12 10:33:44,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 10:33:44,406 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 250 transitions. [2018-04-12 10:33:44,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-12 10:33:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 250 transitions. [2018-04-12 10:33:44,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 10:33:44,407 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 10:33:44,407 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 10:33:44,407 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-12 10:33:44,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1101451338, now seen corresponding path program 9 times [2018-04-12 10:33:44,407 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 10:33:44,407 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 10:33:44,408 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:33:44,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 10:33:44,408 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 10:33:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 10:33:44,420 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 10:33:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-04-12 10:33:44,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 10:33:44,712 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 10:33:44,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-12 10:33:44,756 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-04-12 10:33:44,756 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 10:33:44,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 10:33:44,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:33:44,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:33:44,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 10:33:44,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:33:44,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:33:44,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-12 10:33:44,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:33:44,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:33:44,841 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-12 10:33:44,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 10:33:44,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:33:44,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-12 10:33:44,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:33:44,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:33:44,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-04-12 10:33:44,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-04-12 10:33:44,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 10:33:44,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:33:44,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:33:44,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:33:44,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-04-12 10:33:44,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:33:44,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-12 10:33:44,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 10:33:44,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 10:33:44,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:33:44,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 10:33:44,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-04-12 10:33:52,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 10:33:52,909 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 79 treesize of output 68 [2018-04-12 10:33:53,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 22 case distinctions, treesize of input 52 treesize of output 250 [2018-04-12 10:33:53,009 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-04-12 10:33:53,572 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 65536 conjuctions. This might take some time... Received shutdown request... [2018-04-12 10:38:25,941 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-12 10:38:25,941 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-12 10:38:25,944 WARN L197 ceAbstractionStarter]: Timeout [2018-04-12 10:38:25,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 10:38:25 BoogieIcfgContainer [2018-04-12 10:38:25,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 10:38:25,945 INFO L168 Benchmark]: Toolchain (without parser) took 856275.70 ms. Allocated memory was 405.8 MB in the beginning and 506.5 MB in the end (delta: 100.7 MB). Free memory was 342.2 MB in the beginning and 310.8 MB in the end (delta: 31.4 MB). Peak memory consumption was 374.5 MB. Max. memory is 5.3 GB. [2018-04-12 10:38:25,946 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 405.8 MB. Free memory is still 369.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 10:38:25,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.73 ms. Allocated memory is still 405.8 MB. Free memory was 340.9 MB in the beginning and 317.1 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-12 10:38:25,946 INFO L168 Benchmark]: Boogie Preprocessor took 41.84 ms. Allocated memory is still 405.8 MB. Free memory was 317.1 MB in the beginning and 314.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-12 10:38:25,946 INFO L168 Benchmark]: RCFGBuilder took 369.35 ms. Allocated memory was 405.8 MB in the beginning and 612.4 MB in the end (delta: 206.6 MB). Free memory was 314.5 MB in the beginning and 544.4 MB in the end (delta: -230.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. [2018-04-12 10:38:25,946 INFO L168 Benchmark]: TraceAbstraction took 855628.19 ms. Allocated memory was 612.4 MB in the beginning and 506.5 MB in the end (delta: -105.9 MB). Free memory was 544.4 MB in the beginning and 310.8 MB in the end (delta: 233.6 MB). Peak memory consumption was 370.1 MB. Max. memory is 5.3 GB. [2018-04-12 10:38:25,947 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.13 ms. Allocated memory is still 405.8 MB. Free memory is still 369.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 233.73 ms. Allocated memory is still 405.8 MB. Free memory was 340.9 MB in the beginning and 317.1 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.84 ms. Allocated memory is still 405.8 MB. Free memory was 317.1 MB in the beginning and 314.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 369.35 ms. Allocated memory was 405.8 MB in the beginning and 612.4 MB in the end (delta: 206.6 MB). Free memory was 314.5 MB in the beginning and 544.4 MB in the end (delta: -230.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 855628.19 ms. Allocated memory was 612.4 MB in the beginning and 506.5 MB in the end (delta: -105.9 MB). Free memory was 544.4 MB in the beginning and 310.8 MB in the end (delta: 233.6 MB). Peak memory consumption was 370.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 573]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 573]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 60 locations, 13 error locations. TIMEOUT Result, 855.5s OverallTime, 35 OverallIterations, 12 TraceHistogramMax, 502.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1090 SDtfs, 4904 SDslu, 11678 SDs, 0 SdLazy, 23274 SolverSat, 2195 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 75.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1921 GetRequests, 438 SyntacticMatches, 10 SemanticMatches, 1473 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27966 ImplicationChecksByTransitivity, 486.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=34, 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, 34 MinimizatonAttempts, 700 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 70.2s InterpolantComputationTime, 1892 NumberOfCodeBlocks, 1892 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 1838 ConstructedInterpolants, 372 QuantifiedInterpolants, 2466500 SizeOfPredicates, 352 NumberOfNonLiveVariables, 3881 ConjunctsInSsa, 1351 ConjunctsInUnsatCore, 54 InterpolantComputations, 14 PerfectInterpolantSequences, 16/1348 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_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_10-38-25-953.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_10-38-25-953.csv Completed graceful shutdown