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-1cf7e2d-m [2018-03-29 20:33:52,800 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-29 20:33:52,801 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-29 20:33:52,815 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-29 20:33:52,815 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-29 20:33:52,816 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-29 20:33:52,816 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-29 20:33:52,818 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-29 20:33:52,820 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-29 20:33:52,821 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-29 20:33:52,822 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-29 20:33:52,822 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-29 20:33:52,824 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-29 20:33:52,825 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-29 20:33:52,826 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-29 20:33:52,828 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-29 20:33:52,830 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-29 20:33:52,832 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-29 20:33:52,833 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-29 20:33:52,834 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-29 20:33:52,836 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-29 20:33:52,837 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-29 20:33:52,837 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-29 20:33:52,838 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-29 20:33:52,839 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-29 20:33:52,840 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-29 20:33:52,840 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-29 20:33:52,841 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-29 20:33:52,842 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-29 20:33:52,842 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-29 20:33:52,843 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-29 20:33:52,843 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-03-29 20:33:52,866 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-29 20:33:52,866 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-29 20:33:52,866 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-29 20:33:52,866 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-29 20:33:52,867 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-29 20:33:52,867 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-29 20:33:52,867 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-29 20:33:52,867 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-29 20:33:52,868 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-29 20:33:52,868 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-29 20:33:52,868 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-29 20:33:52,868 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-29 20:33:52,868 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-29 20:33:52,868 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-29 20:33:52,869 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-29 20:33:52,869 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-29 20:33:52,869 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-29 20:33:52,869 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-29 20:33:52,869 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-29 20:33:52,869 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-29 20:33:52,869 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-29 20:33:52,870 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-29 20:33:52,870 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-29 20:33:52,870 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-29 20:33:52,870 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-29 20:33:52,871 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-29 20:33:52,871 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-29 20:33:52,871 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-29 20:33:52,871 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-29 20:33:52,871 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-29 20:33:52,871 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-29 20:33:52,872 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 20:33:52,872 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-29 20:33:52,872 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-29 20:33:52,873 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-29 20:33:52,873 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-29 20:33:52,873 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-29 20:33:52,905 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-29 20:33:52,915 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-29 20:33:52,918 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-29 20:33:52,920 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-29 20:33:52,920 INFO L276 PluginConnector]: CDTParser initialized [2018-03-29 20:33:52,921 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-03-29 20:33:53,204 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf75b555bd [2018-03-29 20:33:53,392 INFO L287 CDTParser]: IsIndexed: true [2018-03-29 20:33:53,392 INFO L288 CDTParser]: Found 1 translation units. [2018-03-29 20:33:53,393 INFO L168 CDTParser]: Scanning openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:33:53,404 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-29 20:33:53,404 INFO L215 ultiparseSymbolTable]: [2018-03-29 20:33:53,405 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-29 20:33:53,405 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-03-29 20:33:53,405 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-03-29 20:33:53,405 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:33:53,405 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-03-29 20:33:53,405 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-29 20:33:53,406 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-03-29 20:33:53,406 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-03-29 20:33:53,406 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-03-29 20:33:53,406 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-03-29 20:33:53,406 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-03-29 20:33:53,406 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-03-29 20:33:53,406 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-03-29 20:33:53,407 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-03-29 20:33:53,407 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-03-29 20:33:53,407 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-03-29 20:33:53,407 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-03-29 20:33:53,407 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-03-29 20:33:53,407 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-03-29 20:33:53,407 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-03-29 20:33:53,407 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-03-29 20:33:53,407 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-03-29 20:33:53,407 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-03-29 20:33:53,407 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-03-29 20:33:53,407 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-03-29 20:33:53,408 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-03-29 20:33:53,408 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-03-29 20:33:53,408 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-03-29 20:33:53,408 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-03-29 20:33:53,408 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-03-29 20:33:53,408 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-03-29 20:33:53,408 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-03-29 20:33:53,408 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-03-29 20:33:53,408 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-03-29 20:33:53,408 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-03-29 20:33:53,408 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-03-29 20:33:53,408 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-03-29 20:33:53,408 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-03-29 20:33:53,408 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-03-29 20:33:53,409 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-03-29 20:33:53,409 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-03-29 20:33:53,409 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-03-29 20:33:53,409 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-03-29 20:33:53,409 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-03-29 20:33:53,409 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-03-29 20:33:53,409 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-03-29 20:33:53,409 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-03-29 20:33:53,409 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-03-29 20:33:53,409 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-03-29 20:33:53,409 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-03-29 20:33:53,409 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-03-29 20:33:53,410 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-03-29 20:33:53,410 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-03-29 20:33:53,410 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-03-29 20:33:53,410 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-03-29 20:33:53,410 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-03-29 20:33:53,410 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-03-29 20:33:53,410 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-03-29 20:33:53,410 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-03-29 20:33:53,410 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-03-29 20:33:53,410 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-03-29 20:33:53,410 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-03-29 20:33:53,410 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-03-29 20:33:53,411 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-03-29 20:33:53,411 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-03-29 20:33:53,411 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-03-29 20:33:53,411 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-03-29 20:33:53,411 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-03-29 20:33:53,411 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-03-29 20:33:53,411 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-03-29 20:33:53,411 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-03-29 20:33:53,411 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-03-29 20:33:53,412 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-03-29 20:33:53,412 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-03-29 20:33:53,412 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-03-29 20:33:53,412 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-03-29 20:33:53,412 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-03-29 20:33:53,412 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-03-29 20:33:53,412 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-03-29 20:33:53,412 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-03-29 20:33:53,412 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-03-29 20:33:53,413 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-03-29 20:33:53,413 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-03-29 20:33:53,413 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-03-29 20:33:53,413 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-03-29 20:33:53,413 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-03-29 20:33:53,413 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-03-29 20:33:53,413 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-03-29 20:33:53,413 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-03-29 20:33:53,413 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-03-29 20:33:53,413 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-03-29 20:33:53,414 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-03-29 20:33:53,414 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-03-29 20:33:53,414 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-03-29 20:33:53,414 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-03-29 20:33:53,414 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-03-29 20:33:53,414 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-03-29 20:33:53,414 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-03-29 20:33:53,414 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-03-29 20:33:53,414 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-03-29 20:33:53,414 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-03-29 20:33:53,415 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-03-29 20:33:53,415 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-03-29 20:33:53,415 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-03-29 20:33:53,415 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-03-29 20:33:53,415 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-03-29 20:33:53,415 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-03-29 20:33:53,415 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-03-29 20:33:53,415 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-03-29 20:33:53,415 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-03-29 20:33:53,416 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-03-29 20:33:53,416 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-03-29 20:33:53,416 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-03-29 20:33:53,416 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-03-29 20:33:53,416 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-03-29 20:33:53,416 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-03-29 20:33:53,416 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-03-29 20:33:53,416 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-03-29 20:33:53,417 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-03-29 20:33:53,417 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-03-29 20:33:53,417 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-03-29 20:33:53,417 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-03-29 20:33:53,417 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-03-29 20:33:53,417 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-03-29 20:33:53,417 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-03-29 20:33:53,417 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-03-29 20:33:53,434 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf75b555bd [2018-03-29 20:33:53,439 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-29 20:33:53,443 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-29 20:33:53,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-29 20:33:53,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-29 20:33:53,448 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-29 20:33:53,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 08:33:53" (1/1) ... [2018-03-29 20:33:53,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f4e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:33:53, skipping insertion in model container [2018-03-29 20:33:53,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 08:33:53" (1/1) ... [2018-03-29 20:33:53,465 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 20:33:53,495 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 20:33:53,661 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 20:33:53,710 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 20:33:53,715 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-03-29 20:33:53,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:33:53 WrapperNode [2018-03-29 20:33:53,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-29 20:33:53,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-29 20:33:53,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-29 20:33:53,755 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-29 20:33:53,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:33:53" (1/1) ... [2018-03-29 20:33:53,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:33:53" (1/1) ... [2018-03-29 20:33:53,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:33:53" (1/1) ... [2018-03-29 20:33:53,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:33:53" (1/1) ... [2018-03-29 20:33:53,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:33:53" (1/1) ... [2018-03-29 20:33:53,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:33:53" (1/1) ... [2018-03-29 20:33:53,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:33:53" (1/1) ... [2018-03-29 20:33:53,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-29 20:33:53,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-29 20:33:53,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-29 20:33:53,808 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-29 20:33:53,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:33:53" (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-03-29 20:33:53,945 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-29 20:33:53,945 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-29 20:33:53,945 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-03-29 20:33:53,946 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-03-29 20:33:53,946 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcat [2018-03-29 20:33:53,946 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-29 20:33:53,946 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-03-29 20:33:53,946 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-03-29 20:33:53,946 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-03-29 20:33:53,946 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-03-29 20:33:53,946 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-03-29 20:33:53,947 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-03-29 20:33:53,947 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-03-29 20:33:53,947 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-03-29 20:33:53,947 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-03-29 20:33:53,947 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-03-29 20:33:53,947 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-03-29 20:33:53,947 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-03-29 20:33:53,948 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-03-29 20:33:53,948 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-03-29 20:33:53,948 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-03-29 20:33:53,948 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-03-29 20:33:53,948 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-03-29 20:33:53,948 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-03-29 20:33:53,949 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-03-29 20:33:53,949 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-03-29 20:33:53,949 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-03-29 20:33:53,949 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-03-29 20:33:53,949 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-03-29 20:33:53,949 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-03-29 20:33:53,949 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-03-29 20:33:53,949 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-03-29 20:33:53,949 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-03-29 20:33:53,949 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-03-29 20:33:53,950 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-03-29 20:33:53,950 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-03-29 20:33:53,950 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-03-29 20:33:53,950 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-03-29 20:33:53,950 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-03-29 20:33:53,950 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-03-29 20:33:53,950 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-03-29 20:33:53,950 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-03-29 20:33:53,950 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-03-29 20:33:53,951 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-03-29 20:33:53,951 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-03-29 20:33:53,951 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-03-29 20:33:53,951 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-03-29 20:33:53,951 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-03-29 20:33:53,951 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-03-29 20:33:53,951 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-03-29 20:33:53,951 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-03-29 20:33:53,951 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-03-29 20:33:53,951 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-03-29 20:33:53,951 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-03-29 20:33:53,952 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-03-29 20:33:53,952 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-03-29 20:33:53,952 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-03-29 20:33:53,952 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-03-29 20:33:53,952 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-29 20:33:53,952 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-03-29 20:33:53,952 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-03-29 20:33:53,952 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-29 20:33:53,952 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-03-29 20:33:53,952 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-03-29 20:33:53,952 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-03-29 20:33:53,953 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-03-29 20:33:53,953 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-03-29 20:33:53,953 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-03-29 20:33:53,953 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-03-29 20:33:53,953 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-03-29 20:33:53,953 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-03-29 20:33:53,953 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-03-29 20:33:53,953 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-03-29 20:33:53,953 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-03-29 20:33:53,953 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-03-29 20:33:53,953 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-03-29 20:33:53,953 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-03-29 20:33:53,953 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-03-29 20:33:53,954 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-03-29 20:33:53,954 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-03-29 20:33:53,954 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-03-29 20:33:53,954 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-03-29 20:33:53,954 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-03-29 20:33:53,954 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-03-29 20:33:53,954 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-03-29 20:33:53,954 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-03-29 20:33:53,954 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-03-29 20:33:53,955 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-03-29 20:33:53,955 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-03-29 20:33:53,955 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-03-29 20:33:53,955 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-03-29 20:33:53,955 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-03-29 20:33:53,955 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-03-29 20:33:53,955 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-03-29 20:33:53,955 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-03-29 20:33:53,956 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-03-29 20:33:53,956 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-03-29 20:33:53,956 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-03-29 20:33:53,956 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-03-29 20:33:53,956 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-03-29 20:33:53,956 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-03-29 20:33:53,956 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-03-29 20:33:53,956 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-03-29 20:33:53,957 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-03-29 20:33:53,957 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-03-29 20:33:53,957 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-03-29 20:33:53,957 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-03-29 20:33:53,957 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-03-29 20:33:53,957 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-03-29 20:33:53,957 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcat [2018-03-29 20:33:53,958 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-29 20:33:53,958 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-29 20:33:53,958 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-29 20:33:53,958 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-29 20:33:53,958 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-29 20:33:53,958 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-29 20:33:53,958 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-29 20:33:53,958 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-29 20:33:54,415 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-29 20:33:54,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 08:33:54 BoogieIcfgContainer [2018-03-29 20:33:54,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-29 20:33:54,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-29 20:33:54,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-29 20:33:54,420 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-29 20:33:54,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 08:33:53" (1/3) ... [2018-03-29 20:33:54,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f968e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 08:33:54, skipping insertion in model container [2018-03-29 20:33:54,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 08:33:53" (2/3) ... [2018-03-29 20:33:54,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f968e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 08:33:54, skipping insertion in model container [2018-03-29 20:33:54,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 08:33:54" (3/3) ... [2018-03-29 20:33:54,424 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-03-29 20:33:54,433 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-29 20:33:54,438 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-03-29 20:33:54,482 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-29 20:33:54,482 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-29 20:33:54,482 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-29 20:33:54,482 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-29 20:33:54,482 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-29 20:33:54,482 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-29 20:33:54,482 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-29 20:33:54,483 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-29 20:33:54,483 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-29 20:33:54,483 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-29 20:33:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-03-29 20:33:54,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-29 20:33:54,500 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:33:54,501 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-03-29 20:33:54,501 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-03-29 20:33:54,504 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-03-29 20:33:54,517 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:33:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:33:54,551 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:33:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:54,586 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:33:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:54,628 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:33:54,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-03-29 20:33:54,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-29 20:33:54,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-29 20:33:54,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-29 20:33:54,643 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states. [2018-03-29 20:33:54,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:33:54,743 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-03-29 20:33:54,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-29 20:33:54,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-03-29 20:33:54,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:33:54,757 INFO L225 Difference]: With dead ends: 112 [2018-03-29 20:33:54,757 INFO L226 Difference]: Without dead ends: 75 [2018-03-29 20:33:54,761 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-03-29 20:33:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-03-29 20:33:54,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-03-29 20:33:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-03-29 20:33:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-03-29 20:33:54,803 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 21 [2018-03-29 20:33:54,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:33:54,804 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-03-29 20:33:54,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-29 20:33:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-03-29 20:33:54,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-03-29 20:33:54,805 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:33:54,805 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-03-29 20:33:54,805 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-03-29 20:33:54,806 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-03-29 20:33:54,812 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:33:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:33:54,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:33:54,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-03-29 20:33:54,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:54,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:33:54,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 20:33:54,876 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-03-29 20:33:54,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:54,887 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-03-29 20:33:54,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-03-29 20:33:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:54,903 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:33:54,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:54,943 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:33:54,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-29 20:33:54,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-29 20:33:54,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-29 20:33:54,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-29 20:33:54,946 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 4 states. [2018-03-29 20:33:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:33:55,040 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-03-29 20:33:55,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-29 20:33:55,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-03-29 20:33:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:33:55,043 INFO L225 Difference]: With dead ends: 75 [2018-03-29 20:33:55,043 INFO L226 Difference]: Without dead ends: 74 [2018-03-29 20:33:55,044 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-03-29 20:33:55,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-03-29 20:33:55,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-03-29 20:33:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-03-29 20:33:55,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-03-29 20:33:55,051 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2018-03-29 20:33:55,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:33:55,051 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-03-29 20:33:55,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-29 20:33:55,052 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-03-29 20:33:55,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-03-29 20:33:55,052 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:33:55,052 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-03-29 20:33:55,052 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-03-29 20:33:55,053 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-03-29 20:33:55,060 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:33:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:33:55,078 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:33:55,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:33:55,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:55,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:33:55,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:55,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:33:55,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-03-29 20:33:55,170 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:33:55,173 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-03-29 20:33:55,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:55,192 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:33:55,193 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:33:55,194 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-03-29 20:33:55,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:55,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:33:55,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-03-29 20:33:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:55,223 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:33:55,353 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:55,354 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-03-29 20:33:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:55,397 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:33:55,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-03-29 20:33:55,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-29 20:33:55,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-29 20:33:55,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-03-29 20:33:55,398 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 9 states. [2018-03-29 20:33:55,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:33:55,616 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-03-29 20:33:55,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 20:33:55,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-03-29 20:33:55,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:33:55,617 INFO L225 Difference]: With dead ends: 74 [2018-03-29 20:33:55,618 INFO L226 Difference]: Without dead ends: 73 [2018-03-29 20:33:55,618 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-03-29 20:33:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-03-29 20:33:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-03-29 20:33:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-03-29 20:33:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-03-29 20:33:55,626 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 24 [2018-03-29 20:33:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:33:55,627 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-03-29 20:33:55,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-29 20:33:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-03-29 20:33:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-03-29 20:33:55,628 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:33:55,628 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-03-29 20:33:55,628 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-03-29 20:33:55,628 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-03-29 20:33:55,637 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:33:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:33:55,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:33:55,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:33:55,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:55,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:33:55,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 20:33:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:55,671 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:33:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:55,707 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:33:55,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-29 20:33:55,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-29 20:33:55,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-29 20:33:55,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-29 20:33:55,708 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2018-03-29 20:33:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:33:55,744 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-03-29 20:33:55,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-29 20:33:55,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-03-29 20:33:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:33:55,745 INFO L225 Difference]: With dead ends: 73 [2018-03-29 20:33:55,745 INFO L226 Difference]: Without dead ends: 72 [2018-03-29 20:33:55,746 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-03-29 20:33:55,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-03-29 20:33:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-03-29 20:33:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-03-29 20:33:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-03-29 20:33:55,751 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 25 [2018-03-29 20:33:55,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:33:55,751 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-03-29 20:33:55,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-29 20:33:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-03-29 20:33:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-03-29 20:33:55,752 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:33:55,752 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-03-29 20:33:55,752 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-03-29 20:33:55,752 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-03-29 20:33:55,758 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:33:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:33:55,771 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:33:55,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:33:55,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:55,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:33:55,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-03-29 20:33:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:55,982 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:33:56,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:56,091 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:33:56,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-03-29 20:33:56,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-29 20:33:56,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-29 20:33:56,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-03-29 20:33:56,093 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 8 states. [2018-03-29 20:33:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:33:56,175 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-03-29 20:33:56,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-29 20:33:56,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-03-29 20:33:56,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:33:56,176 INFO L225 Difference]: With dead ends: 72 [2018-03-29 20:33:56,176 INFO L226 Difference]: Without dead ends: 71 [2018-03-29 20:33:56,177 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-03-29 20:33:56,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-03-29 20:33:56,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-03-29 20:33:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-03-29 20:33:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-03-29 20:33:56,183 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 25 [2018-03-29 20:33:56,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:33:56,183 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-03-29 20:33:56,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-29 20:33:56,183 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-03-29 20:33:56,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-03-29 20:33:56,184 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:33:56,184 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-03-29 20:33:56,184 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-03-29 20:33:56,184 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-03-29 20:33:56,190 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:33:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:33:56,209 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:33:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:56,227 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:33:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:56,256 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:33:56,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-03-29 20:33:56,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-29 20:33:56,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-29 20:33:56,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-29 20:33:56,257 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2018-03-29 20:33:56,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:33:56,304 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-03-29 20:33:56,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-29 20:33:56,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-03-29 20:33:56,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:33:56,305 INFO L225 Difference]: With dead ends: 74 [2018-03-29 20:33:56,305 INFO L226 Difference]: Without dead ends: 73 [2018-03-29 20:33:56,306 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-03-29 20:33:56,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-03-29 20:33:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2018-03-29 20:33:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-03-29 20:33:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-03-29 20:33:56,312 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 31 [2018-03-29 20:33:56,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:33:56,313 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-03-29 20:33:56,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-29 20:33:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-03-29 20:33:56,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-03-29 20:33:56,314 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:33:56,314 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-03-29 20:33:56,314 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-03-29 20:33:56,315 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-03-29 20:33:56,321 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:33:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:33:56,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:33:56,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:33:56,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:56,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:33:56,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-03-29 20:33:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:56,488 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:33:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:56,558 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:33:56,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2018-03-29 20:33:56,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:33:56,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:33:56,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-03-29 20:33:56,559 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 12 states. [2018-03-29 20:33:56,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:33:56,727 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-03-29 20:33:56,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-29 20:33:56,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-03-29 20:33:56,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:33:56,728 INFO L225 Difference]: With dead ends: 87 [2018-03-29 20:33:56,728 INFO L226 Difference]: Without dead ends: 86 [2018-03-29 20:33:56,728 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-03-29 20:33:56,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-03-29 20:33:56,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2018-03-29 20:33:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-03-29 20:33:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-03-29 20:33:56,735 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 31 [2018-03-29 20:33:56,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:33:56,736 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-03-29 20:33:56,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:33:56,736 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-03-29 20:33:56,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-03-29 20:33:56,737 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:33:56,738 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-03-29 20:33:56,738 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-03-29 20:33:56,738 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-03-29 20:33:56,744 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:33:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:33:56,784 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:33:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:56,805 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:33:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:56,836 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:33:56,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-03-29 20:33:56,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 20:33:56,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 20:33:56,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-29 20:33:56,837 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2018-03-29 20:33:56,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:33:56,883 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-03-29 20:33:56,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 20:33:56,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-03-29 20:33:56,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:33:56,884 INFO L225 Difference]: With dead ends: 79 [2018-03-29 20:33:56,884 INFO L226 Difference]: Without dead ends: 78 [2018-03-29 20:33:56,884 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-03-29 20:33:56,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-03-29 20:33:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-03-29 20:33:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-03-29 20:33:56,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-03-29 20:33:56,889 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-03-29 20:33:56,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:33:56,889 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-03-29 20:33:56,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 20:33:56,890 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-03-29 20:33:56,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-03-29 20:33:56,891 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:33:56,891 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-03-29 20:33:56,891 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-03-29 20:33:56,891 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-03-29 20:33:56,901 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:33:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:33:56,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:33:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:56,964 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:33:56,974 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-03-29 20:33:56,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:56,981 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-03-29 20:33:56,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:56,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:33:56,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-03-29 20:33:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:57,019 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:33:57,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-03-29 20:33:57,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-29 20:33:57,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-29 20:33:57,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-03-29 20:33:57,020 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 9 states. [2018-03-29 20:33:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:33:57,121 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-03-29 20:33:57,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:33:57,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-03-29 20:33:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:33:57,122 INFO L225 Difference]: With dead ends: 85 [2018-03-29 20:33:57,122 INFO L226 Difference]: Without dead ends: 84 [2018-03-29 20:33:57,122 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-03-29 20:33:57,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-03-29 20:33:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-03-29 20:33:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-03-29 20:33:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-03-29 20:33:57,128 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 39 [2018-03-29 20:33:57,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:33:57,129 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-03-29 20:33:57,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-29 20:33:57,129 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-03-29 20:33:57,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-03-29 20:33:57,130 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:33:57,130 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-03-29 20:33:57,130 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-03-29 20:33:57,130 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-03-29 20:33:57,136 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:33:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:33:57,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:33:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:57,184 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:33:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:57,213 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:33:57,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-03-29 20:33:57,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 20:33:57,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 20:33:57,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-29 20:33:57,214 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 6 states. [2018-03-29 20:33:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:33:57,277 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-03-29 20:33:57,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 20:33:57,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-03-29 20:33:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:33:57,278 INFO L225 Difference]: With dead ends: 84 [2018-03-29 20:33:57,278 INFO L226 Difference]: Without dead ends: 83 [2018-03-29 20:33:57,279 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-03-29 20:33:57,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-03-29 20:33:57,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-03-29 20:33:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-03-29 20:33:57,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-03-29 20:33:57,284 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 40 [2018-03-29 20:33:57,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:33:57,284 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-03-29 20:33:57,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 20:33:57,284 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-03-29 20:33:57,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-03-29 20:33:57,285 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:33:57,285 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-03-29 20:33:57,286 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-03-29 20:33:57,286 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-03-29 20:33:57,293 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:33:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:33:57,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:33:57,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:33:57,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:57,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:33:57,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-03-29 20:33:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:57,409 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:33:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:57,576 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:33:57,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2018-03-29 20:33:57,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-03-29 20:33:57,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-03-29 20:33:57,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-03-29 20:33:57,577 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 16 states. [2018-03-29 20:33:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:33:57,876 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-03-29 20:33:57,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-29 20:33:57,876 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-03-29 20:33:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:33:57,879 INFO L225 Difference]: With dead ends: 110 [2018-03-29 20:33:57,879 INFO L226 Difference]: Without dead ends: 109 [2018-03-29 20:33:57,879 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-03-29 20:33:57,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-03-29 20:33:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2018-03-29 20:33:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-03-29 20:33:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-03-29 20:33:57,885 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 40 [2018-03-29 20:33:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:33:57,885 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-03-29 20:33:57,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-03-29 20:33:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-03-29 20:33:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-03-29 20:33:57,886 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:33:57,886 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-03-29 20:33:57,886 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-03-29 20:33:57,886 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-03-29 20:33:57,892 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:33:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:33:57,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:33:57,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:33:57,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:57,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:33:57,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-03-29 20:33:57,964 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-03-29 20:33:57,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:33:57,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:57,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:33:57,977 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-03-29 20:33:57,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-03-29 20:33:58,039 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-03-29 20:33:58,064 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-03-29 20:33:58,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:33:58,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:33:58,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:33:58,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35 [2018-03-29 20:33:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:58,162 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:33:58,345 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-03-29 20:33:58,357 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-03-29 20:33:58,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:58,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:33:58,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:33:58,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:38 [2018-03-29 20:33:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:58,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:33:58,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-03-29 20:33:58,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-03-29 20:33:58,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-03-29 20:33:58,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-03-29 20:33:58,608 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 25 states. [2018-03-29 20:33:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:33:59,467 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-03-29 20:33:59,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-03-29 20:33:59,468 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 45 [2018-03-29 20:33:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:33:59,468 INFO L225 Difference]: With dead ends: 124 [2018-03-29 20:33:59,469 INFO L226 Difference]: Without dead ends: 123 [2018-03-29 20:33:59,469 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=233, Invalid=1407, Unknown=0, NotChecked=0, Total=1640 [2018-03-29 20:33:59,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-03-29 20:33:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2018-03-29 20:33:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-03-29 20:33:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-03-29 20:33:59,479 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 45 [2018-03-29 20:33:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:33:59,479 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-03-29 20:33:59,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-03-29 20:33:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-03-29 20:33:59,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-03-29 20:33:59,480 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:33:59,481 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-03-29 20:33:59,481 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-03-29 20:33:59,481 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-03-29 20:33:59,490 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:33:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:33:59,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:33:59,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:33:59,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:59,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:33:59,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 20:33:59,536 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:33:59,537 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:33:59,537 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-03-29 20:33:59,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:59,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:33:59,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-03-29 20:33:59,555 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-03-29 20:33:59,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:33:59,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:59,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:33:59,563 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-03-29 20:33:59,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-03-29 20:33:59,579 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-03-29 20:33:59,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:33:59,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:59,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:33:59,592 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-03-29 20:33:59,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-03-29 20:33:59,747 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-03-29 20:33:59,754 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-03-29 20:33:59,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:33:59,766 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-03-29 20:33:59,766 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:33:59,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:33:59,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:33:59,781 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-03-29 20:33:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:33:59,854 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:34:00,112 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-03-29 20:34:00,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:00,120 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-03-29 20:34:00,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, 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-03-29 20:34:00,128 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:00,129 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:00,134 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-03-29 20:34:00,134 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-03-29 20:34:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:00,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:34:00,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-03-29 20:34:00,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-03-29 20:34:00,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-03-29 20:34:00,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-03-29 20:34:00,189 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 25 states. [2018-03-29 20:34:00,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:34:00,838 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2018-03-29 20:34:00,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-03-29 20:34:00,838 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-03-29 20:34:00,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:34:00,839 INFO L225 Difference]: With dead ends: 128 [2018-03-29 20:34:00,839 INFO L226 Difference]: Without dead ends: 127 [2018-03-29 20:34:00,839 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=1349, Unknown=0, NotChecked=0, Total=1560 [2018-03-29 20:34:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-03-29 20:34:00,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2018-03-29 20:34:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-03-29 20:34:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-03-29 20:34:00,845 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 50 [2018-03-29 20:34:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:34:00,846 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-03-29 20:34:00,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-03-29 20:34:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-03-29 20:34:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-03-29 20:34:00,846 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:34:00,847 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-03-29 20:34:00,847 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-03-29 20:34:00,847 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-03-29 20:34:00,852 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:34:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:34:00,877 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:34:00,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:34:00,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:00,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:00,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-03-29 20:34:00,923 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-03-29 20:34:00,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 11 treesize of output 10 [2018-03-29 20:34:00,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:00,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:00,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 20:34:00,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-03-29 20:34:01,052 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-03-29 20:34:01,054 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:01,060 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-03-29 20:34:01,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:34:01,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:34:01,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:34:01,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2018-03-29 20:34:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:01,175 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:34:01,455 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-03-29 20:34:01,470 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:34:01,471 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-03-29 20:34:01,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:01,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:01,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:34:01,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:54 [2018-03-29 20:34:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:01,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:34:01,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-03-29 20:34:01,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-03-29 20:34:01,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-03-29 20:34:01,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2018-03-29 20:34:01,660 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 31 states. [2018-03-29 20:34:03,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:34:03,570 INFO L93 Difference]: Finished difference Result 160 states and 172 transitions. [2018-03-29 20:34:03,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-03-29 20:34:03,571 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 52 [2018-03-29 20:34:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:34:03,572 INFO L225 Difference]: With dead ends: 160 [2018-03-29 20:34:03,572 INFO L226 Difference]: Without dead ends: 159 [2018-03-29 20:34:03,573 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=402, Invalid=2568, Unknown=0, NotChecked=0, Total=2970 [2018-03-29 20:34:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-03-29 20:34:03,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2018-03-29 20:34:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-03-29 20:34:03,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-03-29 20:34:03,583 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 52 [2018-03-29 20:34:03,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:34:03,584 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-03-29 20:34:03,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-03-29 20:34:03,584 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-03-29 20:34:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-03-29 20:34:03,584 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:34:03,584 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-03-29 20:34:03,585 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-03-29 20:34:03,585 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-03-29 20:34:03,590 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:34:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:34:03,616 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:34:03,642 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:03,642 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-03-29 20:34:03,644 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-03-29 20:34:03,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:03,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:03,652 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-03-29 20:34:03,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:34:03,680 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-03-29 20:34:03,684 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-03-29 20:34:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:03,695 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:34:03,713 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-03-29 20:34:03,717 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-03-29 20:34:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:03,791 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:34:03,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:34:03,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:34:03,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:34:03,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:34:03,792 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 12 states. [2018-03-29 20:34:03,807 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-03-29 20:34:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:34:04,199 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions. [2018-03-29 20:34:04,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:34:04,199 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-03-29 20:34:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:34:04,201 INFO L225 Difference]: With dead ends: 249 [2018-03-29 20:34:04,201 INFO L226 Difference]: Without dead ends: 235 [2018-03-29 20:34:04,201 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-03-29 20:34:04,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-03-29 20:34:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-03-29 20:34:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-03-29 20:34:04,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 252 transitions. [2018-03-29 20:34:04,217 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 252 transitions. Word has length 54 [2018-03-29 20:34:04,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:34:04,217 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 252 transitions. [2018-03-29 20:34:04,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:34:04,217 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 252 transitions. [2018-03-29 20:34:04,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-03-29 20:34:04,218 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:34:04,218 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-03-29 20:34:04,218 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-03-29 20:34:04,218 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-03-29 20:34:04,225 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:34:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:34:04,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:34:04,295 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:04,296 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-03-29 20:34:04,300 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:04,301 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-03-29 20:34:04,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:04,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:04,309 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-03-29 20:34:04,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:34:04,352 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-03-29 20:34:04,357 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-03-29 20:34:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:04,364 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:34:04,381 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-03-29 20:34:04,385 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-03-29 20:34:04,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:04,428 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:34:04,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:34:04,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:34:04,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:34:04,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:34:04,429 INFO L87 Difference]: Start difference. First operand 232 states and 252 transitions. Second operand 12 states. [2018-03-29 20:34:04,447 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-03-29 20:34:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:34:05,000 INFO L93 Difference]: Finished difference Result 347 states and 375 transitions. [2018-03-29 20:34:05,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:34:05,001 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-03-29 20:34:05,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:34:05,002 INFO L225 Difference]: With dead ends: 347 [2018-03-29 20:34:05,002 INFO L226 Difference]: Without dead ends: 333 [2018-03-29 20:34:05,003 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-03-29 20:34:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-03-29 20:34:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 233. [2018-03-29 20:34:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-03-29 20:34:05,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 253 transitions. [2018-03-29 20:34:05,017 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 253 transitions. Word has length 55 [2018-03-29 20:34:05,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:34:05,017 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 253 transitions. [2018-03-29 20:34:05,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:34:05,017 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 253 transitions. [2018-03-29 20:34:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-03-29 20:34:05,018 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:34:05,018 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-03-29 20:34:05,018 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-03-29 20:34:05,018 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-03-29 20:34:05,026 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:34:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:34:05,047 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:34:05,088 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:05,089 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-03-29 20:34:05,104 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-03-29 20:34:05,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:05,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:05,151 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-03-29 20:34:05,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:34:05,185 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-03-29 20:34:05,193 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-03-29 20:34:05,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:05,214 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:34:05,233 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-03-29 20:34:05,246 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-03-29 20:34:05,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:05,299 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:34:05,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:34:05,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:34:05,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:34:05,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:34:05,300 INFO L87 Difference]: Start difference. First operand 233 states and 253 transitions. Second operand 12 states. [2018-03-29 20:34:05,309 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-03-29 20:34:05,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:34:05,598 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-03-29 20:34:05,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:34:05,598 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-03-29 20:34:05,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:34:05,600 INFO L225 Difference]: With dead ends: 348 [2018-03-29 20:34:05,600 INFO L226 Difference]: Without dead ends: 334 [2018-03-29 20:34:05,601 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-03-29 20:34:05,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-03-29 20:34:05,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 235. [2018-03-29 20:34:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-03-29 20:34:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions. [2018-03-29 20:34:05,621 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 55 [2018-03-29 20:34:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:34:05,621 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions. [2018-03-29 20:34:05,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:34:05,622 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions. [2018-03-29 20:34:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-03-29 20:34:05,623 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:34:05,623 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-03-29 20:34:05,623 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-03-29 20:34:05,623 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-03-29 20:34:05,629 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:34:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:34:05,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:34:05,672 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:05,673 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-03-29 20:34:05,675 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:05,676 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-03-29 20:34:05,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:05,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:05,684 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-03-29 20:34:05,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:34:05,714 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-03-29 20:34:05,719 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-03-29 20:34:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:05,730 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:34:05,756 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-03-29 20:34:05,760 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-03-29 20:34:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:05,821 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:34:05,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:34:05,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:34:05,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:34:05,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:34:05,822 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand 12 states. [2018-03-29 20:34:05,840 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-03-29 20:34:06,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:34:06,156 INFO L93 Difference]: Finished difference Result 349 states and 378 transitions. [2018-03-29 20:34:06,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:34:06,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-03-29 20:34:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:34:06,158 INFO L225 Difference]: With dead ends: 349 [2018-03-29 20:34:06,158 INFO L226 Difference]: Without dead ends: 335 [2018-03-29 20:34:06,158 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-03-29 20:34:06,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-03-29 20:34:06,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 235. [2018-03-29 20:34:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-03-29 20:34:06,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions. [2018-03-29 20:34:06,182 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 55 [2018-03-29 20:34:06,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:34:06,183 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions. [2018-03-29 20:34:06,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:34:06,183 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions. [2018-03-29 20:34:06,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-03-29 20:34:06,184 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:34:06,184 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-03-29 20:34:06,184 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-03-29 20:34:06,184 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-03-29 20:34:06,196 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:34:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:34:06,222 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:34:06,246 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:06,247 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-03-29 20:34:06,249 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-03-29 20:34:06,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:06,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:06,255 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-03-29 20:34:06,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:34:06,282 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-03-29 20:34:06,286 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-03-29 20:34:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:06,292 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:34:06,308 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-03-29 20:34:06,311 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-03-29 20:34:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:06,354 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:34:06,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:34:06,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:34:06,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:34:06,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:34:06,355 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand 12 states. [2018-03-29 20:34:06,364 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-03-29 20:34:06,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:34:06,780 INFO L93 Difference]: Finished difference Result 350 states and 379 transitions. [2018-03-29 20:34:06,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:34:06,780 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-03-29 20:34:06,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:34:06,782 INFO L225 Difference]: With dead ends: 350 [2018-03-29 20:34:06,782 INFO L226 Difference]: Without dead ends: 336 [2018-03-29 20:34:06,782 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-03-29 20:34:06,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-03-29 20:34:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 235. [2018-03-29 20:34:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-03-29 20:34:06,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions. [2018-03-29 20:34:06,798 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 56 [2018-03-29 20:34:06,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:34:06,798 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions. [2018-03-29 20:34:06,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:34:06,798 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions. [2018-03-29 20:34:06,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-03-29 20:34:06,799 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:34:06,799 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-03-29 20:34:06,799 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-03-29 20:34:06,799 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-03-29 20:34:06,807 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:34:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:34:06,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:34:06,867 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:06,868 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-03-29 20:34:06,869 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-03-29 20:34:06,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:06,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:06,876 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-03-29 20:34:06,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:34:06,906 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-03-29 20:34:06,910 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-03-29 20:34:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:06,918 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:34:06,937 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-03-29 20:34:06,941 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-03-29 20:34:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:06,984 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:34:06,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:34:06,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:34:06,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:34:06,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:34:06,985 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand 12 states. [2018-03-29 20:34:07,014 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-03-29 20:34:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:34:07,405 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-03-29 20:34:07,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:34:07,405 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-03-29 20:34:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:34:07,406 INFO L225 Difference]: With dead ends: 348 [2018-03-29 20:34:07,406 INFO L226 Difference]: Without dead ends: 334 [2018-03-29 20:34:07,407 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-03-29 20:34:07,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-03-29 20:34:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 234. [2018-03-29 20:34:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-03-29 20:34:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 254 transitions. [2018-03-29 20:34:07,428 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 254 transitions. Word has length 56 [2018-03-29 20:34:07,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:34:07,429 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 254 transitions. [2018-03-29 20:34:07,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:34:07,429 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 254 transitions. [2018-03-29 20:34:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-03-29 20:34:07,429 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:34:07,429 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-03-29 20:34:07,430 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-03-29 20:34:07,430 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-03-29 20:34:07,443 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:34:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:34:07,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:34:07,493 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:07,494 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-03-29 20:34:07,496 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-03-29 20:34:07,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:07,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:07,503 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-03-29 20:34:07,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:34:07,541 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-03-29 20:34:07,544 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-03-29 20:34:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:07,555 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:34:07,574 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-03-29 20:34:07,577 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-03-29 20:34:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:07,612 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:34:07,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:34:07,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:34:07,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:34:07,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:34:07,613 INFO L87 Difference]: Start difference. First operand 234 states and 254 transitions. Second operand 12 states. [2018-03-29 20:34:07,623 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-03-29 20:34:08,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:34:08,063 INFO L93 Difference]: Finished difference Result 349 states and 377 transitions. [2018-03-29 20:34:08,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:34:08,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-03-29 20:34:08,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:34:08,065 INFO L225 Difference]: With dead ends: 349 [2018-03-29 20:34:08,065 INFO L226 Difference]: Without dead ends: 335 [2018-03-29 20:34:08,066 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-03-29 20:34:08,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-03-29 20:34:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 234. [2018-03-29 20:34:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-03-29 20:34:08,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 254 transitions. [2018-03-29 20:34:08,091 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 254 transitions. Word has length 56 [2018-03-29 20:34:08,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:34:08,091 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 254 transitions. [2018-03-29 20:34:08,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:34:08,091 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 254 transitions. [2018-03-29 20:34:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-03-29 20:34:08,092 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:34:08,092 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-03-29 20:34:08,092 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-03-29 20:34:08,092 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-03-29 20:34:08,104 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:34:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:34:08,132 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:34:08,164 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:08,165 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-03-29 20:34:08,167 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-03-29 20:34:08,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:08,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:08,177 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-03-29 20:34:08,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-03-29 20:34:08,210 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-03-29 20:34:08,214 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-03-29 20:34:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:08,225 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:34:08,254 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-03-29 20:34:08,258 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-03-29 20:34:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:08,314 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 20:34:08,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-03-29 20:34:08,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 20:34:08,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 20:34:08,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-03-29 20:34:08,315 INFO L87 Difference]: Start difference. First operand 234 states and 254 transitions. Second operand 12 states. [2018-03-29 20:34:08,330 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-03-29 20:34:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:34:08,870 INFO L93 Difference]: Finished difference Result 237 states and 254 transitions. [2018-03-29 20:34:08,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-29 20:34:08,870 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-03-29 20:34:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:34:08,872 INFO L225 Difference]: With dead ends: 237 [2018-03-29 20:34:08,872 INFO L226 Difference]: Without dead ends: 223 [2018-03-29 20:34:08,872 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-03-29 20:34:08,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-03-29 20:34:08,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 120. [2018-03-29 20:34:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-03-29 20:34:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-03-29 20:34:08,884 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 57 [2018-03-29 20:34:08,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:34:08,884 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-03-29 20:34:08,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 20:34:08,884 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-03-29 20:34:08,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-03-29 20:34:08,885 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:34:08,885 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-03-29 20:34:08,885 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-03-29 20:34:08,885 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-03-29 20:34:08,900 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:34:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:34:08,924 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:34:08,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:34:08,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:08,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:34:08,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:08,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:08,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-03-29 20:34:08,951 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:08,952 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:08,953 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-03-29 20:34:08,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:08,961 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:08,962 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:08,962 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-03-29 20:34:08,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:08,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:08,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-03-29 20:34:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:09,198 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:34:09,682 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-03-29 20:34:09,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:09,687 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-03-29 20:34:09,695 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-29 20:34:09,695 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:09,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 12 treesize of output 3 [2018-03-29 20:34:09,697 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:09,699 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:09,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:09,702 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-03-29 20:34:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:09,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:34:09,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-03-29 20:34:09,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-03-29 20:34:09,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-03-29 20:34:09,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1373, Unknown=0, NotChecked=0, Total=1482 [2018-03-29 20:34:09,759 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 39 states. [2018-03-29 20:34:10,425 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 35 DAG size of output 33 [2018-03-29 20:34:12,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:34:12,166 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2018-03-29 20:34:12,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-03-29 20:34:12,166 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 58 [2018-03-29 20:34:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:34:12,167 INFO L225 Difference]: With dead ends: 153 [2018-03-29 20:34:12,167 INFO L226 Difference]: Without dead ends: 152 [2018-03-29 20:34:12,168 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=607, Invalid=5399, Unknown=0, NotChecked=0, Total=6006 [2018-03-29 20:34:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-03-29 20:34:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 120. [2018-03-29 20:34:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-03-29 20:34:12,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-03-29 20:34:12,186 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 58 [2018-03-29 20:34:12,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:34:12,186 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-03-29 20:34:12,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-03-29 20:34:12,187 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-03-29 20:34:12,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-03-29 20:34:12,187 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:34:12,188 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-03-29 20:34:12,188 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-03-29 20:34:12,188 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-03-29 20:34:12,193 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:34:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:34:12,215 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:34:12,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:34:12,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:12,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:34:12,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:12,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:12,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:34:12,241 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:12,243 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-03-29 20:34:12,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:12,250 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:12,251 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:12,251 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-03-29 20:34:12,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:12,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:12,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:34:12,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, 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-03-29 20:34:12,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 12 treesize of output 11 [2018-03-29 20:34:12,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:12,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:12,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:12,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-03-29 20:34:12,287 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-03-29 20:34:12,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:34:12,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:12,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:12,298 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-03-29 20:34:12,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-03-29 20:34:12,434 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-03-29 20:34:12,444 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-03-29 20:34:12,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:34:12,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:34:12,471 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-03-29 20:34:12,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:45 [2018-03-29 20:34:12,536 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-03-29 20:34:12,541 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-03-29 20:34:12,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:34:12,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:34:12,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:34:12,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-03-29 20:34:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:12,626 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:34:13,312 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-03-29 20:34:13,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 20:34:13,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:13,337 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-03-29 20:34:13,339 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-03-29 20:34:13,339 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:13,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:13,345 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-03-29 20:34:13,347 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-03-29 20:34:13,347 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:13,348 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:13,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:34:13,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:34:13,376 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:57, output treesize:84 [2018-03-29 20:34:15,630 WARN L151 SmtUtils]: Spent 2083ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-03-29 20:34:16,016 WARN L148 SmtUtils]: Spent 336ms on a formula simplification that was a NOOP. DAG size: 34 [2018-03-29 20:34:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:16,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:34:16,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2018-03-29 20:34:16,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-03-29 20:34:16,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-03-29 20:34:16,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2018-03-29 20:34:16,053 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 39 states. [2018-03-29 20:34:39,402 WARN L151 SmtUtils]: Spent 18475ms on a formula simplification. DAG size of input: 71 DAG size of output 53 [2018-03-29 20:34:41,710 WARN L151 SmtUtils]: Spent 1156ms on a formula simplification. DAG size of input: 49 DAG size of output 34 [2018-03-29 20:34:42,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:34:42,253 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-03-29 20:34:42,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-03-29 20:34:42,254 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 61 [2018-03-29 20:34:42,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:34:42,255 INFO L225 Difference]: With dead ends: 137 [2018-03-29 20:34:42,255 INFO L226 Difference]: Without dead ends: 136 [2018-03-29 20:34:42,256 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=315, Invalid=2990, Unknown=1, NotChecked=0, Total=3306 [2018-03-29 20:34:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-03-29 20:34:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 131. [2018-03-29 20:34:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-03-29 20:34:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-03-29 20:34:42,274 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 61 [2018-03-29 20:34:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:34:42,274 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-03-29 20:34:42,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-03-29 20:34:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-03-29 20:34:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-03-29 20:34:42,275 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:34:42,275 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-03-29 20:34:42,275 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-03-29 20:34:42,276 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-03-29 20:34:42,284 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:34:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:34:42,318 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:34:42,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:34:42,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:42,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:34:42,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:42,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:42,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-03-29 20:34:42,366 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:42,367 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:42,367 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-03-29 20:34:42,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:42,375 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:42,375 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-03-29 20:34:42,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:42,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:42,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-03-29 20:34:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:42,710 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:34:43,375 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-03-29 20:34:43,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:43,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-03-29 20:34:43,387 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-29 20:34:43,388 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:43,389 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-03-29 20:34:43,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:43,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:43,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:43,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-03-29 20:34:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:43,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:34:43,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-03-29 20:34:43,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-03-29 20:34:43,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-03-29 20:34:43,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2018-03-29 20:34:43,482 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 46 states. [2018-03-29 20:34:46,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:34:46,705 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions. [2018-03-29 20:34:46,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-03-29 20:34:46,706 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 62 [2018-03-29 20:34:46,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:34:46,707 INFO L225 Difference]: With dead ends: 189 [2018-03-29 20:34:46,707 INFO L226 Difference]: Without dead ends: 188 [2018-03-29 20:34:46,709 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1632 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=935, Invalid=8185, Unknown=0, NotChecked=0, Total=9120 [2018-03-29 20:34:46,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-03-29 20:34:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2018-03-29 20:34:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-03-29 20:34:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions. [2018-03-29 20:34:46,721 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 62 [2018-03-29 20:34:46,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:34:46,722 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions. [2018-03-29 20:34:46,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-03-29 20:34:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions. [2018-03-29 20:34:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-03-29 20:34:46,723 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:34:46,723 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-03-29 20:34:46,723 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-03-29 20:34:46,723 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-03-29 20:34:46,732 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:34:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:34:46,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:34:46,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:34:46,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:46,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:46,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-03-29 20:34:46,799 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-03-29 20:34:46,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-29 20:34:46,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:46,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:46,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 20:34:46,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-03-29 20:34:46,906 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-03-29 20:34:46,908 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:46,915 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-03-29 20:34:46,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:34:46,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:34:46,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:34:46,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2018-03-29 20:34:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:47,118 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:34:47,439 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-03-29 20:34:47,454 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:34:47,455 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-03-29 20:34:47,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:47,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:47,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:34:47,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:54 [2018-03-29 20:34:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:47,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:34:47,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-03-29 20:34:47,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-03-29 20:34:47,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-03-29 20:34:47,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2018-03-29 20:34:47,648 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 35 states. [2018-03-29 20:34:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:34:50,658 INFO L93 Difference]: Finished difference Result 226 states and 237 transitions. [2018-03-29 20:34:50,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-03-29 20:34:50,659 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 65 [2018-03-29 20:34:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:34:50,660 INFO L225 Difference]: With dead ends: 226 [2018-03-29 20:34:50,660 INFO L226 Difference]: Without dead ends: 225 [2018-03-29 20:34:50,661 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=551, Invalid=4561, Unknown=0, NotChecked=0, Total=5112 [2018-03-29 20:34:50,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-03-29 20:34:50,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 201. [2018-03-29 20:34:50,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-03-29 20:34:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 211 transitions. [2018-03-29 20:34:50,682 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 211 transitions. Word has length 65 [2018-03-29 20:34:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:34:50,683 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 211 transitions. [2018-03-29 20:34:50,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-03-29 20:34:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 211 transitions. [2018-03-29 20:34:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-03-29 20:34:50,684 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:34:50,684 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-03-29 20:34:50,684 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-03-29 20:34:50,684 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-03-29 20:34:50,690 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:34:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:34:50,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:34:50,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:34:50,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:50,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:50,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-03-29 20:34:50,755 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-03-29 20:34:50,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:34:50,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:50,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:50,762 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-03-29 20:34:50,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-03-29 20:34:51,050 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-03-29 20:34:51,052 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:51,053 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:51,054 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:51,054 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:51,055 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:51,057 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:51,065 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-03-29 20:34:51,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:34:51,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:34:51,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:34:51,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-03-29 20:34:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:51,250 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:34:51,824 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-03-29 20:34:51,857 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:34:51,857 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:34:51,858 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:34:51,858 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:34:51,859 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:34:51,859 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:34:51,864 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-03-29 20:34:51,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:51,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:51,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:34:51,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:86 [2018-03-29 20:34:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:52,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:34:52,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-03-29 20:34:52,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-03-29 20:34:52,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-03-29 20:34:52,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1599, Unknown=0, NotChecked=0, Total=1806 [2018-03-29 20:34:52,112 INFO L87 Difference]: Start difference. First operand 201 states and 211 transitions. Second operand 43 states. [2018-03-29 20:34:54,032 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 69 DAG size of output 63 [2018-03-29 20:34:55,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:34:55,334 INFO L93 Difference]: Finished difference Result 251 states and 268 transitions. [2018-03-29 20:34:55,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-03-29 20:34:55,334 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 66 [2018-03-29 20:34:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:34:55,335 INFO L225 Difference]: With dead ends: 251 [2018-03-29 20:34:55,335 INFO L226 Difference]: Without dead ends: 250 [2018-03-29 20:34:55,336 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=871, Invalid=5449, Unknown=0, NotChecked=0, Total=6320 [2018-03-29 20:34:55,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-03-29 20:34:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 229. [2018-03-29 20:34:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-03-29 20:34:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 243 transitions. [2018-03-29 20:34:55,354 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 243 transitions. Word has length 66 [2018-03-29 20:34:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:34:55,354 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 243 transitions. [2018-03-29 20:34:55,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-03-29 20:34:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 243 transitions. [2018-03-29 20:34:55,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-03-29 20:34:55,355 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:34:55,355 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-03-29 20:34:55,355 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-03-29 20:34:55,355 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-03-29 20:34:55,361 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:34:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:34:55,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:34:55,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:34:55,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:55,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:34:55,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:55,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:55,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-29 20:34:55,411 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:55,411 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:34:55,412 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-03-29 20:34:55,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:55,419 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-03-29 20:34:55,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:55,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:55,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-03-29 20:34:55,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03-29 20:34:55,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:34:55,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:55,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:55,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:55,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-03-29 20:34:55,453 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-03-29 20:34:55,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-29 20:34:55,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:55,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:55,463 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-03-29 20:34:55,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-03-29 20:34:55,632 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-03-29 20:34:55,640 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-03-29 20:34:55,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:34:55,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:34:55,665 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-03-29 20:34:55,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:49 [2018-03-29 20:34:55,799 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-03-29 20:34:55,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-29 20:34:55,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:55,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:55,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:55,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-03-29 20:34:55,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 21 treesize of output 17 [2018-03-29 20:34:55,879 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-03-29 20:34:55,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:34:55,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:34:55,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:34:55,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-03-29 20:34:55,975 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:55,976 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:34:57,186 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-03-29 20:34:57,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:34:57,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:57,206 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-03-29 20:34:57,208 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-03-29 20:34:57,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:57,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:34:57,220 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-03-29 20:34:57,222 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-03-29 20:34:57,223 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:57,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-03-29 20:34:57,244 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-03-29 20:34:57,245 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:57,249 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-03-29 20:34:57,250 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-03-29 20:34:57,259 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-03-29 20:34:57,302 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-03-29 20:34:57,371 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-03-29 20:34:57,371 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:57,373 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-03-29 20:34:57,373 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:57,375 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:34:57,376 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-03-29 20:34:57,376 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:57,443 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-03-29 20:34:57,444 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-03-29 20:34:57,455 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-03-29 20:34:57,456 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-03-29 20:34:57,517 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-03-29 20:34:57,517 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-03-29 20:34:57,524 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-03-29 20:34:57,524 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-03-29 20:34:57,551 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:34:57,570 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-03-29 20:34:57,574 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-03-29 20:34:57,589 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-03-29 20:34:57,611 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-03-29 20:34:57,612 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-03-29 20:34:57,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-03-29 20:34:57,618 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-03-29 20:34:57,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-03-29 20:34:57,620 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-03-29 20:34:57,661 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-03-29 20:34:57,661 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 3 xjuncts. [2018-03-29 20:34:57,667 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-03-29 20:34:57,667 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-03-29 20:34:57,691 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:34:57,709 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:34:57,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-03-29 20:34:57,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-29 20:34:57,763 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 6 variables, input treesize:58, output treesize:84 [2018-03-29 20:34:58,247 WARN L151 SmtUtils]: Spent 308ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-03-29 20:34:58,618 WARN L148 SmtUtils]: Spent 303ms on a formula simplification that was a NOOP. DAG size: 34 [2018-03-29 20:34:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:34:58,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:34:58,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 48 [2018-03-29 20:34:58,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-03-29 20:34:58,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-03-29 20:34:58,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2018-03-29 20:34:58,672 INFO L87 Difference]: Start difference. First operand 229 states and 243 transitions. Second operand 49 states. [2018-03-29 20:35:00,098 WARN L151 SmtUtils]: Spent 232ms on a formula simplification. DAG size of input: 125 DAG size of output 85 [2018-03-29 20:35:00,951 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 104 DAG size of output 73 [2018-03-29 20:35:01,237 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 102 DAG size of output 78 [2018-03-29 20:35:01,597 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 106 DAG size of output 81 [2018-03-29 20:35:01,864 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 92 DAG size of output 67 [2018-03-29 20:35:05,063 WARN L151 SmtUtils]: Spent 3119ms on a formula simplification. DAG size of input: 88 DAG size of output 57 [2018-03-29 20:35:05,527 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 89 DAG size of output 48 [2018-03-29 20:35:05,987 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 98 DAG size of output 45 [2018-03-29 20:35:06,773 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 93 DAG size of output 51 [2018-03-29 20:35:07,175 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 100 DAG size of output 48 [2018-03-29 20:35:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:35:08,469 INFO L93 Difference]: Finished difference Result 235 states and 248 transitions. [2018-03-29 20:35:08,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-03-29 20:35:08,470 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 72 [2018-03-29 20:35:08,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:35:08,471 INFO L225 Difference]: With dead ends: 235 [2018-03-29 20:35:08,471 INFO L226 Difference]: Without dead ends: 234 [2018-03-29 20:35:08,472 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=813, Invalid=5667, Unknown=0, NotChecked=0, Total=6480 [2018-03-29 20:35:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-03-29 20:35:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 154. [2018-03-29 20:35:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-03-29 20:35:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-03-29 20:35:08,491 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 72 [2018-03-29 20:35:08,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:35:08,495 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-03-29 20:35:08,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-03-29 20:35:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-03-29 20:35:08,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-03-29 20:35:08,495 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:35:08,496 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-03-29 20:35:08,496 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-03-29 20:35:08,496 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-03-29 20:35:08,502 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:35:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:35:08,528 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:35:08,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:35:08,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:08,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03-29 20:35:08,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:08,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:08,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-03-29 20:35:08,560 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:08,561 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:08,561 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-03-29 20:35:08,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:08,571 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:08,572 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:08,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:35:08,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:08,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:08,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-03-29 20:35:08,596 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-03-29 20:35:08,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:35:08,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:08,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:08,604 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-03-29 20:35:08,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-03-29 20:35:08,653 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-03-29 20:35:08,658 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-03-29 20:35:08,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:35:08,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:35:08,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:35:08,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:46 [2018-03-29 20:35:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:35:09,048 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:35:09,776 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-03-29 20:35:09,788 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-03-29 20:35:09,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:09,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:09,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:09,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:45 [2018-03-29 20:35:10,046 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-03-29 20:35:10,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:10,058 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-03-29 20:35:10,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:10,069 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-03-29 20:35:10,082 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-03-29 20:35:10,082 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:10,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:10,097 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-03-29 20:35:10,110 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-03-29 20:35:10,110 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:10,114 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:10,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:35:10,123 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-03-29 20:35:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:35:10,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:35:10,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2018-03-29 20:35:10,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-03-29 20:35:10,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-03-29 20:35:10,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2590, Unknown=0, NotChecked=0, Total=2756 [2018-03-29 20:35:10,206 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 53 states. [2018-03-29 20:35:17,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:35:17,316 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2018-03-29 20:35:17,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-03-29 20:35:17,316 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 76 [2018-03-29 20:35:17,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:35:17,318 INFO L225 Difference]: With dead ends: 247 [2018-03-29 20:35:17,318 INFO L226 Difference]: Without dead ends: 246 [2018-03-29 20:35:17,319 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3512 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1100, Invalid=13906, Unknown=0, NotChecked=0, Total=15006 [2018-03-29 20:35:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-03-29 20:35:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 154. [2018-03-29 20:35:17,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-03-29 20:35:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-03-29 20:35:17,341 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 76 [2018-03-29 20:35:17,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:35:17,342 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-03-29 20:35:17,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-03-29 20:35:17,342 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-03-29 20:35:17,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-03-29 20:35:17,342 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:35:17,343 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-03-29 20:35:17,343 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-03-29 20:35:17,343 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-03-29 20:35:17,348 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:35:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:35:17,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:35:17,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:35:17,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:17,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 20:35:17,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:17,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:17,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-03-29 20:35:17,410 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:17,411 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:17,411 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-03-29 20:35:17,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:17,421 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:17,422 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:17,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 20:35:17,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:17,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:17,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-03-29 20:35:17,446 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-03-29 20:35:17,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:35:17,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:17,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:17,454 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-03-29 20:35:17,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-03-29 20:35:18,036 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-03-29 20:35:18,039 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:18,039 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:18,041 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:18,047 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-03-29 20:35:18,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:35:18,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:35:18,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:35:18,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:84 [2018-03-29 20:35:18,434 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:35:18,435 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:35:19,390 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-03-29 20:35:19,412 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:35:19,413 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:35:19,413 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:35:19,416 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-03-29 20:35:19,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:19,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:19,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:19,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:77 [2018-03-29 20:35:19,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-03-29 20:35:19,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:19,739 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-03-29 20:35:19,752 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-03-29 20:35:19,752 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:19,756 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:19,768 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-03-29 20:35:19,783 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-03-29 20:35:19,784 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:19,788 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:19,800 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-03-29 20:35:19,800 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:19,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:35:19,810 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-03-29 20:35:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:35:19,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:35:19,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2018-03-29 20:35:19,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-03-29 20:35:19,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-03-29 20:35:19,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2968, Unknown=1, NotChecked=0, Total=3192 [2018-03-29 20:35:19,902 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 57 states. [2018-03-29 20:35:21,484 WARN L151 SmtUtils]: Spent 456ms on a formula simplification. DAG size of input: 59 DAG size of output 57 [2018-03-29 20:35:22,118 WARN L151 SmtUtils]: Spent 454ms on a formula simplification. DAG size of input: 57 DAG size of output 55 [2018-03-29 20:35:22,320 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 101 DAG size of output 69 [2018-03-29 20:35:24,793 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 96 DAG size of output 82 [2018-03-29 20:35:25,738 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 75 DAG size of output 72 [2018-03-29 20:35:25,920 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 86 DAG size of output 80 [2018-03-29 20:35:27,421 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 93 DAG size of output 79 [2018-03-29 20:35:28,606 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 95 DAG size of output 77 [2018-03-29 20:35:29,414 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 88 DAG size of output 74 [2018-03-29 20:35:30,120 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 84 DAG size of output 73 [2018-03-29 20:35:30,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:35:30,434 INFO L93 Difference]: Finished difference Result 260 states and 275 transitions. [2018-03-29 20:35:30,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-03-29 20:35:30,435 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 79 [2018-03-29 20:35:30,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:35:30,436 INFO L225 Difference]: With dead ends: 260 [2018-03-29 20:35:30,436 INFO L226 Difference]: Without dead ends: 259 [2018-03-29 20:35:30,437 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4610 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1527, Invalid=16294, Unknown=1, NotChecked=0, Total=17822 [2018-03-29 20:35:30,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-03-29 20:35:30,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 154. [2018-03-29 20:35:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-03-29 20:35:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2018-03-29 20:35:30,468 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 79 [2018-03-29 20:35:30,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:35:30,468 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2018-03-29 20:35:30,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-03-29 20:35:30,468 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2018-03-29 20:35:30,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-03-29 20:35:30,469 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:35:30,469 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-03-29 20:35:30,469 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-03-29 20:35:30,470 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-03-29 20:35:30,478 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:35:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:35:30,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:35:30,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:35:30,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:30,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:35:30,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:30,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-03-29 20:35:30,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-03-29 20:35:30,532 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:30,533 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:30,533 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-03-29 20:35:30,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:30,539 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:30,540 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-03-29 20:35:30,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:30,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:30,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-03-29 20:35:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:35:30,965 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:35:31,909 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-03-29 20:35:31,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:31,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03-29 20:35:31,920 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-03-29 20:35:31,921 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:31,921 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-29 20:35:31,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:31,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:31,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:31,927 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-03-29 20:35:31,977 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:35:31,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:35:31,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-03-29 20:35:31,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-03-29 20:35:31,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-03-29 20:35:31,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2793, Unknown=0, NotChecked=0, Total=2970 [2018-03-29 20:35:31,999 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 55 states. [2018-03-29 20:35:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:35:36,649 INFO L93 Difference]: Finished difference Result 273 states and 289 transitions. [2018-03-29 20:35:36,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-03-29 20:35:36,649 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 80 [2018-03-29 20:35:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:35:36,650 INFO L225 Difference]: With dead ends: 273 [2018-03-29 20:35:36,650 INFO L226 Difference]: Without dead ends: 272 [2018-03-29 20:35:36,652 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3234 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1348, Invalid=14654, Unknown=0, NotChecked=0, Total=16002 [2018-03-29 20:35:36,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-03-29 20:35:36,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 176. [2018-03-29 20:35:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-03-29 20:35:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 188 transitions. [2018-03-29 20:35:36,671 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 188 transitions. Word has length 80 [2018-03-29 20:35:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:35:36,672 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 188 transitions. [2018-03-29 20:35:36,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-03-29 20:35:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 188 transitions. [2018-03-29 20:35:36,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-03-29 20:35:36,672 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:35:36,672 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-03-29 20:35:36,672 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-03-29 20:35:36,673 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-03-29 20:35:36,680 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:35:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:35:36,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:35:36,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:35:36,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:36,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:35:36,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:36,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:36,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-03-29 20:35:36,776 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:36,777 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:36,778 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-03-29 20:35:36,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:36,789 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:36,790 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:36,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, 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-03-29 20:35:36,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:36,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:36,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-03-29 20:35:36,819 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-03-29 20:35:36,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-03-29 20:35:36,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:36,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:36,827 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-03-29 20:35:36,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-03-29 20:35:37,232 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-03-29 20:35:37,235 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:37,240 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-03-29 20:35:37,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:35:37,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:35:37,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:35:37,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:66 [2018-03-29 20:35:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:35:37,699 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:35:38,660 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-03-29 20:35:38,680 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:35:38,682 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-03-29 20:35:38,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:38,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:38,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:38,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:61 [2018-03-29 20:35:38,981 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-03-29 20:35:38,996 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-03-29 20:35:38,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:39,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:39,014 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-03-29 20:35:39,014 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:39,026 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-03-29 20:35:39,026 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:39,036 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-03-29 20:35:39,049 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-03-29 20:35:39,049 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:39,053 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:39,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:35:39,062 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:55, output treesize:21 [2018-03-29 20:35:39,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-03-29 20:35:39,158 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:35:39,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 58 [2018-03-29 20:35:39,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-03-29 20:35:39,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-03-29 20:35:39,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3219, Unknown=0, NotChecked=0, Total=3422 [2018-03-29 20:35:39,159 INFO L87 Difference]: Start difference. First operand 176 states and 188 transitions. Second operand 59 states. [2018-03-29 20:35:40,618 WARN L148 SmtUtils]: Spent 428ms on a formula simplification that was a NOOP. DAG size: 58 [2018-03-29 20:35:41,329 WARN L148 SmtUtils]: Spent 427ms on a formula simplification that was a NOOP. DAG size: 58 [2018-03-29 20:35:42,111 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 87 DAG size of output 78 [2018-03-29 20:35:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:35:48,385 INFO L93 Difference]: Finished difference Result 304 states and 319 transitions. [2018-03-29 20:35:48,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-03-29 20:35:48,385 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 83 [2018-03-29 20:35:48,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:35:48,386 INFO L225 Difference]: With dead ends: 304 [2018-03-29 20:35:48,386 INFO L226 Difference]: Without dead ends: 303 [2018-03-29 20:35:48,387 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4923 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1411, Invalid=18329, Unknown=0, NotChecked=0, Total=19740 [2018-03-29 20:35:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-03-29 20:35:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 177. [2018-03-29 20:35:48,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-03-29 20:35:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2018-03-29 20:35:48,407 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 83 [2018-03-29 20:35:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:35:48,408 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2018-03-29 20:35:48,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-03-29 20:35:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2018-03-29 20:35:48,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-03-29 20:35:48,408 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:35:48,408 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-03-29 20:35:48,408 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-03-29 20:35:48,409 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-03-29 20:35:48,418 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:35:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:35:48,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:35:48,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:35:48,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:48,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03-29 20:35:48,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:48,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:48,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-03-29 20:35:48,503 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:48,504 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:48,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03-29 20:35:48,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:48,515 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:48,515 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:48,516 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-03-29 20:35:48,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:48,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:48,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-03-29 20:35:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:35:49,113 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:35:50,292 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-03-29 20:35:50,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:50,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-03-29 20:35:50,302 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-29 20:35:50,303 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:50,304 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-03-29 20:35:50,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:50,307 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:50,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:50,310 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-03-29 20:35:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:35:50,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:35:50,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-03-29 20:35:50,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-03-29 20:35:50,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-03-29 20:35:50,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=3529, Unknown=0, NotChecked=0, Total=3782 [2018-03-29 20:35:50,423 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand 62 states. [2018-03-29 20:35:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 20:35:57,129 INFO L93 Difference]: Finished difference Result 314 states and 331 transitions. [2018-03-29 20:35:57,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-03-29 20:35:57,129 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 84 [2018-03-29 20:35:57,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 20:35:57,130 INFO L225 Difference]: With dead ends: 314 [2018-03-29 20:35:57,130 INFO L226 Difference]: Without dead ends: 313 [2018-03-29 20:35:57,131 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4935 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2214, Invalid=20738, Unknown=0, NotChecked=0, Total=22952 [2018-03-29 20:35:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-03-29 20:35:57,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 200. [2018-03-29 20:35:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-03-29 20:35:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 212 transitions. [2018-03-29 20:35:57,152 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 212 transitions. Word has length 84 [2018-03-29 20:35:57,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 20:35:57,152 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 212 transitions. [2018-03-29 20:35:57,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-03-29 20:35:57,152 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 212 transitions. [2018-03-29 20:35:57,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-03-29 20:35:57,152 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 20:35:57,153 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-03-29 20:35:57,153 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-03-29 20:35:57,153 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-03-29 20:35:57,158 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 20:35:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 20:35:57,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 20:35:57,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:35:57,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:57,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:57,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-03-29 20:35:57,230 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-03-29 20:35:57,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 20:35:57,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:35:57,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:35:57,237 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-03-29 20:35:57,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-03-29 20:35:58,168 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-03-29 20:35:58,175 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,176 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,177 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,177 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,178 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,179 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,180 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,182 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,183 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,184 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,184 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,185 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,186 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,186 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,187 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,188 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,188 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,189 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,189 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,190 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,191 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,191 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,192 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,193 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,193 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,194 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,195 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,195 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 20:35:58,221 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-03-29 20:35:58,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 20:35:58,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:35:58,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:35:58,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:109, output treesize:129 [2018-03-29 20:35:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:35:58,706 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 20:36:00,591 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-03-29 20:36:00,664 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,665 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,665 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,665 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,666 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,666 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,666 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,667 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,667 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,667 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,668 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,668 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,668 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,669 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,669 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,670 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,670 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,670 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,671 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,671 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,671 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,671 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,672 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,672 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,672 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,672 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,673 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,673 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 20:36:00,694 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-03-29 20:36:00,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 20:36:00,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 20:36:00,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 20:36:00,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:150 [2018-03-29 20:36:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 20:36:01,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 20:36:01,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2018-03-29 20:36:01,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-03-29 20:36:01,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-03-29 20:36:01,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=3863, Unknown=0, NotChecked=0, Total=4422 [2018-03-29 20:36:01,189 INFO L87 Difference]: Start difference. First operand 200 states and 212 transitions. Second operand 67 states. [2018-03-29 20:36:05,175 WARN L151 SmtUtils]: Spent 244ms on a formula simplification. DAG size of input: 137 DAG size of output 121 [2018-03-29 20:36:06,503 WARN L151 SmtUtils]: Spent 1238ms on a formula simplification. DAG size of input: 131 DAG size of output 116 [2018-03-29 20:36:06,790 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 88 DAG size of output 74 [2018-03-29 20:36:07,036 WARN L148 SmtUtils]: Spent 148ms on a formula simplification that was a NOOP. DAG size: 97 [2018-03-29 20:36:07,443 WARN L151 SmtUtils]: Spent 334ms on a formula simplification. DAG size of input: 105 DAG size of output 103 [2018-03-29 20:36:07,607 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 84 DAG size of output 70 [2018-03-29 20:36:07,829 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 83 DAG size of output 69 [2018-03-29 20:36:08,139 WARN L151 SmtUtils]: Spent 220ms on a formula simplification. DAG size of input: 91 DAG size of output 77 [2018-03-29 20:36:08,501 WARN L151 SmtUtils]: Spent 288ms on a formula simplification. DAG size of input: 106 DAG size of output 88 [2018-03-29 20:36:09,186 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 80 DAG size of output 70 [2018-03-29 20:36:09,544 WARN L151 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 104 DAG size of output 88 [2018-03-29 20:36:10,038 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 71 DAG size of output 63 [2018-03-29 20:36:10,380 WARN L151 SmtUtils]: Spent 226ms on a formula simplification. DAG size of input: 103 DAG size of output 87 [2018-03-29 20:36:11,137 WARN L151 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 102 DAG size of output 84 [2018-03-29 20:36:11,802 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 101 DAG size of output 83 [2018-03-29 20:36:12,411 WARN L151 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 100 DAG size of output 82 [2018-03-29 20:36:13,871 WARN L151 SmtUtils]: Spent 448ms on a formula simplification. DAG size of input: 114 DAG size of output 96 Received shutdown request... [2018-03-29 20:36:14,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-03-29 20:36:14,453 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-29 20:36:14,456 WARN L197 ceAbstractionStarter]: Timeout [2018-03-29 20:36:14,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 08:36:14 BoogieIcfgContainer [2018-03-29 20:36:14,457 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-29 20:36:14,457 INFO L168 Benchmark]: Toolchain (without parser) took 141017.87 ms. Allocated memory was 305.7 MB in the beginning and 486.0 MB in the end (delta: 180.4 MB). Free memory was 243.5 MB in the beginning and 340.6 MB in the end (delta: -97.1 MB). Peak memory consumption was 83.2 MB. Max. memory is 5.3 GB. [2018-03-29 20:36:14,458 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 305.7 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-29 20:36:14,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.09 ms. Allocated memory is still 305.7 MB. Free memory was 243.5 MB in the beginning and 219.3 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 5.3 GB. [2018-03-29 20:36:14,459 INFO L168 Benchmark]: Boogie Preprocessor took 52.73 ms. Allocated memory is still 305.7 MB. Free memory was 219.3 MB in the beginning and 216.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-03-29 20:36:14,459 INFO L168 Benchmark]: RCFGBuilder took 608.49 ms. Allocated memory was 305.7 MB in the beginning and 466.1 MB in the end (delta: 160.4 MB). Free memory was 216.3 MB in the beginning and 400.6 MB in the end (delta: -184.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-03-29 20:36:14,459 INFO L168 Benchmark]: TraceAbstraction took 140039.26 ms. Allocated memory was 466.1 MB in the beginning and 486.0 MB in the end (delta: 19.9 MB). Free memory was 399.2 MB in the beginning and 340.6 MB in the end (delta: 58.6 MB). Peak memory consumption was 78.5 MB. Max. memory is 5.3 GB. [2018-03-29 20:36:14,461 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.23 ms. Allocated memory is still 305.7 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 311.09 ms. Allocated memory is still 305.7 MB. Free memory was 243.5 MB in the beginning and 219.3 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 52.73 ms. Allocated memory is still 305.7 MB. Free memory was 219.3 MB in the beginning and 216.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 608.49 ms. Allocated memory was 305.7 MB in the beginning and 466.1 MB in the end (delta: 160.4 MB). Free memory was 216.3 MB in the beginning and 400.6 MB in the end (delta: -184.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 140039.26 ms. Allocated memory was 466.1 MB in the beginning and 486.0 MB in the end (delta: 19.9 MB). Free memory was 399.2 MB in the beginning and 340.6 MB in the end (delta: 58.6 MB). Peak memory consumption was 78.5 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 (200states) and interpolant automaton (currently 74 states, 67 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 564]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (200states) and interpolant automaton (currently 74 states, 67 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (200states) and interpolant automaton (currently 74 states, 67 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (200states) and interpolant automaton (currently 74 states, 67 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 564]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (200states) and interpolant automaton (currently 74 states, 67 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (200states) and interpolant automaton (currently 74 states, 67 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (200states) and interpolant automaton (currently 74 states, 67 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (200states) and interpolant automaton (currently 74 states, 67 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (200states) and interpolant automaton (currently 74 states, 67 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (200states) and interpolant automaton (currently 74 states, 67 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (200states) and interpolant automaton (currently 74 states, 67 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 89 locations, 11 error locations. TIMEOUT Result, 139.9s OverallTime, 34 OverallIterations, 10 TraceHistogramMax, 107.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2306 SDtfs, 7476 SDslu, 27155 SDs, 0 SdLazy, 25934 SolverSat, 1314 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 23.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4411 GetRequests, 2773 SyntacticMatches, 34 SemanticMatches, 1603 ConstructedPredicates, 40 IntricatePredicates, 0 DeprecatedPredicates, 34313 ImplicationChecksByTransitivity, 105.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 1470 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 29.9s InterpolantComputationTime, 1810 NumberOfCodeBlocks, 1810 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 3552 ConstructedInterpolants, 647 QuantifiedInterpolants, 3479935 SizeOfPredicates, 553 NumberOfNonLiveVariables, 5544 ConjunctsInSsa, 1123 ConjunctsInUnsatCore, 68 InterpolantComputations, 38 PerfectInterpolantSequences, 0/1656 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-03-29_20-36-14-469.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-03-29_20-36-14-469.csv Completed graceful shutdown