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-453dfda-m [2018-04-09 20:18:08,892 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 20:18:08,894 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 20:18:08,909 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 20:18:08,910 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 20:18:08,910 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 20:18:08,912 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 20:18:08,914 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 20:18:08,916 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 20:18:08,917 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 20:18:08,918 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 20:18:08,918 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 20:18:08,919 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 20:18:08,920 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 20:18:08,921 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 20:18:08,923 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 20:18:08,925 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 20:18:08,927 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 20:18:08,929 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 20:18:08,930 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 20:18:08,932 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 20:18:08,933 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 20:18:08,933 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 20:18:08,934 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 20:18:08,935 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 20:18:08,936 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 20:18:08,936 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 20:18:08,937 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 20:18:08,938 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 20:18:08,938 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 20:18:08,939 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 20:18:08,939 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-09 20:18:08,964 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 20:18:08,964 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 20:18:08,964 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 20:18:08,964 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 20:18:08,965 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 20:18:08,965 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 20:18:08,966 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 20:18:08,966 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 20:18:08,966 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 20:18:08,966 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 20:18:08,967 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 20:18:08,967 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 20:18:08,967 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 20:18:08,967 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 20:18:08,967 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 20:18:08,968 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 20:18:08,968 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 20:18:08,968 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 20:18:08,968 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 20:18:08,968 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 20:18:08,968 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 20:18:08,969 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 20:18:08,969 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 20:18:08,969 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 20:18:08,969 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 20:18:08,969 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 20:18:08,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 20:18:08,970 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 20:18:08,970 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 20:18:08,970 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 20:18:08,970 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 20:18:08,970 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 20:18:08,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:18:08,971 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 20:18:08,972 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 20:18:08,972 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 20:18:08,972 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 20:18:08,972 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 20:18:09,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 20:18:09,019 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 20:18:09,023 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 20:18:09,024 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 20:18:09,025 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 20:18:09,025 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-09 20:18:09,395 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG783ae5229 [2018-04-09 20:18:09,560 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 20:18:09,561 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 20:18:09,562 INFO L168 CDTParser]: Scanning openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:18:09,574 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 20:18:09,574 INFO L215 ultiparseSymbolTable]: [2018-04-09 20:18:09,574 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 20:18:09,574 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-09 20:18:09,574 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-09 20:18:09,574 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:18:09,575 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-09 20:18:09,575 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 20:18:09,575 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-09 20:18:09,575 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-09 20:18:09,575 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-09 20:18:09,575 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-09 20:18:09,575 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-09 20:18:09,575 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-09 20:18:09,575 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-09 20:18:09,576 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-09 20:18:09,576 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-09 20:18:09,576 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-09 20:18:09,576 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-09 20:18:09,576 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-09 20:18:09,576 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-09 20:18:09,576 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-09 20:18:09,576 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-09 20:18:09,576 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-09 20:18:09,576 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-09 20:18:09,576 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-09 20:18:09,576 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-09 20:18:09,577 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-09 20:18:09,577 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-09 20:18:09,577 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-09 20:18:09,577 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-09 20:18:09,577 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-09 20:18:09,577 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-09 20:18:09,577 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-09 20:18:09,577 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-09 20:18:09,577 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-09 20:18:09,578 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-09 20:18:09,578 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-09 20:18:09,578 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-09 20:18:09,578 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-09 20:18:09,578 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-09 20:18:09,578 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-09 20:18:09,578 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-09 20:18:09,578 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-09 20:18:09,579 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-09 20:18:09,579 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-09 20:18:09,579 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-09 20:18:09,579 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-09 20:18:09,579 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-09 20:18:09,579 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-09 20:18:09,579 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-09 20:18:09,579 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-09 20:18:09,580 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-09 20:18:09,580 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-09 20:18:09,580 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-09 20:18:09,580 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-09 20:18:09,580 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-09 20:18:09,580 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-09 20:18:09,580 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-09 20:18:09,580 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-09 20:18:09,581 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-09 20:18:09,581 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-09 20:18:09,581 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-09 20:18:09,581 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-09 20:18:09,581 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-09 20:18:09,581 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-09 20:18:09,581 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-09 20:18:09,581 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-09 20:18:09,581 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-09 20:18:09,582 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-09 20:18:09,582 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-09 20:18:09,582 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-09 20:18:09,582 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-09 20:18:09,582 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-09 20:18:09,582 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-09 20:18:09,582 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-09 20:18:09,582 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-09 20:18:09,582 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-09 20:18:09,582 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-09 20:18:09,582 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-09 20:18:09,583 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-09 20:18:09,583 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-09 20:18:09,583 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-09 20:18:09,583 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-09 20:18:09,583 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-09 20:18:09,583 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-09 20:18:09,583 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-09 20:18:09,583 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-09 20:18:09,583 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-09 20:18:09,583 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-09 20:18:09,583 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-09 20:18:09,583 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-09 20:18:09,583 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-09 20:18:09,583 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-09 20:18:09,583 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-09 20:18:09,584 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-09 20:18:09,584 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-09 20:18:09,584 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-09 20:18:09,584 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-09 20:18:09,584 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-09 20:18:09,584 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-09 20:18:09,584 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-09 20:18:09,584 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-09 20:18:09,584 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-09 20:18:09,584 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-09 20:18:09,584 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-09 20:18:09,584 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-09 20:18:09,585 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-09 20:18:09,585 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-09 20:18:09,585 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-09 20:18:09,585 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-09 20:18:09,585 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-09 20:18:09,585 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-09 20:18:09,585 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-09 20:18:09,585 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-09 20:18:09,586 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-09 20:18:09,586 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-09 20:18:09,586 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-09 20:18:09,586 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-09 20:18:09,586 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-09 20:18:09,586 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-09 20:18:09,586 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-09 20:18:09,586 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-09 20:18:09,586 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-09 20:18:09,587 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-09 20:18:09,587 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-09 20:18:09,587 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-09 20:18:09,587 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-09 20:18:09,605 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG783ae5229 [2018-04-09 20:18:09,609 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 20:18:09,611 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 20:18:09,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 20:18:09,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 20:18:09,619 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 20:18:09,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 08:18:09" (1/1) ... [2018-04-09 20:18:09,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@95e4a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:18:09, skipping insertion in model container [2018-04-09 20:18:09,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 08:18:09" (1/1) ... [2018-04-09 20:18:09,635 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 20:18:09,666 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 20:18:09,831 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 20:18:09,880 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 20:18:09,888 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-09 20:18:09,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:18:09 WrapperNode [2018-04-09 20:18:09,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 20:18:09,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 20:18:09,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 20:18:09,937 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 20:18:09,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:18:09" (1/1) ... [2018-04-09 20:18:09,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:18:09" (1/1) ... [2018-04-09 20:18:09,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:18:09" (1/1) ... [2018-04-09 20:18:09,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:18:09" (1/1) ... [2018-04-09 20:18:09,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:18:09" (1/1) ... [2018-04-09 20:18:09,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:18:09" (1/1) ... [2018-04-09 20:18:09,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:18:09" (1/1) ... [2018-04-09 20:18:09,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 20:18:09,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 20:18:09,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 20:18:09,995 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 20:18:09,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:18:09" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 20:18:10,116 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 20:18:10,116 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 20:18:10,116 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-09 20:18:10,116 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-09 20:18:10,116 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcat [2018-04-09 20:18:10,116 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 20:18:10,117 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-09 20:18:10,117 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-09 20:18:10,117 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 20:18:10,117 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 20:18:10,117 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 20:18:10,117 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 20:18:10,117 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 20:18:10,118 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 20:18:10,118 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 20:18:10,118 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 20:18:10,118 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 20:18:10,118 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 20:18:10,118 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 20:18:10,118 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 20:18:10,119 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 20:18:10,119 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 20:18:10,119 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 20:18:10,119 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 20:18:10,119 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 20:18:10,119 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 20:18:10,119 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 20:18:10,120 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 20:18:10,120 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 20:18:10,120 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 20:18:10,120 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 20:18:10,120 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 20:18:10,120 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 20:18:10,120 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 20:18:10,120 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 20:18:10,120 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 20:18:10,120 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 20:18:10,121 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 20:18:10,121 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 20:18:10,121 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 20:18:10,121 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 20:18:10,121 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 20:18:10,121 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 20:18:10,121 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 20:18:10,121 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 20:18:10,121 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 20:18:10,122 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 20:18:10,122 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 20:18:10,122 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 20:18:10,122 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 20:18:10,122 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 20:18:10,122 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 20:18:10,122 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 20:18:10,122 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 20:18:10,122 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 20:18:10,122 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 20:18:10,123 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 20:18:10,123 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 20:18:10,123 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 20:18:10,123 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 20:18:10,123 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 20:18:10,123 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 20:18:10,123 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 20:18:10,123 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 20:18:10,123 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 20:18:10,123 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 20:18:10,123 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 20:18:10,123 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 20:18:10,123 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 20:18:10,124 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 20:18:10,124 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 20:18:10,124 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 20:18:10,124 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 20:18:10,124 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 20:18:10,124 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 20:18:10,124 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 20:18:10,124 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 20:18:10,124 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 20:18:10,124 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 20:18:10,124 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 20:18:10,124 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 20:18:10,124 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 20:18:10,125 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 20:18:10,125 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 20:18:10,125 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 20:18:10,125 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 20:18:10,125 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 20:18:10,125 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 20:18:10,125 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 20:18:10,125 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 20:18:10,125 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 20:18:10,126 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 20:18:10,126 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 20:18:10,126 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 20:18:10,126 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 20:18:10,126 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 20:18:10,126 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 20:18:10,126 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 20:18:10,126 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 20:18:10,127 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 20:18:10,127 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 20:18:10,127 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 20:18:10,127 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 20:18:10,127 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 20:18:10,127 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 20:18:10,127 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 20:18:10,128 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 20:18:10,128 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 20:18:10,128 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 20:18:10,128 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcat [2018-04-09 20:18:10,128 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 20:18:10,128 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 20:18:10,128 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 20:18:10,128 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 20:18:10,128 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 20:18:10,128 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 20:18:10,129 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 20:18:10,129 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 20:18:10,490 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 20:18:10,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 08:18:10 BoogieIcfgContainer [2018-04-09 20:18:10,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 20:18:10,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 20:18:10,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 20:18:10,493 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 20:18:10,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 08:18:09" (1/3) ... [2018-04-09 20:18:10,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5c48e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 08:18:10, skipping insertion in model container [2018-04-09 20:18:10,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:18:09" (2/3) ... [2018-04-09 20:18:10,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5c48e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 08:18:10, skipping insertion in model container [2018-04-09 20:18:10,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 08:18:10" (3/3) ... [2018-04-09 20:18:10,496 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 20:18:10,505 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 20:18:10,513 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-04-09 20:18:10,551 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 20:18:10,552 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 20:18:10,552 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 20:18:10,552 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 20:18:10,552 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 20:18:10,552 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 20:18:10,552 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 20:18:10,552 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 20:18:10,552 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 20:18:10,553 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 20:18:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-04-09 20:18:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-09 20:18:10,574 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:10,575 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-09 20:18:10,575 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-09 20:18:10,579 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-09 20:18:10,594 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:10,629 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:10,664 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:10,697 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:10,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 20:18:10,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 20:18:10,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 20:18:10,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 20:18:10,712 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states. [2018-04-09 20:18:10,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:10,804 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-04-09 20:18:10,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 20:18:10,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-04-09 20:18:10,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:10,818 INFO L225 Difference]: With dead ends: 112 [2018-04-09 20:18:10,818 INFO L226 Difference]: Without dead ends: 75 [2018-04-09 20:18:10,822 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-09 20:18:10,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-09 20:18:10,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-09 20:18:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-09 20:18:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-04-09 20:18:10,867 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 21 [2018-04-09 20:18:10,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:10,868 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-04-09 20:18:10,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 20:18:10,868 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-04-09 20:18:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-09 20:18:10,869 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:10,869 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-09 20:18:10,869 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-09 20:18:10,869 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-09 20:18:10,879 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:10,898 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:10,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:10,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:10,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:10,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 20:18:10,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 20:18:10,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:10,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:18:10,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-09 20:18:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:10,965 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:10,997 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:10,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 20:18:10,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 20:18:10,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 20:18:10,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 20:18:11,000 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 4 states. [2018-04-09 20:18:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:11,068 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-04-09 20:18:11,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 20:18:11,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-04-09 20:18:11,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:11,070 INFO L225 Difference]: With dead ends: 75 [2018-04-09 20:18:11,070 INFO L226 Difference]: Without dead ends: 74 [2018-04-09 20:18:11,071 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-09 20:18:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-04-09 20:18:11,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-04-09 20:18:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-09 20:18:11,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-04-09 20:18:11,081 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2018-04-09 20:18:11,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:11,082 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-04-09 20:18:11,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 20:18:11,082 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-04-09 20:18:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-09 20:18:11,083 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:11,083 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-09 20:18:11,083 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-09 20:18:11,084 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-09 20:18:11,092 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:11,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:11,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:11,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:11,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:11,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:11,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:11,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-09 20:18:11,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:11,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 20:18:11,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:11,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:11,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:11,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:18:11,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:11,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:11,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-09 20:18:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:11,346 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:11,488 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:11,488 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-04-09 20:18:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:11,538 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:11,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-09 20:18:11,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 20:18:11,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 20:18:11,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-09 20:18:11,539 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 9 states. [2018-04-09 20:18:11,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:11,662 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-04-09 20:18:11,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 20:18:11,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-04-09 20:18:11,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:11,664 INFO L225 Difference]: With dead ends: 74 [2018-04-09 20:18:11,664 INFO L226 Difference]: Without dead ends: 73 [2018-04-09 20:18:11,664 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-09 20:18:11,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-09 20:18:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-04-09 20:18:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-09 20:18:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-04-09 20:18:11,672 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 24 [2018-04-09 20:18:11,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:11,672 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-04-09 20:18:11,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 20:18:11,673 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-04-09 20:18:11,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-09 20:18:11,673 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:11,673 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-09 20:18:11,673 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-09 20:18:11,674 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-09 20:18:11,681 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:11,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:11,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:11,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:11,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:11,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 20:18:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:11,737 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:11,798 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:11,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 20:18:11,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 20:18:11,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 20:18:11,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 20:18:11,800 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2018-04-09 20:18:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:11,861 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-04-09 20:18:11,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 20:18:11,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-09 20:18:11,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:11,863 INFO L225 Difference]: With dead ends: 73 [2018-04-09 20:18:11,863 INFO L226 Difference]: Without dead ends: 72 [2018-04-09 20:18:11,863 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-09 20:18:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-09 20:18:11,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-04-09 20:18:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-09 20:18:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-04-09 20:18:11,870 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 25 [2018-04-09 20:18:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:11,871 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-04-09 20:18:11,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 20:18:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-04-09 20:18:11,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-09 20:18:11,872 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:11,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] [2018-04-09 20:18:11,872 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-09 20:18:11,872 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-09 20:18:11,885 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:11,904 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:11,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:11,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:11,962 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-09 20:18:11,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-04-09 20:18:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:11,986 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:12,059 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:12,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-04-09 20:18:12,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 20:18:12,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 20:18:12,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-09 20:18:12,060 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 8 states. [2018-04-09 20:18:12,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:12,147 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-04-09 20:18:12,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 20:18:12,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-09 20:18:12,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:12,148 INFO L225 Difference]: With dead ends: 72 [2018-04-09 20:18:12,148 INFO L226 Difference]: Without dead ends: 71 [2018-04-09 20:18:12,149 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-09 20:18:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-09 20:18:12,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-04-09 20:18:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-09 20:18:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-04-09 20:18:12,154 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 25 [2018-04-09 20:18:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:12,155 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-04-09 20:18:12,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 20:18:12,155 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-04-09 20:18:12,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-09 20:18:12,155 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:12,155 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-09 20:18:12,155 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-09 20:18:12,156 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-09 20:18:12,161 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:12,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:12,204 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:12,234 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:12,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 20:18:12,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 20:18:12,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 20:18:12,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 20:18:12,236 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2018-04-09 20:18:12,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:12,293 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-04-09 20:18:12,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 20:18:12,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-09 20:18:12,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:12,294 INFO L225 Difference]: With dead ends: 74 [2018-04-09 20:18:12,294 INFO L226 Difference]: Without dead ends: 73 [2018-04-09 20:18:12,295 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-09 20:18:12,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-09 20:18:12,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2018-04-09 20:18:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-09 20:18:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-04-09 20:18:12,299 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 31 [2018-04-09 20:18:12,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:12,300 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-04-09 20:18:12,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 20:18:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-04-09 20:18:12,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-09 20:18:12,300 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:12,301 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-09 20:18:12,301 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-09 20:18:12,301 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-09 20:18:12,312 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:12,332 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:12,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-09 20:18:12,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:12,345 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-09 20:18:12,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-09 20:18:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:12,378 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:12,466 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:12,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2018-04-09 20:18:12,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:18:12,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:18:12,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-09 20:18:12,467 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 12 states. [2018-04-09 20:18:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:12,631 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-04-09 20:18:12,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 20:18:12,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-04-09 20:18:12,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:12,632 INFO L225 Difference]: With dead ends: 87 [2018-04-09 20:18:12,632 INFO L226 Difference]: Without dead ends: 86 [2018-04-09 20:18:12,633 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-09 20:18:12,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-09 20:18:12,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2018-04-09 20:18:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-09 20:18:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-04-09 20:18:12,642 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 31 [2018-04-09 20:18:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:12,642 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-04-09 20:18:12,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:18:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-04-09 20:18:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-09 20:18:12,644 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:12,644 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:18:12,644 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-09 20:18:12,645 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-09 20:18:12,651 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:12,691 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:12,720 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:12,746 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:12,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 20:18:12,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 20:18:12,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 20:18:12,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-09 20:18:12,747 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2018-04-09 20:18:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:12,792 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-04-09 20:18:12,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 20:18:12,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-04-09 20:18:12,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:12,793 INFO L225 Difference]: With dead ends: 79 [2018-04-09 20:18:12,793 INFO L226 Difference]: Without dead ends: 78 [2018-04-09 20:18:12,794 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-09 20:18:12,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-09 20:18:12,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-04-09 20:18:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-09 20:18:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-04-09 20:18:12,801 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-04-09 20:18:12,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:12,801 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-04-09 20:18:12,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 20:18:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-04-09 20:18:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-09 20:18:12,803 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:12,803 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:18:12,803 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-09 20:18:12,803 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-09 20:18:12,809 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:12,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:12,870 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:12,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-09 20:18:12,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:12,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-09 20:18:12,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:12,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:12,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-09 20:18:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:12,944 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:12,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-09 20:18:12,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 20:18:12,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 20:18:12,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-09 20:18:12,945 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 9 states. [2018-04-09 20:18:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:13,052 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-04-09 20:18:13,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:18:13,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-04-09 20:18:13,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:13,053 INFO L225 Difference]: With dead ends: 85 [2018-04-09 20:18:13,053 INFO L226 Difference]: Without dead ends: 84 [2018-04-09 20:18:13,054 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-04-09 20:18:13,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-09 20:18:13,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-04-09 20:18:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-09 20:18:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-04-09 20:18:13,060 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 39 [2018-04-09 20:18:13,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:13,061 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-04-09 20:18:13,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 20:18:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-04-09 20:18:13,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 20:18:13,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:13,062 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-09 20:18:13,062 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-09 20:18:13,062 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-09 20:18:13,069 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:13,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:13,132 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:13,174 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:13,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 20:18:13,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 20:18:13,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 20:18:13,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-09 20:18:13,175 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 6 states. [2018-04-09 20:18:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:13,228 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-04-09 20:18:13,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 20:18:13,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-04-09 20:18:13,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:13,230 INFO L225 Difference]: With dead ends: 84 [2018-04-09 20:18:13,230 INFO L226 Difference]: Without dead ends: 83 [2018-04-09 20:18:13,230 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-09 20:18:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-09 20:18:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-09 20:18:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-09 20:18:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-04-09 20:18:13,235 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 40 [2018-04-09 20:18:13,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:13,236 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-04-09 20:18:13,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 20:18:13,236 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-04-09 20:18:13,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 20:18:13,237 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:13,237 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-09 20:18:13,237 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-09 20:18:13,237 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-09 20:18:13,247 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:13,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:13,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:13,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:13,286 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-09 20:18:13,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-09 20:18:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:13,337 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:13,530 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:13,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2018-04-09 20:18:13,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-09 20:18:13,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-09 20:18:13,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-04-09 20:18:13,531 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 16 states. [2018-04-09 20:18:13,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:13,794 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-04-09 20:18:13,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 20:18:13,795 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-04-09 20:18:13,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:13,797 INFO L225 Difference]: With dead ends: 110 [2018-04-09 20:18:13,797 INFO L226 Difference]: Without dead ends: 109 [2018-04-09 20:18:13,798 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-09 20:18:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-09 20:18:13,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2018-04-09 20:18:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-09 20:18:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-04-09 20:18:13,803 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 40 [2018-04-09 20:18:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:13,803 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-04-09 20:18:13,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-09 20:18:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-04-09 20:18:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-09 20:18:13,804 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:13,805 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-09 20:18:13,805 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-09 20:18:13,805 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-09 20:18:13,812 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:13,830 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:13,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:13,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:13,863 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-09 20:18:13,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-09 20:18:13,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:18:13,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:18:13,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:13,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:13,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:18:13,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-09 20:18:14,023 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-09 20:18:14,034 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-09 20:18:14,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:18:14,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:14,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:14,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35 [2018-04-09 20:18:14,126 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-09 20:18:14,126 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:14,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-09 20:18:14,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 20:18:14,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:14,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:14,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:14,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:38 [2018-04-09 20:18:14,534 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-09 20:18:14,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:18:14,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-04-09 20:18:14,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-09 20:18:14,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-09 20:18:14,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-04-09 20:18:14,556 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 25 states. [2018-04-09 20:18:15,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:15,495 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-04-09 20:18:15,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-09 20:18:15,495 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 45 [2018-04-09 20:18:15,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:15,496 INFO L225 Difference]: With dead ends: 124 [2018-04-09 20:18:15,496 INFO L226 Difference]: Without dead ends: 123 [2018-04-09 20:18:15,497 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=1407, Unknown=0, NotChecked=0, Total=1640 [2018-04-09 20:18:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-09 20:18:15,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2018-04-09 20:18:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-09 20:18:15,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-04-09 20:18:15,505 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 45 [2018-04-09 20:18:15,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:15,506 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-04-09 20:18:15,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-09 20:18:15,506 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-04-09 20:18:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-09 20:18:15,507 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:15,507 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-09 20:18:15,508 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-09 20:18:15,508 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-09 20:18:15,520 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:15,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:15,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:15,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:15,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:15,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 20:18:15,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:15,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:15,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:18:15,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:15,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:15,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-09 20:18:15,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:18:15,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:18:15,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:15,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:15,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:18:15,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-09 20:18:15,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-09 20:18:15,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:18:15,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:15,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:15,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-09 20:18:15,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-09 20:18:15,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-04-09 20:18:15,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-09 20:18:15,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:18:15,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 20:18:15,859 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:15,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:15,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:15,872 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-04-09 20:18:15,939 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-09 20:18:15,939 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:16,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-09 20:18:16,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:16,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-09 20:18:16,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 20:18:16,219 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:16,220 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:16,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:16,225 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-04-09 20:18:16,261 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-09 20:18:16,282 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:18:16,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-04-09 20:18:16,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-09 20:18:16,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-09 20:18:16,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-04-09 20:18:16,283 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 25 states. [2018-04-09 20:18:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:16,972 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-04-09 20:18:16,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-09 20:18:16,972 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-04-09 20:18:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:16,973 INFO L225 Difference]: With dead ends: 133 [2018-04-09 20:18:16,973 INFO L226 Difference]: Without dead ends: 132 [2018-04-09 20:18:16,973 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=219, Invalid=1421, Unknown=0, NotChecked=0, Total=1640 [2018-04-09 20:18:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-09 20:18:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2018-04-09 20:18:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-09 20:18:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-04-09 20:18:16,979 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 50 [2018-04-09 20:18:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:16,979 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-04-09 20:18:16,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-09 20:18:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-04-09 20:18:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-09 20:18:16,981 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:16,981 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-09 20:18:16,981 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-09 20:18:16,981 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-09 20:18:16,987 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:17,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:17,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:17,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:17,033 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-09 20:18:17,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-09 20:18:17,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:18:17,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:18:17,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:17,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:17,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:18:17,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-09 20:18:17,194 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-09 20:18:17,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:17,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-04-09 20:18:17,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:18:17,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:17,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:17,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2018-04-09 20:18:17,321 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-09 20:18:17,322 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:17,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-09 20:18:17,611 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:18:17,612 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-09 20:18:17,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:17,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:17,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:17,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:54 [2018-04-09 20:18:17,780 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-09 20:18:17,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:18:17,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-04-09 20:18:17,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-09 20:18:17,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-09 20:18:17,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2018-04-09 20:18:17,803 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 31 states. [2018-04-09 20:18:19,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:19,017 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2018-04-09 20:18:19,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-09 20:18:19,017 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 52 [2018-04-09 20:18:19,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:19,019 INFO L225 Difference]: With dead ends: 148 [2018-04-09 20:18:19,019 INFO L226 Difference]: Without dead ends: 147 [2018-04-09 20:18:19,020 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=368, Invalid=2388, Unknown=0, NotChecked=0, Total=2756 [2018-04-09 20:18:19,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-09 20:18:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2018-04-09 20:18:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-09 20:18:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-04-09 20:18:19,030 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 52 [2018-04-09 20:18:19,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:19,030 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-04-09 20:18:19,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-09 20:18:19,030 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-04-09 20:18:19,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 20:18:19,031 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:19,031 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-09 20:18:19,031 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-09 20:18:19,031 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-09 20:18:19,037 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:19,056 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:19,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:19,079 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-09 20:18:19,081 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-09 20:18:19,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:19,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:19,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:18:19,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:18:19,134 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-09 20:18:19,139 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-09 20:18:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:19,146 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:19,167 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-09 20:18:19,170 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-09 20:18:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:19,221 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:19,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:18:19,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:18:19,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:18:19,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:18:19,222 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 12 states. [2018-04-09 20:18:19,232 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-09 20:18:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:19,603 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions. [2018-04-09 20:18:19,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:18:19,603 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-04-09 20:18:19,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:19,604 INFO L225 Difference]: With dead ends: 249 [2018-04-09 20:18:19,604 INFO L226 Difference]: Without dead ends: 235 [2018-04-09 20:18:19,605 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-09 20:18:19,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-04-09 20:18:19,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-04-09 20:18:19,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-09 20:18:19,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 252 transitions. [2018-04-09 20:18:19,620 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 252 transitions. Word has length 54 [2018-04-09 20:18:19,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:19,620 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 252 transitions. [2018-04-09 20:18:19,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:18:19,621 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 252 transitions. [2018-04-09 20:18:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-09 20:18:19,621 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:19,621 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-09 20:18:19,621 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-09 20:18:19,621 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-09 20:18:19,627 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:19,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:19,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:19,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-09 20:18:19,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:19,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 20:18:19,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:19,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:19,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:18:19,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:18:19,753 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-09 20:18:19,758 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-09 20:18:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:19,767 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:19,785 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-09 20:18:19,789 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-09 20:18:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:19,831 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:19,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:18:19,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:18:19,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:18:19,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:18:19,832 INFO L87 Difference]: Start difference. First operand 232 states and 252 transitions. Second operand 12 states. [2018-04-09 20:18:19,843 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-09 20:18:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:20,147 INFO L93 Difference]: Finished difference Result 347 states and 375 transitions. [2018-04-09 20:18:20,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:18:20,148 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-09 20:18:20,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:20,150 INFO L225 Difference]: With dead ends: 347 [2018-04-09 20:18:20,150 INFO L226 Difference]: Without dead ends: 333 [2018-04-09 20:18:20,151 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-09 20:18:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-09 20:18:20,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 233. [2018-04-09 20:18:20,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-09 20:18:20,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 253 transitions. [2018-04-09 20:18:20,172 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 253 transitions. Word has length 55 [2018-04-09 20:18:20,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:20,172 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 253 transitions. [2018-04-09 20:18:20,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:18:20,172 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 253 transitions. [2018-04-09 20:18:20,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-09 20:18:20,173 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:20,173 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-09 20:18:20,173 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-09 20:18:20,174 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-09 20:18:20,182 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:20,208 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:20,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:20,277 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-09 20:18:20,297 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-09 20:18:20,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:20,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:20,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:18:20,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:18:20,382 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-09 20:18:20,387 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-09 20:18:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:20,398 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:20,431 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-09 20:18:20,435 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-09 20:18:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:20,491 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:20,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:18:20,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:18:20,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:18:20,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:18:20,493 INFO L87 Difference]: Start difference. First operand 233 states and 253 transitions. Second operand 12 states. [2018-04-09 20:18:20,523 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-09 20:18:20,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:20,982 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-04-09 20:18:20,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:18:20,983 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-09 20:18:20,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:20,984 INFO L225 Difference]: With dead ends: 348 [2018-04-09 20:18:20,985 INFO L226 Difference]: Without dead ends: 334 [2018-04-09 20:18:20,985 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-09 20:18:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-09 20:18:21,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 235. [2018-04-09 20:18:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-09 20:18:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions. [2018-04-09 20:18:21,008 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 55 [2018-04-09 20:18:21,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:21,008 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions. [2018-04-09 20:18:21,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:18:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions. [2018-04-09 20:18:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-09 20:18:21,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:21,010 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-09 20:18:21,010 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-09 20:18:21,010 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-09 20:18:21,021 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:21,042 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:21,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:21,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-09 20:18:21,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:21,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 20:18:21,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:21,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:21,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:18:21,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:18:21,136 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-09 20:18:21,141 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-09 20:18:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:21,151 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:21,175 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-09 20:18:21,179 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-09 20:18:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:21,240 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:21,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:18:21,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:18:21,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:18:21,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:18:21,241 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand 12 states. [2018-04-09 20:18:21,269 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-09 20:18:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:21,755 INFO L93 Difference]: Finished difference Result 349 states and 378 transitions. [2018-04-09 20:18:21,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:18:21,755 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-09 20:18:21,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:21,756 INFO L225 Difference]: With dead ends: 349 [2018-04-09 20:18:21,756 INFO L226 Difference]: Without dead ends: 335 [2018-04-09 20:18:21,757 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-09 20:18:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-04-09 20:18:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 235. [2018-04-09 20:18:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-09 20:18:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions. [2018-04-09 20:18:21,775 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 55 [2018-04-09 20:18:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:21,775 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions. [2018-04-09 20:18:21,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:18:21,776 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions. [2018-04-09 20:18:21,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-09 20:18:21,777 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:21,777 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-09 20:18:21,777 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-09 20:18:21,777 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-09 20:18:21,785 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:21,803 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:21,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:21,823 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-09 20:18:21,824 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-09 20:18:21,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:21,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:21,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:18:21,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:18:21,856 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-09 20:18:21,860 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-09 20:18:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:21,867 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:21,883 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-09 20:18:21,886 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-09 20:18:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:21,925 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:21,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:18:21,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:18:21,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:18:21,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:18:21,927 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand 12 states. [2018-04-09 20:18:21,952 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-09 20:18:22,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:22,300 INFO L93 Difference]: Finished difference Result 350 states and 379 transitions. [2018-04-09 20:18:22,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:18:22,300 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-04-09 20:18:22,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:22,302 INFO L225 Difference]: With dead ends: 350 [2018-04-09 20:18:22,302 INFO L226 Difference]: Without dead ends: 336 [2018-04-09 20:18:22,303 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-09 20:18:22,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-04-09 20:18:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 235. [2018-04-09 20:18:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-09 20:18:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions. [2018-04-09 20:18:22,322 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 56 [2018-04-09 20:18:22,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:22,322 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions. [2018-04-09 20:18:22,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:18:22,322 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions. [2018-04-09 20:18:22,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-09 20:18:22,323 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:22,323 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-09 20:18:22,323 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-09 20:18:22,323 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-09 20:18:22,329 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:22,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:22,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:22,392 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-09 20:18:22,394 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-09 20:18:22,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:22,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:22,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:18:22,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:18:22,448 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-09 20:18:22,456 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-09 20:18:22,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:22,462 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:22,484 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-09 20:18:22,488 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-09 20:18:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:22,537 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:22,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:18:22,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:18:22,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:18:22,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:18:22,538 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand 12 states. [2018-04-09 20:18:22,548 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-09 20:18:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:22,943 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-04-09 20:18:22,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:18:22,943 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-04-09 20:18:22,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:22,945 INFO L225 Difference]: With dead ends: 348 [2018-04-09 20:18:22,945 INFO L226 Difference]: Without dead ends: 334 [2018-04-09 20:18:22,945 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-09 20:18:22,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-09 20:18:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 234. [2018-04-09 20:18:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-09 20:18:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 254 transitions. [2018-04-09 20:18:22,960 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 254 transitions. Word has length 56 [2018-04-09 20:18:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:22,960 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 254 transitions. [2018-04-09 20:18:22,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:18:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 254 transitions. [2018-04-09 20:18:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-09 20:18:22,961 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:22,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, 1] [2018-04-09 20:18:22,961 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-09 20:18:22,961 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-09 20:18:22,975 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:22,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:23,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:23,039 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-09 20:18:23,041 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-09 20:18:23,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:23,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:23,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:18:23,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:18:23,079 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-09 20:18:23,084 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-09 20:18:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:23,094 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:23,124 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-09 20:18:23,128 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-09 20:18:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:23,184 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:23,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:18:23,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:18:23,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:18:23,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:18:23,186 INFO L87 Difference]: Start difference. First operand 234 states and 254 transitions. Second operand 12 states. [2018-04-09 20:18:23,210 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-09 20:18:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:23,584 INFO L93 Difference]: Finished difference Result 349 states and 377 transitions. [2018-04-09 20:18:23,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:18:23,611 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-04-09 20:18:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:23,613 INFO L225 Difference]: With dead ends: 349 [2018-04-09 20:18:23,613 INFO L226 Difference]: Without dead ends: 335 [2018-04-09 20:18:23,614 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-09 20:18:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-04-09 20:18:23,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 234. [2018-04-09 20:18:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-09 20:18:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 254 transitions. [2018-04-09 20:18:23,638 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 254 transitions. Word has length 56 [2018-04-09 20:18:23,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:23,639 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 254 transitions. [2018-04-09 20:18:23,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:18:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 254 transitions. [2018-04-09 20:18:23,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-09 20:18:23,640 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:23,640 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-09 20:18:23,640 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-09 20:18:23,640 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-09 20:18:23,647 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:23,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:23,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:23,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-09 20:18:23,840 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-09 20:18:23,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:23,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:23,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:18:23,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 20:18:23,956 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-09 20:18:23,966 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-09 20:18:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:23,973 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:24,056 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-09 20:18:24,072 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-09 20:18:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:18:24,137 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:18:24,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 20:18:24,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:18:24,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:18:24,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 20:18:24,138 INFO L87 Difference]: Start difference. First operand 234 states and 254 transitions. Second operand 12 states. [2018-04-09 20:18:24,158 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-09 20:18:24,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:24,558 INFO L93 Difference]: Finished difference Result 237 states and 254 transitions. [2018-04-09 20:18:24,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 20:18:24,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-04-09 20:18:24,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:24,560 INFO L225 Difference]: With dead ends: 237 [2018-04-09 20:18:24,560 INFO L226 Difference]: Without dead ends: 223 [2018-04-09 20:18:24,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 20:18:24,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-09 20:18:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 120. [2018-04-09 20:18:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-09 20:18:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-04-09 20:18:24,579 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 57 [2018-04-09 20:18:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:24,580 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-04-09 20:18:24,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:18:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-04-09 20:18:24,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-09 20:18:24,581 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:24,581 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-09 20:18:24,581 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-09 20:18:24,581 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-09 20:18:24,593 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:24,620 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:24,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:24,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:24,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:24,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:24,644 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-09 20:18:24,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-09 20:18:24,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:24,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:24,662 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-09 20:18:24,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:24,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:24,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:24,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:18:24,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:24,678 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-09 20:18:24,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-09 20:18:24,999 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-09 20:18:24,999 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:25,459 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-09 20:18:25,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:25,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 20:18:25,471 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 20:18:25,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:25,472 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-09 20:18:25,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:25,475 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:25,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:25,478 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-09 20:18:25,522 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-09 20:18:25,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:18:25,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-04-09 20:18:25,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-09 20:18:25,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-09 20:18:25,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1373, Unknown=0, NotChecked=0, Total=1482 [2018-04-09 20:18:25,544 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 39 states. [2018-04-09 20:18:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:27,734 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2018-04-09 20:18:27,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-09 20:18:27,735 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 58 [2018-04-09 20:18:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:27,735 INFO L225 Difference]: With dead ends: 152 [2018-04-09 20:18:27,735 INFO L226 Difference]: Without dead ends: 151 [2018-04-09 20:18:27,737 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=573, Invalid=5127, Unknown=0, NotChecked=0, Total=5700 [2018-04-09 20:18:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-09 20:18:27,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 120. [2018-04-09 20:18:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-09 20:18:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-04-09 20:18:27,748 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 58 [2018-04-09 20:18:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:27,748 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-04-09 20:18:27,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-09 20:18:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-04-09 20:18:27,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-09 20:18:27,748 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:27,748 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-09 20:18:27,749 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-09 20:18:27,749 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-09 20:18:27,754 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:27,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:27,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:27,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:27,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:27,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:27,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:27,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 20:18:27,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:27,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 20:18:27,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:27,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:27,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:27,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:18:27,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:27,812 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-09 20:18:27,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 20:18:27,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-09 20:18:27,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 20:18:27,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:27,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:27,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:27,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-09 20:18:27,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-04-09 20:18:27,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:18:27,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:27,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:27,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:18:27,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-09 20:18:27,997 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-09 20:18:28,006 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-09 20:18:28,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:18:28,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:28,032 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-09 20:18:28,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:45 [2018-04-09 20:18:28,100 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-09 20:18:28,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-09 20:18:28,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:18:28,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:28,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:28,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-09 20:18:28,189 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-09 20:18:28,189 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:28,891 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-09 20:18:28,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 20:18:28,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:28,920 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-09 20:18:28,922 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-09 20:18:28,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:28,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:28,927 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-09 20:18:28,929 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-09 20:18:28,929 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:28,930 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:28,940 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-09 20:18:28,957 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-09 20:18:28,957 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:57, output treesize:84 [2018-04-09 20:18:29,192 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-09 20:18:29,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:18:29,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2018-04-09 20:18:29,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-09 20:18:29,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-09 20:18:29,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2018-04-09 20:18:29,214 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 39 states. [2018-04-09 20:18:33,857 WARN L151 SmtUtils]: Spent 587ms on a formula simplification. DAG size of input: 71 DAG size of output 53 [2018-04-09 20:18:34,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:34,425 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-04-09 20:18:34,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-09 20:18:34,425 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 61 [2018-04-09 20:18:34,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:34,426 INFO L225 Difference]: With dead ends: 139 [2018-04-09 20:18:34,426 INFO L226 Difference]: Without dead ends: 138 [2018-04-09 20:18:34,426 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=314, Invalid=2991, Unknown=1, NotChecked=0, Total=3306 [2018-04-09 20:18:34,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-04-09 20:18:34,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 131. [2018-04-09 20:18:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-09 20:18:34,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-04-09 20:18:34,445 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 61 [2018-04-09 20:18:34,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:34,445 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-04-09 20:18:34,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-09 20:18:34,446 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-04-09 20:18:34,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-09 20:18:34,446 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:34,446 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-09 20:18:34,446 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-09 20:18:34,446 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-09 20:18:34,452 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:34,473 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:34,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:34,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:34,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:34,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:34,494 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-09 20:18:34,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-09 20:18:34,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:34,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:34,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:18:34,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:34,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:34,514 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-09 20:18:34,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:34,519 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-09 20:18:34,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-09 20:18:34,865 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-09 20:18:34,865 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:35,556 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-09 20:18:35,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:35,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-09 20:18:35,568 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 20:18:35,568 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:35,569 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-09 20:18:35,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:35,573 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:35,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:35,576 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-09 20:18:35,639 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-09 20:18:35,660 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:18:35,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-04-09 20:18:35,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-09 20:18:35,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-09 20:18:35,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2018-04-09 20:18:35,661 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 46 states. [2018-04-09 20:18:38,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:38,798 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions. [2018-04-09 20:18:38,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-09 20:18:38,798 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 62 [2018-04-09 20:18:38,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:38,799 INFO L225 Difference]: With dead ends: 189 [2018-04-09 20:18:38,799 INFO L226 Difference]: Without dead ends: 188 [2018-04-09 20:18:38,801 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=884, Invalid=7858, Unknown=0, NotChecked=0, Total=8742 [2018-04-09 20:18:38,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-09 20:18:38,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2018-04-09 20:18:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-09 20:18:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions. [2018-04-09 20:18:38,813 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 62 [2018-04-09 20:18:38,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:38,813 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions. [2018-04-09 20:18:38,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-09 20:18:38,813 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions. [2018-04-09 20:18:38,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-09 20:18:38,814 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:38,814 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-09 20:18:38,814 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-09 20:18:38,814 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-09 20:18:38,822 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:38,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:38,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:38,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:38,885 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-09 20:18:38,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-09 20:18:38,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:18:38,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:18:38,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:38,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:38,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:18:38,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-09 20:18:39,000 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-09 20:18:39,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:39,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-04-09 20:18:39,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:18:39,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:39,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:39,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2018-04-09 20:18:39,166 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-09 20:18:39,166 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:39,470 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-09 20:18:39,484 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:18:39,486 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-09 20:18:39,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:39,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:39,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:39,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:54 [2018-04-09 20:18:39,660 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-09 20:18:39,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:18:39,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-04-09 20:18:39,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-09 20:18:39,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-09 20:18:39,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2018-04-09 20:18:39,681 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 35 states. [2018-04-09 20:18:42,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:42,262 INFO L93 Difference]: Finished difference Result 225 states and 236 transitions. [2018-04-09 20:18:42,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-09 20:18:42,263 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 65 [2018-04-09 20:18:42,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:42,264 INFO L225 Difference]: With dead ends: 225 [2018-04-09 20:18:42,264 INFO L226 Difference]: Without dead ends: 224 [2018-04-09 20:18:42,265 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=622, Invalid=4928, Unknown=0, NotChecked=0, Total=5550 [2018-04-09 20:18:42,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-09 20:18:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 201. [2018-04-09 20:18:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-09 20:18:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 211 transitions. [2018-04-09 20:18:42,277 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 211 transitions. Word has length 65 [2018-04-09 20:18:42,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:42,277 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 211 transitions. [2018-04-09 20:18:42,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-09 20:18:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 211 transitions. [2018-04-09 20:18:42,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-09 20:18:42,278 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:42,278 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-09 20:18:42,278 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-09 20:18:42,278 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-09 20:18:42,285 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:42,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:42,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:42,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:42,332 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-09 20:18:42,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-09 20:18:42,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:18:42,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:18:42,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:42,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:42,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:18:42,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-09 20:18:42,636 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-09 20:18:42,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:42,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:42,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:42,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:42,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:42,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:42,651 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-09 20:18:42,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:18:42,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:42,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:42,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-04-09 20:18:42,842 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-09 20:18:42,842 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:43,412 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-09 20:18:43,443 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:18:43,444 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:18:43,444 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:18:43,444 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:18:43,445 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:18:43,445 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:18:43,450 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-09 20:18:43,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:43,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:43,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:43,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:86 [2018-04-09 20:18:43,681 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-09 20:18:43,702 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:18:43,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-04-09 20:18:43,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-09 20:18:43,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-09 20:18:43,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1599, Unknown=0, NotChecked=0, Total=1806 [2018-04-09 20:18:43,703 INFO L87 Difference]: Start difference. First operand 201 states and 211 transitions. Second operand 43 states. [2018-04-09 20:18:45,863 WARN L151 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 97 DAG size of output 89 [2018-04-09 20:18:46,094 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 91 DAG size of output 84 [2018-04-09 20:18:46,341 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 62 DAG size of output 56 [2018-04-09 20:18:46,595 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 67 DAG size of output 63 [2018-04-09 20:18:46,845 WARN L151 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 74 DAG size of output 68 [2018-04-09 20:18:47,593 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 75 DAG size of output 65 [2018-04-09 20:18:48,251 WARN L151 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 73 DAG size of output 63 [2018-04-09 20:18:48,637 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 70 DAG size of output 60 [2018-04-09 20:18:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:18:48,941 INFO L93 Difference]: Finished difference Result 255 states and 272 transitions. [2018-04-09 20:18:48,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-09 20:18:48,941 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 66 [2018-04-09 20:18:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:18:48,942 INFO L225 Difference]: With dead ends: 255 [2018-04-09 20:18:48,942 INFO L226 Difference]: Without dead ends: 254 [2018-04-09 20:18:48,944 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=852, Invalid=5468, Unknown=0, NotChecked=0, Total=6320 [2018-04-09 20:18:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-04-09 20:18:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 229. [2018-04-09 20:18:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-09 20:18:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 243 transitions. [2018-04-09 20:18:48,961 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 243 transitions. Word has length 66 [2018-04-09 20:18:48,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:18:48,961 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 243 transitions. [2018-04-09 20:18:48,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-09 20:18:48,961 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 243 transitions. [2018-04-09 20:18:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-09 20:18:48,962 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:18:48,962 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-09 20:18:48,962 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-09 20:18:48,962 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-09 20:18:48,969 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:18:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:18:48,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:18:48,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:48,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:49,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:18:49,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:49,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:49,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 20:18:49,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:49,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:18:49,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:18:49,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:49,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 20:18:49,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:49,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:49,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-09 20:18:49,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-09 20:18:49,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 20:18:49,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:49,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:49,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:49,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-09 20:18:49,064 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-09 20:18:49,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:18:49,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:49,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:49,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 20:18:49,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-09 20:18:49,240 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-09 20:18:49,248 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-09 20:18:49,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:18:49,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:49,273 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-09 20:18:49,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:49 [2018-04-09 20:18:49,363 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-09 20:18:49,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 20:18:49,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:49,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:49,373 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-09 20:18:49,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-09 20:18:49,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 21 treesize of output 17 [2018-04-09 20:18:49,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-09 20:18:49,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:18:49,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:49,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:18:49,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-09 20:18:49,538 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-09 20:18:49,538 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:18:50,662 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-09 20:18:50,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 20:18:50,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:50,682 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-09 20:18:50,684 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-09 20:18:50,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:50,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:18:50,692 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-09 20:18:50,694 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-09 20:18:50,694 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:50,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-09 20:18:50,715 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-09 20:18:50,715 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:50,719 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-09 20:18:50,720 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-09 20:18:50,729 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-09 20:18:50,781 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-09 20:18:50,848 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-09 20:18:50,848 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:50,850 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-09 20:18:50,850 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:50,852 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:18:50,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-09 20:18:50,854 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:50,924 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-09 20:18:50,925 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-04-09 20:18:50,936 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-09 20:18:50,937 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-04-09 20:18:50,996 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-09 20:18:50,997 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-09 20:18:51,002 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-09 20:18:51,003 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-04-09 20:18:51,030 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 20:18:51,049 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 20:18:51,051 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-09 20:18:51,061 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-09 20:18:51,085 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-09 20:18:51,085 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-09 20:18:51,092 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-09 20:18:51,092 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-04-09 20:18:51,094 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-09 20:18:51,094 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-09 20:18:51,133 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-09 20:18:51,134 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 3 xjuncts. [2018-04-09 20:18:51,139 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-09 20:18:51,139 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-04-09 20:18:51,163 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 20:18:51,181 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-09 20:18:51,207 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-09 20:18:51,234 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-09 20:18:51,234 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 6 variables, input treesize:58, output treesize:84 [2018-04-09 20:18:51,517 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-09 20:18:51,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:18:51,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 48 [2018-04-09 20:18:51,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-09 20:18:51,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-09 20:18:51,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2018-04-09 20:18:51,540 INFO L87 Difference]: Start difference. First operand 229 states and 243 transitions. Second operand 49 states. [2018-04-09 20:18:52,999 WARN L151 SmtUtils]: Spent 231ms on a formula simplification. DAG size of input: 125 DAG size of output 85 [2018-04-09 20:18:54,057 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 104 DAG size of output 73 [2018-04-09 20:18:54,342 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 102 DAG size of output 78 [2018-04-09 20:18:54,675 WARN L151 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 106 DAG size of output 81 [2018-04-09 20:18:54,920 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 92 DAG size of output 67 [2018-04-09 20:18:58,047 WARN L151 SmtUtils]: Spent 3045ms on a formula simplification. DAG size of input: 88 DAG size of output 57 [2018-04-09 20:18:58,517 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 89 DAG size of output 48 [2018-04-09 20:18:58,953 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 98 DAG size of output 45 [2018-04-09 20:18:59,709 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 93 DAG size of output 51 [2018-04-09 20:19:00,120 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 100 DAG size of output 48 [2018-04-09 20:19:00,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:19:00,587 INFO L93 Difference]: Finished difference Result 237 states and 250 transitions. [2018-04-09 20:19:00,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-09 20:19:00,587 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 72 [2018-04-09 20:19:00,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:19:00,588 INFO L225 Difference]: With dead ends: 237 [2018-04-09 20:19:00,588 INFO L226 Difference]: Without dead ends: 236 [2018-04-09 20:19:00,590 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1397 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=887, Invalid=6253, Unknown=0, NotChecked=0, Total=7140 [2018-04-09 20:19:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-09 20:19:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 154. [2018-04-09 20:19:00,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-09 20:19:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-04-09 20:19:00,606 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 72 [2018-04-09 20:19:00,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:19:00,607 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-04-09 20:19:00,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-09 20:19:00,607 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-04-09 20:19:00,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-09 20:19:00,607 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:19:00,607 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-09 20:19:00,607 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-09 20:19:00,607 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-09 20:19:00,613 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:19:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:19:00,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:19:00,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:19:00,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:00,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:19:00,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:00,658 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-09 20:19:00,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-09 20:19:00,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:00,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:00,674 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-09 20:19:00,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:00,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:00,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:00,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:19:00,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:00,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:00,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-09 20:19:00,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:19:00,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:19:00,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:00,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:00,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:19:00,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-09 20:19:00,764 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-09 20:19:00,769 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-09 20:19:00,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:19:00,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:19:00,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:19:00,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:46 [2018-04-09 20:19:01,149 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-09 20:19:01,150 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:19:01,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-09 20:19:01,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 20:19:01,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:01,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:01,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:01,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:45 [2018-04-09 20:19:02,137 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-09 20:19:02,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:02,148 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-09 20:19:02,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:02,159 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-09 20:19:02,172 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-09 20:19:02,172 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:02,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:02,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 20:19:02,200 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-09 20:19:02,200 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:02,204 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:02,213 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-09 20:19:02,213 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-09 20:19:02,273 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-09 20:19:02,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:19:02,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2018-04-09 20:19:02,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-09 20:19:02,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-09 20:19:02,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2590, Unknown=0, NotChecked=0, Total=2756 [2018-04-09 20:19:02,295 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 53 states. [2018-04-09 20:19:03,766 WARN L151 SmtUtils]: Spent 531ms on a formula simplification. DAG size of input: 65 DAG size of output 62 [2018-04-09 20:19:04,298 WARN L151 SmtUtils]: Spent 457ms on a formula simplification. DAG size of input: 58 DAG size of output 57 [2018-04-09 20:19:08,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:19:08,072 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2018-04-09 20:19:08,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-09 20:19:08,072 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 76 [2018-04-09 20:19:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:19:08,073 INFO L225 Difference]: With dead ends: 247 [2018-04-09 20:19:08,073 INFO L226 Difference]: Without dead ends: 246 [2018-04-09 20:19:08,074 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3074 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1009, Invalid=12563, Unknown=0, NotChecked=0, Total=13572 [2018-04-09 20:19:08,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-04-09 20:19:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 154. [2018-04-09 20:19:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-09 20:19:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-04-09 20:19:08,101 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 76 [2018-04-09 20:19:08,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:19:08,101 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-04-09 20:19:08,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-09 20:19:08,101 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-04-09 20:19:08,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-09 20:19:08,102 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:19:08,102 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-09 20:19:08,102 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-09 20:19:08,103 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-09 20:19:08,111 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:19:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:19:08,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:19:08,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:19:08,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:08,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:19:08,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:08,157 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-09 20:19:08,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-09 20:19:08,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:08,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:08,172 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-09 20:19:08,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:08,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:08,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:08,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:19:08,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:08,189 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-09 20:19:08,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-09 20:19:08,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:19:08,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:19:08,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:08,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:08,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:19:08,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-09 20:19:08,413 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-09 20:19:08,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:08,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:08,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:08,424 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-09 20:19:08,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:19:08,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:19:08,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:19:08,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:84 [2018-04-09 20:19:08,810 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-09 20:19:08,810 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:19:09,803 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-09 20:19:09,826 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:09,826 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:09,826 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:09,829 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-09 20:19:09,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:09,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:09,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:09,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:77 [2018-04-09 20:19:10,135 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-09 20:19:10,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:10,148 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-09 20:19:10,161 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-09 20:19:10,161 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:10,164 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:10,176 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-09 20:19:10,191 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-09 20:19:10,191 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:10,196 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:10,207 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-09 20:19:10,207 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:10,217 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-09 20:19:10,217 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-09 20:19:10,292 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-09 20:19:10,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:19:10,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2018-04-09 20:19:10,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-09 20:19:10,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-09 20:19:10,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2969, Unknown=0, NotChecked=0, Total=3192 [2018-04-09 20:19:10,313 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 57 states. [2018-04-09 20:19:11,928 WARN L151 SmtUtils]: Spent 445ms on a formula simplification. DAG size of input: 59 DAG size of output 57 [2018-04-09 20:19:12,349 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 101 DAG size of output 69 [2018-04-09 20:19:14,473 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 96 DAG size of output 82 [2018-04-09 20:19:15,500 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 86 DAG size of output 80 [2018-04-09 20:19:16,496 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 89 DAG size of output 75 [2018-04-09 20:19:19,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:19:19,228 INFO L93 Difference]: Finished difference Result 255 states and 270 transitions. [2018-04-09 20:19:19,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-09 20:19:19,229 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 79 [2018-04-09 20:19:19,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:19:19,230 INFO L225 Difference]: With dead ends: 255 [2018-04-09 20:19:19,230 INFO L226 Difference]: Without dead ends: 254 [2018-04-09 20:19:19,231 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4260 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1506, Invalid=15264, Unknown=0, NotChecked=0, Total=16770 [2018-04-09 20:19:19,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-04-09 20:19:19,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 154. [2018-04-09 20:19:19,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-09 20:19:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-04-09 20:19:19,261 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 79 [2018-04-09 20:19:19,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:19:19,262 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-04-09 20:19:19,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-09 20:19:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-04-09 20:19:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-09 20:19:19,262 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:19:19,263 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-09 20:19:19,263 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-09 20:19:19,263 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-09 20:19:19,271 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:19:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:19:19,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:19:19,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-09 20:19:19,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:19,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:19:19,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:19,313 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-09 20:19:19,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-09 20:19:19,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:19,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:19,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:19:19,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:19,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:19,332 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-09 20:19:19,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:19,337 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-09 20:19:19,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-09 20:19:19,758 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-09 20:19:19,758 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:19:20,697 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-09 20:19:20,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:20,701 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-09 20:19:20,709 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-09 20:19:20,709 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:20,710 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 20:19:20,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:20,712 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:20,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:20,715 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-09 20:19:20,766 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-09 20:19:20,789 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:19:20,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-04-09 20:19:20,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-09 20:19:20,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-09 20:19:20,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2793, Unknown=0, NotChecked=0, Total=2970 [2018-04-09 20:19:20,790 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 55 states. [2018-04-09 20:19:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:19:25,371 INFO L93 Difference]: Finished difference Result 273 states and 289 transitions. [2018-04-09 20:19:25,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-09 20:19:25,371 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 80 [2018-04-09 20:19:25,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:19:25,372 INFO L225 Difference]: With dead ends: 273 [2018-04-09 20:19:25,372 INFO L226 Difference]: Without dead ends: 272 [2018-04-09 20:19:25,373 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-09 20:19:25,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-04-09 20:19:25,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 176. [2018-04-09 20:19:25,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-09 20:19:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 188 transitions. [2018-04-09 20:19:25,393 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 188 transitions. Word has length 80 [2018-04-09 20:19:25,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:19:25,393 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 188 transitions. [2018-04-09 20:19:25,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-09 20:19:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 188 transitions. [2018-04-09 20:19:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-09 20:19:25,394 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:19:25,394 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-09 20:19:25,395 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-09 20:19:25,395 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-09 20:19:25,400 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:19:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:19:25,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:19:25,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:19:25,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:25,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-09 20:19:25,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:25,470 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-09 20:19:25,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-09 20:19:25,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:25,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:25,489 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-09 20:19:25,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:25,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:25,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:25,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:19:25,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:25,508 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-09 20:19:25,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-09 20:19:25,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:19:25,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:19:25,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:25,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:25,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:19:25,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-09 20:19:25,670 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-09 20:19:25,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:25,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-04-09 20:19:25,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:19:25,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:19:25,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:19:25,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:66 [2018-04-09 20:19:26,137 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-09 20:19:26,137 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:19:27,093 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-09 20:19:27,111 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:27,113 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-09 20:19:27,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:27,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:27,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:27,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:61 [2018-04-09 20:19:27,412 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-09 20:19:27,427 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-09 20:19:27,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:27,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:27,445 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-09 20:19:27,445 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:27,458 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-09 20:19:27,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:27,469 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-09 20:19:27,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, 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-09 20:19:27,482 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:27,486 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:27,495 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-09 20:19:27,495 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-09 20:19:27,564 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-09 20:19:27,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:19:27,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 58 [2018-04-09 20:19:27,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-09 20:19:27,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-09 20:19:27,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3219, Unknown=0, NotChecked=0, Total=3422 [2018-04-09 20:19:27,587 INFO L87 Difference]: Start difference. First operand 176 states and 188 transitions. Second operand 59 states. [2018-04-09 20:19:29,049 WARN L148 SmtUtils]: Spent 421ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-09 20:19:29,770 WARN L148 SmtUtils]: Spent 420ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-09 20:19:30,592 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 87 DAG size of output 78 [2018-04-09 20:19:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:19:37,516 INFO L93 Difference]: Finished difference Result 299 states and 314 transitions. [2018-04-09 20:19:37,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-09 20:19:37,517 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 83 [2018-04-09 20:19:37,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:19:37,518 INFO L225 Difference]: With dead ends: 299 [2018-04-09 20:19:37,518 INFO L226 Difference]: Without dead ends: 298 [2018-04-09 20:19:37,519 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4741 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1400, Invalid=17782, Unknown=0, NotChecked=0, Total=19182 [2018-04-09 20:19:37,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-09 20:19:37,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 177. [2018-04-09 20:19:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-09 20:19:37,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2018-04-09 20:19:37,538 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 83 [2018-04-09 20:19:37,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:19:37,538 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2018-04-09 20:19:37,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-09 20:19:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2018-04-09 20:19:37,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-09 20:19:37,539 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:19:37,539 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-09 20:19:37,539 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-09 20:19:37,539 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-09 20:19:37,544 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:19:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:19:37,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:19:37,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:19:37,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:37,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:19:37,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:37,595 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-09 20:19:37,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-09 20:19:37,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:37,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:37,608 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-09 20:19:37,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:37,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:37,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:37,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:19:37,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:37,622 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-09 20:19:37,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-09 20:19:38,148 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-09 20:19:38,148 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:19:39,299 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-09 20:19:39,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:39,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-09 20:19:39,310 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 20:19:39,310 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:39,311 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-09 20:19:39,312 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:39,315 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:39,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:39,317 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-09 20:19:39,412 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-09 20:19:39,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:19:39,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-04-09 20:19:39,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-09 20:19:39,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-09 20:19:39,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=3529, Unknown=0, NotChecked=0, Total=3782 [2018-04-09 20:19:39,434 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand 62 states. [2018-04-09 20:19:45,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:19:45,906 INFO L93 Difference]: Finished difference Result 314 states and 331 transitions. [2018-04-09 20:19:45,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-09 20:19:45,906 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 84 [2018-04-09 20:19:45,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:19:45,908 INFO L225 Difference]: With dead ends: 314 [2018-04-09 20:19:45,908 INFO L226 Difference]: Without dead ends: 313 [2018-04-09 20:19:45,909 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4695 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2143, Invalid=19909, Unknown=0, NotChecked=0, Total=22052 [2018-04-09 20:19:45,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-09 20:19:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 200. [2018-04-09 20:19:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-09 20:19:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-04-09 20:19:45,943 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 84 [2018-04-09 20:19:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:19:45,944 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-04-09 20:19:45,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-09 20:19:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-04-09 20:19:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-09 20:19:45,945 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:19:45,945 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-09 20:19:45,945 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-09 20:19:45,945 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-09 20:19:45,951 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:19:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:19:45,991 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:19:46,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:19:46,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:46,031 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-09 20:19:46,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-09 20:19:46,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:19:46,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:19:46,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:46,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:46,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:19:46,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-09 20:19:47,094 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-09 20:19:47,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:19:47,145 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-09 20:19:47,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:19:47,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:19:47,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:19:47,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:109, output treesize:129 [2018-04-09 20:19:47,653 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-09 20:19:47,653 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:19:49,585 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-09 20:19:49,655 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,655 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,656 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,656 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,656 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,657 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,657 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,657 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,657 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,658 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,660 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,660 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,660 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,661 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,661 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,661 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,661 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,662 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,662 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,662 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,662 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,663 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,663 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,663 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,664 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,664 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,664 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,664 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:19:49,685 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-09 20:19:49,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:19:49,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:19:49,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:19:49,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:150 [2018-04-09 20:19:50,152 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-09 20:19:50,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:19:50,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2018-04-09 20:19:50,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-09 20:19:50,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-09 20:19:50,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=3863, Unknown=0, NotChecked=0, Total=4422 [2018-04-09 20:19:50,174 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 67 states. [2018-04-09 20:19:53,962 WARN L151 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 137 DAG size of output 121 [2018-04-09 20:19:55,222 WARN L151 SmtUtils]: Spent 1168ms on a formula simplification. DAG size of input: 131 DAG size of output 116 [2018-04-09 20:19:55,505 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 88 DAG size of output 74 [2018-04-09 20:19:55,750 WARN L148 SmtUtils]: Spent 150ms on a formula simplification that was a NOOP. DAG size: 97 [2018-04-09 20:19:56,165 WARN L151 SmtUtils]: Spent 339ms on a formula simplification. DAG size of input: 105 DAG size of output 103 [2018-04-09 20:19:56,328 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 84 DAG size of output 70 [2018-04-09 20:19:56,574 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 83 DAG size of output 69 [2018-04-09 20:19:56,888 WARN L151 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 91 DAG size of output 77 [2018-04-09 20:19:57,254 WARN L151 SmtUtils]: Spent 289ms on a formula simplification. DAG size of input: 106 DAG size of output 88 [2018-04-09 20:19:57,937 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 80 DAG size of output 70 [2018-04-09 20:19:58,304 WARN L151 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 104 DAG size of output 88 [2018-04-09 20:19:58,812 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 71 DAG size of output 63 [2018-04-09 20:19:59,163 WARN L151 SmtUtils]: Spent 229ms on a formula simplification. DAG size of input: 103 DAG size of output 87 [2018-04-09 20:19:59,930 WARN L151 SmtUtils]: Spent 210ms on a formula simplification. DAG size of input: 102 DAG size of output 84 [2018-04-09 20:20:01,096 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 74 DAG size of output 68 [2018-04-09 20:20:01,874 WARN L151 SmtUtils]: Spent 562ms on a formula simplification. DAG size of input: 118 DAG size of output 100 [2018-04-09 20:20:03,290 WARN L151 SmtUtils]: Spent 562ms on a formula simplification. DAG size of input: 117 DAG size of output 99 [2018-04-09 20:20:04,377 WARN L151 SmtUtils]: Spent 476ms on a formula simplification. DAG size of input: 114 DAG size of output 96 [2018-04-09 20:20:05,184 WARN L151 SmtUtils]: Spent 402ms on a formula simplification. DAG size of input: 112 DAG size of output 96 [2018-04-09 20:20:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:20:05,236 INFO L93 Difference]: Finished difference Result 341 states and 368 transitions. [2018-04-09 20:20:05,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-09 20:20:05,236 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 94 [2018-04-09 20:20:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:20:05,238 INFO L225 Difference]: With dead ends: 341 [2018-04-09 20:20:05,238 INFO L226 Difference]: Without dead ends: 340 [2018-04-09 20:20:05,238 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4976 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=2775, Invalid=15585, Unknown=0, NotChecked=0, Total=18360 [2018-04-09 20:20:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-04-09 20:20:05,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 256. [2018-04-09 20:20:05,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-09 20:20:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 276 transitions. [2018-04-09 20:20:05,269 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 276 transitions. Word has length 94 [2018-04-09 20:20:05,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:20:05,270 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 276 transitions. [2018-04-09 20:20:05,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-09 20:20:05,270 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 276 transitions. [2018-04-09 20:20:05,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-09 20:20:05,270 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:20:05,270 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-09 20:20:05,270 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-09 20:20:05,271 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-09 20:20:05,276 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:20:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:20:05,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:20:05,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:20:05,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:05,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:20:05,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:05,326 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-09 20:20:05,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-09 20:20:05,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:05,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:05,341 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-09 20:20:05,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:05,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:05,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:05,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:20:05,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:05,357 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-09 20:20:05,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-09 20:20:05,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:20:05,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:20:05,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:05,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:20:05,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:20:05,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-09 20:20:05,690 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-09 20:20:05,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:05,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:05,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:05,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:05,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:05,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:05,706 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-09 20:20:05,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:20:05,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:20:05,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:20:05,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:106 [2018-04-09 20:20:06,319 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-09 20:20:06,319 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:20:07,960 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-09 20:20:07,990 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:07,991 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:07,991 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:07,991 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:07,992 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:07,992 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:07,997 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-09 20:20:07,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:08,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:20:08,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:20:08,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:93 [2018-04-09 20:20:08,397 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-09 20:20:08,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:08,409 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-09 20:20:08,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:08,419 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-09 20:20:08,432 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-09 20:20:08,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:08,436 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:20:08,446 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-09 20:20:08,459 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-09 20:20:08,460 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:08,463 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:20:08,473 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-09 20:20:08,473 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-09 20:20:08,570 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-09 20:20:08,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:20:08,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 70 [2018-04-09 20:20:08,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-09 20:20:08,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-09 20:20:08,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=4657, Unknown=0, NotChecked=0, Total=4970 [2018-04-09 20:20:08,591 INFO L87 Difference]: Start difference. First operand 256 states and 276 transitions. Second operand 71 states. [2018-04-09 20:20:10,258 WARN L148 SmtUtils]: Spent 465ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-09 20:20:10,997 WARN L148 SmtUtils]: Spent 409ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-09 20:20:16,591 WARN L151 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 127 DAG size of output 113 [2018-04-09 20:20:16,858 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 120 DAG size of output 106 [2018-04-09 20:20:18,032 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 97 DAG size of output 88 [2018-04-09 20:20:18,391 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 107 DAG size of output 92 [2018-04-09 20:20:18,976 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 106 DAG size of output 94 [2018-04-09 20:20:19,358 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 90 DAG size of output 81 [2018-04-09 20:20:19,627 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 110 DAG size of output 102 [2018-04-09 20:20:20,188 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 98 DAG size of output 87 [2018-04-09 20:20:21,274 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 114 DAG size of output 94 [2018-04-09 20:20:22,588 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 110 DAG size of output 90 [2018-04-09 20:20:23,586 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 106 DAG size of output 88 [2018-04-09 20:20:24,554 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 102 DAG size of output 88 [2018-04-09 20:20:25,395 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 98 DAG size of output 89 [2018-04-09 20:20:25,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:20:25,541 INFO L93 Difference]: Finished difference Result 457 states and 480 transitions. [2018-04-09 20:20:25,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-04-09 20:20:25,541 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 97 [2018-04-09 20:20:25,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:20:25,542 INFO L225 Difference]: With dead ends: 457 [2018-04-09 20:20:25,542 INFO L226 Difference]: Without dead ends: 456 [2018-04-09 20:20:25,543 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8342 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=2315, Invalid=28485, Unknown=0, NotChecked=0, Total=30800 [2018-04-09 20:20:25,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-09 20:20:25,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 274. [2018-04-09 20:20:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-09 20:20:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 295 transitions. [2018-04-09 20:20:25,593 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 295 transitions. Word has length 97 [2018-04-09 20:20:25,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:20:25,594 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 295 transitions. [2018-04-09 20:20:25,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-09 20:20:25,594 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 295 transitions. [2018-04-09 20:20:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-04-09 20:20:25,595 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:20:25,595 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-09 20:20:25,595 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-09 20:20:25,595 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-09 20:20:25,604 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:20:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:20:25,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:20:25,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:20:25,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:25,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:20:25,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:25,665 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-09 20:20:25,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-09 20:20:25,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:25,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:25,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:20:25,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:25,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:25,692 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-09 20:20:25,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:25,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:20:25,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-09 20:20:25,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:20:25,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:20:25,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:25,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:20:25,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:20:25,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-09 20:20:25,780 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-09 20:20:25,790 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-09 20:20:25,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:20:25,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:20:25,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:20:25,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:46 [2018-04-09 20:20:26,456 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-09 20:20:26,456 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:20:27,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-09 20:20:27,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 20:20:27,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:27,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:20:27,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:20:27,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:45 [2018-04-09 20:20:28,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 20:20:28,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:28,072 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-09 20:20:28,085 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-09 20:20:28,085 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:28,089 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:20:28,100 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-09 20:20:28,125 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-09 20:20:28,126 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:28,131 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:20:28,145 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-09 20:20:28,145 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:28,156 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-09 20:20:28,157 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-09 20:20:28,254 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-09 20:20:28,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:20:28,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2018-04-09 20:20:28,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-09 20:20:28,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-09 20:20:28,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4438, Unknown=0, NotChecked=0, Total=4692 [2018-04-09 20:20:28,276 INFO L87 Difference]: Start difference. First operand 274 states and 295 transitions. Second operand 69 states. [2018-04-09 20:20:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:20:37,056 INFO L93 Difference]: Finished difference Result 444 states and 470 transitions. [2018-04-09 20:20:37,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-04-09 20:20:37,056 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 98 [2018-04-09 20:20:37,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:20:37,058 INFO L225 Difference]: With dead ends: 444 [2018-04-09 20:20:37,058 INFO L226 Difference]: Without dead ends: 443 [2018-04-09 20:20:37,059 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6806 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1884, Invalid=26172, Unknown=0, NotChecked=0, Total=28056 [2018-04-09 20:20:37,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-04-09 20:20:37,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 274. [2018-04-09 20:20:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-09 20:20:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 295 transitions. [2018-04-09 20:20:37,101 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 295 transitions. Word has length 98 [2018-04-09 20:20:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:20:37,101 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 295 transitions. [2018-04-09 20:20:37,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-09 20:20:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 295 transitions. [2018-04-09 20:20:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-04-09 20:20:37,102 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:20:37,102 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-09 20:20:37,102 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-09 20:20:37,103 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-09 20:20:37,113 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:20:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:20:37,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:20:37,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:20:37,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:37,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:20:37,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:37,205 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-09 20:20:37,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-09 20:20:37,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,223 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-09 20:20:37,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:37,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:20:37,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:37,248 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-09 20:20:37,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-09 20:20:37,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:20:37,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:20:37,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:37,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:20:37,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:20:37,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-09 20:20:37,979 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-09 20:20:37,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:37,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:20:38,008 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-09 20:20:38,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:20:38,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:20:38,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:20:38,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:150 [2018-04-09 20:20:38,639 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-09 20:20:38,639 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:20:40,682 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-09 20:20:40,732 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:40,733 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:40,733 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:40,733 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:40,733 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:40,734 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:40,734 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:40,734 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:40,735 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:40,735 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:40,739 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:40,740 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:40,740 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:40,740 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:40,741 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:20:40,751 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-09 20:20:40,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:40,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:20:40,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:20:40,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:107, output treesize:125 [2018-04-09 20:20:41,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, 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-09 20:20:41,203 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-09 20:20:41,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:41,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:20:41,221 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-09 20:20:41,222 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:41,235 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-09 20:20:41,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:41,247 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-09 20:20:41,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-09 20:20:41,262 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:20:41,266 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:20:41,276 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-09 20:20:41,276 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-09 20:20:41,392 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-09 20:20:41,413 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:20:41,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 74 [2018-04-09 20:20:41,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-09 20:20:41,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-09 20:20:41,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=5108, Unknown=0, NotChecked=0, Total=5550 [2018-04-09 20:20:41,414 INFO L87 Difference]: Start difference. First operand 274 states and 295 transitions. Second operand 75 states. [2018-04-09 20:20:43,554 WARN L151 SmtUtils]: Spent 827ms on a formula simplification. DAG size of input: 57 DAG size of output 55 [2018-04-09 20:20:44,028 WARN L151 SmtUtils]: Spent 394ms on a formula simplification. DAG size of input: 59 DAG size of output 57 [2018-04-09 20:20:44,708 WARN L151 SmtUtils]: Spent 446ms on a formula simplification. DAG size of input: 57 DAG size of output 55 [2018-04-09 20:20:44,966 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 131 DAG size of output 69 [2018-04-09 20:20:47,801 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 101 DAG size of output 97 [2018-04-09 20:20:49,100 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 106 DAG size of output 102 [2018-04-09 20:20:50,313 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 111 DAG size of output 107 [2018-04-09 20:20:50,817 WARN L151 SmtUtils]: Spent 231ms on a formula simplification. DAG size of input: 143 DAG size of output 122 [2018-04-09 20:20:51,141 WARN L151 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 136 DAG size of output 117 [2018-04-09 20:20:51,712 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 90 DAG size of output 75 [2018-04-09 20:20:52,073 WARN L151 SmtUtils]: Spent 222ms on a formula simplification. DAG size of input: 109 DAG size of output 94 [2018-04-09 20:20:52,420 WARN L151 SmtUtils]: Spent 258ms on a formula simplification. DAG size of input: 119 DAG size of output 101 [2018-04-09 20:20:52,604 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 98 DAG size of output 81 [2018-04-09 20:20:52,818 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 102 DAG size of output 84 [2018-04-09 20:20:53,106 WARN L151 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 115 DAG size of output 97 [2018-04-09 20:20:55,808 WARN L151 SmtUtils]: Spent 215ms on a formula simplification. DAG size of input: 102 DAG size of output 97 [2018-04-09 20:20:56,276 WARN L151 SmtUtils]: Spent 274ms on a formula simplification. DAG size of input: 122 DAG size of output 111 [2018-04-09 20:20:56,646 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 96 DAG size of output 79 [2018-04-09 20:20:56,919 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 108 DAG size of output 89 [2018-04-09 20:20:58,301 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 97 DAG size of output 88 [2018-04-09 20:20:58,739 WARN L151 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 126 DAG size of output 108 [2018-04-09 20:20:59,413 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 105 DAG size of output 87 [2018-04-09 20:21:00,543 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 96 DAG size of output 88 [2018-04-09 20:21:01,025 WARN L151 SmtUtils]: Spent 253ms on a formula simplification. DAG size of input: 135 DAG size of output 116 [2018-04-09 20:21:01,832 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 105 DAG size of output 91 [2018-04-09 20:21:02,702 WARN L151 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 134 DAG size of output 112 [2018-04-09 20:21:03,317 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 96 DAG size of output 85 [2018-04-09 20:21:03,999 WARN L151 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 131 DAG size of output 106 [2018-04-09 20:21:04,871 WARN L151 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 127 DAG size of output 106 [2018-04-09 20:21:05,687 WARN L151 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 123 DAG size of output 105 [2018-04-09 20:21:06,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:21:06,115 INFO L93 Difference]: Finished difference Result 413 states and 437 transitions. [2018-04-09 20:21:06,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-04-09 20:21:06,116 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 100 [2018-04-09 20:21:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:21:06,117 INFO L225 Difference]: With dead ends: 413 [2018-04-09 20:21:06,117 INFO L226 Difference]: Without dead ends: 412 [2018-04-09 20:21:06,118 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10476 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=3533, Invalid=32377, Unknown=0, NotChecked=0, Total=35910 [2018-04-09 20:21:06,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-04-09 20:21:06,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 256. [2018-04-09 20:21:06,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-09 20:21:06,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 276 transitions. [2018-04-09 20:21:06,154 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 276 transitions. Word has length 100 [2018-04-09 20:21:06,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:21:06,154 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 276 transitions. [2018-04-09 20:21:06,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-09 20:21:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 276 transitions. [2018-04-09 20:21:06,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-04-09 20:21:06,155 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:21:06,156 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-09 20:21:06,156 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-09 20:21:06,156 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-09 20:21:06,161 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:21:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:21:06,194 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:21:06,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:21:06,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:06,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:21:06,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:06,258 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-09 20:21:06,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-09 20:21:06,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:06,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:06,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:21:06,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:06,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:06,281 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-09 20:21:06,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:06,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:21:06,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-09 20:21:06,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:21:06,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:21:06,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:06,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:21:06,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:21:06,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-09 20:21:06,506 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-09 20:21:06,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:06,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:06,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:06,516 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-09 20:21:06,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:21:06,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:21:06,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:21:06,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:84 [2018-04-09 20:21:07,215 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-09 20:21:07,215 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:21:08,778 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-09 20:21:08,800 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:21:08,801 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:21:08,801 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:21:08,804 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-09 20:21:08,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:08,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:21:08,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:21:08,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:77 [2018-04-09 20:21:09,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 27 treesize of output 21 [2018-04-09 20:21:09,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:09,180 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-09 20:21:09,193 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-09 20:21:09,193 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:09,196 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:21:09,208 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-09 20:21:09,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:09,218 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-09 20:21:09,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-09 20:21:09,231 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:09,235 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:21:09,244 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-09 20:21:09,244 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-09 20:21:09,341 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-09 20:21:09,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:21:09,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 72 [2018-04-09 20:21:09,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-09 20:21:09,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-09 20:21:09,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=4965, Unknown=0, NotChecked=0, Total=5256 [2018-04-09 20:21:09,363 INFO L87 Difference]: Start difference. First operand 256 states and 276 transitions. Second operand 73 states. [2018-04-09 20:21:11,140 WARN L148 SmtUtils]: Spent 542ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-09 20:21:11,927 WARN L148 SmtUtils]: Spent 427ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-09 20:21:14,305 WARN L151 SmtUtils]: Spent 371ms on a formula simplification. DAG size of input: 98 DAG size of output 87 [2018-04-09 20:21:15,618 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 89 DAG size of output 86 [2018-04-09 20:21:16,853 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 92 DAG size of output 81 [2018-04-09 20:21:22,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:21:22,910 INFO L93 Difference]: Finished difference Result 475 states and 499 transitions. [2018-04-09 20:21:22,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-04-09 20:21:22,911 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 101 [2018-04-09 20:21:22,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:21:22,912 INFO L225 Difference]: With dead ends: 475 [2018-04-09 20:21:22,912 INFO L226 Difference]: Without dead ends: 474 [2018-04-09 20:21:22,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8524 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=2166, Invalid=30414, Unknown=0, NotChecked=0, Total=32580 [2018-04-09 20:21:22,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-04-09 20:21:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 256. [2018-04-09 20:21:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-09 20:21:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 276 transitions. [2018-04-09 20:21:22,950 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 276 transitions. Word has length 101 [2018-04-09 20:21:22,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:21:22,951 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 276 transitions. [2018-04-09 20:21:22,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-09 20:21:22,951 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 276 transitions. [2018-04-09 20:21:22,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-04-09 20:21:22,951 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:21:22,951 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-09 20:21:22,951 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-09 20:21:22,952 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-09 20:21:22,958 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:21:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:21:22,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:21:23,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:21:23,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:23,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-09 20:21:23,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:23,012 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-09 20:21:23,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-09 20:21:23,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:23,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:23,027 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-09 20:21:23,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:23,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:23,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:23,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-09 20:21:23,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:23,043 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-09 20:21:23,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-09 20:21:23,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:21:23,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 20:21:23,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:23,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:21:23,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:21:23,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-09 20:21:23,332 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-09 20:21:23,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:23,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-04-09 20:21:23,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:21:23,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:21:23,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:21:23,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:66 [2018-04-09 20:21:24,094 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-09 20:21:24,095 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:21:25,681 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-09 20:21:25,698 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:21:25,699 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-09 20:21:25,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:25,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:21:25,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:21:25,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:61 [2018-04-09 20:21:26,050 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-09 20:21:26,065 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-09 20:21:26,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:26,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:21:26,083 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-09 20:21:26,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:26,100 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-09 20:21:26,113 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-09 20:21:26,113 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:26,116 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:21:26,128 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-09 20:21:26,128 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:26,137 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-09 20:21:26,137 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-09 20:21:26,230 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-09 20:21:26,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:21:26,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 74 [2018-04-09 20:21:26,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-09 20:21:26,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-09 20:21:26,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=5259, Unknown=0, NotChecked=0, Total=5550 [2018-04-09 20:21:26,252 INFO L87 Difference]: Start difference. First operand 256 states and 276 transitions. Second operand 75 states. [2018-04-09 20:21:28,342 WARN L148 SmtUtils]: Spent 833ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-09 20:21:28,888 WARN L148 SmtUtils]: Spent 435ms on a formula simplification that was a NOOP. DAG size: 60 [2018-04-09 20:21:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:21:41,048 INFO L93 Difference]: Finished difference Result 441 states and 466 transitions. [2018-04-09 20:21:41,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-04-09 20:21:41,048 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 105 [2018-04-09 20:21:41,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:21:41,049 INFO L225 Difference]: With dead ends: 441 [2018-04-09 20:21:41,050 INFO L226 Difference]: Without dead ends: 440 [2018-04-09 20:21:41,051 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8697 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=2218, Invalid=32192, Unknown=0, NotChecked=0, Total=34410 [2018-04-09 20:21:41,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-04-09 20:21:41,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 256. [2018-04-09 20:21:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-09 20:21:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 276 transitions. [2018-04-09 20:21:41,115 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 276 transitions. Word has length 105 [2018-04-09 20:21:41,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:21:41,116 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 276 transitions. [2018-04-09 20:21:41,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-09 20:21:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 276 transitions. [2018-04-09 20:21:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-04-09 20:21:41,117 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:21:41,117 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-09 20:21:41,117 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-09 20:21:41,117 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-09 20:21:41,126 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:21:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:21:41,168 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:21:41,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:21:41,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:41,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:21:41,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:41,182 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-09 20:21:41,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-09 20:21:41,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:41,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:41,200 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-09 20:21:41,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:41,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:41,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:41,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 20:21:41,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:41,214 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-09 20:21:41,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-09 20:21:42,055 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-09 20:21:42,055 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:21:43,941 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-09 20:21:43,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:43,945 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-09 20:21:43,952 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 20:21:43,952 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:43,953 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-09 20:21:43,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:43,955 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:21:43,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:21:43,958 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-09 20:21:44,040 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-09 20:21:44,060 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:21:44,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 78 [2018-04-09 20:21:44,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-09 20:21:44,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-09 20:21:44,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=5808, Unknown=0, NotChecked=0, Total=6162 [2018-04-09 20:21:44,061 INFO L87 Difference]: Start difference. First operand 256 states and 276 transitions. Second operand 79 states. [2018-04-09 20:21:53,353 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 98 DAG size of output 90 [2018-04-09 20:21:54,343 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 82 DAG size of output 76 [2018-04-09 20:21:55,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:21:55,981 INFO L93 Difference]: Finished difference Result 500 states and 527 transitions. [2018-04-09 20:21:55,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-04-09 20:21:55,982 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 113 [2018-04-09 20:21:55,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:21:55,983 INFO L225 Difference]: With dead ends: 500 [2018-04-09 20:21:55,983 INFO L226 Difference]: Without dead ends: 499 [2018-04-09 20:21:55,984 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10168 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=3672, Invalid=39800, Unknown=0, NotChecked=0, Total=43472 [2018-04-09 20:21:55,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-04-09 20:21:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 301. [2018-04-09 20:21:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-04-09 20:21:56,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 321 transitions. [2018-04-09 20:21:56,025 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 321 transitions. Word has length 113 [2018-04-09 20:21:56,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:21:56,026 INFO L459 AbstractCegarLoop]: Abstraction has 301 states and 321 transitions. [2018-04-09 20:21:56,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-09 20:21:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 321 transitions. [2018-04-09 20:21:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-09 20:21:56,026 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:21:56,027 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-09 20:21:56,027 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-09 20:21:56,027 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-09 20:21:56,035 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:21:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:21:56,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:21:56,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:21:56,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:56,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 20:21:56,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:56,100 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-09 20:21:56,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-09 20:21:56,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:56,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:56,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-09 20:21:56,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:56,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:56,123 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-09 20:21:56,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:56,129 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-09 20:21:56,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-09 20:21:56,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-09 20:21:56,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 11 treesize of output 10 [2018-04-09 20:21:56,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:21:56,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:21:56,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 20:21:56,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-09 20:21:56,920 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-09 20:21:56,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:56,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:56,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:56,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:56,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:56,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 20:21:56,935 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-09 20:21:56,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 20:21:56,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:21:56,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 20:21:56,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:106 [2018-04-09 20:21:57,910 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-09 20:21:57,910 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:22:00,249 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-09 20:22:00,279 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:22:00,279 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:22:00,279 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:22:00,280 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:22:00,280 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:22:00,280 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 20:22:00,284 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-09 20:22:00,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 20:22:00,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:22:00,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:22:00,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:93 [2018-04-09 20:22:00,718 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-09 20:22:00,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:22:00,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 20:22:00,751 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-09 20:22:00,751 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 20:22:00,755 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:22:00,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 20:22:00,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 20:22:00,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 20:22:00,808 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-09 20:22:00,808 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 20:22:00,812 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:22:00,823 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-09 20:22:00,824 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-04-09 20:22:00,954 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-09 20:22:00,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:22:00,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 86 [2018-04-09 20:22:00,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-09 20:22:00,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-09 20:22:00,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=7080, Unknown=1, NotChecked=0, Total=7482 [2018-04-09 20:22:00,977 INFO L87 Difference]: Start difference. First operand 301 states and 321 transitions. Second operand 87 states. [2018-04-09 20:22:02,777 WARN L148 SmtUtils]: Spent 336ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-09 20:22:03,604 WARN L148 SmtUtils]: Spent 433ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-09 20:22:07,653 WARN L151 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 115 DAG size of output 101 [2018-04-09 20:22:07,916 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 108 DAG size of output 94 [2018-04-09 20:22:08,892 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 90 DAG size of output 80 [2018-04-09 20:22:09,232 WARN L151 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 102 DAG size of output 89 [2018-04-09 20:22:09,917 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 99 DAG size of output 86 [2018-04-09 20:22:10,332 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 82 DAG size of output 79 [2018-04-09 20:22:10,603 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 105 DAG size of output 96 [2018-04-09 20:22:11,387 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 90 DAG size of output 79 [2018-04-09 20:22:12,683 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 111 DAG size of output 88 [2018-04-09 20:22:14,175 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 107 DAG size of output 84 [2018-04-09 20:22:15,212 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 103 DAG size of output 83 [2018-04-09 20:22:17,114 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 98 DAG size of output 84 Received shutdown request... [2018-04-09 20:22:17,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-04-09 20:22:17,318 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 20:22:17,321 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 20:22:17,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 08:22:17 BoogieIcfgContainer [2018-04-09 20:22:17,322 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 20:22:17,322 INFO L168 Benchmark]: Toolchain (without parser) took 247712.57 ms. Allocated memory was 302.5 MB in the beginning and 406.8 MB in the end (delta: 104.3 MB). Free memory was 239.7 MB in the beginning and 304.3 MB in the end (delta: -64.6 MB). Peak memory consumption was 116.1 MB. Max. memory is 5.3 GB. [2018-04-09 20:22:17,323 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 302.5 MB. Free memory is still 265.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 20:22:17,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.21 ms. Allocated memory is still 302.5 MB. Free memory was 239.7 MB in the beginning and 215.7 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-09 20:22:17,324 INFO L168 Benchmark]: Boogie Preprocessor took 57.57 ms. Allocated memory is still 302.5 MB. Free memory was 215.7 MB in the beginning and 212.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-09 20:22:17,324 INFO L168 Benchmark]: RCFGBuilder took 495.43 ms. Allocated memory was 302.5 MB in the beginning and 459.8 MB in the end (delta: 157.3 MB). Free memory was 212.7 MB in the beginning and 394.2 MB in the end (delta: -181.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 5.3 GB. [2018-04-09 20:22:17,324 INFO L168 Benchmark]: TraceAbstraction took 246830.93 ms. Allocated memory was 459.8 MB in the beginning and 406.8 MB in the end (delta: -53.0 MB). Free memory was 394.2 MB in the beginning and 304.3 MB in the end (delta: 89.9 MB). Peak memory consumption was 113.4 MB. Max. memory is 5.3 GB. [2018-04-09 20:22:17,326 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.20 ms. Allocated memory is still 302.5 MB. Free memory is still 265.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 324.21 ms. Allocated memory is still 302.5 MB. Free memory was 239.7 MB in the beginning and 215.7 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 57.57 ms. Allocated memory is still 302.5 MB. Free memory was 215.7 MB in the beginning and 212.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 495.43 ms. Allocated memory was 302.5 MB in the beginning and 459.8 MB in the end (delta: 157.3 MB). Free memory was 212.7 MB in the beginning and 394.2 MB in the end (delta: -181.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 246830.93 ms. Allocated memory was 459.8 MB in the beginning and 406.8 MB in the end (delta: -53.0 MB). Free memory was 394.2 MB in the beginning and 304.3 MB in the end (delta: 89.9 MB). Peak memory consumption was 113.4 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 121 states, 87 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - 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 121 states, 87 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - 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 121 states, 87 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - 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 121 states, 87 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - 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 121 states, 87 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - 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 121 states, 87 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - 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 121 states, 87 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - 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 121 states, 87 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - 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 121 states, 87 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - 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 121 states, 87 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - 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 121 states, 87 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 89 locations, 11 error locations. TIMEOUT Result, 246.7s OverallTime, 41 OverallIterations, 10 TraceHistogramMax, 192.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2918 SDtfs, 13514 SDslu, 49912 SDs, 0 SdLazy, 53358 SolverSat, 2466 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 43.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6632 GetRequests, 3710 SyntacticMatches, 41 SemanticMatches, 2880 ConstructedPredicates, 40 IntricatePredicates, 0 DeprecatedPredicates, 95710 ImplicationChecksByTransitivity, 186.1s 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.7s AutomataMinimizationTime, 40 MinimizatonAttempts, 2650 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 50.9s 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-09_20-22-17-332.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-09_20-22-17-332.csv Completed graceful shutdown