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_cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-35b68b2 [2018-04-06 19:29:38,502 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-06 19:29:38,504 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-06 19:29:38,518 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-06 19:29:38,518 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-06 19:29:38,519 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-06 19:29:38,519 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-06 19:29:38,521 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-06 19:29:38,524 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-06 19:29:38,525 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-06 19:29:38,526 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-06 19:29:38,526 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-06 19:29:38,527 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-06 19:29:38,528 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-06 19:29:38,529 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-06 19:29:38,532 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-06 19:29:38,534 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-06 19:29:38,535 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-06 19:29:38,537 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-06 19:29:38,538 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-06 19:29:38,541 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-06 19:29:38,541 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-06 19:29:38,541 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-06 19:29:38,542 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-06 19:29:38,543 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-06 19:29:38,545 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-06 19:29:38,545 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-06 19:29:38,546 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-06 19:29:38,547 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-06 19:29:38,547 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-06 19:29:38,548 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-06 19:29:38,548 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-06 19:29:38,573 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-06 19:29:38,573 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-06 19:29:38,573 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-06 19:29:38,573 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-06 19:29:38,574 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-06 19:29:38,574 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-06 19:29:38,574 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-06 19:29:38,574 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-06 19:29:38,574 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-06 19:29:38,574 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-06 19:29:38,575 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-06 19:29:38,575 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-06 19:29:38,575 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-06 19:29:38,575 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-06 19:29:38,575 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-06 19:29:38,575 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-06 19:29:38,576 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-06 19:29:38,576 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-06 19:29:38,576 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-06 19:29:38,576 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-06 19:29:38,576 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-06 19:29:38,576 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-06 19:29:38,577 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-06 19:29:38,577 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-06 19:29:38,577 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-06 19:29:38,577 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-06 19:29:38,577 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 19:29:38,578 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-06 19:29:38,578 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-06 19:29:38,578 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-06 19:29:38,578 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-06 19:29:38,578 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-06 19:29:38,578 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:29:38,578 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-06 19:29:38,579 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-06 19:29:38,579 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-06 19:29:38,580 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-06 19:29:38,580 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-06 19:29:38,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-06 19:29:38,623 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-06 19:29:38,626 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-06 19:29:38,627 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-06 19:29:38,627 INFO L276 PluginConnector]: CDTParser initialized [2018-04-06 19:29:38,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:38,988 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG0d4d981cf [2018-04-06 19:29:39,174 INFO L287 CDTParser]: IsIndexed: true [2018-04-06 19:29:39,174 INFO L288 CDTParser]: Found 1 translation units. [2018-04-06 19:29:39,175 INFO L168 CDTParser]: Scanning openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,187 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-06 19:29:39,187 INFO L215 ultiparseSymbolTable]: [2018-04-06 19:29:39,187 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-06 19:29:39,188 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcat ('cstrcat') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,188 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,188 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,188 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,188 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-06 19:29:39,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,188 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,189 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,190 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,191 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,192 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,193 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:39,222 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG0d4d981cf [2018-04-06 19:29:39,226 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-06 19:29:39,228 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-06 19:29:39,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-06 19:29:39,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-06 19:29:39,235 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-06 19:29:39,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 07:29:39" (1/1) ... [2018-04-06 19:29:39,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2b053e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:29:39, skipping insertion in model container [2018-04-06 19:29:39,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 07:29:39" (1/1) ... [2018-04-06 19:29:39,253 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 19:29:39,283 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 19:29:39,456 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 19:29:39,502 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 19:29:39,509 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-06 19:29:39,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:29:39 WrapperNode [2018-04-06 19:29:39,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-06 19:29:39,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-06 19:29:39,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-06 19:29:39,563 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-06 19:29:39,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:29:39" (1/1) ... [2018-04-06 19:29:39,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:29:39" (1/1) ... [2018-04-06 19:29:39,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:29:39" (1/1) ... [2018-04-06 19:29:39,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:29:39" (1/1) ... [2018-04-06 19:29:39,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:29:39" (1/1) ... [2018-04-06 19:29:39,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:29:39" (1/1) ... [2018-04-06 19:29:39,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:29:39" (1/1) ... [2018-04-06 19:29:39,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-06 19:29:39,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-06 19:29:39,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-06 19:29:39,622 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-06 19:29:39,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:29:39" (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-06 19:29:39,755 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-06 19:29:39,755 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-06 19:29:39,755 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-06 19:29:39,755 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-06 19:29:39,755 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcat [2018-04-06 19:29:39,755 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-06 19:29:39,755 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-06 19:29:39,755 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-06 19:29:39,756 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-06 19:29:39,756 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-06 19:29:39,756 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-06 19:29:39,756 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-06 19:29:39,756 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-06 19:29:39,756 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-06 19:29:39,756 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-06 19:29:39,756 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-06 19:29:39,756 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-06 19:29:39,756 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-06 19:29:39,757 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-06 19:29:39,757 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-06 19:29:39,757 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-06 19:29:39,757 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-06 19:29:39,757 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-06 19:29:39,757 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-06 19:29:39,757 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-06 19:29:39,757 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-06 19:29:39,757 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-06 19:29:39,757 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-06 19:29:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-06 19:29:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-06 19:29:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-06 19:29:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-06 19:29:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-06 19:29:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-06 19:29:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-06 19:29:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-06 19:29:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-06 19:29:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-06 19:29:39,758 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-06 19:29:39,759 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-06 19:29:39,759 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-06 19:29:39,759 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-06 19:29:39,759 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-06 19:29:39,759 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-06 19:29:39,759 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-06 19:29:39,759 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-06 19:29:39,760 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-06 19:29:39,760 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-06 19:29:39,760 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-06 19:29:39,760 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-06 19:29:39,760 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-06 19:29:39,760 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-06 19:29:39,760 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-06 19:29:39,760 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-06 19:29:39,761 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-06 19:29:39,761 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-06 19:29:39,761 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-06 19:29:39,761 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-06 19:29:39,761 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-06 19:29:39,761 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-06 19:29:39,761 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-06 19:29:39,761 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-06 19:29:39,762 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-06 19:29:39,762 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-06 19:29:39,762 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-06 19:29:39,762 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-06 19:29:39,762 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-06 19:29:39,762 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-06 19:29:39,762 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-06 19:29:39,762 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-06 19:29:39,763 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-06 19:29:39,763 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-06 19:29:39,763 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-06 19:29:39,763 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-06 19:29:39,763 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-06 19:29:39,763 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-06 19:29:39,763 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-06 19:29:39,763 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-06 19:29:39,764 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-06 19:29:39,764 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-06 19:29:39,764 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-06 19:29:39,764 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-06 19:29:39,764 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-06 19:29:39,764 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-06 19:29:39,764 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-06 19:29:39,764 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-06 19:29:39,765 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-06 19:29:39,765 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-06 19:29:39,765 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-06 19:29:39,765 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-06 19:29:39,765 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-06 19:29:39,765 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-06 19:29:39,765 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-06 19:29:39,766 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-06 19:29:39,766 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-06 19:29:39,766 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-06 19:29:39,766 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-06 19:29:39,766 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-06 19:29:39,766 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-06 19:29:39,766 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-06 19:29:39,766 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-06 19:29:39,767 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-06 19:29:39,767 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-06 19:29:39,767 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-06 19:29:39,767 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-06 19:29:39,767 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-06 19:29:39,767 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-06 19:29:39,767 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-06 19:29:39,767 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-06 19:29:39,768 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcat [2018-04-06 19:29:39,768 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-06 19:29:39,768 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-06 19:29:39,768 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-06 19:29:39,768 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-06 19:29:39,768 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-06 19:29:39,768 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-06 19:29:39,768 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-06 19:29:39,769 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-06 19:29:40,131 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-06 19:29:40,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 07:29:40 BoogieIcfgContainer [2018-04-06 19:29:40,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-06 19:29:40,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-06 19:29:40,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-06 19:29:40,135 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-06 19:29:40,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 07:29:39" (1/3) ... [2018-04-06 19:29:40,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab1da2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 07:29:40, skipping insertion in model container [2018-04-06 19:29:40,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:29:39" (2/3) ... [2018-04-06 19:29:40,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab1da2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 07:29:40, skipping insertion in model container [2018-04-06 19:29:40,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 07:29:40" (3/3) ... [2018-04-06 19:29:40,137 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:29:40,144 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-06 19:29:40,150 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-04-06 19:29:40,194 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-06 19:29:40,194 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-06 19:29:40,194 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-06 19:29:40,194 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-06 19:29:40,194 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-06 19:29:40,195 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-06 19:29:40,195 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-06 19:29:40,195 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-06 19:29:40,195 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-06 19:29:40,195 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-06 19:29:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-04-06 19:29:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-06 19:29:40,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:40,219 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:29:40,219 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:40,223 INFO L82 PathProgramCache]: Analyzing trace with hash 703701311, 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-06 19:29:40,235 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:40,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:40,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:29:40,306 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:40,316 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-06 19:29:40,339 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:40,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-06 19:29:40,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-06 19:29:40,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-06 19:29:40,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-06 19:29:40,352 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states. [2018-04-06 19:29:40,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:40,426 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-04-06 19:29:40,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-06 19:29:40,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-04-06 19:29:40,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:40,438 INFO L225 Difference]: With dead ends: 112 [2018-04-06 19:29:40,439 INFO L226 Difference]: Without dead ends: 75 [2018-04-06 19:29:40,442 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-06 19:29:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-06 19:29:40,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-06 19:29:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-06 19:29:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-04-06 19:29:40,477 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 21 [2018-04-06 19:29:40,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:40,478 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-04-06 19:29:40,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-06 19:29:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-04-06 19:29:40,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-06 19:29:40,479 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:40,479 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:29:40,479 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:40,479 INFO L82 PathProgramCache]: Analyzing trace with hash 289022876, 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-06 19:29:40,494 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:40,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:40,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:29:40,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:40,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:40,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 19:29:40,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-06 19:29:40,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:40,604 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-06 19:29:40,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-06 19:29:40,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-06 19:29:40,615 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:40,628 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-06 19:29:40,649 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:40,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 19:29:40,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 19:29:40,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 19:29:40,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 19:29:40,651 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 4 states. [2018-04-06 19:29:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:40,707 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-04-06 19:29:40,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 19:29:40,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-04-06 19:29:40,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:40,709 INFO L225 Difference]: With dead ends: 75 [2018-04-06 19:29:40,710 INFO L226 Difference]: Without dead ends: 74 [2018-04-06 19:29:40,711 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 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-06 19:29:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-04-06 19:29:40,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-04-06 19:29:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-06 19:29:40,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-04-06 19:29:40,720 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2018-04-06 19:29:40,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:40,721 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-04-06 19:29:40,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 19:29:40,721 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-04-06 19:29:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-06 19:29:40,722 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:40,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] [2018-04-06 19:29:40,723 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:40,723 INFO L82 PathProgramCache]: Analyzing trace with hash 289022877, 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-06 19:29:40,729 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:40,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:40,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:29:40,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:40,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:29:40,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:40,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:40,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-06 19:29:40,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:40,848 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-06 19:29:40,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:40,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:40,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:40,866 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-06 19:29:40,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:40,874 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-06 19:29:40,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-06 19:29:40,941 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-06 19:29:40,941 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:41,072 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:41,073 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-04-06 19:29:41,087 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-06 19:29:41,114 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:41,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-06 19:29:41,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-06 19:29:41,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-06 19:29:41,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-06 19:29:41,115 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 9 states. [2018-04-06 19:29:41,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:41,256 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-04-06 19:29:41,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 19:29:41,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-04-06 19:29:41,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:41,257 INFO L225 Difference]: With dead ends: 74 [2018-04-06 19:29:41,257 INFO L226 Difference]: Without dead ends: 73 [2018-04-06 19:29:41,258 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-06 19:29:41,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-06 19:29:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-04-06 19:29:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-06 19:29:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-04-06 19:29:41,263 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 24 [2018-04-06 19:29:41,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:41,264 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-04-06 19:29:41,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-06 19:29:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-04-06 19:29:41,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-06 19:29:41,265 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:41,265 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:29:41,265 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:41,265 INFO L82 PathProgramCache]: Analyzing trace with hash 369774579, 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-06 19:29:41,276 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:41,297 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:41,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:29:41,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:41,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:41,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 19:29:41,343 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-06 19:29:41,343 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:41,349 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-06 19:29:41,383 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:41,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 19:29:41,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 19:29:41,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 19:29:41,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 19:29:41,385 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2018-04-06 19:29:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:41,462 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-04-06 19:29:41,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 19:29:41,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-06 19:29:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:41,463 INFO L225 Difference]: With dead ends: 73 [2018-04-06 19:29:41,463 INFO L226 Difference]: Without dead ends: 72 [2018-04-06 19:29:41,463 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-06 19:29:41,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-06 19:29:41,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-04-06 19:29:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-06 19:29:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-04-06 19:29:41,468 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 25 [2018-04-06 19:29:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:41,469 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-04-06 19:29:41,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 19:29:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-04-06 19:29:41,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-06 19:29:41,469 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:41,469 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:29:41,470 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:41,470 INFO L82 PathProgramCache]: Analyzing trace with hash 369774580, 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-06 19:29:41,475 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:41,490 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:41,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:29:41,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:41,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:41,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-04-06 19:29:41,538 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-06 19:29:41,538 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:41,575 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-06 19:29:41,599 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:41,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-04-06 19:29:41,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-06 19:29:41,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-06 19:29:41,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-06 19:29:41,600 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 8 states. [2018-04-06 19:29:41,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:41,679 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-04-06 19:29:41,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-06 19:29:41,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-06 19:29:41,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:41,680 INFO L225 Difference]: With dead ends: 72 [2018-04-06 19:29:41,680 INFO L226 Difference]: Without dead ends: 71 [2018-04-06 19:29:41,681 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-06 19:29:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-06 19:29:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-04-06 19:29:41,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-06 19:29:41,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-04-06 19:29:41,685 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 25 [2018-04-06 19:29:41,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:41,685 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-04-06 19:29:41,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-06 19:29:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-04-06 19:29:41,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-06 19:29:41,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:41,687 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] [2018-04-06 19:29:41,687 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:41,687 INFO L82 PathProgramCache]: Analyzing trace with hash -941306668, 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-06 19:29:41,693 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:41,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:41,734 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-06 19:29:41,734 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:41,740 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-06 19:29:41,762 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:41,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-06 19:29:41,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-06 19:29:41,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-06 19:29:41,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-06 19:29:41,763 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2018-04-06 19:29:41,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:41,815 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-04-06 19:29:41,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 19:29:41,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-06 19:29:41,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:41,816 INFO L225 Difference]: With dead ends: 74 [2018-04-06 19:29:41,817 INFO L226 Difference]: Without dead ends: 73 [2018-04-06 19:29:41,817 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-06 19:29:41,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-06 19:29:41,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2018-04-06 19:29:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-06 19:29:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-04-06 19:29:41,824 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 31 [2018-04-06 19:29:41,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:41,825 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-04-06 19:29:41,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-06 19:29:41,825 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-04-06 19:29:41,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-06 19:29:41,826 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:41,826 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] [2018-04-06 19:29:41,826 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:41,827 INFO L82 PathProgramCache]: Analyzing trace with hash -941306667, 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-06 19:29:41,834 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:41,854 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:41,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:29:41,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:41,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:41,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-06 19:29:41,952 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-06 19:29:41,952 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:42,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-06 19:29:42,035 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:42,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2018-04-06 19:29:42,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:29:42,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:29:42,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-06 19:29:42,036 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 12 states. [2018-04-06 19:29:42,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:42,208 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-04-06 19:29:42,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-06 19:29:42,208 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-04-06 19:29:42,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:42,209 INFO L225 Difference]: With dead ends: 87 [2018-04-06 19:29:42,209 INFO L226 Difference]: Without dead ends: 86 [2018-04-06 19:29:42,210 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-04-06 19:29:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-06 19:29:42,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2018-04-06 19:29:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-06 19:29:42,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-04-06 19:29:42,218 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 31 [2018-04-06 19:29:42,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:42,218 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-04-06 19:29:42,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:29:42,219 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-04-06 19:29:42,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-06 19:29:42,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:42,219 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-06 19:29:42,220 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:42,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1776158873, 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-06 19:29:42,228 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:42,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:42,288 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-06 19:29:42,288 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:42,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-06 19:29:42,314 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:42,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-06 19:29:42,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 19:29:42,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 19:29:42,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-06 19:29:42,315 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2018-04-06 19:29:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:42,363 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-04-06 19:29:42,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 19:29:42,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-04-06 19:29:42,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:42,364 INFO L225 Difference]: With dead ends: 79 [2018-04-06 19:29:42,364 INFO L226 Difference]: Without dead ends: 78 [2018-04-06 19:29:42,365 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 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-06 19:29:42,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-06 19:29:42,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-04-06 19:29:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-06 19:29:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-04-06 19:29:42,370 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-04-06 19:29:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:42,370 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-04-06 19:29:42,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 19:29:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-04-06 19:29:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-06 19:29:42,371 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:42,371 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-06 19:29:42,371 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:42,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1776158874, 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-06 19:29:42,377 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:42,404 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:42,470 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-06 19:29:42,471 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:42,482 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-06 19:29:42,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:42,490 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-06 19:29:42,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:42,493 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-06 19:29:42,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-06 19:29:42,512 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-06 19:29:42,533 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:42,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-06 19:29:42,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-06 19:29:42,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-06 19:29:42,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-06 19:29:42,534 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 9 states. [2018-04-06 19:29:42,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:42,641 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-04-06 19:29:42,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:29:42,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-04-06 19:29:42,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:42,642 INFO L225 Difference]: With dead ends: 85 [2018-04-06 19:29:42,643 INFO L226 Difference]: Without dead ends: 84 [2018-04-06 19:29:42,643 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-04-06 19:29:42,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-06 19:29:42,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-04-06 19:29:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-06 19:29:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-04-06 19:29:42,649 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 39 [2018-04-06 19:29:42,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:42,649 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-04-06 19:29:42,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-06 19:29:42,649 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-04-06 19:29:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-06 19:29:42,650 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:42,650 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] [2018-04-06 19:29:42,650 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:42,650 INFO L82 PathProgramCache]: Analyzing trace with hash -773649723, 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-06 19:29:42,656 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:42,676 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:42,710 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-06 19:29:42,710 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:42,727 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-06 19:29:42,747 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:42,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-06 19:29:42,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 19:29:42,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 19:29:42,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-06 19:29:42,748 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 6 states. [2018-04-06 19:29:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:42,810 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-04-06 19:29:42,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 19:29:42,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-04-06 19:29:42,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:42,811 INFO L225 Difference]: With dead ends: 84 [2018-04-06 19:29:42,811 INFO L226 Difference]: Without dead ends: 83 [2018-04-06 19:29:42,812 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 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-06 19:29:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-06 19:29:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-06 19:29:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-06 19:29:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-04-06 19:29:42,816 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 40 [2018-04-06 19:29:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:42,817 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-04-06 19:29:42,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 19:29:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-04-06 19:29:42,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-06 19:29:42,818 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:42,818 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] [2018-04-06 19:29:42,818 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:42,818 INFO L82 PathProgramCache]: Analyzing trace with hash -773649722, 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-06 19:29:42,826 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:42,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:42,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:29:42,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:42,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:42,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-06 19:29:42,938 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-06 19:29:42,938 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:43,098 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-06 19:29:43,119 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:43,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2018-04-06 19:29:43,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-06 19:29:43,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-06 19:29:43,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-04-06 19:29:43,120 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 16 states. [2018-04-06 19:29:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:43,415 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-04-06 19:29:43,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-06 19:29:43,415 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-04-06 19:29:43,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:43,417 INFO L225 Difference]: With dead ends: 110 [2018-04-06 19:29:43,418 INFO L226 Difference]: Without dead ends: 109 [2018-04-06 19:29:43,418 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2018-04-06 19:29:43,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-06 19:29:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2018-04-06 19:29:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-06 19:29:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-04-06 19:29:43,424 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 40 [2018-04-06 19:29:43,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:43,424 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-04-06 19:29:43,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-06 19:29:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-04-06 19:29:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-06 19:29:43,425 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:43,425 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-06 19:29:43,425 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:43,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1625754133, 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-06 19:29:43,432 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:43,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:43,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:29:43,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:43,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:43,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-06 19:29:43,532 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-06 19:29:43,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 19:29:43,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:43,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:43,552 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-06 19:29:43,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-06 19:29:43,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-06 19:29:43,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-04-06 19:29:43,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:29:43,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:29:43,638 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-06 19:29:43,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35 [2018-04-06 19:29:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:29:43,715 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:43,867 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-06 19:29:43,901 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-06 19:29:43,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:43,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:43,910 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-06 19:29:43,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:38 [2018-04-06 19:29:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:29:44,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:29:44,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-04-06 19:29:44,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-06 19:29:44,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-06 19:29:44,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-04-06 19:29:44,125 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 25 states. [2018-04-06 19:29:45,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:45,033 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-04-06 19:29:45,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-06 19:29:45,034 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 45 [2018-04-06 19:29:45,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:45,034 INFO L225 Difference]: With dead ends: 124 [2018-04-06 19:29:45,034 INFO L226 Difference]: Without dead ends: 123 [2018-04-06 19:29:45,035 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=233, Invalid=1407, Unknown=0, NotChecked=0, Total=1640 [2018-04-06 19:29:45,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-06 19:29:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2018-04-06 19:29:45,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-06 19:29:45,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-04-06 19:29:45,044 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 45 [2018-04-06 19:29:45,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:45,044 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-04-06 19:29:45,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-06 19:29:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-04-06 19:29:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-06 19:29:45,046 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:45,046 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:29:45,046 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:45,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1969495212, 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-06 19:29:45,057 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:45,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:45,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:29:45,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:45,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:45,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 19:29:45,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:45,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:45,115 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-06 19:29:45,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:45,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:45,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-06 19:29:45,133 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-06 19:29:45,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 19:29:45,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:45,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:45,142 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-06 19:29:45,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-06 19:29:45,156 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-06 19:29:45,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 19:29:45,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:45,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:45,170 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-06 19:29:45,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-06 19:29:45,344 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-06 19:29:45,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-06 19:29:45,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:29:45,367 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-06 19:29:45,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:45,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:29:45,387 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-06 19:29:45,387 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-04-06 19:29:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:29:45,456 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:45,717 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-06 19:29:45,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:45,725 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-06 19:29:45,734 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-06 19:29:45,734 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:45,735 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:45,740 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-06 19:29:45,741 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-04-06 19:29:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:29:45,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:29:45,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-04-06 19:29:45,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-06 19:29:45,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-06 19:29:45,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-04-06 19:29:45,798 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 25 states. [2018-04-06 19:29:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:46,512 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-04-06 19:29:46,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-06 19:29:46,512 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-04-06 19:29:46,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:46,513 INFO L225 Difference]: With dead ends: 133 [2018-04-06 19:29:46,513 INFO L226 Difference]: Without dead ends: 132 [2018-04-06 19:29:46,513 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=1421, Unknown=0, NotChecked=0, Total=1640 [2018-04-06 19:29:46,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-06 19:29:46,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2018-04-06 19:29:46,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-06 19:29:46,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-04-06 19:29:46,520 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 50 [2018-04-06 19:29:46,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:46,520 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-04-06 19:29:46,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-06 19:29:46,520 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-04-06 19:29:46,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-06 19:29:46,521 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:46,522 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:29:46,522 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:46,522 INFO L82 PathProgramCache]: Analyzing trace with hash 4657691, now seen corresponding path program 2 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-06 19:29:46,528 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:46,547 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:46,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:29:46,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:46,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:46,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-06 19:29:46,582 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-06 19:29:46,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:29:46,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:46,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:46,592 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-06 19:29:46,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-06 19:29:46,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-06 19:29:46,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:46,728 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-06 19:29:46,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:29:46,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:29:46,752 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-06 19:29:46,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2018-04-06 19:29:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:29:46,843 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:47,137 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 29 treesize of output 25 [2018-04-06 19:29:47,152 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:29:47,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-06 19:29:47,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:47,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:47,163 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-06 19:29:47,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:54 [2018-04-06 19:29:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:29:47,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:29:47,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-04-06 19:29:47,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-06 19:29:47,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-06 19:29:47,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2018-04-06 19:29:47,339 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 31 states. [2018-04-06 19:29:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:49,166 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-04-06 19:29:49,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-06 19:29:49,167 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 52 [2018-04-06 19:29:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:49,168 INFO L225 Difference]: With dead ends: 152 [2018-04-06 19:29:49,168 INFO L226 Difference]: Without dead ends: 151 [2018-04-06 19:29:49,168 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=364, Invalid=2392, Unknown=0, NotChecked=0, Total=2756 [2018-04-06 19:29:49,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-06 19:29:49,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 134. [2018-04-06 19:29:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-06 19:29:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-04-06 19:29:49,177 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 52 [2018-04-06 19:29:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:49,177 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-04-06 19:29:49,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-06 19:29:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-04-06 19:29:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-06 19:29:49,178 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:49,179 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] [2018-04-06 19:29:49,179 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:49,179 INFO L82 PathProgramCache]: Analyzing trace with hash -953565311, 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-06 19:29:49,184 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:49,204 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:49,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:49,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-06 19:29:49,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-06 19:29:49,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:49,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:49,240 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-06 19:29:49,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:29:49,282 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-06 19:29:49,288 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-06 19:29:49,297 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-06 19:29:49,297 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:49,315 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_16| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_16|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_16| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_16| 0) |c_old(#valid)|))) is different from false [2018-04-06 19:29:49,318 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_15| Int) (|v_main_#t~malloc11.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_15| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_16|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_16| 1) |v_main_#t~malloc10.base_15| 0) |v_main_#t~malloc11.base_16| 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_15|) 0))))) is different from false [2018-04-06 19:29:49,359 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-06 19:29:49,392 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:49,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:29:49,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:29:49,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:29:49,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:29:49,393 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 12 states. [2018-04-06 19:29:49,406 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_15| Int) (|v_main_#t~malloc11.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_15| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_16|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_16| 1) |v_main_#t~malloc10.base_15| 0) |v_main_#t~malloc11.base_16| 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_15|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-06 19:29:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:49,851 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions. [2018-04-06 19:29:49,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:29:49,851 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-04-06 19:29:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:49,854 INFO L225 Difference]: With dead ends: 249 [2018-04-06 19:29:49,854 INFO L226 Difference]: Without dead ends: 235 [2018-04-06 19:29:49,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 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-06 19:29:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-04-06 19:29:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-04-06 19:29:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-06 19:29:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 252 transitions. [2018-04-06 19:29:49,876 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 252 transitions. Word has length 54 [2018-04-06 19:29:49,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:49,876 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 252 transitions. [2018-04-06 19:29:49,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:29:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 252 transitions. [2018-04-06 19:29:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-06 19:29:49,878 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:49,878 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] [2018-04-06 19:29:49,878 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:49,878 INFO L82 PathProgramCache]: Analyzing trace with hash 61705302, 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-06 19:29:49,885 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:49,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:49,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:49,937 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-06 19:29:49,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:49,941 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-06 19:29:49,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:49,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:49,951 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-06 19:29:49,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:29:49,998 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-06 19:29:50,003 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-06 19:29:50,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-06 19:29:50,014 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:50,045 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_18| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_18| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_18| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_18|))))) is different from false [2018-04-06 19:29:50,050 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_17| Int) (|v_main_#t~malloc11.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_17| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_18| 1) |v_main_#t~malloc10.base_17| 0) |v_main_#t~malloc11.base_18| 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_18|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_17|) 0))))) is different from false [2018-04-06 19:29:50,073 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-06 19:29:50,108 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:50,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:29:50,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:29:50,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:29:50,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:29:50,109 INFO L87 Difference]: Start difference. First operand 232 states and 252 transitions. Second operand 12 states. [2018-04-06 19:29:50,126 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_17| Int) (|v_main_#t~malloc11.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_17| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_18| 1) |v_main_#t~malloc10.base_17| 0) |v_main_#t~malloc11.base_18| 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_18|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_17|) 0)))))) is different from false [2018-04-06 19:29:50,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:50,460 INFO L93 Difference]: Finished difference Result 347 states and 375 transitions. [2018-04-06 19:29:50,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:29:50,460 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-06 19:29:50,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:50,462 INFO L225 Difference]: With dead ends: 347 [2018-04-06 19:29:50,463 INFO L226 Difference]: Without dead ends: 333 [2018-04-06 19:29:50,463 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 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-06 19:29:50,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-06 19:29:50,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 233. [2018-04-06 19:29:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-06 19:29:50,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 253 transitions. [2018-04-06 19:29:50,487 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 253 transitions. Word has length 55 [2018-04-06 19:29:50,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:50,488 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 253 transitions. [2018-04-06 19:29:50,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:29:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 253 transitions. [2018-04-06 19:29:50,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-06 19:29:50,489 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:50,489 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] [2018-04-06 19:29:50,489 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:50,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2135979729, 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-06 19:29:50,515 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:50,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:50,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:50,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-06 19:29:50,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-06 19:29:50,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:50,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:50,575 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-06 19:29:50,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:29:50,613 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-06 19:29:50,616 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-06 19:29:50,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:29:50,624 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:50,639 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_20| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_20| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_20|))))) is different from false [2018-04-06 19:29:50,642 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_20| Int) (|v_main_#t~malloc10.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_19| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_20|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_20| 1) |v_main_#t~malloc10.base_19| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_19|)))))) is different from false [2018-04-06 19:29:50,657 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-06 19:29:50,678 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:50,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:29:50,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:29:50,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:29:50,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:29:50,679 INFO L87 Difference]: Start difference. First operand 233 states and 253 transitions. Second operand 12 states. [2018-04-06 19:29:50,688 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc11.base_20| Int) (|v_main_#t~malloc10.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_19| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_20|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_20| 1) |v_main_#t~malloc10.base_19| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_19|))))))) is different from false [2018-04-06 19:29:50,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:50,935 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-04-06 19:29:50,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:29:50,935 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-06 19:29:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:50,937 INFO L225 Difference]: With dead ends: 348 [2018-04-06 19:29:50,937 INFO L226 Difference]: Without dead ends: 334 [2018-04-06 19:29:50,937 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 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-06 19:29:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-06 19:29:50,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 235. [2018-04-06 19:29:50,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-06 19:29:50,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions. [2018-04-06 19:29:50,959 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 55 [2018-04-06 19:29:50,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:50,959 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions. [2018-04-06 19:29:50,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:29:50,959 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions. [2018-04-06 19:29:50,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-06 19:29:50,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:50,961 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] [2018-04-06 19:29:50,961 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:50,961 INFO L82 PathProgramCache]: Analyzing trace with hash 183707505, 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-06 19:29:50,968 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:50,987 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:51,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:51,014 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-06 19:29:51,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:51,017 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-06 19:29:51,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:51,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:51,026 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-06 19:29:51,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:29:51,065 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-06 19:29:51,070 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-06 19:29:51,080 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-06 19:29:51,080 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:51,105 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_22| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_22|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_22| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|))) is different from false [2018-04-06 19:29:51,109 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_21| Int) (|v_main_#t~malloc11.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_22| 1) |v_main_#t~malloc10.base_21| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_22|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_21|) 0))))) is different from false [2018-04-06 19:29:51,133 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-06 19:29:51,169 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:51,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:29:51,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:29:51,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:29:51,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:29:51,170 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand 12 states. [2018-04-06 19:29:51,215 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_21| Int) (|v_main_#t~malloc11.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_22| 1) |v_main_#t~malloc10.base_21| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_22|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_21|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-06 19:29:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:51,578 INFO L93 Difference]: Finished difference Result 349 states and 378 transitions. [2018-04-06 19:29:51,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:29:51,611 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-06 19:29:51,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:51,613 INFO L225 Difference]: With dead ends: 349 [2018-04-06 19:29:51,613 INFO L226 Difference]: Without dead ends: 335 [2018-04-06 19:29:51,613 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 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-06 19:29:51,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-04-06 19:29:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 235. [2018-04-06 19:29:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-06 19:29:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions. [2018-04-06 19:29:51,628 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 55 [2018-04-06 19:29:51,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:51,628 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions. [2018-04-06 19:29:51,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:29:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions. [2018-04-06 19:29:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-06 19:29:51,629 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:51,629 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] [2018-04-06 19:29:51,629 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:51,629 INFO L82 PathProgramCache]: Analyzing trace with hash -750369636, 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-06 19:29:51,642 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:51,661 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:51,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:51,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-06 19:29:51,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-06 19:29:51,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:51,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:51,690 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-06 19:29:51,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:29:51,716 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-06 19:29:51,719 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-06 19:29:51,726 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-06 19:29:51,726 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:51,742 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_24| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_24| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_24|))))) is different from false [2018-04-06 19:29:51,745 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_24| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc11.base_24|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_24| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|)))) is different from false [2018-04-06 19:29:51,780 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-06 19:29:51,801 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:51,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:29:51,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:29:51,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:29:51,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:29:51,802 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand 12 states. [2018-04-06 19:29:51,814 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_24| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc11.base_24|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_24| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|)))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-06 19:29:52,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:52,129 INFO L93 Difference]: Finished difference Result 350 states and 379 transitions. [2018-04-06 19:29:52,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:29:52,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-04-06 19:29:52,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:52,131 INFO L225 Difference]: With dead ends: 350 [2018-04-06 19:29:52,131 INFO L226 Difference]: Without dead ends: 336 [2018-04-06 19:29:52,131 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 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-06 19:29:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-04-06 19:29:52,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 235. [2018-04-06 19:29:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-06 19:29:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions. [2018-04-06 19:29:52,147 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 56 [2018-04-06 19:29:52,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:52,147 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions. [2018-04-06 19:29:52,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:29:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions. [2018-04-06 19:29:52,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-06 19:29:52,148 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:52,148 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] [2018-04-06 19:29:52,148 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:52,148 INFO L82 PathProgramCache]: Analyzing trace with hash 957424230, 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-06 19:29:52,154 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:52,176 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:52,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:52,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-06 19:29:52,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-06 19:29:52,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:52,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:52,224 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-06 19:29:52,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:29:52,256 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-06 19:29:52,261 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-06 19:29:52,272 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-06 19:29:52,272 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:52,324 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_26| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_26|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_26| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_26| 0) |c_old(#valid)|))) is different from false [2018-04-06 19:29:52,329 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_25| Int) (|v_main_#t~malloc11.base_26| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_25|) 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_26|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_26| 1) |v_main_#t~malloc10.base_25| 0) |v_main_#t~malloc11.base_26| 0))))) is different from false [2018-04-06 19:29:52,352 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-06 19:29:52,387 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:52,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:29:52,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:29:52,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:29:52,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:29:52,389 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand 12 states. [2018-04-06 19:29:52,400 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_25| Int) (|v_main_#t~malloc11.base_26| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_25|) 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_26|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_26| 1) |v_main_#t~malloc10.base_25| 0) |v_main_#t~malloc11.base_26| 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-06 19:29:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:52,854 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-04-06 19:29:52,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:29:52,854 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-04-06 19:29:52,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:52,855 INFO L225 Difference]: With dead ends: 348 [2018-04-06 19:29:52,855 INFO L226 Difference]: Without dead ends: 334 [2018-04-06 19:29:52,856 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 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-06 19:29:52,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-06 19:29:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 234. [2018-04-06 19:29:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-06 19:29:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 254 transitions. [2018-04-06 19:29:52,871 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 254 transitions. Word has length 56 [2018-04-06 19:29:52,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:52,871 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 254 transitions. [2018-04-06 19:29:52,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:29:52,871 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 254 transitions. [2018-04-06 19:29:52,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-06 19:29:52,872 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:52,872 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] [2018-04-06 19:29:52,872 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:52,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1263268639, now seen corresponding path program 1 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-06 19:29:52,878 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:52,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:52,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:52,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-06 19:29:52,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-06 19:29:52,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:52,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:52,955 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-06 19:29:52,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:29:53,011 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-06 19:29:53,021 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-06 19:29:53,032 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-06 19:29:53,032 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:53,072 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_28| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_28|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_28| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_28| 0) |c_old(#valid)|))) is different from false [2018-04-06 19:29:53,077 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_27| Int) (|v_main_#t~malloc11.base_28| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_27| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_28|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_28| 1) |v_main_#t~malloc10.base_27| 0) |v_main_#t~malloc11.base_28| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc10.base_27|) 0))))) is different from false [2018-04-06 19:29:53,097 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-06 19:29:53,132 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:53,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:29:53,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:29:53,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:29:53,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:29:53,133 INFO L87 Difference]: Start difference. First operand 234 states and 254 transitions. Second operand 12 states. [2018-04-06 19:29:53,146 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_27| Int) (|v_main_#t~malloc11.base_28| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_27| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_28|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_28| 1) |v_main_#t~malloc10.base_27| 0) |v_main_#t~malloc11.base_28| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc10.base_27|) 0)))))) is different from false [2018-04-06 19:29:53,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:53,552 INFO L93 Difference]: Finished difference Result 349 states and 377 transitions. [2018-04-06 19:29:53,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:29:53,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-04-06 19:29:53,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:53,554 INFO L225 Difference]: With dead ends: 349 [2018-04-06 19:29:53,554 INFO L226 Difference]: Without dead ends: 335 [2018-04-06 19:29:53,555 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 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-06 19:29:53,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-04-06 19:29:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 234. [2018-04-06 19:29:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-06 19:29:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 254 transitions. [2018-04-06 19:29:53,579 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 254 transitions. Word has length 56 [2018-04-06 19:29:53,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:53,580 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 254 transitions. [2018-04-06 19:29:53,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:29:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 254 transitions. [2018-04-06 19:29:53,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-06 19:29:53,581 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:29:53,581 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:53,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1247113356, 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-06 19:29:53,591 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:53,619 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:53,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:53,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-06 19:29:53,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-06 19:29:53,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:53,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:53,662 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-06 19:29:53,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:29:53,691 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-06 19:29:53,695 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-06 19:29:53,706 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-06 19:29:53,706 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:53,759 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_30| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_30|))) (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc11.base_30| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_30| 0)))) is different from false [2018-04-06 19:29:53,763 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_30| Int) (|v_main_#t~malloc10.base_29| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_29| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_29|) 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_30|))) (= (store (store (store .cse0 |v_main_#t~malloc11.base_30| 1) |v_main_#t~malloc10.base_29| 0) |v_main_#t~malloc11.base_30| 0) |c_old(#valid)|)))) is different from false [2018-04-06 19:29:53,785 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-06 19:29:53,819 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:29:53,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:29:53,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:29:53,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:29:53,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:29:53,820 INFO L87 Difference]: Start difference. First operand 234 states and 254 transitions. Second operand 12 states. [2018-04-06 19:29:53,833 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc11.base_30| Int) (|v_main_#t~malloc10.base_29| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_29| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_29|) 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_30|))) (= (store (store (store .cse0 |v_main_#t~malloc11.base_30| 1) |v_main_#t~malloc10.base_29| 0) |v_main_#t~malloc11.base_30| 0) |c_old(#valid)|))))) is different from false [2018-04-06 19:29:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:54,260 INFO L93 Difference]: Finished difference Result 237 states and 254 transitions. [2018-04-06 19:29:54,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:29:54,260 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-04-06 19:29:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:54,261 INFO L225 Difference]: With dead ends: 237 [2018-04-06 19:29:54,262 INFO L226 Difference]: Without dead ends: 223 [2018-04-06 19:29:54,262 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 103 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-06 19:29:54,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-06 19:29:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 120. [2018-04-06 19:29:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-06 19:29:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-04-06 19:29:54,280 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 57 [2018-04-06 19:29:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:54,280 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-04-06 19:29:54,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:29:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-04-06 19:29:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-06 19:29:54,281 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:54,281 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] [2018-04-06 19:29:54,281 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:54,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1035920506, 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-06 19:29:54,291 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:54,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:54,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:29:54,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:54,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:29:54,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:54,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:54,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-06 19:29:54,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:54,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:54,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-06 19:29:54,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:54,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:54,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:54,395 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-06 19:29:54,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:54,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:54,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-06 19:29:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:29:54,784 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:55,249 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 10 treesize of output 3 [2018-04-06 19:29:55,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:55,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-06 19:29:55,261 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 19:29:55,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:55,262 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 12 treesize of output 3 [2018-04-06 19:29:55,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:55,264 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:55,267 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-06 19:29:55,267 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-06 19:29:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:29:55,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:29:55,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-04-06 19:29:55,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-06 19:29:55,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-06 19:29:55,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1373, Unknown=0, NotChecked=0, Total=1482 [2018-04-06 19:29:55,330 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 39 states. [2018-04-06 19:29:57,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:29:57,509 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2018-04-06 19:29:57,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-06 19:29:57,510 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 58 [2018-04-06 19:29:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:29:57,510 INFO L225 Difference]: With dead ends: 151 [2018-04-06 19:29:57,510 INFO L226 Difference]: Without dead ends: 150 [2018-04-06 19:29:57,512 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=573, Invalid=5127, Unknown=0, NotChecked=0, Total=5700 [2018-04-06 19:29:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-06 19:29:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 120. [2018-04-06 19:29:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-06 19:29:57,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-04-06 19:29:57,523 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 58 [2018-04-06 19:29:57,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:29:57,523 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-04-06 19:29:57,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-06 19:29:57,523 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-04-06 19:29:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-06 19:29:57,523 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:29:57,523 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:29:57,523 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:29:57,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2054739622, now seen corresponding path program 2 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-06 19:29:57,529 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:29:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:29:57,551 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:29:57,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:29:57,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:57,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:29:57,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:57,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:57,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:29:57,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:57,574 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-06 19:29:57,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:57,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:57,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:29:57,583 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-06 19:29:57,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:57,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:57,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:29:57,602 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-06 19:29:57,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:29:57,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:57,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:57,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:57,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-06 19:29:57,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-04-06 19:29:57,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:29:57,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:57,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:57,627 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-06 19:29:57,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-06 19:29:57,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-06 19:29:57,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-04-06 19:29:57,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:29:57,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:29:57,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-06 19:29:57,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:45 [2018-04-06 19:29:57,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-06 19:29:57,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-06 19:29:57,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:29:57,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:29:57,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:29:57,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-06 19:29:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:29:57,993 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:29:58,726 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 39 treesize of output 30 [2018-04-06 19:29:58,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 12 treesize of output 11 [2018-04-06 19:29:58,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:58,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-06 19:29:58,755 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 9 treesize of output 1 [2018-04-06 19:29:58,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:58,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:58,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-06 19:29:58,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-04-06 19:29:58,762 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:29:58,763 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:29:58,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:29:58,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:29:58,792 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:57, output treesize:84 [2018-04-06 19:29:59,622 WARN L151 SmtUtils]: Spent 653ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-04-06 19:29:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:29:59,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:29:59,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2018-04-06 19:29:59,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-06 19:29:59,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-06 19:29:59,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2018-04-06 19:29:59,743 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 39 states. [2018-04-06 19:30:06,204 WARN L151 SmtUtils]: Spent 4608ms on a formula simplification. DAG size of input: 71 DAG size of output 53 [2018-04-06 19:30:06,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:30:06,756 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-04-06 19:30:06,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-06 19:30:06,757 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 61 [2018-04-06 19:30:06,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:30:06,757 INFO L225 Difference]: With dead ends: 139 [2018-04-06 19:30:06,757 INFO L226 Difference]: Without dead ends: 138 [2018-04-06 19:30:06,758 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=314, Invalid=2992, Unknown=0, NotChecked=0, Total=3306 [2018-04-06 19:30:06,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-04-06 19:30:06,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 131. [2018-04-06 19:30:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-06 19:30:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-04-06 19:30:06,777 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 61 [2018-04-06 19:30:06,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:30:06,778 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-04-06 19:30:06,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-06 19:30:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-04-06 19:30:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-06 19:30:06,778 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:30:06,779 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:30:06,779 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:30:06,779 INFO L82 PathProgramCache]: Analyzing trace with hash 727581190, 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-06 19:30:06,788 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:30:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:30:06,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:30:06,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:30:06,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:06,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:30:06,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:06,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:06,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-06 19:30:06,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:06,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:06,848 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-06 19:30:06,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:06,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:06,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-06 19:30:06,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:06,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:06,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-06 19:30:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:30:07,306 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:30:08,029 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 6 treesize of output 1 [2018-04-06 19:30:08,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:08,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 [2018-04-06 19:30:08,041 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 19:30:08,041 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:08,042 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 12 treesize of output 3 [2018-04-06 19:30:08,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:08,046 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:08,049 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-06 19:30:08,049 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-06 19:30:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:30:08,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:30:08,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-04-06 19:30:08,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-06 19:30:08,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-06 19:30:08,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2018-04-06 19:30:08,135 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 46 states. [2018-04-06 19:30:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:30:11,332 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions. [2018-04-06 19:30:11,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-06 19:30:11,332 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 62 [2018-04-06 19:30:11,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:30:11,333 INFO L225 Difference]: With dead ends: 189 [2018-04-06 19:30:11,333 INFO L226 Difference]: Without dead ends: 188 [2018-04-06 19:30:11,335 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=884, Invalid=7858, Unknown=0, NotChecked=0, Total=8742 [2018-04-06 19:30:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-06 19:30:11,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2018-04-06 19:30:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-06 19:30:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions. [2018-04-06 19:30:11,350 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 62 [2018-04-06 19:30:11,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:30:11,350 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions. [2018-04-06 19:30:11,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-06 19:30:11,351 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions. [2018-04-06 19:30:11,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-06 19:30:11,351 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:30:11,351 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-04-06 19:30:11,351 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:30:11,351 INFO L82 PathProgramCache]: Analyzing trace with hash -740387276, now seen corresponding path program 2 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-06 19:30:11,359 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:30:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:30:11,391 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:30:11,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:30:11,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:11,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:11,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-06 19:30:11,437 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-06 19:30:11,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:30:11,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:11,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:11,446 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-06 19:30:11,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-06 19:30:11,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-06 19:30:11,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:11,550 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-06 19:30:11,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:30:11,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:30:11,573 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-06 19:30:11,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2018-04-06 19:30:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:30:11,704 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:30:12,020 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 29 treesize of output 25 [2018-04-06 19:30:12,035 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:30:12,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-06 19:30:12,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:12,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:12,047 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-06 19:30:12,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:54 [2018-04-06 19:30:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:30:12,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:30:12,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-04-06 19:30:12,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-06 19:30:12,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-06 19:30:12,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2018-04-06 19:30:12,232 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 35 states. [2018-04-06 19:30:16,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:30:16,137 INFO L93 Difference]: Finished difference Result 224 states and 235 transitions. [2018-04-06 19:30:16,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-06 19:30:16,137 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 65 [2018-04-06 19:30:16,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:30:16,138 INFO L225 Difference]: With dead ends: 224 [2018-04-06 19:30:16,138 INFO L226 Difference]: Without dead ends: 223 [2018-04-06 19:30:16,139 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=514, Invalid=4316, Unknown=0, NotChecked=0, Total=4830 [2018-04-06 19:30:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-06 19:30:16,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 201. [2018-04-06 19:30:16,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-06 19:30:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 211 transitions. [2018-04-06 19:30:16,151 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 211 transitions. Word has length 65 [2018-04-06 19:30:16,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:30:16,151 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 211 transitions. [2018-04-06 19:30:16,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-06 19:30:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 211 transitions. [2018-04-06 19:30:16,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-06 19:30:16,152 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:30:16,152 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 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-06 19:30:16,152 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:30:16,152 INFO L82 PathProgramCache]: Analyzing trace with hash -76833573, now seen corresponding path program 3 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-06 19:30:16,158 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:30:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:30:16,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:30:16,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:30:16,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:16,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:16,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-06 19:30:16,216 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-06 19:30:16,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:30:16,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:16,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:16,223 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-06 19:30:16,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-06 19:30:16,497 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 48 treesize of output 38 [2018-04-06 19:30:16,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:16,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:16,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:16,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:16,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:16,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:16,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 93 [2018-04-06 19:30:16,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:30:16,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:30:16,570 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-06 19:30:16,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-04-06 19:30:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:30:16,707 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:30:17,289 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 59 treesize of output 51 [2018-04-06 19:30:17,320 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:30:17,321 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:30:17,321 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:30:17,321 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:30:17,322 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:30:17,323 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:30:17,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 49 [2018-04-06 19:30:17,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:17,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:17,353 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-06 19:30:17,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:86 [2018-04-06 19:30:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:30:17,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:30:17,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-04-06 19:30:17,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-06 19:30:17,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-06 19:30:17,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1599, Unknown=0, NotChecked=0, Total=1806 [2018-04-06 19:30:17,602 INFO L87 Difference]: Start difference. First operand 201 states and 211 transitions. Second operand 43 states. [2018-04-06 19:30:21,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:30:21,050 INFO L93 Difference]: Finished difference Result 251 states and 268 transitions. [2018-04-06 19:30:21,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-06 19:30:21,051 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 66 [2018-04-06 19:30:21,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:30:21,052 INFO L225 Difference]: With dead ends: 251 [2018-04-06 19:30:21,052 INFO L226 Difference]: Without dead ends: 250 [2018-04-06 19:30:21,053 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=700, Invalid=4412, Unknown=0, NotChecked=0, Total=5112 [2018-04-06 19:30:21,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-06 19:30:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 229. [2018-04-06 19:30:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-06 19:30:21,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 243 transitions. [2018-04-06 19:30:21,070 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 243 transitions. Word has length 66 [2018-04-06 19:30:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:30:21,070 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 243 transitions. [2018-04-06 19:30:21,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-06 19:30:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 243 transitions. [2018-04-06 19:30:21,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-06 19:30:21,071 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:30:21,071 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:30:21,071 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:30:21,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1610415124, now seen corresponding path program 3 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-06 19:30:21,077 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:30:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:30:21,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:30:21,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:30:21,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:21,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:30:21,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:21,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:21,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:30:21,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:21,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:21,123 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-06 19:30:21,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:21,129 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-06 19:30:21,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:21,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:21,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:30:21,148 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-06 19:30:21,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:30:21,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:21,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:21,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:21,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-06 19:30:21,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-04-06 19:30:21,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:30:21,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:21,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:21,173 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-06 19:30:21,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-06 19:30:21,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-06 19:30:21,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-04-06 19:30:21,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:30:21,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:30:21,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-06 19:30:21,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:49 [2018-04-06 19:30:21,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-06 19:30:21,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 19:30:21,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:21,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:21,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:21,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-06 19:30:21,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-06 19:30:21,554 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-06 19:30:21,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:30:21,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:30:21,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:30:21,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-06 19:30:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:30:21,651 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:30:24,718 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 40 treesize of output 31 [2018-04-06 19:30:24,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 19:30:24,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:24,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-06 19:30:24,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-04-06 19:30:24,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:24,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:24,750 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 32 treesize of output 34 [2018-04-06 19:30:24,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-04-06 19:30:24,752 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:24,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-06 19:30:24,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:30:24,774 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:24,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-04-06 19:30:24,779 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-06 19:30:24,789 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-06 19:30:24,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 52 [2018-04-06 19:30:24,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-04-06 19:30:24,903 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:24,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-04-06 19:30:24,905 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:24,907 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:30:24,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-04-06 19:30:24,908 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:24,977 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 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-06 19:30:24,978 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-04-06 19:30:24,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-06 19:30:24,995 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-04-06 19:30:25,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-04-06 19:30:25,060 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-06 19:30:25,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-04-06 19:30:25,066 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-04-06 19:30:25,094 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:30:25,112 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 19:30:25,114 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-06 19:30:25,122 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-04-06 19:30:25,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-04-06 19:30:25,145 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-06 19:30:25,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-04-06 19:30:25,151 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-04-06 19:30:25,152 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 22 treesize of output 16 [2018-04-06 19:30:25,153 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:25,192 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 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-06 19:30:25,193 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 3 xjuncts. [2018-04-06 19:30:25,198 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 23 treesize of output 19 [2018-04-06 19:30:25,198 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-04-06 19:30:25,222 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:30:25,240 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:30:25,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-06 19:30:25,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:30:25,296 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 6 variables, input treesize:58, output treesize:84 [2018-04-06 19:30:25,778 WARN L151 SmtUtils]: Spent 308ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-04-06 19:30:26,143 WARN L148 SmtUtils]: Spent 300ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-06 19:30:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:30:26,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:30:26,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 48 [2018-04-06 19:30:26,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-06 19:30:26,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-06 19:30:26,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2018-04-06 19:30:26,192 INFO L87 Difference]: Start difference. First operand 229 states and 243 transitions. Second operand 49 states. [2018-04-06 19:30:27,675 WARN L151 SmtUtils]: Spent 263ms on a formula simplification. DAG size of input: 125 DAG size of output 85 [2018-04-06 19:30:28,724 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 104 DAG size of output 73 [2018-04-06 19:30:29,004 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 102 DAG size of output 78 [2018-04-06 19:30:29,341 WARN L151 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 106 DAG size of output 81 [2018-04-06 19:30:29,590 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 92 DAG size of output 67 [2018-04-06 19:30:32,662 WARN L151 SmtUtils]: Spent 2988ms on a formula simplification. DAG size of input: 88 DAG size of output 57 [2018-04-06 19:30:33,163 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 89 DAG size of output 48 [2018-04-06 19:30:33,586 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 98 DAG size of output 45 [2018-04-06 19:30:37,271 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 93 DAG size of output 51 [2018-04-06 19:30:37,665 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 100 DAG size of output 48 [2018-04-06 19:30:39,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:30:39,241 INFO L93 Difference]: Finished difference Result 237 states and 250 transitions. [2018-04-06 19:30:39,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-06 19:30:39,241 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 72 [2018-04-06 19:30:39,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:30:39,243 INFO L225 Difference]: With dead ends: 237 [2018-04-06 19:30:39,243 INFO L226 Difference]: Without dead ends: 236 [2018-04-06 19:30:39,245 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1397 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=887, Invalid=6253, Unknown=0, NotChecked=0, Total=7140 [2018-04-06 19:30:39,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-06 19:30:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 154. [2018-04-06 19:30:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-06 19:30:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-04-06 19:30:39,262 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 72 [2018-04-06 19:30:39,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:30:39,262 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-04-06 19:30:39,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-06 19:30:39,262 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-04-06 19:30:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-06 19:30:39,262 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:30:39,263 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-06 19:30:39,263 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:30:39,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2103712966, now seen corresponding path program 3 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-06 19:30:39,269 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:30:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:30:39,297 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:30:39,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:30:39,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:39,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:30:39,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:39,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:39,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-06 19:30:39,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:39,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:39,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-06 19:30:39,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:39,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:39,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:39,342 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-06 19:30:39,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:39,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:39,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-06 19:30:39,367 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-06 19:30:39,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:30:39,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:39,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:39,374 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-06 19:30:39,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-06 19:30:39,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-06 19:30:39,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-04-06 19:30:39,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:30:39,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:30:39,443 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-06 19:30:39,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:46 [2018-04-06 19:30:39,822 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:30:39,822 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:30:40,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-06 19:30:40,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-06 19:30:40,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:40,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:40,755 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-06 19:30:40,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:45 [2018-04-06 19:30:41,003 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 27 treesize of output 21 [2018-04-06 19:30:41,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:41,015 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 27 treesize of output 21 [2018-04-06 19:30:41,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:41,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-06 19:30:41,040 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 12 treesize of output 3 [2018-04-06 19:30:41,040 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:41,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:41,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-06 19:30:41,069 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 12 treesize of output 3 [2018-04-06 19:30:41,069 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:41,073 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:41,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:30:41,082 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-06 19:30:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:30:41,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:30:41,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2018-04-06 19:30:41,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-06 19:30:41,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-06 19:30:41,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2590, Unknown=0, NotChecked=0, Total=2756 [2018-04-06 19:30:41,169 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 53 states. [2018-04-06 19:30:42,282 WARN L151 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 65 DAG size of output 62 [2018-04-06 19:30:47,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:30:47,172 INFO L93 Difference]: Finished difference Result 255 states and 270 transitions. [2018-04-06 19:30:47,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-06 19:30:47,173 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 76 [2018-04-06 19:30:47,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:30:47,174 INFO L225 Difference]: With dead ends: 255 [2018-04-06 19:30:47,174 INFO L226 Difference]: Without dead ends: 254 [2018-04-06 19:30:47,175 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3545 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1112, Invalid=13894, Unknown=0, NotChecked=0, Total=15006 [2018-04-06 19:30:47,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-04-06 19:30:47,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 154. [2018-04-06 19:30:47,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-06 19:30:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-04-06 19:30:47,203 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 76 [2018-04-06 19:30:47,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:30:47,203 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-04-06 19:30:47,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-06 19:30:47,204 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-04-06 19:30:47,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-06 19:30:47,204 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:30:47,204 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2018-04-06 19:30:47,204 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:30:47,205 INFO L82 PathProgramCache]: Analyzing trace with hash 138511220, now seen corresponding path program 4 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-06 19:30:47,213 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:30:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:30:47,243 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:30:47,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:30:47,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:47,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:30:47,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:47,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:47,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-06 19:30:47,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:47,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:47,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-06 19:30:47,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:47,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:47,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:47,289 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-06 19:30:47,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:47,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:47,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-06 19:30:47,313 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-06 19:30:47,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:30:47,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:47,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:47,320 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-06 19:30:47,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-06 19:30:47,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-04-06 19:30:47,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:47,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:47,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:47,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 58 [2018-04-06 19:30:47,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:30:47,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:30:47,991 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-06 19:30:47,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:84 [2018-04-06 19:30:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:30:48,342 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:30:49,304 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 44 treesize of output 38 [2018-04-06 19:30:49,327 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:30:49,327 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:30:49,327 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:30:49,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, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-06 19:30:49,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:49,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:49,346 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-06 19:30:49,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:77 [2018-04-06 19:30:49,634 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 27 treesize of output 21 [2018-04-06 19:30:49,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:49,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-06 19:30:49,659 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 12 treesize of output 3 [2018-04-06 19:30:49,659 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:49,663 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:49,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-04-06 19:30:49,690 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 12 treesize of output 3 [2018-04-06 19:30:49,691 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:49,695 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:49,707 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 19 treesize of output 13 [2018-04-06 19:30:49,707 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:49,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:30:49,719 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-06 19:30:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:30:49,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:30:49,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2018-04-06 19:30:49,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-06 19:30:49,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-06 19:30:49,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2968, Unknown=1, NotChecked=0, Total=3192 [2018-04-06 19:30:49,813 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 57 states. [2018-04-06 19:30:51,524 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 101 DAG size of output 69 [2018-04-06 19:30:53,185 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 96 DAG size of output 82 [2018-04-06 19:30:54,227 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 86 DAG size of output 80 [2018-04-06 19:30:55,052 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 89 DAG size of output 75 [2018-04-06 19:30:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:30:57,733 INFO L93 Difference]: Finished difference Result 254 states and 269 transitions. [2018-04-06 19:30:57,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-06 19:30:57,733 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 79 [2018-04-06 19:30:57,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:30:57,734 INFO L225 Difference]: With dead ends: 254 [2018-04-06 19:30:57,734 INFO L226 Difference]: Without dead ends: 253 [2018-04-06 19:30:57,736 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4179 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1505, Invalid=15006, Unknown=1, NotChecked=0, Total=16512 [2018-04-06 19:30:57,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-06 19:30:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 154. [2018-04-06 19:30:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-06 19:30:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-04-06 19:30:57,759 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 79 [2018-04-06 19:30:57,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:30:57,759 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-04-06 19:30:57,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-06 19:30:57,759 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-04-06 19:30:57,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-06 19:30:57,759 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:30:57,760 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:30:57,760 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:30:57,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1497310022, now seen corresponding path program 5 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-06 19:30:57,767 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:30:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:30:57,796 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:30:57,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 6 treesize of output 5 [2018-04-06 19:30:57,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:57,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:30:57,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:57,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:57,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-06 19:30:57,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:57,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:57,824 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-06 19:30:57,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:57,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:30:57,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-06 19:30:57,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:57,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:57,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-06 19:30:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:30:58,265 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:30:59,179 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 10 treesize of output 3 [2018-04-06 19:30:59,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:59,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-06 19:30:59,192 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 12 treesize of output 3 [2018-04-06 19:30:59,192 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:59,193 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 19:30:59,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:30:59,195 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:30:59,198 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-06 19:30:59,198 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-06 19:30:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:30:59,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:30:59,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-04-06 19:30:59,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-06 19:30:59,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-06 19:30:59,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2793, Unknown=0, NotChecked=0, Total=2970 [2018-04-06 19:30:59,275 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 55 states. [2018-04-06 19:31:03,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:31:03,921 INFO L93 Difference]: Finished difference Result 273 states and 289 transitions. [2018-04-06 19:31:03,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-06 19:31:03,921 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 80 [2018-04-06 19:31:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:31:03,923 INFO L225 Difference]: With dead ends: 273 [2018-04-06 19:31:03,923 INFO L226 Difference]: Without dead ends: 272 [2018-04-06 19:31:03,924 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3100 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1293, Invalid=14207, Unknown=0, NotChecked=0, Total=15500 [2018-04-06 19:31:03,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-04-06 19:31:03,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 176. [2018-04-06 19:31:03,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-06 19:31:03,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 188 transitions. [2018-04-06 19:31:03,956 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 188 transitions. Word has length 80 [2018-04-06 19:31:03,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:31:03,956 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 188 transitions. [2018-04-06 19:31:03,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-06 19:31:03,956 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 188 transitions. [2018-04-06 19:31:03,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-06 19:31:03,957 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:31:03,957 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:31:03,957 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:31:03,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1524329472, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:31:03,966 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:31:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:31:04,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:31:04,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:31:04,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:04,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:31:04,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:04,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:04,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-06 19:31:04,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:04,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:04,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-06 19:31:04,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:04,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:04,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:04,152 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-06 19:31:04,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:04,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:04,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-06 19:31:04,231 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-06 19:31:04,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 19:31:04,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:04,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:04,250 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-06 19:31:04,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-06 19:31:04,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-06 19:31:04,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:04,446 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-06 19:31:04,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:31:04,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:31:04,472 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-06 19:31:04,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:66 [2018-04-06 19:31:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:31:04,923 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:31:05,892 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 29 treesize of output 25 [2018-04-06 19:31:05,907 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:05,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-06 19:31:05,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:05,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:05,925 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-06 19:31:05,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:61 [2018-04-06 19:31:06,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-04-06 19:31:06,231 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 12 treesize of output 3 [2018-04-06 19:31:06,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:06,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:06,250 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 19 treesize of output 13 [2018-04-06 19:31:06,250 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:06,262 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 27 treesize of output 21 [2018-04-06 19:31:06,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:06,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-06 19:31:06,286 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 12 treesize of output 3 [2018-04-06 19:31:06,286 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:06,290 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:06,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:31:06,299 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-06 19:31:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:31:06,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:31:06,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 58 [2018-04-06 19:31:06,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-06 19:31:06,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-06 19:31:06,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3219, Unknown=0, NotChecked=0, Total=3422 [2018-04-06 19:31:06,392 INFO L87 Difference]: Start difference. First operand 176 states and 188 transitions. Second operand 59 states. [2018-04-06 19:31:08,391 WARN L148 SmtUtils]: Spent 910ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-06 19:31:08,724 WARN L148 SmtUtils]: Spent 248ms on a formula simplification that was a NOOP. DAG size: 60 [2018-04-06 19:31:09,158 WARN L148 SmtUtils]: Spent 255ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-06 19:31:09,949 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 87 DAG size of output 78 [2018-04-06 19:31:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:31:16,418 INFO L93 Difference]: Finished difference Result 302 states and 317 transitions. [2018-04-06 19:31:16,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-06 19:31:16,418 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 83 [2018-04-06 19:31:16,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:31:16,419 INFO L225 Difference]: With dead ends: 302 [2018-04-06 19:31:16,419 INFO L226 Difference]: Without dead ends: 301 [2018-04-06 19:31:16,420 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4745 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1375, Invalid=17807, Unknown=0, NotChecked=0, Total=19182 [2018-04-06 19:31:16,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-04-06 19:31:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 177. [2018-04-06 19:31:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-06 19:31:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2018-04-06 19:31:16,439 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 83 [2018-04-06 19:31:16,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:31:16,439 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2018-04-06 19:31:16,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-06 19:31:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2018-04-06 19:31:16,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-06 19:31:16,440 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:31:16,440 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:31:16,440 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:31:16,440 INFO L82 PathProgramCache]: Analyzing trace with hash 882641222, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:31:16,445 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:31:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:31:16,473 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:31:16,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:31:16,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:16,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:31:16,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:16,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:16,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-06 19:31:16,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:16,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:16,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-06 19:31:16,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:16,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:16,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:16,519 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-06 19:31:16,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:16,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:16,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-06 19:31:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:31:17,062 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:31:18,238 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 6 treesize of output 1 [2018-04-06 19:31:18,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:18,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 [2018-04-06 19:31:18,249 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 19:31:18,249 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:18,250 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 12 treesize of output 3 [2018-04-06 19:31:18,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:18,254 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:18,256 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-06 19:31:18,257 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-06 19:31:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:31:18,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:31:18,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-04-06 19:31:18,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-06 19:31:18,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-06 19:31:18,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=3529, Unknown=0, NotChecked=0, Total=3782 [2018-04-06 19:31:18,371 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand 62 states. [2018-04-06 19:31:24,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:31:24,865 INFO L93 Difference]: Finished difference Result 314 states and 331 transitions. [2018-04-06 19:31:24,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-06 19:31:24,866 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 84 [2018-04-06 19:31:24,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:31:24,867 INFO L225 Difference]: With dead ends: 314 [2018-04-06 19:31:24,867 INFO L226 Difference]: Without dead ends: 313 [2018-04-06 19:31:24,868 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4694 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2143, Invalid=19909, Unknown=0, NotChecked=0, Total=22052 [2018-04-06 19:31:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-06 19:31:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 200. [2018-04-06 19:31:24,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-06 19:31:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-04-06 19:31:24,886 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 84 [2018-04-06 19:31:24,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:31:24,887 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-04-06 19:31:24,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-06 19:31:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-04-06 19:31:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-06 19:31:24,887 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:31:24,887 INFO L355 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 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-06 19:31:24,887 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:31:24,887 INFO L82 PathProgramCache]: Analyzing trace with hash -39632293, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:31:24,893 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:31:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:31:24,926 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:31:24,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:31:24,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:24,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:24,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-06 19:31:24,960 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-06 19:31:24,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 11 treesize of output 10 [2018-04-06 19:31:24,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:24,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:24,968 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-06 19:31:24,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-06 19:31:25,913 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 88 treesize of output 70 [2018-04-06 19:31:25,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:25,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 42 disjoint index pairs (out of 36 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 313 [2018-04-06 19:31:25,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:31:26,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:31:26,221 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-06 19:31:26,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:109, output treesize:129 [2018-04-06 19:31:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:31:26,463 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:31:28,368 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 119 treesize of output 103 [2018-04-06 19:31:28,439 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,439 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,439 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,440 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,440 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,440 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,440 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,441 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,441 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,442 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,442 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,442 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,444 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,444 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,444 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,445 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,445 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,445 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,445 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,446 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,446 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,446 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,446 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,447 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,447 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,447 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,448 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,448 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:28,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 44 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 207 [2018-04-06 19:31:28,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:28,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:28,579 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-06 19:31:28,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:150 [2018-04-06 19:31:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:31:28,961 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:31:28,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2018-04-06 19:31:28,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-06 19:31:28,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-06 19:31:28,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=3863, Unknown=0, NotChecked=0, Total=4422 [2018-04-06 19:31:28,962 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 67 states. [2018-04-06 19:31:32,615 WARN L151 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 137 DAG size of output 121 [2018-04-06 19:31:33,943 WARN L151 SmtUtils]: Spent 1236ms on a formula simplification. DAG size of input: 131 DAG size of output 116 [2018-04-06 19:31:34,225 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 88 DAG size of output 74 [2018-04-06 19:31:34,469 WARN L148 SmtUtils]: Spent 149ms on a formula simplification that was a NOOP. DAG size: 97 [2018-04-06 19:31:34,880 WARN L151 SmtUtils]: Spent 336ms on a formula simplification. DAG size of input: 105 DAG size of output 103 [2018-04-06 19:31:35,045 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 84 DAG size of output 70 [2018-04-06 19:31:35,284 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 83 DAG size of output 69 [2018-04-06 19:31:35,603 WARN L151 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 91 DAG size of output 77 [2018-04-06 19:31:35,963 WARN L151 SmtUtils]: Spent 284ms on a formula simplification. DAG size of input: 106 DAG size of output 88 [2018-04-06 19:31:36,650 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 80 DAG size of output 70 [2018-04-06 19:31:37,023 WARN L151 SmtUtils]: Spent 255ms on a formula simplification. DAG size of input: 104 DAG size of output 88 [2018-04-06 19:31:37,539 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 71 DAG size of output 63 [2018-04-06 19:31:37,894 WARN L151 SmtUtils]: Spent 237ms on a formula simplification. DAG size of input: 103 DAG size of output 87 [2018-04-06 19:31:38,658 WARN L151 SmtUtils]: Spent 210ms on a formula simplification. DAG size of input: 102 DAG size of output 84 [2018-04-06 19:31:39,727 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 101 DAG size of output 83 [2018-04-06 19:31:40,325 WARN L151 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 100 DAG size of output 82 [2018-04-06 19:31:40,790 WARN L151 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 97 DAG size of output 79 [2018-04-06 19:31:41,149 WARN L151 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 95 DAG size of output 79 [2018-04-06 19:31:42,468 WARN L151 SmtUtils]: Spent 393ms on a formula simplification. DAG size of input: 112 DAG size of output 96 [2018-04-06 19:31:42,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:31:42,479 INFO L93 Difference]: Finished difference Result 349 states and 377 transitions. [2018-04-06 19:31:42,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-06 19:31:42,479 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 94 [2018-04-06 19:31:42,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:31:42,480 INFO L225 Difference]: With dead ends: 349 [2018-04-06 19:31:42,481 INFO L226 Difference]: Without dead ends: 348 [2018-04-06 19:31:42,481 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5199 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=2899, Invalid=16007, Unknown=0, NotChecked=0, Total=18906 [2018-04-06 19:31:42,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-04-06 19:31:42,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 256. [2018-04-06 19:31:42,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-06 19:31:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 276 transitions. [2018-04-06 19:31:42,512 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 276 transitions. Word has length 94 [2018-04-06 19:31:42,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:31:42,512 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 276 transitions. [2018-04-06 19:31:42,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-06 19:31:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 276 transitions. [2018-04-06 19:31:42,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-06 19:31:42,513 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:31:42,513 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:31:42,513 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:31:42,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1813950784, now seen corresponding path program 7 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:31:42,519 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:31:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:31:42,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:31:42,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:31:42,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:42,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:31:42,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:42,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:42,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-06 19:31:42,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:42,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:42,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-06 19:31:42,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:42,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:42,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:42,599 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-06 19:31:42,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:42,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:42,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-06 19:31:42,623 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-06 19:31:42,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:31:42,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:42,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:42,630 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-06 19:31:42,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-06 19:31:42,933 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 48 treesize of output 38 [2018-04-06 19:31:42,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:42,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:42,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:42,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:42,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:42,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:31:42,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 93 [2018-04-06 19:31:42,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:31:42,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:31:43,001 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-06 19:31:43,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:106 [2018-04-06 19:31:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:31:43,564 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:31:45,151 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 59 treesize of output 51 [2018-04-06 19:31:45,182 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:45,183 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:45,183 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:45,183 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:45,183 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:45,184 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:31:45,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 49 [2018-04-06 19:31:45,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:45,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:45,212 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-06 19:31:45,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:93 [2018-04-06 19:31:45,580 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 27 treesize of output 21 [2018-04-06 19:31:45,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:45,592 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 27 treesize of output 21 [2018-04-06 19:31:45,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:45,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-06 19:31:45,615 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 12 treesize of output 3 [2018-04-06 19:31:45,615 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:45,619 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:45,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-06 19:31:45,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3 [2018-04-06 19:31:45,643 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:31:45,646 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:31:45,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:31:45,656 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-06 19:31:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:31:45,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:31:45,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 70 [2018-04-06 19:31:45,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-06 19:31:45,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-06 19:31:45,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=4657, Unknown=0, NotChecked=0, Total=4970 [2018-04-06 19:31:45,777 INFO L87 Difference]: Start difference. First operand 256 states and 276 transitions. Second operand 71 states. [2018-04-06 19:31:47,512 WARN L148 SmtUtils]: Spent 422ms on a formula simplification that was a NOOP. DAG size: 60 [2018-04-06 19:31:47,836 WARN L148 SmtUtils]: Spent 111ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-06 19:31:51,367 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 114 DAG size of output 100 [2018-04-06 19:31:51,599 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 107 DAG size of output 93 [2018-04-06 19:31:53,106 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 97 DAG size of output 88 [2018-04-06 19:31:53,363 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 107 DAG size of output 92 [2018-04-06 19:31:53,948 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 106 DAG size of output 94 [2018-04-06 19:31:54,636 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 90 DAG size of output 81 [2018-04-06 19:31:55,004 WARN L151 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 110 DAG size of output 102 [2018-04-06 19:31:55,554 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 98 DAG size of output 87 [2018-04-06 19:31:56,633 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 114 DAG size of output 94 [2018-04-06 19:31:57,968 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 110 DAG size of output 90 [2018-04-06 19:31:58,998 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 106 DAG size of output 88 [2018-04-06 19:31:59,910 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 102 DAG size of output 88 [2018-04-06 19:32:00,748 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 98 DAG size of output 89 [2018-04-06 19:32:00,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:32:00,896 INFO L93 Difference]: Finished difference Result 452 states and 475 transitions. [2018-04-06 19:32:00,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-04-06 19:32:00,896 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 97 [2018-04-06 19:32:00,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:32:00,897 INFO L225 Difference]: With dead ends: 452 [2018-04-06 19:32:00,898 INFO L226 Difference]: Without dead ends: 451 [2018-04-06 19:32:00,899 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8341 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=2321, Invalid=28479, Unknown=0, NotChecked=0, Total=30800 [2018-04-06 19:32:00,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-04-06 19:32:00,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 274. [2018-04-06 19:32:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-06 19:32:00,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 295 transitions. [2018-04-06 19:32:00,952 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 295 transitions. Word has length 97 [2018-04-06 19:32:00,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:32:00,953 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 295 transitions. [2018-04-06 19:32:00,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-06 19:32:00,953 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 295 transitions. [2018-04-06 19:32:00,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-04-06 19:32:00,954 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:32:00,954 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:32:00,954 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:32:00,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1290114054, now seen corresponding path program 8 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:32:00,964 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:32:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:32:00,998 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:32:01,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:32:01,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:01,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:32:01,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:01,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:01,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-06 19:32:01,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:01,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:01,038 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-06 19:32:01,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:01,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:01,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-06 19:32:01,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:01,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:01,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-06 19:32:01,073 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-06 19:32:01,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 19:32:01,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:01,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:01,081 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-06 19:32:01,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-06 19:32:01,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-06 19:32:01,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-04-06 19:32:01,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:32:01,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:32:01,154 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-06 19:32:01,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:46 [2018-04-06 19:32:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:32:01,819 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:32:03,119 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-06 19:32:03,127 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-06 19:32:03,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:03,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:03,134 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-06 19:32:03,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:45 [2018-04-06 19:32:03,442 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 27 treesize of output 21 [2018-04-06 19:32:03,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:03,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-06 19:32:03,468 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 12 treesize of output 3 [2018-04-06 19:32:03,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:03,472 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:03,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-04-06 19:32:03,500 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 12 treesize of output 3 [2018-04-06 19:32:03,500 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:03,505 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:03,516 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 19 treesize of output 13 [2018-04-06 19:32:03,517 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:03,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:32:03,527 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-06 19:32:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:32:03,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:32:03,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2018-04-06 19:32:03,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-06 19:32:03,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-06 19:32:03,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4438, Unknown=0, NotChecked=0, Total=4692 [2018-04-06 19:32:03,635 INFO L87 Difference]: Start difference. First operand 274 states and 295 transitions. Second operand 69 states. [2018-04-06 19:32:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:32:13,039 INFO L93 Difference]: Finished difference Result 444 states and 470 transitions. [2018-04-06 19:32:13,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-04-06 19:32:13,039 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 98 [2018-04-06 19:32:13,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:32:13,040 INFO L225 Difference]: With dead ends: 444 [2018-04-06 19:32:13,041 INFO L226 Difference]: Without dead ends: 443 [2018-04-06 19:32:13,041 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6806 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1884, Invalid=26172, Unknown=0, NotChecked=0, Total=28056 [2018-04-06 19:32:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-04-06 19:32:13,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 274. [2018-04-06 19:32:13,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-06 19:32:13,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 295 transitions. [2018-04-06 19:32:13,099 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 295 transitions. Word has length 98 [2018-04-06 19:32:13,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:32:13,099 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 295 transitions. [2018-04-06 19:32:13,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-06 19:32:13,099 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 295 transitions. [2018-04-06 19:32:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-04-06 19:32:13,100 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:32:13,101 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 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] [2018-04-06 19:32:13,101 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:32:13,101 INFO L82 PathProgramCache]: Analyzing trace with hash 717612218, now seen corresponding path program 9 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:32:13,113 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:32:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:32:13,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:32:13,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:32:13,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:13,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:32:13,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:13,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:13,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-06 19:32:13,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:13,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:13,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-06 19:32:13,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:13,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:13,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:13,234 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-06 19:32:13,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:13,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:13,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-06 19:32:13,268 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-06 19:32:13,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:32:13,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:13,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:13,277 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-06 19:32:13,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-06 19:32:14,322 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 68 treesize of output 54 [2018-04-06 19:32:14,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:14,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:14,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:14,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:14,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:14,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:14,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:14,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:14,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:14,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:14,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:14,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:14,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:14,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:14,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:14,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 187 [2018-04-06 19:32:14,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:32:14,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:32:14,463 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-06 19:32:14,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:150 [2018-04-06 19:32:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:32:14,987 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:32:17,041 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 89 treesize of output 77 [2018-04-06 19:32:17,090 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:17,090 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:17,091 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:17,091 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:17,091 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:17,091 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:17,092 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:17,092 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:17,092 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:17,092 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:17,093 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:17,093 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:17,093 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:17,094 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:17,094 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:17,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 114 [2018-04-06 19:32:17,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:17,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:17,152 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-06 19:32:17,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:107, output treesize:125 [2018-04-06 19:32:17,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-04-06 19:32:17,561 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 12 treesize of output 3 [2018-04-06 19:32:17,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:17,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:17,578 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 19 treesize of output 13 [2018-04-06 19:32:17,579 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:17,593 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 27 treesize of output 21 [2018-04-06 19:32:17,593 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:17,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-06 19:32:17,619 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 12 treesize of output 3 [2018-04-06 19:32:17,620 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:17,623 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:17,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:32:17,633 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-06 19:32:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:32:17,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:32:17,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 74 [2018-04-06 19:32:17,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-06 19:32:17,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-06 19:32:17,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=5107, Unknown=1, NotChecked=0, Total=5550 [2018-04-06 19:32:17,766 INFO L87 Difference]: Start difference. First operand 274 states and 295 transitions. Second operand 75 states. [2018-04-06 19:32:19,906 WARN L151 SmtUtils]: Spent 841ms on a formula simplification. DAG size of input: 57 DAG size of output 55 [2018-04-06 19:32:20,576 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 131 DAG size of output 69 [2018-04-06 19:32:23,325 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 96 DAG size of output 92 [2018-04-06 19:32:26,041 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 101 DAG size of output 97 [2018-04-06 19:32:27,632 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 106 DAG size of output 102 [2018-04-06 19:32:28,862 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 111 DAG size of output 107 [2018-04-06 19:32:29,374 WARN L151 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 143 DAG size of output 122 [2018-04-06 19:32:29,705 WARN L151 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 136 DAG size of output 117 [2018-04-06 19:32:30,283 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 90 DAG size of output 75 [2018-04-06 19:32:30,640 WARN L151 SmtUtils]: Spent 229ms on a formula simplification. DAG size of input: 109 DAG size of output 94 [2018-04-06 19:32:30,985 WARN L151 SmtUtils]: Spent 255ms on a formula simplification. DAG size of input: 119 DAG size of output 101 [2018-04-06 19:32:31,172 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 98 DAG size of output 81 [2018-04-06 19:32:31,383 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 102 DAG size of output 84 [2018-04-06 19:32:31,682 WARN L151 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 115 DAG size of output 97 [2018-04-06 19:32:32,202 WARN L151 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 102 DAG size of output 97 [2018-04-06 19:32:32,573 WARN L151 SmtUtils]: Spent 278ms on a formula simplification. DAG size of input: 122 DAG size of output 111 [2018-04-06 19:32:32,938 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 96 DAG size of output 79 [2018-04-06 19:32:33,220 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 108 DAG size of output 89 [2018-04-06 19:32:33,988 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 97 DAG size of output 88 [2018-04-06 19:32:34,429 WARN L151 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 126 DAG size of output 108 [2018-04-06 19:32:35,161 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 105 DAG size of output 87 [2018-04-06 19:32:35,564 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 82 DAG size of output 74 [2018-04-06 19:32:35,989 WARN L151 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 122 DAG size of output 103 [2018-04-06 19:32:36,703 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 91 DAG size of output 77 [2018-04-06 19:32:38,037 WARN L151 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 134 DAG size of output 112 [2018-04-06 19:32:38,663 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 96 DAG size of output 85 [2018-04-06 19:32:39,344 WARN L151 SmtUtils]: Spent 202ms on a formula simplification. DAG size of input: 131 DAG size of output 106 [2018-04-06 19:32:40,225 WARN L151 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 127 DAG size of output 106 [2018-04-06 19:32:41,034 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 123 DAG size of output 105 [2018-04-06 19:32:41,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:32:41,450 INFO L93 Difference]: Finished difference Result 412 states and 436 transitions. [2018-04-06 19:32:41,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-04-06 19:32:41,450 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 100 [2018-04-06 19:32:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:32:41,451 INFO L225 Difference]: With dead ends: 412 [2018-04-06 19:32:41,451 INFO L226 Difference]: Without dead ends: 411 [2018-04-06 19:32:41,453 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10460 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=3540, Invalid=32369, Unknown=1, NotChecked=0, Total=35910 [2018-04-06 19:32:41,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-04-06 19:32:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 256. [2018-04-06 19:32:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-06 19:32:41,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 276 transitions. [2018-04-06 19:32:41,486 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 276 transitions. Word has length 100 [2018-04-06 19:32:41,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:32:41,486 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 276 transitions. [2018-04-06 19:32:41,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-06 19:32:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 276 transitions. [2018-04-06 19:32:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-04-06 19:32:41,487 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:32:41,488 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:32:41,488 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:32:41,488 INFO L82 PathProgramCache]: Analyzing trace with hash -725048268, now seen corresponding path program 10 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:32:41,497 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:32:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:32:41,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:32:41,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:32:41,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:41,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:32:41,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:41,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:41,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-06 19:32:41,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:41,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:41,572 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-06 19:32:41,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:41,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:41,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-06 19:32:41,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:41,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:41,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-06 19:32:41,609 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-06 19:32:41,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 19:32:41,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:41,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:41,616 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-06 19:32:41,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-06 19:32:41,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-04-06 19:32:41,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:41,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:41,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:41,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 58 [2018-04-06 19:32:41,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:32:41,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:32:41,859 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-06 19:32:41,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:84 [2018-04-06 19:32:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:32:42,523 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:32:44,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-04-06 19:32:44,117 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:44,118 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:44,118 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:32:44,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-06 19:32:44,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:44,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:44,136 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-06 19:32:44,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:77 [2018-04-06 19:32:44,489 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 27 treesize of output 21 [2018-04-06 19:32:44,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:44,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-06 19:32:44,515 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 12 treesize of output 3 [2018-04-06 19:32:44,515 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:44,519 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:44,531 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 27 treesize of output 21 [2018-04-06 19:32:44,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:44,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-06 19:32:44,554 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 12 treesize of output 3 [2018-04-06 19:32:44,554 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:44,558 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:44,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:32:44,568 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-06 19:32:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:32:44,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:32:44,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 72 [2018-04-06 19:32:44,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-06 19:32:44,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-06 19:32:44,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=4965, Unknown=0, NotChecked=0, Total=5256 [2018-04-06 19:32:44,684 INFO L87 Difference]: Start difference. First operand 256 states and 276 transitions. Second operand 73 states. [2018-04-06 19:32:48,455 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 98 DAG size of output 87 [2018-04-06 19:32:49,780 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 89 DAG size of output 86 [2018-04-06 19:32:51,030 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 92 DAG size of output 81 [2018-04-06 19:32:53,178 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 100 DAG size of output 82 [2018-04-06 19:32:54,634 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 95 DAG size of output 78 [2018-04-06 19:32:57,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:32:57,794 INFO L93 Difference]: Finished difference Result 475 states and 499 transitions. [2018-04-06 19:32:57,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-04-06 19:32:57,794 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 101 [2018-04-06 19:32:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:32:57,795 INFO L225 Difference]: With dead ends: 475 [2018-04-06 19:32:57,795 INFO L226 Difference]: Without dead ends: 474 [2018-04-06 19:32:57,796 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8641 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=2170, Invalid=30772, Unknown=0, NotChecked=0, Total=32942 [2018-04-06 19:32:57,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-04-06 19:32:57,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 256. [2018-04-06 19:32:57,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-06 19:32:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 276 transitions. [2018-04-06 19:32:57,873 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 276 transitions. Word has length 101 [2018-04-06 19:32:57,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:32:57,873 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 276 transitions. [2018-04-06 19:32:57,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-06 19:32:57,873 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 276 transitions. [2018-04-06 19:32:57,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-04-06 19:32:57,874 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:32:57,874 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:32:57,874 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:32:57,874 INFO L82 PathProgramCache]: Analyzing trace with hash 35619776, now seen corresponding path program 11 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:32:57,882 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:32:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:32:57,916 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:32:57,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:32:57,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:57,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:32:57,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:57,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:57,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-06 19:32:57,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:57,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:57,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-06 19:32:57,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:57,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:57,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:57,974 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-06 19:32:57,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:57,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:57,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-06 19:32:57,998 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-06 19:32:58,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:32:58,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:32:58,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:32:58,006 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-06 19:32:58,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-06 19:32:58,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-06 19:32:58,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:32:58,125 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-06 19:32:58,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:32:58,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:32:58,149 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-06 19:32:58,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:66 [2018-04-06 19:32:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:32:58,897 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:33:00,504 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 29 treesize of output 25 [2018-04-06 19:33:00,521 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:33:00,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-06 19:33:00,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:00,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:33:00,535 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-06 19:33:00,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:61 [2018-04-06 19:33:00,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-04-06 19:33:00,896 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 12 treesize of output 3 [2018-04-06 19:33:00,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:00,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:33:00,914 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 27 treesize of output 21 [2018-04-06 19:33:00,915 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:00,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-06 19:33:00,940 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 12 treesize of output 3 [2018-04-06 19:33:00,940 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:00,944 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:33:00,955 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 19 treesize of output 13 [2018-04-06 19:33:00,956 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:00,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:33:00,965 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-06 19:33:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:33:01,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:33:01,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 74 [2018-04-06 19:33:01,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-06 19:33:01,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-06 19:33:01,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=5259, Unknown=0, NotChecked=0, Total=5550 [2018-04-06 19:33:01,080 INFO L87 Difference]: Start difference. First operand 256 states and 276 transitions. Second operand 75 states. [2018-04-06 19:33:02,781 WARN L148 SmtUtils]: Spent 429ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-06 19:33:03,567 WARN L148 SmtUtils]: Spent 428ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-06 19:33:04,966 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 87 DAG size of output 78 [2018-04-06 19:33:18,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:33:18,254 INFO L93 Difference]: Finished difference Result 449 states and 474 transitions. [2018-04-06 19:33:18,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-04-06 19:33:18,255 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 105 [2018-04-06 19:33:18,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:33:18,256 INFO L225 Difference]: With dead ends: 449 [2018-04-06 19:33:18,256 INFO L226 Difference]: Without dead ends: 448 [2018-04-06 19:33:18,257 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9055 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=2257, Invalid=33275, Unknown=0, NotChecked=0, Total=35532 [2018-04-06 19:33:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-04-06 19:33:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 256. [2018-04-06 19:33:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-06 19:33:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 276 transitions. [2018-04-06 19:33:18,310 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 276 transitions. Word has length 105 [2018-04-06 19:33:18,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:33:18,310 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 276 transitions. [2018-04-06 19:33:18,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-06 19:33:18,310 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 276 transitions. [2018-04-06 19:33:18,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-04-06 19:33:18,311 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:33:18,311 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:33:18,311 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:33:18,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1937459648, now seen corresponding path program 12 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:33:18,321 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:33:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:33:18,377 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:33:18,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:33:18,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:18,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:33:18,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:18,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:33:18,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-06 19:33:18,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:33:18,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:33:18,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-06 19:33:18,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:18,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:33:18,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:33:18,420 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-06 19:33:18,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:18,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:33:18,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-06 19:33:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:33:19,272 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:33:21,155 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 10 treesize of output 3 [2018-04-06 19:33:21,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:21,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-06 19:33:21,167 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 19:33:21,167 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:21,168 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 12 treesize of output 3 [2018-04-06 19:33:21,168 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:21,170 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:33:21,173 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-06 19:33:21,173 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-06 19:33:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:33:21,277 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:33:21,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 78 [2018-04-06 19:33:21,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-06 19:33:21,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-06 19:33:21,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=5808, Unknown=0, NotChecked=0, Total=6162 [2018-04-06 19:33:21,278 INFO L87 Difference]: Start difference. First operand 256 states and 276 transitions. Second operand 79 states. [2018-04-06 19:33:30,183 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 85 DAG size of output 69 [2018-04-06 19:33:30,624 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 98 DAG size of output 90 [2018-04-06 19:33:31,614 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 82 DAG size of output 76 [2018-04-06 19:33:33,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:33:33,272 INFO L93 Difference]: Finished difference Result 500 states and 527 transitions. [2018-04-06 19:33:33,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-04-06 19:33:33,272 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 113 [2018-04-06 19:33:33,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:33:33,274 INFO L225 Difference]: With dead ends: 500 [2018-04-06 19:33:33,274 INFO L226 Difference]: Without dead ends: 499 [2018-04-06 19:33:33,275 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10168 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=3672, Invalid=39800, Unknown=0, NotChecked=0, Total=43472 [2018-04-06 19:33:33,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-04-06 19:33:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 301. [2018-04-06 19:33:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-04-06 19:33:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 321 transitions. [2018-04-06 19:33:33,314 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 321 transitions. Word has length 113 [2018-04-06 19:33:33,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:33:33,314 INFO L459 AbstractCegarLoop]: Abstraction has 301 states and 321 transitions. [2018-04-06 19:33:33,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-06 19:33:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 321 transitions. [2018-04-06 19:33:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-06 19:33:33,316 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:33:33,316 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:33:33,316 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-06 19:33:33,316 INFO L82 PathProgramCache]: Analyzing trace with hash 475803904, now seen corresponding path program 13 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:33:33,328 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:33:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:33:33,375 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:33:33,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:33:33,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:33,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:33:33,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:33,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:33:33,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-06 19:33:33,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:33:33,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:33:33,421 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-06 19:33:33,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:33,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:33:33,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-06 19:33:33,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:33,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:33:33,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-06 19:33:33,453 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-06 19:33:33,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 19:33:33,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:33,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:33:33,461 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-06 19:33:33,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-06 19:33:34,444 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 48 treesize of output 38 [2018-04-06 19:33:34,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:33:34,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:33:34,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:33:34,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:33:34,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:33:34,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:33:34,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 93 [2018-04-06 19:33:34,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:33:34,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:33:34,513 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-06 19:33:34,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:106 [2018-04-06 19:33:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:33:35,446 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:33:37,811 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 59 treesize of output 51 [2018-04-06 19:33:37,844 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:33:37,844 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:33:37,844 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:33:37,845 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:33:37,845 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:33:37,845 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 19:33:37,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 49 [2018-04-06 19:33:37,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:37,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:33:37,871 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-06 19:33:37,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:93 [2018-04-06 19:33:38,286 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 27 treesize of output 21 [2018-04-06 19:33:38,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:38,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-06 19:33:38,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3 [2018-04-06 19:33:38,314 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:38,319 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:33:38,332 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 27 treesize of output 21 [2018-04-06 19:33:38,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:38,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-06 19:33:38,359 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 12 treesize of output 3 [2018-04-06 19:33:38,359 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:33:38,363 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:33:38,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:33:38,374 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-06 19:33:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:33:38,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:33:38,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 86 [2018-04-06 19:33:38,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-06 19:33:38,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-06 19:33:38,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=7080, Unknown=1, NotChecked=0, Total=7482 [2018-04-06 19:33:38,537 INFO L87 Difference]: Start difference. First operand 301 states and 321 transitions. Second operand 87 states. [2018-04-06 19:33:40,851 WARN L148 SmtUtils]: Spent 668ms on a formula simplification that was a NOOP. DAG size: 60 [2018-04-06 19:33:41,803 WARN L148 SmtUtils]: Spent 669ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-06 19:33:45,296 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 97 DAG size of output 96 [2018-04-06 19:33:45,852 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 115 DAG size of output 101 [2018-04-06 19:33:46,145 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 108 DAG size of output 94 Received shutdown request... [2018-04-06 19:33:48,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-06 19:33:48,524 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-06 19:33:48,527 WARN L197 ceAbstractionStarter]: Timeout [2018-04-06 19:33:48,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 07:33:48 BoogieIcfgContainer [2018-04-06 19:33:48,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-06 19:33:48,528 INFO L168 Benchmark]: Toolchain (without parser) took 249302.29 ms. Allocated memory was 307.2 MB in the beginning and 443.5 MB in the end (delta: 136.3 MB). Free memory was 244.6 MB in the beginning and 347.7 MB in the end (delta: -103.1 MB). Peak memory consumption was 136.5 MB. Max. memory is 5.3 GB. [2018-04-06 19:33:48,529 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 307.2 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-06 19:33:48,530 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.11 ms. Allocated memory is still 307.2 MB. Free memory was 244.6 MB in the beginning and 220.6 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-06 19:33:48,530 INFO L168 Benchmark]: Boogie Preprocessor took 58.62 ms. Allocated memory is still 307.2 MB. Free memory was 220.6 MB in the beginning and 217.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-06 19:33:48,530 INFO L168 Benchmark]: RCFGBuilder took 509.69 ms. Allocated memory was 307.2 MB in the beginning and 467.1 MB in the end (delta: 159.9 MB). Free memory was 217.6 MB in the beginning and 401.2 MB in the end (delta: -183.6 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. [2018-04-06 19:33:48,531 INFO L168 Benchmark]: TraceAbstraction took 248395.41 ms. Allocated memory was 467.1 MB in the beginning and 443.5 MB in the end (delta: -23.6 MB). Free memory was 401.2 MB in the beginning and 347.7 MB in the end (delta: 53.5 MB). Peak memory consumption was 133.2 MB. Max. memory is 5.3 GB. [2018-04-06 19:33:48,532 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.21 ms. Allocated memory is still 307.2 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 334.11 ms. Allocated memory is still 307.2 MB. Free memory was 244.6 MB in the beginning and 220.6 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 58.62 ms. Allocated memory is still 307.2 MB. Free memory was 220.6 MB in the beginning and 217.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 509.69 ms. Allocated memory was 307.2 MB in the beginning and 467.1 MB in the end (delta: 159.9 MB). Free memory was 217.6 MB in the beginning and 401.2 MB in the end (delta: -183.6 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 248395.41 ms. Allocated memory was 467.1 MB in the beginning and 443.5 MB in the end (delta: -23.6 MB). Free memory was 401.2 MB in the beginning and 347.7 MB in the end (delta: 53.5 MB). Peak memory consumption was 133.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 53 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 133 known predicates. - TimeoutResultAtElement [Line: 564]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 53 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 133 known predicates. - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 53 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 133 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 53 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 133 known predicates. - TimeoutResultAtElement [Line: 564]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 53 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 133 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 53 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 133 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 53 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 133 known predicates. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 53 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 133 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 53 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 133 known predicates. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 53 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 133 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (301states) and interpolant automaton (currently 53 states, 87 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 133 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 89 locations, 11 error locations. TIMEOUT Result, 248.3s OverallTime, 41 OverallIterations, 10 TraceHistogramMax, 189.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2870 SDtfs, 12656 SDslu, 48026 SDs, 0 SdLazy, 50977 SolverSat, 2337 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 50.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6568 GetRequests, 3710 SyntacticMatches, 41 SemanticMatches, 2816 ConstructedPredicates, 40 IntricatePredicates, 0 DeprecatedPredicates, 90322 ImplicationChecksByTransitivity, 181.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=40, 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.8s AutomataMinimizationTime, 40 MinimizatonAttempts, 2668 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 55.2s InterpolantComputationTime, 2543 NumberOfCodeBlocks, 2543 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 5004 ConstructedInterpolants, 814 QuantifiedInterpolants, 6874163 SizeOfPredicates, 923 NumberOfNonLiveVariables, 7743 ConjunctsInSsa, 1876 ConjunctsInUnsatCore, 82 InterpolantComputations, 38 PerfectInterpolantSequences, 0/3682 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_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-06_19-33-48-538.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-06_19-33-48-538.csv Completed graceful shutdown