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 -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 20:33:26,659 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 20:33:26,660 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 20:33:26,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 20:33:26,673 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 20:33:26,674 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 20:33:26,675 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 20:33:26,677 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 20:33:26,679 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 20:33:26,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 20:33:26,680 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 20:33:26,680 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 20:33:26,681 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 20:33:26,683 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 20:33:26,683 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 20:33:26,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 20:33:26,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 20:33:26,689 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 20:33:26,691 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 20:33:26,692 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 20:33:26,694 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 20:33:26,694 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 20:33:26,695 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 20:33:26,696 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 20:33:26,696 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 20:33:26,698 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 20:33:26,698 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 20:33:26,699 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 20:33:26,699 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 20:33:26,700 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 20:33:26,700 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 20:33:26,701 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-09 20:33:26,725 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 20:33:26,725 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 20:33:26,726 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 20:33:26,726 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 20:33:26,726 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 20:33:26,727 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 20:33:26,727 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 20:33:26,727 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 20:33:26,727 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 20:33:26,727 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 20:33:26,728 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 20:33:26,728 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 20:33:26,728 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 20:33:26,728 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 20:33:26,729 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 20:33:26,729 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 20:33:26,729 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 20:33:26,729 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 20:33:26,729 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 20:33:26,730 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 20:33:26,730 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 20:33:26,730 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 20:33:26,730 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 20:33:26,730 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 20:33:26,730 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 20:33:26,731 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 20:33:26,731 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 20:33:26,731 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 20:33:26,731 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 20:33:26,731 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 20:33:26,732 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 20:33:26,732 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 20:33:26,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:26,732 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 20:33:26,733 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 20:33:26,733 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 20:33:26,733 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 20:33:26,734 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 20:33:26,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 20:33:26,779 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 20:33:26,783 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 20:33:26,785 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 20:33:26,785 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 20:33:26,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,106 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG9253e2c88 [2018-04-09 20:33:27,277 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 20:33:27,278 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 20:33:27,278 INFO L168 CDTParser]: Scanning openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,289 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 20:33:27,289 INFO L215 ultiparseSymbolTable]: [2018-04-09 20:33:27,289 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 20:33:27,289 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,289 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlen ('cstrlen') in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,289 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,289 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,290 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmp ('cstrncmp') in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,290 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstr ('cstrstr') in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,290 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 20:33:27,290 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,290 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,290 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,290 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,290 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,291 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,292 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,293 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,293 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,293 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,293 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,293 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,293 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,293 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,293 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,294 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,294 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,294 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,294 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,294 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,294 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,294 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,294 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,295 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,295 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,295 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,295 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,295 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,295 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,295 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,295 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,296 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,296 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,296 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,296 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,296 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,296 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,296 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,296 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,296 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,296 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,296 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,296 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,296 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,297 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,297 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,297 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,297 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,297 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,297 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,297 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,297 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,297 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,297 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,297 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,297 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,297 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,297 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,297 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,297 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,298 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,299 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,300 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,301 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:27,321 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG9253e2c88 [2018-04-09 20:33:27,325 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 20:33:27,327 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 20:33:27,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 20:33:27,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 20:33:27,333 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 20:33:27,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 08:33:27" (1/1) ... [2018-04-09 20:33:27,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2861ed96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:33:27, skipping insertion in model container [2018-04-09 20:33:27,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 08:33:27" (1/1) ... [2018-04-09 20:33:27,349 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 20:33:27,378 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 20:33:27,557 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 20:33:27,609 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 20:33:27,615 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 114 non ball SCCs. Number of states in SCCs 114. [2018-04-09 20:33:27,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:33:27 WrapperNode [2018-04-09 20:33:27,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 20:33:27,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 20:33:27,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 20:33:27,656 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 20:33:27,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:33:27" (1/1) ... [2018-04-09 20:33:27,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:33:27" (1/1) ... [2018-04-09 20:33:27,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:33:27" (1/1) ... [2018-04-09 20:33:27,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:33:27" (1/1) ... [2018-04-09 20:33:27,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:33:27" (1/1) ... [2018-04-09 20:33:27,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:33:27" (1/1) ... [2018-04-09 20:33:27,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:33:27" (1/1) ... [2018-04-09 20:33:27,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 20:33:27,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 20:33:27,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 20:33:27,717 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 20:33:27,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:33:27" (1/1) ... No working directory specified, using /storage/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-09 20:33:27,847 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 20:33:27,847 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 20:33:27,848 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-09 20:33:27,848 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-09 20:33:27,848 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlen [2018-04-09 20:33:27,848 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmp [2018-04-09 20:33:27,848 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstr [2018-04-09 20:33:27,848 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 20:33:27,848 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-09 20:33:27,849 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-09 20:33:27,849 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 20:33:27,849 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 20:33:27,849 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 20:33:27,849 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 20:33:27,849 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 20:33:27,850 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 20:33:27,850 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 20:33:27,850 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 20:33:27,850 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 20:33:27,850 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 20:33:27,850 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 20:33:27,850 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 20:33:27,851 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 20:33:27,851 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 20:33:27,851 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 20:33:27,851 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 20:33:27,851 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 20:33:27,851 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 20:33:27,851 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 20:33:27,851 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 20:33:27,852 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 20:33:27,852 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 20:33:27,852 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 20:33:27,852 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 20:33:27,852 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 20:33:27,852 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 20:33:27,852 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 20:33:27,853 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 20:33:27,853 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 20:33:27,853 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 20:33:27,853 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 20:33:27,853 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 20:33:27,853 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 20:33:27,853 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 20:33:27,853 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 20:33:27,854 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 20:33:27,854 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 20:33:27,854 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 20:33:27,854 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 20:33:27,854 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 20:33:27,854 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 20:33:27,854 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 20:33:27,854 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 20:33:27,855 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 20:33:27,855 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 20:33:27,855 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 20:33:27,855 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 20:33:27,855 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 20:33:27,855 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 20:33:27,855 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 20:33:27,855 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 20:33:27,856 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 20:33:27,856 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 20:33:27,856 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 20:33:27,856 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 20:33:27,856 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 20:33:27,856 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 20:33:27,856 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 20:33:27,857 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 20:33:27,857 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 20:33:27,857 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 20:33:27,857 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 20:33:27,857 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 20:33:27,857 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 20:33:27,857 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 20:33:27,857 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 20:33:27,858 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 20:33:27,858 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 20:33:27,858 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 20:33:27,858 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 20:33:27,858 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 20:33:27,858 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 20:33:27,858 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 20:33:27,858 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 20:33:27,859 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 20:33:27,859 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 20:33:27,859 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 20:33:27,859 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 20:33:27,859 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 20:33:27,859 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 20:33:27,859 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 20:33:27,859 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 20:33:27,860 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 20:33:27,860 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 20:33:27,860 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 20:33:27,860 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 20:33:27,860 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 20:33:27,860 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 20:33:27,860 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 20:33:27,860 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 20:33:27,861 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 20:33:27,861 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 20:33:27,861 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 20:33:27,861 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 20:33:27,861 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 20:33:27,861 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 20:33:27,861 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 20:33:27,861 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 20:33:27,862 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 20:33:27,862 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 20:33:27,862 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 20:33:27,862 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlen [2018-04-09 20:33:27,862 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 20:33:27,862 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmp [2018-04-09 20:33:27,862 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstr [2018-04-09 20:33:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 20:33:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 20:33:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 20:33:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 20:33:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 20:33:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 20:33:27,863 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 20:33:28,361 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 20:33:28,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 08:33:28 BoogieIcfgContainer [2018-04-09 20:33:28,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 20:33:28,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 20:33:28,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 20:33:28,366 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 20:33:28,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 08:33:27" (1/3) ... [2018-04-09 20:33:28,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a60c8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 08:33:28, skipping insertion in model container [2018-04-09 20:33:28,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:33:27" (2/3) ... [2018-04-09 20:33:28,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a60c8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 08:33:28, skipping insertion in model container [2018-04-09 20:33:28,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 08:33:28" (3/3) ... [2018-04-09 20:33:28,370 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:33:28,379 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 20:33:28,387 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-04-09 20:33:28,433 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 20:33:28,434 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 20:33:28,434 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 20:33:28,434 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 20:33:28,434 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 20:33:28,434 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 20:33:28,434 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 20:33:28,434 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 20:33:28,434 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 20:33:28,435 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 20:33:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2018-04-09 20:33:28,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-09 20:33:28,453 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:33:28,454 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:33:28,454 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:33:28,458 INFO L82 PathProgramCache]: Analyzing trace with hash 104768082, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:28,470 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:33:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:33:28,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:33:28,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:33:28,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:28,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:28,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 20:33:28,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 20:33:28,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:28,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:33:28,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-09 20:33:28,615 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-09 20:33:28,615 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:33:28,646 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-09 20:33:28,684 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:33:28,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 20:33:28,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 20:33:28,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 20:33:28,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 20:33:28,701 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 4 states. [2018-04-09 20:33:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:33:28,837 INFO L93 Difference]: Finished difference Result 243 states and 267 transitions. [2018-04-09 20:33:28,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 20:33:28,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-09 20:33:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:33:28,849 INFO L225 Difference]: With dead ends: 243 [2018-04-09 20:33:28,850 INFO L226 Difference]: Without dead ends: 146 [2018-04-09 20:33:28,854 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 20:33:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-09 20:33:28,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-04-09 20:33:28,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-09 20:33:28,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2018-04-09 20:33:28,907 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 19 [2018-04-09 20:33:28,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:33:28,907 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2018-04-09 20:33:28,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 20:33:28,908 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2018-04-09 20:33:28,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-09 20:33:28,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:33:28,909 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:33:28,909 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:33:28,909 INFO L82 PathProgramCache]: Analyzing trace with hash 104768083, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:28,917 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:33:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:33:28,936 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:33:28,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:33:28,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:28,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:33:28,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:28,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:28,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-09 20:33:29,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:33:29,034 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-09 20:33:29,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:29,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:33:29,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:33:29,053 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-09 20:33:29,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:29,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:29,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-09 20:33:29,077 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-09 20:33:29,078 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:33:29,199 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:29,200 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-04-09 20:33:29,208 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-09 20:33:29,229 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:33:29,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-09 20:33:29,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 20:33:29,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 20:33:29,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-09 20:33:29,231 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand 9 states. [2018-04-09 20:33:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:33:29,401 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-04-09 20:33:29,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 20:33:29,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-04-09 20:33:29,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:33:29,403 INFO L225 Difference]: With dead ends: 146 [2018-04-09 20:33:29,403 INFO L226 Difference]: Without dead ends: 145 [2018-04-09 20:33:29,404 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-09 20:33:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-09 20:33:29,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-04-09 20:33:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-09 20:33:29,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-04-09 20:33:29,415 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 19 [2018-04-09 20:33:29,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:33:29,415 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2018-04-09 20:33:29,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 20:33:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-04-09 20:33:29,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-09 20:33:29,416 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:33:29,416 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:33:29,417 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:33:29,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1047156750, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:29,424 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:33:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:33:29,438 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:33:29,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:33:29,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:29,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:29,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 20:33:29,467 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-09 20:33:29,467 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:33:29,471 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-09 20:33:29,492 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:33:29,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 20:33:29,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 20:33:29,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 20:33:29,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 20:33:29,493 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 4 states. [2018-04-09 20:33:29,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:33:29,590 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-04-09 20:33:29,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 20:33:29,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-09 20:33:29,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:33:29,592 INFO L225 Difference]: With dead ends: 145 [2018-04-09 20:33:29,592 INFO L226 Difference]: Without dead ends: 144 [2018-04-09 20:33:29,593 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-09 20:33:29,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-09 20:33:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-04-09 20:33:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-09 20:33:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-04-09 20:33:29,604 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 20 [2018-04-09 20:33:29,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:33:29,604 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-04-09 20:33:29,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 20:33:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-04-09 20:33:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-09 20:33:29,605 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:33:29,606 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:33:29,606 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:33:29,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1047156749, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:29,617 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:33:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:33:29,634 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:33:29,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-09 20:33:29,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:29,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:29,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-09 20:33:29,699 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-09 20:33:29,699 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:33:29,738 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-09 20:33:29,760 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:33:29,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-09 20:33:29,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 20:33:29,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 20:33:29,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-09 20:33:29,761 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 7 states. [2018-04-09 20:33:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:33:29,888 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-04-09 20:33:29,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 20:33:29,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-04-09 20:33:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:33:29,890 INFO L225 Difference]: With dead ends: 144 [2018-04-09 20:33:29,890 INFO L226 Difference]: Without dead ends: 143 [2018-04-09 20:33:29,891 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 20:33:29,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-09 20:33:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-04-09 20:33:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-09 20:33:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-04-09 20:33:29,901 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 20 [2018-04-09 20:33:29,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:33:29,902 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-04-09 20:33:29,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 20:33:29,902 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-04-09 20:33:29,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-09 20:33:29,902 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:33:29,902 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:33:29,902 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:33:29,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1739525523, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:29,923 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:33:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:33:29,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:33:29,960 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-09 20:33:29,960 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:33:29,964 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-09 20:33:29,984 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:33:29,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 20:33:29,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 20:33:29,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 20:33:29,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-09 20:33:29,985 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 6 states. [2018-04-09 20:33:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:33:30,074 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2018-04-09 20:33:30,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 20:33:30,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-04-09 20:33:30,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:33:30,075 INFO L225 Difference]: With dead ends: 143 [2018-04-09 20:33:30,075 INFO L226 Difference]: Without dead ends: 142 [2018-04-09 20:33:30,075 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 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-09 20:33:30,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-09 20:33:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-04-09 20:33:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-09 20:33:30,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-04-09 20:33:30,084 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 29 [2018-04-09 20:33:30,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:33:30,084 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-04-09 20:33:30,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 20:33:30,084 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-04-09 20:33:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-09 20:33:30,084 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:33:30,085 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:33:30,085 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:33:30,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1739525524, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:30,091 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:33:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:33:30,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:33:30,152 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-09 20:33:30,152 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:33:30,158 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-09 20:33:30,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:30,164 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-09 20:33:30,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:30,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:33:30,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-09 20:33:30,178 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-09 20:33:30,199 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:33:30,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-09 20:33:30,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 20:33:30,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 20:33:30,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-09 20:33:30,200 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand 9 states. [2018-04-09 20:33:30,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:33:30,351 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-04-09 20:33:30,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:33:30,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-04-09 20:33:30,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:33:30,352 INFO L225 Difference]: With dead ends: 142 [2018-04-09 20:33:30,352 INFO L226 Difference]: Without dead ends: 141 [2018-04-09 20:33:30,353 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-04-09 20:33:30,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-09 20:33:30,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-04-09 20:33:30,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-09 20:33:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-04-09 20:33:30,359 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 29 [2018-04-09 20:33:30,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:33:30,359 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-04-09 20:33:30,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 20:33:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-04-09 20:33:30,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-09 20:33:30,360 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:33:30,360 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:33:30,360 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:33:30,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1793175866, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:30,366 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:33:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:33:30,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:33:30,431 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-09 20:33:30,431 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:33:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:33:30,458 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:33:30,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-09 20:33:30,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 20:33:30,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 20:33:30,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-04-09 20:33:30,459 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 9 states. [2018-04-09 20:33:30,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:33:30,708 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-04-09 20:33:30,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 20:33:30,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-04-09 20:33:30,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:33:30,710 INFO L225 Difference]: With dead ends: 141 [2018-04-09 20:33:30,710 INFO L226 Difference]: Without dead ends: 140 [2018-04-09 20:33:30,710 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-04-09 20:33:30,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-09 20:33:30,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-04-09 20:33:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-09 20:33:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-04-09 20:33:30,720 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 39 [2018-04-09 20:33:30,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:33:30,720 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-04-09 20:33:30,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 20:33:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-04-09 20:33:30,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-09 20:33:30,721 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:33:30,722 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:33:30,722 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:33:30,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1793175867, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:30,730 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:33:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:33:30,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:33:30,764 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-09 20:33:30,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 20:33:30,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:30,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:30,771 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-09 20:33:30,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-04-09 20:33:30,848 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-09 20:33:30,856 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-09 20:33:30,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:33:30,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:33:30,870 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-09 20:33:30,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-04-09 20:33:30,988 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-09 20:33:30,988 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:33:31,385 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-09 20:33:31,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:31,393 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 13 treesize of output 11 [2018-04-09 20:33:31,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 20:33:31,402 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:31,403 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:31,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:31,409 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-04-09 20:33:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:33:31,443 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:33:31,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 13] imperfect sequences [] total 24 [2018-04-09 20:33:31,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-09 20:33:31,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-09 20:33:31,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-04-09 20:33:31,444 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 25 states. [2018-04-09 20:33:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:33:32,395 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-04-09 20:33:32,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-09 20:33:32,395 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2018-04-09 20:33:32,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:33:32,399 INFO L225 Difference]: With dead ends: 154 [2018-04-09 20:33:32,399 INFO L226 Difference]: Without dead ends: 153 [2018-04-09 20:33:32,401 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=198, Invalid=1208, Unknown=0, NotChecked=0, Total=1406 [2018-04-09 20:33:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-09 20:33:32,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 142. [2018-04-09 20:33:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-09 20:33:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-04-09 20:33:32,409 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 39 [2018-04-09 20:33:32,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:33:32,409 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-04-09 20:33:32,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-09 20:33:32,410 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-04-09 20:33:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-09 20:33:32,411 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:33:32,411 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:33:32,411 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:33:32,412 INFO L82 PathProgramCache]: Analyzing trace with hash 474358775, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:32,421 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:33:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:33:32,442 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:33:32,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:33:32,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-09 20:33:32,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:33:32,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 20:33:32,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:32,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:32,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:33:32,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:33:32,546 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc22.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc22.base| 1))) (and (= (select .cse0 |c_main_#t~malloc23.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc22.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc23.base| 1) |main_#t~malloc22.base| 0))))) is different from true [2018-04-09 20:33:32,551 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc22.base| Int) (|main_#t~malloc23.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc22.base| 1))) (and (= (select .cse0 |main_#t~malloc23.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc22.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc23.base| 1) |main_#t~malloc22.base| 0) |main_#t~malloc23.base| 0))))) is different from true [2018-04-09 20:33:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:33:32,559 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:33:32,630 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc23.base_12| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc23.base_12| 1) |c_main_#t~malloc22.base| 0) |v_main_#t~malloc23.base_12| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc23.base_12|))))) is different from false [2018-04-09 20:33:32,639 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc22.base_11| Int) (|v_main_#t~malloc23.base_12| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc22.base_11| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc23.base_12| 1) |v_main_#t~malloc22.base_11| 0) |v_main_#t~malloc23.base_12| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc22.base_11|))) (not (= (select .cse0 |v_main_#t~malloc23.base_12|) 0))))) is different from false [2018-04-09 20:33:32,659 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-09 20:33:32,680 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:33:32,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:33:32,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:33:32,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:33:32,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:33:32,681 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand 12 states. [2018-04-09 20:33:32,689 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc22.base_11| Int) (|v_main_#t~malloc23.base_12| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc22.base_11| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc23.base_12| 1) |v_main_#t~malloc22.base_11| 0) |v_main_#t~malloc23.base_12| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc22.base_11|))) (not (= (select .cse0 |v_main_#t~malloc23.base_12|) 0)))))) is different from false [2018-04-09 20:33:33,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:33:33,120 INFO L93 Difference]: Finished difference Result 269 states and 288 transitions. [2018-04-09 20:33:33,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:33:33,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-04-09 20:33:33,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:33:33,122 INFO L225 Difference]: With dead ends: 269 [2018-04-09 20:33:33,122 INFO L226 Difference]: Without dead ends: 249 [2018-04-09 20:33:33,122 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 20:33:33,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-09 20:33:33,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 236. [2018-04-09 20:33:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-09 20:33:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 266 transitions. [2018-04-09 20:33:33,138 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 266 transitions. Word has length 43 [2018-04-09 20:33:33,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:33:33,138 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 266 transitions. [2018-04-09 20:33:33,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:33:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 266 transitions. [2018-04-09 20:33:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-09 20:33:33,140 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:33:33,140 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:33:33,140 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:33:33,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1862601621, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:33,147 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:33:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:33:33,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:33:33,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:33:33,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-09 20:33:33,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:33:33,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 20:33:33,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:33,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:33,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:33:33,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:33:33,237 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc22.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc22.base| 1))) (and (= (select .cse0 |c_main_#t~malloc23.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc22.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc23.base| 1) |main_#t~malloc22.base| 0))))) is different from true [2018-04-09 20:33:33,241 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc22.base| Int) (|main_#t~malloc23.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc22.base| 1))) (and (= (select .cse0 |main_#t~malloc23.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc22.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc23.base| 1) |main_#t~malloc22.base| 0) |main_#t~malloc23.base| 0))))) is different from true [2018-04-09 20:33:33,249 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-09 20:33:33,249 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:33:33,267 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc23.base_14| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc23.base_14| 1) |c_main_#t~malloc22.base| 0) |v_main_#t~malloc23.base_14| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc23.base_14|))))) is different from false [2018-04-09 20:33:33,271 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc22.base_13| Int) (|v_main_#t~malloc23.base_14| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc22.base_13| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc23.base_14|))) (= (store (store (store .cse0 |v_main_#t~malloc23.base_14| 1) |v_main_#t~malloc22.base_13| 0) |v_main_#t~malloc23.base_14| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc22.base_13|)))))) is different from false [2018-04-09 20:33:33,312 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-09 20:33:33,333 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:33:33,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:33:33,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:33:33,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:33:33,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:33:33,334 INFO L87 Difference]: Start difference. First operand 236 states and 266 transitions. Second operand 12 states. [2018-04-09 20:33:33,346 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc22.base_13| Int) (|v_main_#t~malloc23.base_14| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc22.base_13| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc23.base_14|))) (= (store (store (store .cse0 |v_main_#t~malloc23.base_14| 1) |v_main_#t~malloc22.base_13| 0) |v_main_#t~malloc23.base_14| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc22.base_13|))))))) is different from false [2018-04-09 20:33:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:33:34,072 INFO L93 Difference]: Finished difference Result 363 states and 401 transitions. [2018-04-09 20:33:34,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:33:34,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-04-09 20:33:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:33:34,073 INFO L225 Difference]: With dead ends: 363 [2018-04-09 20:33:34,074 INFO L226 Difference]: Without dead ends: 343 [2018-04-09 20:33:34,074 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 20:33:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-09 20:33:34,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 237. [2018-04-09 20:33:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-04-09 20:33:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 267 transitions. [2018-04-09 20:33:34,093 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 267 transitions. Word has length 44 [2018-04-09 20:33:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:33:34,093 INFO L459 AbstractCegarLoop]: Abstraction has 237 states and 267 transitions. [2018-04-09 20:33:34,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:33:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 267 transitions. [2018-04-09 20:33:34,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-09 20:33:34,094 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:33:34,094 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:33:34,094 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:33:34,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1515778480, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:34,102 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:33:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:33:34,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:33:34,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:33:34,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-09 20:33:34,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:33:34,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 20:33:34,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:34,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:34,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:33:34,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:33:34,204 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc22.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc22.base| 1))) (and (= (select .cse0 |c_main_#t~malloc23.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc22.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc23.base| 1) |main_#t~malloc22.base| 0))))) is different from true [2018-04-09 20:33:34,209 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc22.base| Int) (|main_#t~malloc23.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc22.base| 1))) (and (= (select .cse0 |main_#t~malloc23.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc22.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc23.base| 1) |main_#t~malloc22.base| 0) |main_#t~malloc23.base| 0))))) is different from true [2018-04-09 20:33:34,215 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-09 20:33:34,215 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:33:34,234 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc23.base_16| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc23.base_16| 1) |c_main_#t~malloc22.base| 0) |v_main_#t~malloc23.base_16| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc23.base_16|))))) is different from false [2018-04-09 20:33:34,237 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc22.base_15| Int) (|v_main_#t~malloc23.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc22.base_15| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc22.base_15|))) (= (store (store (store .cse0 |v_main_#t~malloc23.base_16| 1) |v_main_#t~malloc22.base_15| 0) |v_main_#t~malloc23.base_16| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc23.base_16|) 0))))) is different from false [2018-04-09 20:33:34,249 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-09 20:33:34,270 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:33:34,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:33:34,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:33:34,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:33:34,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:33:34,270 INFO L87 Difference]: Start difference. First operand 237 states and 267 transitions. Second operand 12 states. [2018-04-09 20:33:34,278 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc22.base_15| Int) (|v_main_#t~malloc23.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc22.base_15| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc22.base_15|))) (= (store (store (store .cse0 |v_main_#t~malloc23.base_16| 1) |v_main_#t~malloc22.base_15| 0) |v_main_#t~malloc23.base_16| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc23.base_16|) 0)))))) is different from false [2018-04-09 20:33:34,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:33:34,907 INFO L93 Difference]: Finished difference Result 363 states and 401 transitions. [2018-04-09 20:33:34,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:33:34,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-04-09 20:33:34,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:33:34,909 INFO L225 Difference]: With dead ends: 363 [2018-04-09 20:33:34,909 INFO L226 Difference]: Without dead ends: 343 [2018-04-09 20:33:34,910 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 20:33:34,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-09 20:33:34,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 237. [2018-04-09 20:33:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-04-09 20:33:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 267 transitions. [2018-04-09 20:33:34,928 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 267 transitions. Word has length 44 [2018-04-09 20:33:34,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:33:34,928 INFO L459 AbstractCegarLoop]: Abstraction has 237 states and 267 transitions. [2018-04-09 20:33:34,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:33:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 267 transitions. [2018-04-09 20:33:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-09 20:33:34,930 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:33:34,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:33:34,930 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:33:34,930 INFO L82 PathProgramCache]: Analyzing trace with hash 965199198, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:34,941 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:33:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:33:34,958 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:33:34,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 6 treesize of output 5 [2018-04-09 20:33:34,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:34,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:34,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 20:33:34,974 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-09 20:33:34,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 20:33:34,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:34,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:34,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:34,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-09 20:33:35,049 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-09 20:33:35,054 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-09 20:33:35,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:33:35,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:33:35,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:33:35,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-09 20:33:35,118 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-09 20:33:35,118 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:33:35,503 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 13 treesize of output 11 [2018-04-09 20:33:35,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 20:33:35,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:35,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:35,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:33:35,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-04-09 20:33:35,596 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-09 20:33:35,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:33:35,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-04-09 20:33:35,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-09 20:33:35,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-09 20:33:35,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-04-09 20:33:35,617 INFO L87 Difference]: Start difference. First operand 237 states and 267 transitions. Second operand 30 states. [2018-04-09 20:33:36,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:33:36,563 INFO L93 Difference]: Finished difference Result 253 states and 285 transitions. [2018-04-09 20:33:36,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-09 20:33:36,563 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 46 [2018-04-09 20:33:36,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:33:36,565 INFO L225 Difference]: With dead ends: 253 [2018-04-09 20:33:36,565 INFO L226 Difference]: Without dead ends: 252 [2018-04-09 20:33:36,566 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=268, Invalid=1802, Unknown=0, NotChecked=0, Total=2070 [2018-04-09 20:33:36,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-09 20:33:36,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 232. [2018-04-09 20:33:36,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-09 20:33:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 261 transitions. [2018-04-09 20:33:36,580 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 261 transitions. Word has length 46 [2018-04-09 20:33:36,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:33:36,580 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 261 transitions. [2018-04-09 20:33:36,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-09 20:33:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 261 transitions. [2018-04-09 20:33:36,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-09 20:33:36,581 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:33:36,581 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:33:36,582 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:33:36,582 INFO L82 PathProgramCache]: Analyzing trace with hash -213125892, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:36,587 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:33:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:33:36,606 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:33:36,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:33:36,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-09 20:33:36,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:33:36,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 20:33:36,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:36,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:36,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:33:36,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:33:36,684 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc22.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc22.base| 1))) (and (= (select .cse0 |c_main_#t~malloc23.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc22.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc23.base| 1) |main_#t~malloc22.base| 0))))) is different from true [2018-04-09 20:33:36,687 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc22.base| Int) (|main_#t~malloc23.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc22.base| 1))) (and (= (select .cse0 |main_#t~malloc23.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc22.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc23.base| 1) |main_#t~malloc22.base| 0) |main_#t~malloc23.base| 0))))) is different from true [2018-04-09 20:33:36,693 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-09 20:33:36,694 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:33:36,712 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc23.base_19| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc23.base_19| 1) |c_main_#t~malloc22.base| 0) |v_main_#t~malloc23.base_19| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc23.base_19|))))) is different from false [2018-04-09 20:33:36,715 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc23.base_19| Int) (|v_main_#t~malloc22.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc22.base_17| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc23.base_19| 1) |v_main_#t~malloc22.base_17| 0) |v_main_#t~malloc23.base_19| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc23.base_19|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc22.base_17|)))))) is different from false [2018-04-09 20:33:36,741 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-09 20:33:36,776 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:33:36,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:33:36,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:33:36,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:33:36,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:33:36,777 INFO L87 Difference]: Start difference. First operand 232 states and 261 transitions. Second operand 12 states. [2018-04-09 20:33:36,791 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc23.base_19| Int) (|v_main_#t~malloc22.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc22.base_17| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc23.base_19| 1) |v_main_#t~malloc22.base_17| 0) |v_main_#t~malloc23.base_19| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc23.base_19|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc22.base_17|))))))) is different from false [2018-04-09 20:33:37,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:33:37,405 INFO L93 Difference]: Finished difference Result 244 states and 261 transitions. [2018-04-09 20:33:37,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:33:37,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-04-09 20:33:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:33:37,430 INFO L225 Difference]: With dead ends: 244 [2018-04-09 20:33:37,430 INFO L226 Difference]: Without dead ends: 224 [2018-04-09 20:33:37,431 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 20:33:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-09 20:33:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 119. [2018-04-09 20:33:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-09 20:33:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-04-09 20:33:37,439 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 45 [2018-04-09 20:33:37,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:33:37,440 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-04-09 20:33:37,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:33:37,440 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-04-09 20:33:37,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-09 20:33:37,440 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:33:37,440 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:33:37,440 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:33:37,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1966925962, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:37,447 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:33:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:33:37,466 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:33:37,489 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-09 20:33:37,489 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:33:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:33:37,516 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:33:37,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 6 [2018-04-09 20:33:37,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 20:33:37,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 20:33:37,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-09 20:33:37,517 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 7 states. [2018-04-09 20:33:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:33:37,582 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-04-09 20:33:37,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 20:33:37,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-04-09 20:33:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:33:37,583 INFO L225 Difference]: With dead ends: 119 [2018-04-09 20:33:37,583 INFO L226 Difference]: Without dead ends: 118 [2018-04-09 20:33:37,584 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-09 20:33:37,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-04-09 20:33:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-04-09 20:33:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-09 20:33:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-04-09 20:33:37,597 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 51 [2018-04-09 20:33:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:33:37,597 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-04-09 20:33:37,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 20:33:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-04-09 20:33:37,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-09 20:33:37,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:33:37,598 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:33:37,598 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:33:37,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1966925963, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:37,604 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:33:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:33:37,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:33:37,689 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-09 20:33:37,689 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:33:37,696 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-09 20:33:37,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:37,702 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-09 20:33:37,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:37,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:33:37,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-09 20:33:37,717 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-09 20:33:37,737 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:33:37,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 9 [2018-04-09 20:33:37,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 20:33:37,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 20:33:37,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-04-09 20:33:37,738 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 10 states. [2018-04-09 20:33:39,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:33:39,930 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-04-09 20:33:39,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 20:33:39,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-04-09 20:33:39,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:33:39,932 INFO L225 Difference]: With dead ends: 124 [2018-04-09 20:33:39,932 INFO L226 Difference]: Without dead ends: 123 [2018-04-09 20:33:39,933 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-04-09 20:33:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-09 20:33:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-04-09 20:33:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-09 20:33:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-04-09 20:33:39,950 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 51 [2018-04-09 20:33:39,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:33:39,950 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-04-09 20:33:39,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 20:33:39,950 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-04-09 20:33:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-09 20:33:39,951 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:33:39,951 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:33:39,951 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:33:39,952 INFO L82 PathProgramCache]: Analyzing trace with hash -461841797, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:39,961 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:33:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:33:39,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:33:39,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:33:39,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:40,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:40,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 20:33:40,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:33:40,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:33:40,021 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-09 20:33:40,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:40,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:40,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-09 20:33:40,050 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-09 20:33:40,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 20:33:40,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:40,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:40,064 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-09 20:33:40,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-09 20:33:40,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-09 20:33:40,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:33:40,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:40,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:40,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-09 20:33:40,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-09 20:33:46,374 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 30 treesize of output 28 [2018-04-09 20:33:46,380 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-09 20:33:46,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:33:46,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 20:33:46,388 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:46,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:33:46,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:33:46,402 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-04-09 20:33:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:33:46,497 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:33:46,946 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-09 20:33:46,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:46,952 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 13 treesize of output 11 [2018-04-09 20:33:46,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 20:33:46,960 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:46,961 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:46,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:46,966 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-04-09 20:33:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:33:47,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:33:47,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2018-04-09 20:33:47,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-09 20:33:47,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-09 20:33:47,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=669, Unknown=3, NotChecked=0, Total=756 [2018-04-09 20:33:47,072 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 28 states. [2018-04-09 20:33:47,648 WARN L151 SmtUtils]: Spent 285ms on a formula simplification. DAG size of input: 52 DAG size of output 39 [2018-04-09 20:33:52,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:33:52,615 INFO L93 Difference]: Finished difference Result 192 states and 205 transitions. [2018-04-09 20:33:52,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-09 20:33:52,616 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-04-09 20:33:52,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:33:52,617 INFO L225 Difference]: With dead ends: 192 [2018-04-09 20:33:52,617 INFO L226 Difference]: Without dead ends: 191 [2018-04-09 20:33:52,618 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=259, Invalid=1544, Unknown=3, NotChecked=0, Total=1806 [2018-04-09 20:33:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-04-09 20:33:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2018-04-09 20:33:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-09 20:33:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 201 transitions. [2018-04-09 20:33:52,639 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 201 transitions. Word has length 60 [2018-04-09 20:33:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:33:52,640 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 201 transitions. [2018-04-09 20:33:52,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-09 20:33:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 201 transitions. [2018-04-09 20:33:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-09 20:33:52,641 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:33:52,641 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 20:33:52,641 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:33:52,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1757645193, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:33:52,650 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:33:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:33:52,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:33:52,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:33:52,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:52,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:52,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 20:33:52,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:33:52,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:33:52,710 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-09 20:33:52,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:52,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:52,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-09 20:33:52,737 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-09 20:33:52,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 20:33:52,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:52,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:52,747 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-09 20:33:52,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-09 20:33:52,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-09 20:33:52,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 20:33:52,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:52,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:52,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-09 20:33:52,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-09 20:33:57,160 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 30 treesize of output 28 [2018-04-09 20:33:57,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 20:33:57,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:57,171 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-09 20:33:57,172 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-09 20:33:57,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:33:57,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:33:57,184 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-04-09 20:33:57,295 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-09 20:33:57,295 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:33:57,727 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-09 20:33:57,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:57,769 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 13 treesize of output 11 [2018-04-09 20:33:57,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 20:33:57,778 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:33:57,779 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:57,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:33:57,784 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-04-09 20:33:57,890 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-09 20:33:57,910 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:33:57,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18, 13] imperfect sequences [] total 29 [2018-04-09 20:33:57,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-09 20:33:57,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-09 20:33:57,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=778, Unknown=1, NotChecked=0, Total=870 [2018-04-09 20:33:57,911 INFO L87 Difference]: Start difference. First operand 178 states and 201 transitions. Second operand 30 states. [2018-04-09 20:34:00,172 WARN L151 SmtUtils]: Spent 2034ms on a formula simplification. DAG size of input: 52 DAG size of output 50 [2018-04-09 20:34:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:34:05,264 INFO L93 Difference]: Finished difference Result 222 states and 238 transitions. [2018-04-09 20:34:05,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-09 20:34:05,265 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 63 [2018-04-09 20:34:05,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:34:05,266 INFO L225 Difference]: With dead ends: 222 [2018-04-09 20:34:05,267 INFO L226 Difference]: Without dead ends: 220 [2018-04-09 20:34:05,267 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=241, Invalid=1650, Unknown=1, NotChecked=0, Total=1892 [2018-04-09 20:34:05,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-04-09 20:34:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 179. [2018-04-09 20:34:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-09 20:34:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 202 transitions. [2018-04-09 20:34:05,290 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 202 transitions. Word has length 63 [2018-04-09 20:34:05,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:34:05,291 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 202 transitions. [2018-04-09 20:34:05,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-09 20:34:05,291 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 202 transitions. [2018-04-09 20:34:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-09 20:34:05,291 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:34:05,292 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 20:34:05,292 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:34:05,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1757645194, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:34:05,300 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:34:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:34:05,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:34:05,360 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-09 20:34:05,360 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:34:05,367 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-09 20:34:05,387 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:34:05,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 8 [2018-04-09 20:34:05,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 20:34:05,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 20:34:05,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-09 20:34:05,388 INFO L87 Difference]: Start difference. First operand 179 states and 202 transitions. Second operand 9 states. [2018-04-09 20:34:05,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:34:05,496 INFO L93 Difference]: Finished difference Result 187 states and 210 transitions. [2018-04-09 20:34:05,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 20:34:05,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-04-09 20:34:05,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:34:05,498 INFO L225 Difference]: With dead ends: 187 [2018-04-09 20:34:05,498 INFO L226 Difference]: Without dead ends: 185 [2018-04-09 20:34:05,498 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-04-09 20:34:05,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-09 20:34:05,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 180. [2018-04-09 20:34:05,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-09 20:34:05,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 202 transitions. [2018-04-09 20:34:05,521 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 202 transitions. Word has length 63 [2018-04-09 20:34:05,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:34:05,522 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 202 transitions. [2018-04-09 20:34:05,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 20:34:05,522 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 202 transitions. [2018-04-09 20:34:05,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-09 20:34:05,523 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:34:05,523 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:34:05,523 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:34:05,523 INFO L82 PathProgramCache]: Analyzing trace with hash -2061634130, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:34:05,531 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:34:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:34:05,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:34:05,621 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-09 20:34:05,621 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:34:05,631 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-09 20:34:05,653 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:34:05,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 9 [2018-04-09 20:34:05,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 20:34:05,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 20:34:05,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-04-09 20:34:05,654 INFO L87 Difference]: Start difference. First operand 180 states and 202 transitions. Second operand 10 states. [2018-04-09 20:34:05,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:34:05,831 INFO L93 Difference]: Finished difference Result 180 states and 202 transitions. [2018-04-09 20:34:05,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-09 20:34:05,831 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-04-09 20:34:05,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:34:05,832 INFO L225 Difference]: With dead ends: 180 [2018-04-09 20:34:05,832 INFO L226 Difference]: Without dead ends: 179 [2018-04-09 20:34:05,833 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-04-09 20:34:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-09 20:34:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-04-09 20:34:05,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-09 20:34:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 200 transitions. [2018-04-09 20:34:05,854 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 200 transitions. Word has length 66 [2018-04-09 20:34:05,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:34:05,855 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 200 transitions. [2018-04-09 20:34:05,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 20:34:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 200 transitions. [2018-04-09 20:34:05,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-09 20:34:05,856 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:34:05,856 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:34:05,856 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:34:05,856 INFO L82 PathProgramCache]: Analyzing trace with hash -2061634129, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:34:05,866 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:34:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:34:05,895 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:34:05,970 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-09 20:34:05,970 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:34:06,059 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-04-09 20:34:06,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:06,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:34:06,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:3 [2018-04-09 20:34:06,097 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2018-04-09 20:34:06,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-09 20:34:06,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:34:06,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:17 [2018-04-09 20:34:06,201 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-09 20:34:06,234 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:34:06,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2018-04-09 20:34:06,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-09 20:34:06,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-09 20:34:06,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-04-09 20:34:06,236 INFO L87 Difference]: Start difference. First operand 179 states and 200 transitions. Second operand 20 states. [2018-04-09 20:34:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:34:06,483 INFO L93 Difference]: Finished difference Result 203 states and 226 transitions. [2018-04-09 20:34:06,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 20:34:06,483 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2018-04-09 20:34:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:34:06,484 INFO L225 Difference]: With dead ends: 203 [2018-04-09 20:34:06,484 INFO L226 Difference]: Without dead ends: 202 [2018-04-09 20:34:06,485 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2018-04-09 20:34:06,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-04-09 20:34:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 185. [2018-04-09 20:34:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-09 20:34:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 206 transitions. [2018-04-09 20:34:06,498 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 206 transitions. Word has length 66 [2018-04-09 20:34:06,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:34:06,499 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 206 transitions. [2018-04-09 20:34:06,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-09 20:34:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 206 transitions. [2018-04-09 20:34:06,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-09 20:34:06,499 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:34:06,499 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 20:34:06,499 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:34:06,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1879697781, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:34:06,506 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:34:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:34:06,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:34:06,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:34:06,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:06,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:34:06,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:06,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:34:06,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 20:34:06,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:34:06,550 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-09 20:34:06,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:06,563 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:34:06,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:34:06,565 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-09 20:34:06,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:06,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:34:06,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-09 20:34:06,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-09 20:34:06,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 20:34:06,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:06,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:34:06,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:34:06,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-09 20:34:06,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-09 20:34:06,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-09 20:34:06,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:06,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:34:06,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:34:06,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-09 20:34:07,767 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 33 treesize of output 31 [2018-04-09 20:34:07,769 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-09 20:34:07,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:07,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-09 20:34:07,778 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-09 20:34:07,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:34:07,787 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-09 20:34:07,787 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-04-09 20:34:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:34:07,886 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:34:08,665 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 13 treesize of output 11 [2018-04-09 20:34:08,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 20:34:08,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:08,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:34:08,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:34:08,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-04-09 20:34:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:34:09,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:34:09,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 34 [2018-04-09 20:34:09,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-09 20:34:09,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-09 20:34:09,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1071, Unknown=0, NotChecked=0, Total=1190 [2018-04-09 20:34:09,066 INFO L87 Difference]: Start difference. First operand 185 states and 206 transitions. Second operand 35 states. [2018-04-09 20:34:09,541 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 32 DAG size of output 28 [2018-04-09 20:34:09,979 WARN L151 SmtUtils]: Spent 309ms on a formula simplification. DAG size of input: 68 DAG size of output 48 [2018-04-09 20:34:10,455 WARN L151 SmtUtils]: Spent 297ms on a formula simplification. DAG size of input: 47 DAG size of output 39 [2018-04-09 20:34:10,829 WARN L151 SmtUtils]: Spent 339ms on a formula simplification. DAG size of input: 59 DAG size of output 41 [2018-04-09 20:34:11,106 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 35 DAG size of output 31 [2018-04-09 20:34:11,688 WARN L151 SmtUtils]: Spent 491ms on a formula simplification. DAG size of input: 56 DAG size of output 46 [2018-04-09 20:34:12,419 WARN L151 SmtUtils]: Spent 440ms on a formula simplification. DAG size of input: 40 DAG size of output 36 [2018-04-09 20:34:12,600 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 53 DAG size of output 43 [2018-04-09 20:34:12,991 WARN L151 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 57 DAG size of output 50 [2018-04-09 20:34:13,208 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 48 DAG size of output 40 [2018-04-09 20:34:13,578 WARN L151 SmtUtils]: Spent 287ms on a formula simplification. DAG size of input: 40 DAG size of output 34 [2018-04-09 20:34:14,767 WARN L151 SmtUtils]: Spent 1050ms on a formula simplification. DAG size of input: 56 DAG size of output 45 [2018-04-09 20:34:14,996 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 45 DAG size of output 40 [2018-04-09 20:34:15,393 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 55 DAG size of output 46 [2018-04-09 20:34:15,660 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 59 DAG size of output 52 [2018-04-09 20:34:16,435 WARN L151 SmtUtils]: Spent 431ms on a formula simplification. DAG size of input: 50 DAG size of output 43 [2018-04-09 20:34:16,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:34:16,613 INFO L93 Difference]: Finished difference Result 188 states and 209 transitions. [2018-04-09 20:34:16,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-09 20:34:16,613 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 69 [2018-04-09 20:34:16,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:34:16,614 INFO L225 Difference]: With dead ends: 188 [2018-04-09 20:34:16,615 INFO L226 Difference]: Without dead ends: 187 [2018-04-09 20:34:16,615 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=546, Invalid=2534, Unknown=0, NotChecked=0, Total=3080 [2018-04-09 20:34:16,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-04-09 20:34:16,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 176. [2018-04-09 20:34:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-09 20:34:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2018-04-09 20:34:16,629 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 69 [2018-04-09 20:34:16,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:34:16,629 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2018-04-09 20:34:16,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-09 20:34:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2018-04-09 20:34:16,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-09 20:34:16,630 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:34:16,630 INFO L355 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:34:16,630 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:34:16,630 INFO L82 PathProgramCache]: Analyzing trace with hash -101908377, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:34:16,636 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:34:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:34:16,663 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:34:16,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:34:16,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:16,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:34:16,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:16,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:34:16,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 20:34:16,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:34:16,700 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-09 20:34:16,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:16,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:34:16,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:34:16,709 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-09 20:34:16,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:16,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:34:16,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-09 20:34:16,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-09 20:34:16,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-09 20:34:16,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:16,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:34:16,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 1 xjuncts. [2018-04-09 20:34:16,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-09 20:34:16,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-09 20:34:16,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 20:34:16,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:16,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:34:16,762 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-09 20:34:16,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-04-09 20:34:18,019 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-09 20:34:18,021 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-09 20:34:18,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:18,029 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-09 20:34:18,030 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-09 20:34:18,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:34:18,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:34:18,042 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-04-09 20:34:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:34:18,176 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:34:19,260 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 13 treesize of output 11 [2018-04-09 20:34:19,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 20:34:19,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:19,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:34:19,276 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-09 20:34:19,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-04-09 20:34:19,655 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-09 20:34:19,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:34:19,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2018-04-09 20:34:19,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-09 20:34:19,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-09 20:34:19,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1208, Unknown=0, NotChecked=0, Total=1332 [2018-04-09 20:34:19,677 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand 37 states. [2018-04-09 20:34:20,527 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 39 DAG size of output 35 [2018-04-09 20:34:21,064 WARN L151 SmtUtils]: Spent 306ms on a formula simplification. DAG size of input: 77 DAG size of output 57 [2018-04-09 20:34:22,305 WARN L151 SmtUtils]: Spent 607ms on a formula simplification. DAG size of input: 56 DAG size of output 48 [2018-04-09 20:34:22,612 WARN L151 SmtUtils]: Spent 233ms on a formula simplification. DAG size of input: 66 DAG size of output 54 [2018-04-09 20:34:22,944 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 42 DAG size of output 38 [2018-04-09 20:34:25,425 WARN L151 SmtUtils]: Spent 2224ms on a formula simplification. DAG size of input: 65 DAG size of output 55 [2018-04-09 20:34:26,009 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 47 DAG size of output 43 [2018-04-09 20:34:26,487 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 58 DAG size of output 51 [2018-04-09 20:34:26,911 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 62 DAG size of output 57 [2018-04-09 20:34:27,169 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 52 DAG size of output 46 [2018-04-09 20:34:29,556 WARN L151 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 46 DAG size of output 41 [2018-04-09 20:34:32,376 WARN L151 SmtUtils]: Spent 379ms on a formula simplification. DAG size of input: 60 DAG size of output 51 [2018-04-09 20:34:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:34:33,910 INFO L93 Difference]: Finished difference Result 216 states and 230 transitions. [2018-04-09 20:34:33,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-09 20:34:33,911 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-04-09 20:34:33,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:34:33,912 INFO L225 Difference]: With dead ends: 216 [2018-04-09 20:34:33,912 INFO L226 Difference]: Without dead ends: 215 [2018-04-09 20:34:33,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=442, Invalid=2862, Unknown=2, NotChecked=0, Total=3306 [2018-04-09 20:34:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-09 20:34:33,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 119. [2018-04-09 20:34:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-09 20:34:33,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-04-09 20:34:33,923 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 72 [2018-04-09 20:34:33,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:34:33,923 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-04-09 20:34:33,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-09 20:34:33,924 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-04-09 20:34:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-09 20:34:33,924 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:34:33,924 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:34:33,924 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:34:33,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1870819696, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:34:33,937 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:34:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:34:33,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:34:33,994 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-09 20:34:33,994 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:34:34,011 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-04-09 20:34:34,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:34,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:34:34,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-04-09 20:34:34,044 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-09 20:34:34,064 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:34:34,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2018-04-09 20:34:34,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-09 20:34:34,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-09 20:34:34,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-04-09 20:34:34,065 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 14 states. [2018-04-09 20:34:34,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:34:34,175 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-04-09 20:34:34,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:34:34,176 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2018-04-09 20:34:34,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:34:34,177 INFO L225 Difference]: With dead ends: 125 [2018-04-09 20:34:34,177 INFO L226 Difference]: Without dead ends: 124 [2018-04-09 20:34:34,177 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-04-09 20:34:34,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-09 20:34:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2018-04-09 20:34:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-09 20:34:34,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-04-09 20:34:34,194 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 73 [2018-04-09 20:34:34,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:34:34,194 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-04-09 20:34:34,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-09 20:34:34,194 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-04-09 20:34:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-09 20:34:34,195 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:34:34,195 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:34:34,195 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:34:34,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1870819695, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:34:34,202 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:34:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:34:34,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:34:34,286 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-09 20:34:34,286 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:34:34,293 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-09 20:34:34,313 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:34:34,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 9 [2018-04-09 20:34:34,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 20:34:34,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 20:34:34,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-04-09 20:34:34,314 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 10 states. [2018-04-09 20:34:34,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:34:34,421 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-04-09 20:34:34,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-09 20:34:34,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-04-09 20:34:34,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:34:34,422 INFO L225 Difference]: With dead ends: 118 [2018-04-09 20:34:34,422 INFO L226 Difference]: Without dead ends: 116 [2018-04-09 20:34:34,422 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-04-09 20:34:34,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-04-09 20:34:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-04-09 20:34:34,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-09 20:34:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2018-04-09 20:34:34,433 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 73 [2018-04-09 20:34:34,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:34:34,433 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2018-04-09 20:34:34,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 20:34:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2018-04-09 20:34:34,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-09 20:34:34,434 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:34:34,434 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:34:34,434 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:34:34,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1742816140, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:34:34,439 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:34:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:34:34,463 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:34:34,509 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-09 20:34:34,509 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:34:34,517 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-09 20:34:34,538 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:34:34,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 10 [2018-04-09 20:34:34,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-09 20:34:34,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-09 20:34:34,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-04-09 20:34:34,539 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 11 states. [2018-04-09 20:34:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:34:34,671 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-04-09 20:34:34,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:34:34,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-04-09 20:34:34,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:34:34,672 INFO L225 Difference]: With dead ends: 116 [2018-04-09 20:34:34,672 INFO L226 Difference]: Without dead ends: 115 [2018-04-09 20:34:34,672 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-04-09 20:34:34,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-09 20:34:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-04-09 20:34:34,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-09 20:34:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2018-04-09 20:34:34,683 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 74 [2018-04-09 20:34:34,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:34:34,684 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2018-04-09 20:34:34,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-09 20:34:34,684 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2018-04-09 20:34:34,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-09 20:34:34,684 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:34:34,684 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:34:34,684 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:34:34,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1742816139, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:34:34,690 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:34:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:34:34,715 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:34:34,804 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-09 20:34:34,804 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:34:34,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-04-09 20:34:34,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:34,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:34:34,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:3 [2018-04-09 20:34:34,946 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2018-04-09 20:34:34,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-09 20:34:34,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:34:34,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:17 [2018-04-09 20:34:35,014 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-09 20:34:35,035 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:34:35,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 23 [2018-04-09 20:34:35,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-09 20:34:35,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-09 20:34:35,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2018-04-09 20:34:35,036 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 24 states. [2018-04-09 20:34:35,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:34:35,481 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-04-09 20:34:35,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-09 20:34:35,481 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-04-09 20:34:35,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:34:35,482 INFO L225 Difference]: With dead ends: 156 [2018-04-09 20:34:35,482 INFO L226 Difference]: Without dead ends: 155 [2018-04-09 20:34:35,483 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2018-04-09 20:34:35,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-09 20:34:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 123. [2018-04-09 20:34:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-09 20:34:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2018-04-09 20:34:35,496 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 74 [2018-04-09 20:34:35,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:34:35,496 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2018-04-09 20:34:35,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-09 20:34:35,496 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2018-04-09 20:34:35,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-09 20:34:35,496 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:34:35,497 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:34:35,497 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:34:35,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1888847233, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:34:35,511 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:34:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:34:35,547 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:34:35,569 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-09 20:34:35,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:34:35,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:35,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:34:35,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:34:35,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-04-09 20:34:37,948 WARN L148 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 17 [2018-04-09 20:34:41,995 WARN L151 SmtUtils]: Spent 4008ms on a formula simplification. DAG size of input: 23 DAG size of output 15 [2018-04-09 20:34:44,044 WARN L148 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 15 [2018-04-09 20:34:46,093 WARN L148 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 15 [2018-04-09 20:34:48,115 WARN L148 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 21 [2018-04-09 20:34:50,137 WARN L148 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 21 [2018-04-09 20:34:50,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-04-09 20:34:50,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 3 [2018-04-09 20:34:50,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:34:50,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:34:50,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:34:50,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:36, output treesize:3 [2018-04-09 20:34:50,405 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-09 20:34:50,406 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:35:09,035 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-09 20:35:09,057 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:35:09,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20, 17] imperfect sequences [] total 34 [2018-04-09 20:35:09,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-09 20:35:09,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-09 20:35:09,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=998, Unknown=9, NotChecked=0, Total=1122 [2018-04-09 20:35:09,058 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 34 states. [2018-04-09 20:35:11,700 WARN L148 SmtUtils]: Spent 2009ms on a formula simplification that was a NOOP. DAG size: 27 [2018-04-09 20:35:13,759 WARN L148 SmtUtils]: Spent 2007ms on a formula simplification that was a NOOP. DAG size: 25 [2018-04-09 20:35:15,960 WARN L148 SmtUtils]: Spent 2013ms on a formula simplification that was a NOOP. DAG size: 20 [2018-04-09 20:35:20,205 WARN L148 SmtUtils]: Spent 4007ms on a formula simplification that was a NOOP. DAG size: 23 [2018-04-09 20:35:24,305 WARN L148 SmtUtils]: Spent 4008ms on a formula simplification that was a NOOP. DAG size: 29 [2018-04-09 20:35:30,444 WARN L148 SmtUtils]: Spent 6014ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-09 20:35:34,541 WARN L148 SmtUtils]: Spent 4008ms on a formula simplification that was a NOOP. DAG size: 29 [2018-04-09 20:35:38,649 WARN L148 SmtUtils]: Spent 4011ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-09 20:35:42,806 WARN L148 SmtUtils]: Spent 4015ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-09 20:35:44,868 WARN L148 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 29 [2018-04-09 20:35:47,046 WARN L148 SmtUtils]: Spent 2008ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-09 20:35:49,150 WARN L148 SmtUtils]: Spent 2006ms on a formula simplification that was a NOOP. DAG size: 29 [2018-04-09 20:35:51,255 WARN L148 SmtUtils]: Spent 2008ms on a formula simplification that was a NOOP. DAG size: 31 [2018-04-09 20:35:55,458 WARN L148 SmtUtils]: Spent 2006ms on a formula simplification that was a NOOP. DAG size: 17 [2018-04-09 20:35:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:35:55,561 INFO L93 Difference]: Finished difference Result 256 states and 277 transitions. [2018-04-09 20:35:55,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-09 20:35:55,562 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 82 [2018-04-09 20:35:55,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:35:55,562 INFO L225 Difference]: With dead ends: 256 [2018-04-09 20:35:55,563 INFO L226 Difference]: Without dead ends: 129 [2018-04-09 20:35:55,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 78.6s TimeCoverageRelationStatistics Valid=327, Invalid=2633, Unknown=10, NotChecked=0, Total=2970 [2018-04-09 20:35:55,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-09 20:35:55,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-04-09 20:35:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-09 20:35:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-04-09 20:35:55,576 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 82 [2018-04-09 20:35:55,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:35:55,577 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-04-09 20:35:55,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-09 20:35:55,577 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-04-09 20:35:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-09 20:35:55,577 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:35:55,578 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 20:35:55,578 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:35:55,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1938968188, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:35:55,596 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:35:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:35:55,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:35:55,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:35:55,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:35:55,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:35:55,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 20:35:55,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:35:55,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:35:55,690 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-09 20:35:55,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:35:55,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:35:55,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-09 20:35:55,708 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-09 20:35:55,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 20:35:55,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:35:55,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:35:55,722 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-09 20:35:55,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-09 20:35:55,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-09 20:35:55,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 20:35:55,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:35:55,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:35:55,748 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-09 20:35:55,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-04-09 20:36:02,288 WARN L148 SmtUtils]: Spent 2011ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-09 20:36:13,280 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 53 treesize of output 45 [2018-04-09 20:36:13,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-04-09 20:36:13,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:36:13,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:36:13,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-04-09 20:36:13,301 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-09 20:36:13,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:36:13,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:36:13,336 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:75, output treesize:51 [2018-04-09 20:36:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:36:13,525 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:36:23,270 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-09 20:36:23,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:36:23,289 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 79 [2018-04-09 20:36:23,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 20:36:23,330 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:36:23,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 [2018-04-09 20:36:23,404 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:36:23,404 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:36:23,407 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:36:23,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-09 20:36:23,408 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 20:36:23,430 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 39 treesize of output 35 [2018-04-09 20:36:23,430 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:36:23,450 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:36:23,458 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 62 [2018-04-09 20:36:23,459 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-09 20:36:23,481 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:36:23,484 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 49 [2018-04-09 20:36:23,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-04-09 20:36:23,508 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 20:36:23,516 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:36:23,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2018-04-09 20:36:23,518 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 20:36:23,524 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:36:23,545 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 20:36:23,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:36:23,575 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:154, output treesize:24 [2018-04-09 20:36:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:36:23,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:36:23,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 59 [2018-04-09 20:36:23,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-09 20:36:23,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-09 20:36:23,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3308, Unknown=8, NotChecked=0, Total=3540 [2018-04-09 20:36:23,980 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 60 states. [2018-04-09 20:36:26,537 WARN L148 SmtUtils]: Spent 2027ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-09 20:36:31,513 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 83 DAG size of output 73 [2018-04-09 20:37:00,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:37:00,497 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2018-04-09 20:37:00,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-09 20:37:00,498 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 89 [2018-04-09 20:37:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:37:00,499 INFO L225 Difference]: With dead ends: 194 [2018-04-09 20:37:00,499 INFO L226 Difference]: Without dead ends: 193 [2018-04-09 20:37:00,501 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2241 ImplicationChecksByTransitivity, 39.2s TimeCoverageRelationStatistics Valid=792, Invalid=9298, Unknown=10, NotChecked=0, Total=10100 [2018-04-09 20:37:00,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-09 20:37:00,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 141. [2018-04-09 20:37:00,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-09 20:37:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-04-09 20:37:00,516 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 89 [2018-04-09 20:37:00,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:37:00,516 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-04-09 20:37:00,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-09 20:37:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-04-09 20:37:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-09 20:37:00,517 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:37:00,517 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:37:00,517 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:37:00,517 INFO L82 PathProgramCache]: Analyzing trace with hash 786129802, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:37:00,523 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:37:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:37:00,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:37:00,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:37:00,657 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:37:00,777 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 20:37:00,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:37:00,781 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-09 20:37:00,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:37:00,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:37:00,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:5 [2018-04-09 20:37:00,816 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-04-09 20:37:00,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-09 20:37:00,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:37:00,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:19 [2018-04-09 20:37:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:37:00,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:37:00,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-04-09 20:37:00,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-09 20:37:00,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-09 20:37:00,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2018-04-09 20:37:00,936 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 26 states. [2018-04-09 20:37:01,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:37:01,388 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2018-04-09 20:37:01,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-09 20:37:01,388 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 92 [2018-04-09 20:37:01,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:37:01,389 INFO L225 Difference]: With dead ends: 168 [2018-04-09 20:37:01,389 INFO L226 Difference]: Without dead ends: 167 [2018-04-09 20:37:01,390 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=1167, Unknown=0, NotChecked=0, Total=1332 [2018-04-09 20:37:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-09 20:37:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 144. [2018-04-09 20:37:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-09 20:37:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2018-04-09 20:37:01,406 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 92 [2018-04-09 20:37:01,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:37:01,406 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2018-04-09 20:37:01,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-09 20:37:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2018-04-09 20:37:01,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-04-09 20:37:01,407 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:37:01,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 20:37:01,407 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:37:01,407 INFO L82 PathProgramCache]: Analyzing trace with hash 782901072, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:37:01,415 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:37:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:37:01,448 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:37:01,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:37:01,584 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:37:01,783 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 20:37:01,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:37:01,789 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-09 20:37:01,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:37:01,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:37:01,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:5 [2018-04-09 20:37:01,856 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-04-09 20:37:01,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-09 20:37:01,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:37:01,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:19 [2018-04-09 20:37:02,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:37:02,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:37:02,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-04-09 20:37:02,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-09 20:37:02,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-09 20:37:02,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2018-04-09 20:37:02,079 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 30 states. [2018-04-09 20:37:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:37:02,742 INFO L93 Difference]: Finished difference Result 199 states and 213 transitions. [2018-04-09 20:37:02,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-09 20:37:02,742 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 100 [2018-04-09 20:37:02,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:37:02,743 INFO L225 Difference]: With dead ends: 199 [2018-04-09 20:37:02,744 INFO L226 Difference]: Without dead ends: 198 [2018-04-09 20:37:02,744 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=238, Invalid=1924, Unknown=0, NotChecked=0, Total=2162 [2018-04-09 20:37:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-09 20:37:02,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 145. [2018-04-09 20:37:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-09 20:37:02,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2018-04-09 20:37:02,759 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 100 [2018-04-09 20:37:02,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:37:02,759 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2018-04-09 20:37:02,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-09 20:37:02,759 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2018-04-09 20:37:02,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-04-09 20:37:02,760 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:37:02,760 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:37:02,760 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr8RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr9RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr4RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr6RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr7RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrncmpErr5RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr2RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr1RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrstrErr3RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr0RequiresViolation, __U_MULTI_fopenbsd_cstrstr_alloca_true_valid_memsafety_true_termination_i__cstrlenErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-09 20:37:02,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1946079834, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:37:02,766 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:37:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:37:02,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:37:02,801 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-09 20:37:02,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 20:37:02,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:37:02,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:37:02,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:37:02,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-04-09 20:37:05,519 WARN L148 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 19 [2018-04-09 20:37:09,594 WARN L151 SmtUtils]: Spent 4008ms on a formula simplification. DAG size of input: 25 DAG size of output 17 [2018-04-09 20:37:11,678 WARN L148 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 17 [2018-04-09 20:37:13,755 WARN L148 SmtUtils]: Spent 2007ms on a formula simplification that was a NOOP. DAG size: 17 [2018-04-09 20:37:15,834 WARN L148 SmtUtils]: Spent 2008ms on a formula simplification that was a NOOP. DAG size: 17 [2018-04-09 20:37:17,909 WARN L148 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 15 [2018-04-09 20:37:19,938 WARN L148 SmtUtils]: Spent 2005ms on a formula simplification that was a NOOP. DAG size: 21 [2018-04-09 20:37:21,963 WARN L148 SmtUtils]: Spent 2004ms on a formula simplification that was a NOOP. DAG size: 21 [2018-04-09 20:37:22,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-04-09 20:37:22,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 3 [2018-04-09 20:37:22,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:37:22,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:37:22,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:37:22,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:36, output treesize:3 [2018-04-09 20:37:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:37:22,369 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:37:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:37:41,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:37:41,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2018-04-09 20:37:41,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-09 20:37:41,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-09 20:37:41,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1572, Unknown=9, NotChecked=0, Total=1722 [2018-04-09 20:37:41,849 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand 42 states. [2018-04-09 20:37:45,197 WARN L148 SmtUtils]: Spent 2010ms on a formula simplification that was a NOOP. DAG size: 29 [2018-04-09 20:37:47,290 WARN L148 SmtUtils]: Spent 2010ms on a formula simplification that was a NOOP. DAG size: 27 [2018-04-09 20:37:49,634 WARN L148 SmtUtils]: Spent 2032ms on a formula simplification that was a NOOP. DAG size: 25 [2018-04-09 20:37:54,031 WARN L148 SmtUtils]: Spent 4008ms on a formula simplification that was a NOOP. DAG size: 26 Received shutdown request... [2018-04-09 20:38:00,332 WARN L148 SmtUtils]: Spent 6016ms on a formula simplification that was a NOOP. DAG size: 35 [2018-04-09 20:38:00,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-09 20:38:00,334 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 20:38:00,338 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 20:38:00,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 08:38:00 BoogieIcfgContainer [2018-04-09 20:38:00,339 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 20:38:00,340 INFO L168 Benchmark]: Toolchain (without parser) took 273014.30 ms. Allocated memory was 304.1 MB in the beginning and 557.8 MB in the end (delta: 253.8 MB). Free memory was 241.4 MB in the beginning and 430.0 MB in the end (delta: -188.5 MB). Peak memory consumption was 65.2 MB. Max. memory is 5.3 GB. [2018-04-09 20:38:00,341 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.1 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 20:38:00,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.48 ms. Allocated memory is still 304.1 MB. Free memory was 241.4 MB in the beginning and 216.3 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-09 20:38:00,341 INFO L168 Benchmark]: Boogie Preprocessor took 60.49 ms. Allocated memory is still 304.1 MB. Free memory was 216.3 MB in the beginning and 213.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-09 20:38:00,341 INFO L168 Benchmark]: RCFGBuilder took 645.72 ms. Allocated memory was 304.1 MB in the beginning and 464.0 MB in the end (delta: 159.9 MB). Free memory was 213.3 MB in the beginning and 386.6 MB in the end (delta: -173.3 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-04-09 20:38:00,341 INFO L168 Benchmark]: TraceAbstraction took 271975.84 ms. Allocated memory was 464.0 MB in the beginning and 557.8 MB in the end (delta: 93.8 MB). Free memory was 386.6 MB in the beginning and 430.0 MB in the end (delta: -43.3 MB). Peak memory consumption was 50.5 MB. Max. memory is 5.3 GB. [2018-04-09 20:38:00,343 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 304.1 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 327.48 ms. Allocated memory is still 304.1 MB. Free memory was 241.4 MB in the beginning and 216.3 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 60.49 ms. Allocated memory is still 304.1 MB. Free memory was 216.3 MB in the beginning and 213.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 645.72 ms. Allocated memory was 304.1 MB in the beginning and 464.0 MB in the end (delta: 159.9 MB). Free memory was 213.3 MB in the beginning and 386.6 MB in the end (delta: -173.3 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 271975.84 ms. Allocated memory was 464.0 MB in the beginning and 557.8 MB in the end (delta: 93.8 MB). Free memory was 386.6 MB in the beginning and 430.0 MB in the end (delta: -43.3 MB). Peak memory consumption was 50.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 590]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (145states) and interpolant automaton (currently 19 states, 42 states before enhancement), while ReachableStatesComputation was computing reachable states (105 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 160 locations, 21 error locations. TIMEOUT Result, 271.9s OverallTime, 31 OverallIterations, 3 TraceHistogramMax, 146.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3893 SDtfs, 6856 SDslu, 31101 SDs, 0 SdLazy, 14886 SolverSat, 671 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 46.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3794 GetRequests, 2942 SyntacticMatches, 36 SemanticMatches, 816 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 6316 ImplicationChecksByTransitivity, 217.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237occurred in iteration=10, 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.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 713 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 123.3s InterpolantComputationTime, 1762 NumberOfCodeBlocks, 1762 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 3462 ConstructedInterpolants, 731 QuantifiedInterpolants, 2547530 SizeOfPredicates, 420 NumberOfNonLiveVariables, 5366 ConjunctsInSsa, 892 ConjunctsInUnsatCore, 62 InterpolantComputations, 46 PerfectInterpolantSequences, 43/164 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_20-38-00-349.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_20-38-00-349.csv Completed graceful shutdown