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/cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-835382a-m [2018-04-05 15:24:59,429 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-05 15:24:59,432 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-05 15:24:59,447 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-05 15:24:59,448 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-05 15:24:59,449 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-05 15:24:59,450 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-05 15:24:59,453 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-05 15:24:59,455 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-05 15:24:59,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-05 15:24:59,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-05 15:24:59,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-05 15:24:59,458 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-05 15:24:59,460 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-05 15:24:59,461 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-05 15:24:59,464 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-05 15:24:59,466 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-05 15:24:59,468 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-05 15:24:59,470 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-05 15:24:59,471 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-05 15:24:59,474 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-05 15:24:59,475 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-05 15:24:59,475 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-05 15:24:59,476 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-05 15:24:59,477 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-05 15:24:59,479 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-05 15:24:59,479 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-05 15:24:59,480 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-05 15:24:59,481 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-05 15:24:59,481 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-05 15:24:59,482 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-05 15:24:59,483 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-05 15:24:59,549 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-05 15:24:59,550 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-05 15:24:59,550 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-05 15:24:59,551 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-05 15:24:59,551 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-05 15:24:59,560 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-05 15:24:59,560 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-05 15:24:59,560 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-05 15:24:59,561 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-05 15:24:59,561 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-05 15:24:59,562 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-05 15:24:59,562 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-05 15:24:59,562 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-05 15:24:59,563 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-05 15:24:59,563 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-05 15:24:59,563 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-05 15:24:59,563 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-05 15:24:59,564 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-05 15:24:59,583 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-05 15:24:59,583 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-05 15:24:59,587 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-05 15:24:59,587 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-05 15:24:59,588 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-05 15:24:59,588 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-05 15:24:59,588 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-05 15:24:59,588 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 15:24:59,589 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-05 15:24:59,589 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-05 15:24:59,589 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-05 15:24:59,589 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-05 15:24:59,589 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-05 15:24:59,590 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:24:59,590 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-05 15:24:59,601 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-05 15:24:59,601 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-05 15:24:59,602 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-05 15:24:59,602 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-05 15:24:59,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-05 15:24:59,710 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-05 15:24:59,722 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-05 15:24:59,729 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-05 15:24:59,730 INFO L276 PluginConnector]: CDTParser initialized [2018-04-05 15:24:59,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,334 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG595f01cd0 [2018-04-05 15:25:00,833 INFO L287 CDTParser]: IsIndexed: true [2018-04-05 15:25:00,834 INFO L288 CDTParser]: Found 1 translation units. [2018-04-05 15:25:00,835 INFO L168 CDTParser]: Scanning cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,860 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-05 15:25:00,874 INFO L215 ultiparseSymbolTable]: [2018-04-05 15:25:00,874 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-05 15:25:00,874 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,874 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,874 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,875 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,875 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-05 15:25:00,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__time_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,875 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,876 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____id_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__div_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_short in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__key_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ulong in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_short in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__off_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_char in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,890 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_long in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__size_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,891 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,892 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_char in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,893 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__id_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____u_int in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,894 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,895 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,896 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____off_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__uint in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_long in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,897 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,898 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ushort in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____time_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,899 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__register_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____key_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:00,900 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:01,001 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG595f01cd0 [2018-04-05 15:25:01,011 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-05 15:25:01,018 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-05 15:25:01,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-05 15:25:01,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-05 15:25:01,052 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-05 15:25:01,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 03:25:01" (1/1) ... [2018-04-05 15:25:01,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55e7ab32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:25:01, skipping insertion in model container [2018-04-05 15:25:01,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 03:25:01" (1/1) ... [2018-04-05 15:25:01,104 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 15:25:01,201 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 15:25:01,654 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 15:25:01,768 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 15:25:01,782 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-05 15:25:01,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:25:01 WrapperNode [2018-04-05 15:25:01,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-05 15:25:01,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-05 15:25:01,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-05 15:25:01,928 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-05 15:25:01,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:25:01" (1/1) ... [2018-04-05 15:25:01,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:25:01" (1/1) ... [2018-04-05 15:25:01,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:25:01" (1/1) ... [2018-04-05 15:25:01,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:25:01" (1/1) ... [2018-04-05 15:25:02,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:25:01" (1/1) ... [2018-04-05 15:25:02,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:25:01" (1/1) ... [2018-04-05 15:25:02,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:25:01" (1/1) ... [2018-04-05 15:25:02,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-05 15:25:02,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-05 15:25:02,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-05 15:25:02,074 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-05 15:25:02,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:25:01" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 15:25:02,471 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-05 15:25:02,471 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-05 15:25:02,471 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-05 15:25:02,472 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-05 15:25:02,473 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-04-05 15:25:02,473 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-05 15:25:02,473 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-05 15:25:02,473 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-05 15:25:02,474 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-05 15:25:02,474 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-05 15:25:02,474 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-05 15:25:02,474 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-05 15:25:02,474 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-05 15:25:02,474 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-05 15:25:02,474 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-05 15:25:02,475 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-05 15:25:02,475 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-05 15:25:02,475 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-05 15:25:02,475 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-05 15:25:02,475 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-05 15:25:02,475 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-05 15:25:02,475 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-05 15:25:02,476 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-05 15:25:02,476 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-05 15:25:02,476 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-05 15:25:02,476 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-05 15:25:02,476 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-05 15:25:02,476 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-05 15:25:02,476 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-05 15:25:02,477 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-05 15:25:02,493 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-05 15:25:02,493 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-05 15:25:02,493 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-05 15:25:02,494 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-05 15:25:02,494 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-05 15:25:02,494 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-05 15:25:02,494 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-05 15:25:02,494 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-05 15:25:02,494 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-05 15:25:02,494 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-05 15:25:02,495 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-05 15:25:02,495 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-05 15:25:02,495 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-05 15:25:02,495 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-05 15:25:02,495 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-05 15:25:02,495 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-05 15:25:02,495 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-05 15:25:02,496 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-05 15:25:02,505 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-05 15:25:02,505 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-05 15:25:02,505 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-05 15:25:02,505 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-05 15:25:02,506 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-05 15:25:02,506 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-05 15:25:02,506 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-05 15:25:02,506 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-05 15:25:02,506 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-05 15:25:02,511 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-05 15:25:02,511 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-05 15:25:02,511 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-05 15:25:02,511 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-05 15:25:02,511 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-05 15:25:02,512 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-05 15:25:02,512 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-05 15:25:02,512 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-05 15:25:02,512 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-05 15:25:02,512 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-05 15:25:02,512 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-05 15:25:02,512 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-05 15:25:02,513 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-05 15:25:02,513 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-05 15:25:02,513 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-05 15:25:02,513 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-05 15:25:02,513 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-05 15:25:02,513 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-05 15:25:02,513 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-05 15:25:02,514 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-05 15:25:02,514 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-05 15:25:02,514 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-05 15:25:02,514 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-05 15:25:02,514 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-05 15:25:02,514 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-05 15:25:02,514 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-05 15:25:02,515 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-05 15:25:02,526 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-05 15:25:02,526 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-05 15:25:02,526 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-05 15:25:02,526 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-05 15:25:02,527 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-05 15:25:02,527 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-05 15:25:02,527 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-05 15:25:02,527 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-05 15:25:02,527 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-05 15:25:02,527 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-05 15:25:02,527 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-05 15:25:02,528 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-05 15:25:02,528 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-05 15:25:02,528 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-05 15:25:02,528 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-05 15:25:02,528 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-05 15:25:02,528 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-05 15:25:02,528 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-05 15:25:02,529 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-05 15:25:02,529 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-05 15:25:02,529 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-05 15:25:02,529 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-05 15:25:02,529 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-05 15:25:02,529 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-05 15:25:02,529 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-05 15:25:02,530 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-04-05 15:25:02,541 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-05 15:25:02,541 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-05 15:25:02,541 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-05 15:25:02,541 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-05 15:25:02,542 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-05 15:25:02,542 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-05 15:25:02,542 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-05 15:25:02,542 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-05 15:25:03,768 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-05 15:25:03,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 03:25:03 BoogieIcfgContainer [2018-04-05 15:25:03,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-05 15:25:03,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-05 15:25:03,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-05 15:25:03,788 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-05 15:25:03,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 03:25:01" (1/3) ... [2018-04-05 15:25:03,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f13eb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 03:25:03, skipping insertion in model container [2018-04-05 15:25:03,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:25:01" (2/3) ... [2018-04-05 15:25:03,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f13eb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 03:25:03, skipping insertion in model container [2018-04-05 15:25:03,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 03:25:03" (3/3) ... [2018-04-05 15:25:03,802 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-05 15:25:03,836 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-05 15:25:03,860 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-04-05 15:25:04,011 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-05 15:25:04,012 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-05 15:25:04,013 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-05 15:25:04,013 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-05 15:25:04,014 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-05 15:25:04,014 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-05 15:25:04,014 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-05 15:25:04,014 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-05 15:25:04,014 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-05 15:25:04,015 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-05 15:25:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-04-05 15:25:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-05 15:25:04,067 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:25:04,068 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:25:04,068 INFO L408 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:25:04,079 INFO L82 PathProgramCache]: Analyzing trace with hash -921233729, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:25:04,123 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:25:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:25:04,222 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:25:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:04,331 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:25:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:04,528 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:25:04,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-05 15:25:04,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-05 15:25:04,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-05 15:25:04,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-05 15:25:04,567 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states. [2018-04-05 15:25:04,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:25:04,818 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-04-05 15:25:04,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-05 15:25:04,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-04-05 15:25:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:25:04,850 INFO L225 Difference]: With dead ends: 112 [2018-04-05 15:25:04,850 INFO L226 Difference]: Without dead ends: 75 [2018-04-05 15:25:04,862 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-05 15:25:04,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-05 15:25:04,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-05 15:25:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-05 15:25:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-04-05 15:25:05,002 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 21 [2018-04-05 15:25:05,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:25:05,003 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-04-05 15:25:05,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-05 15:25:05,003 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-04-05 15:25:05,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-05 15:25:05,004 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:25:05,004 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:25:05,004 INFO L408 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:25:05,005 INFO L82 PathProgramCache]: Analyzing trace with hash 425643425, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:25:05,043 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:25:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:25:05,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:25:05,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:25:05,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:05,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:25:05,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:05,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:05,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-05 15:25:05,667 WARN L148 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 14 [2018-04-05 15:25:05,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:25:05,789 INFO L303 Elim1Store]: Index analysis took 101 ms [2018-04-05 15:25:05,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-05 15:25:05,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:06,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:25:06,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:25:06,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-05 15:25:06,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:06,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:06,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-05 15:25:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:06,288 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:25:06,726 WARN L148 SmtUtils]: Spent 133ms on a formula simplification that was a NOOP. DAG size: 26 [2018-04-05 15:25:06,903 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:06,904 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-04-05 15:25:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:07,005 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:25:07,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-05 15:25:07,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-05 15:25:07,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-05 15:25:07,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-05 15:25:07,013 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 9 states. [2018-04-05 15:25:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:25:07,669 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-04-05 15:25:07,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-05 15:25:07,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-04-05 15:25:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:25:07,671 INFO L225 Difference]: With dead ends: 75 [2018-04-05 15:25:07,672 INFO L226 Difference]: Without dead ends: 73 [2018-04-05 15:25:07,673 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-05 15:25:07,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-05 15:25:07,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-04-05 15:25:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-05 15:25:07,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-04-05 15:25:07,687 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 24 [2018-04-05 15:25:07,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:25:07,687 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-04-05 15:25:07,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-05 15:25:07,688 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-04-05 15:25:07,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-05 15:25:07,693 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:25:07,693 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:25:07,694 INFO L408 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:25:07,694 INFO L82 PathProgramCache]: Analyzing trace with hash 310044275, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:25:07,706 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:25:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:25:07,823 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:25:07,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:25:07,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:07,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:07,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 15:25:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:07,924 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:25:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:08,098 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:25:08,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-05 15:25:08,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-05 15:25:08,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-05 15:25:08,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-05 15:25:08,099 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2018-04-05 15:25:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:25:08,405 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-04-05 15:25:08,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-05 15:25:08,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-05 15:25:08,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:25:08,407 INFO L225 Difference]: With dead ends: 73 [2018-04-05 15:25:08,408 INFO L226 Difference]: Without dead ends: 72 [2018-04-05 15:25:08,408 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-05 15:25:08,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-05 15:25:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-04-05 15:25:08,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-05 15:25:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-04-05 15:25:08,449 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 25 [2018-04-05 15:25:08,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:25:08,455 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-04-05 15:25:08,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-05 15:25:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-04-05 15:25:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-05 15:25:08,456 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:25:08,456 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:25:08,456 INFO L408 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:25:08,457 INFO L82 PathProgramCache]: Analyzing trace with hash 310044276, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:25:08,496 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:25:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:25:08,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:25:08,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:25:08,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:08,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:08,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-04-05 15:25:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:09,068 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:25:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:09,310 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:25:09,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-04-05 15:25:09,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-05 15:25:09,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-05 15:25:09,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-05 15:25:09,311 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 8 states. [2018-04-05 15:25:09,643 WARN L148 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 18 [2018-04-05 15:25:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:25:09,945 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-04-05 15:25:09,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-05 15:25:09,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-05 15:25:09,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:25:09,946 INFO L225 Difference]: With dead ends: 72 [2018-04-05 15:25:09,946 INFO L226 Difference]: Without dead ends: 71 [2018-04-05 15:25:09,947 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-05 15:25:09,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-05 15:25:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-04-05 15:25:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-05 15:25:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-04-05 15:25:09,963 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 25 [2018-04-05 15:25:09,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:25:09,969 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-04-05 15:25:09,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-05 15:25:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-04-05 15:25:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-05 15:25:09,970 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:25:09,970 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:25:09,971 INFO L408 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:25:09,971 INFO L82 PathProgramCache]: Analyzing trace with hash 178192733, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:25:10,006 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:25:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:25:10,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:25:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:10,172 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:25:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:10,294 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:25:10,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-05 15:25:10,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 15:25:10,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 15:25:10,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-05 15:25:10,296 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2018-04-05 15:25:10,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:25:10,699 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-04-05 15:25:10,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-05 15:25:10,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-05 15:25:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:25:10,701 INFO L225 Difference]: With dead ends: 78 [2018-04-05 15:25:10,701 INFO L226 Difference]: Without dead ends: 77 [2018-04-05 15:25:10,702 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-05 15:25:10,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-05 15:25:10,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-04-05 15:25:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-05 15:25:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-04-05 15:25:10,727 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 31 [2018-04-05 15:25:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:25:10,727 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-04-05 15:25:10,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 15:25:10,727 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-04-05 15:25:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-05 15:25:10,732 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:25:10,733 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:25:10,733 INFO L408 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:25:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash 178192734, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:25:10,756 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:25:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:25:10,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:25:10,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:25:10,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:10,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:10,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-05 15:25:11,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:11,148 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:25:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:11,687 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:25:11,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2018-04-05 15:25:11,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-05 15:25:11,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-05 15:25:11,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-04-05 15:25:11,688 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 14 states. [2018-04-05 15:25:13,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:25:13,022 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-04-05 15:25:13,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-05 15:25:13,022 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-04-05 15:25:13,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:25:13,023 INFO L225 Difference]: With dead ends: 85 [2018-04-05 15:25:13,024 INFO L226 Difference]: Without dead ends: 84 [2018-04-05 15:25:13,024 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-04-05 15:25:13,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-05 15:25:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2018-04-05 15:25:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-05 15:25:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-04-05 15:25:13,044 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 31 [2018-04-05 15:25:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:25:13,045 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-04-05 15:25:13,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-05 15:25:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-04-05 15:25:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-05 15:25:13,047 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:25:13,047 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:25:13,047 INFO L408 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:25:13,047 INFO L82 PathProgramCache]: Analyzing trace with hash 404305818, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:25:13,079 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:25:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:25:13,136 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:25:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 15:25:13,322 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:25:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-05 15:25:13,389 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:25:13,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-05 15:25:13,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-05 15:25:13,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-05 15:25:13,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-05 15:25:13,391 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 7 states. [2018-04-05 15:25:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:25:14,146 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-04-05 15:25:14,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-05 15:25:14,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-04-05 15:25:14,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:25:14,148 INFO L225 Difference]: With dead ends: 76 [2018-04-05 15:25:14,148 INFO L226 Difference]: Without dead ends: 75 [2018-04-05 15:25:14,156 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-05 15:25:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-05 15:25:14,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-04-05 15:25:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-05 15:25:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-04-05 15:25:14,171 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 38 [2018-04-05 15:25:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:25:14,172 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-04-05 15:25:14,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-05 15:25:14,182 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-04-05 15:25:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-05 15:25:14,190 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:25:14,190 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:25:14,190 INFO L408 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:25:14,191 INFO L82 PathProgramCache]: Analyzing trace with hash 404305819, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:25:14,217 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:25:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:25:14,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:25:14,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:25:14,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:14,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:14,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-05 15:25:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:14,873 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:25:15,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:15,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 15:25:15,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-04-05 15:25:15,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-05 15:25:15,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-05 15:25:15,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-04-05 15:25:15,801 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 19 states. [2018-04-05 15:25:16,576 WARN L148 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 16 [2018-04-05 15:25:17,100 WARN L148 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 19 [2018-04-05 15:25:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:25:18,624 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-04-05 15:25:18,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-05 15:25:18,624 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-04-05 15:25:18,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:25:18,627 INFO L225 Difference]: With dead ends: 95 [2018-04-05 15:25:18,627 INFO L226 Difference]: Without dead ends: 94 [2018-04-05 15:25:18,639 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-04-05 15:25:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-04-05 15:25:18,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2018-04-05 15:25:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-05 15:25:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-04-05 15:25:18,674 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 38 [2018-04-05 15:25:18,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:25:18,675 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-04-05 15:25:18,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-05 15:25:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-04-05 15:25:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-05 15:25:18,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:25:18,686 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:25:18,686 INFO L408 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:25:18,687 INFO L82 PathProgramCache]: Analyzing trace with hash 585207874, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:25:18,715 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:25:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:25:18,753 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:25:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:18,879 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:25:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:18,953 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:25:18,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-05 15:25:18,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 15:25:18,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 15:25:18,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-05 15:25:18,954 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2018-04-05 15:25:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:25:19,516 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-04-05 15:25:19,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-05 15:25:19,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-04-05 15:25:19,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:25:19,581 INFO L225 Difference]: With dead ends: 79 [2018-04-05 15:25:19,581 INFO L226 Difference]: Without dead ends: 78 [2018-04-05 15:25:19,581 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-05 15:25:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-05 15:25:19,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-04-05 15:25:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-05 15:25:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-04-05 15:25:19,612 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-04-05 15:25:19,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:25:19,612 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-04-05 15:25:19,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 15:25:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-04-05 15:25:19,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-05 15:25:19,613 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:25:19,614 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:25:19,624 INFO L408 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:25:19,624 INFO L82 PathProgramCache]: Analyzing trace with hash 585207875, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:25:19,651 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:25:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:25:19,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:25:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:20,242 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:25:20,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-05 15:25:20,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:20,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-05 15:25:20,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:20,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:25:20,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-05 15:25:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:20,524 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:25:20,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-05 15:25:20,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-05 15:25:20,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-05 15:25:20,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-05 15:25:20,526 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 9 states. [2018-04-05 15:25:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:25:21,780 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-04-05 15:25:21,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-05 15:25:21,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-04-05 15:25:21,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:25:21,782 INFO L225 Difference]: With dead ends: 85 [2018-04-05 15:25:21,782 INFO L226 Difference]: Without dead ends: 84 [2018-04-05 15:25:21,783 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-04-05 15:25:21,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-05 15:25:21,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-04-05 15:25:21,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-05 15:25:21,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-04-05 15:25:21,805 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 39 [2018-04-05 15:25:21,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:25:21,805 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-04-05 15:25:21,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-05 15:25:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-04-05 15:25:21,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-05 15:25:21,806 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:25:21,811 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:25:21,812 INFO L408 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:25:21,812 INFO L82 PathProgramCache]: Analyzing trace with hash 961574980, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:25:21,830 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:25:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:25:21,894 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:25:22,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:22,105 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:25:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:22,195 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:25:22,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-05 15:25:22,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-05 15:25:22,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-05 15:25:22,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-05 15:25:22,196 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 7 states. [2018-04-05 15:25:22,936 WARN L148 SmtUtils]: Spent 144ms on a formula simplification that was a NOOP. DAG size: 15 [2018-04-05 15:25:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:25:23,116 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-04-05 15:25:23,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-05 15:25:23,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-04-05 15:25:23,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:25:23,118 INFO L225 Difference]: With dead ends: 84 [2018-04-05 15:25:23,118 INFO L226 Difference]: Without dead ends: 83 [2018-04-05 15:25:23,118 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-05 15:25:23,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-05 15:25:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-05 15:25:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-05 15:25:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-04-05 15:25:23,126 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 40 [2018-04-05 15:25:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:25:23,130 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-04-05 15:25:23,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-05 15:25:23,130 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-04-05 15:25:23,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-05 15:25:23,137 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:25:23,137 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:25:23,137 INFO L408 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:25:23,137 INFO L82 PathProgramCache]: Analyzing trace with hash 961574981, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:25:23,162 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:25:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:25:23,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:25:23,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:25:23,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:23,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:23,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-05 15:25:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:23,784 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:25:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:24,554 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:25:24,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2018-04-05 15:25:24,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-05 15:25:24,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-05 15:25:24,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-04-05 15:25:24,595 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 18 states. [2018-04-05 15:25:26,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:25:26,518 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-04-05 15:25:26,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-05 15:25:26,519 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-04-05 15:25:26,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:25:26,522 INFO L225 Difference]: With dead ends: 110 [2018-04-05 15:25:26,522 INFO L226 Difference]: Without dead ends: 109 [2018-04-05 15:25:26,523 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2018-04-05 15:25:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-05 15:25:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2018-04-05 15:25:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-05 15:25:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2018-04-05 15:25:26,537 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 40 [2018-04-05 15:25:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:25:26,537 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2018-04-05 15:25:26,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-05 15:25:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2018-04-05 15:25:26,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-05 15:25:26,547 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:25:26,547 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:25:26,547 INFO L408 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:25:26,548 INFO L82 PathProgramCache]: Analyzing trace with hash 226357950, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:25:26,567 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:25:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:25:26,627 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:25:26,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-04-05 15:25:26,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:26,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:26,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-05 15:25:27,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-05 15:25:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 15:25:27,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:27,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:27,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 15:25:27,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-05 15:25:27,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-05 15:25:27,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-04-05 15:25:27,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-05 15:25:27,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:25:27,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:25:27,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35 [2018-04-05 15:25:27,878 WARN L151 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 17 DAG size of output 17 [2018-04-05 15:25:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:28,441 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:25:29,511 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 18 DAG size of output 14 [2018-04-05 15:25:30,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-05 15:25:30,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-05 15:25:30,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:30,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:30,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:25:30,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:38 [2018-04-05 15:25:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:31,299 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 15:25:31,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-04-05 15:25:31,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-05 15:25:31,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-05 15:25:31,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2018-04-05 15:25:31,301 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 31 states. [2018-04-05 15:25:33,328 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 54 DAG size of output 51 [2018-04-05 15:25:34,119 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 54 DAG size of output 53 [2018-04-05 15:25:34,907 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 48 DAG size of output 46 [2018-04-05 15:25:36,209 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 49 DAG size of output 46 [2018-04-05 15:25:37,259 WARN L151 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 48 DAG size of output 44 [2018-04-05 15:25:37,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:25:37,484 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-04-05 15:25:37,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-05 15:25:37,485 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-04-05 15:25:37,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:25:37,486 INFO L225 Difference]: With dead ends: 124 [2018-04-05 15:25:37,486 INFO L226 Difference]: Without dead ends: 123 [2018-04-05 15:25:37,487 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=351, Invalid=2301, Unknown=0, NotChecked=0, Total=2652 [2018-04-05 15:25:37,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-05 15:25:37,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2018-04-05 15:25:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-05 15:25:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-04-05 15:25:37,517 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 45 [2018-04-05 15:25:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:25:37,518 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-04-05 15:25:37,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-05 15:25:37,518 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-04-05 15:25:37,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-05 15:25:37,519 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:25:37,519 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:25:37,519 INFO L408 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:25:37,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1360561045, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:25:37,539 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:25:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:25:37,573 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:25:37,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:25:37,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:37,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:37,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 15:25:37,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:25:37,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:25:37,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-05 15:25:37,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:37,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:38,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-05 15:25:38,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-05 15:25:38,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 15:25:38,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:38,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:38,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 15:25:38,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-05 15:25:38,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-05 15:25:38,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 15:25:38,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:38,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:38,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-05 15:25:38,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-05 15:25:38,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-04-05 15:25:38,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-05 15:25:38,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:39,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-05 15:25:39,094 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-05 15:25:39,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:25:39,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:25:39,214 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-04-05 15:25:39,510 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 15 DAG size of output 15 [2018-04-05 15:25:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:39,803 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:25:41,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-05 15:25:41,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:41,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-05 15:25:41,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-05 15:25:41,290 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:41,297 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:41,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:41,331 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-04-05 15:25:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:41,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 15:25:41,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-04-05 15:25:41,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-05 15:25:41,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-05 15:25:41,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-04-05 15:25:41,574 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 25 states. [2018-04-05 15:25:42,790 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 46 DAG size of output 42 [2018-04-05 15:25:43,187 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 68 DAG size of output 57 [2018-04-05 15:25:43,723 WARN L151 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 63 DAG size of output 54 [2018-04-05 15:25:44,140 WARN L151 SmtUtils]: Spent 300ms on a formula simplification. DAG size of input: 34 DAG size of output 31 [2018-04-05 15:25:44,378 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 25 DAG size of output 24 [2018-04-05 15:25:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:25:45,418 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2018-04-05 15:25:45,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-05 15:25:45,418 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-04-05 15:25:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:25:45,419 INFO L225 Difference]: With dead ends: 129 [2018-04-05 15:25:45,420 INFO L226 Difference]: Without dead ends: 128 [2018-04-05 15:25:45,422 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=211, Invalid=1349, Unknown=0, NotChecked=0, Total=1560 [2018-04-05 15:25:45,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-05 15:25:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2018-04-05 15:25:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-05 15:25:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-04-05 15:25:45,441 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 50 [2018-04-05 15:25:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:25:45,441 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-04-05 15:25:45,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-05 15:25:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-04-05 15:25:45,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-05 15:25:45,442 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:25:45,442 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:25:45,443 INFO L408 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:25:45,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1356203461, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:25:45,471 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:25:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:25:45,534 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:25:45,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:25:45,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:45,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:45,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-05 15:25:45,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-05 15:25:45,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 15:25:45,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:45,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:45,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 15:25:45,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-05 15:25:46,644 WARN L148 SmtUtils]: Spent 139ms on a formula simplification that was a NOOP. DAG size: 26 [2018-04-05 15:25:46,926 WARN L148 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 26 [2018-04-05 15:25:47,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-05 15:25:47,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:25:47,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-04-05 15:25:47,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-05 15:25:47,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:25:47,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:25:47,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2018-04-05 15:25:47,629 WARN L151 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 20 DAG size of output 19 [2018-04-05 15:25:48,312 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:48,312 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:25:51,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-05 15:25:51,540 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 21 DAG size of output 17 [2018-04-05 15:25:51,549 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 15:25:51,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-05 15:25:51,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:25:51,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:25:51,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:25:51,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:54 [2018-04-05 15:25:52,029 WARN L151 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 23 DAG size of output 17 [2018-04-05 15:25:52,666 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 11 DAG size of output 10 [2018-04-05 15:25:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:25:53,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 15:25:53,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-04-05 15:25:53,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-05 15:25:53,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-05 15:25:53,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1356, Unknown=0, NotChecked=0, Total=1482 [2018-04-05 15:25:53,025 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 39 states. [2018-04-05 15:25:56,636 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 57 DAG size of output 43 [2018-04-05 15:25:57,061 WARN L148 SmtUtils]: Spent 244ms on a formula simplification that was a NOOP. DAG size: 60 [2018-04-05 15:25:59,683 WARN L151 SmtUtils]: Spent 515ms on a formula simplification. DAG size of input: 69 DAG size of output 61 [2018-04-05 15:26:00,990 WARN L151 SmtUtils]: Spent 1109ms on a formula simplification. DAG size of input: 61 DAG size of output 58 [2018-04-05 15:26:03,032 WARN L151 SmtUtils]: Spent 1315ms on a formula simplification. DAG size of input: 77 DAG size of output 72 [2018-04-05 15:26:03,441 WARN L151 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 66 DAG size of output 62 [2018-04-05 15:26:03,763 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 49 DAG size of output 47 [2018-04-05 15:26:04,097 WARN L148 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-05 15:26:04,914 WARN L151 SmtUtils]: Spent 353ms on a formula simplification. DAG size of input: 61 DAG size of output 59 [2018-04-05 15:26:05,340 WARN L151 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 54 DAG size of output 48 [2018-04-05 15:26:05,823 WARN L151 SmtUtils]: Spent 233ms on a formula simplification. DAG size of input: 54 DAG size of output 48 [2018-04-05 15:26:06,423 WARN L151 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 44 DAG size of output 41 [2018-04-05 15:26:07,778 WARN L151 SmtUtils]: Spent 599ms on a formula simplification. DAG size of input: 60 DAG size of output 54 [2018-04-05 15:26:08,811 WARN L151 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 51 DAG size of output 48 [2018-04-05 15:26:09,890 WARN L151 SmtUtils]: Spent 222ms on a formula simplification. DAG size of input: 57 DAG size of output 51 [2018-04-05 15:26:10,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:26:10,095 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2018-04-05 15:26:10,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-05 15:26:10,096 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-04-05 15:26:10,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:26:10,097 INFO L225 Difference]: With dead ends: 148 [2018-04-05 15:26:10,097 INFO L226 Difference]: Without dead ends: 147 [2018-04-05 15:26:10,100 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=599, Invalid=4231, Unknown=0, NotChecked=0, Total=4830 [2018-04-05 15:26:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-05 15:26:10,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2018-04-05 15:26:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-05 15:26:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-04-05 15:26:10,139 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 52 [2018-04-05 15:26:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:26:10,140 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-04-05 15:26:10,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-05 15:26:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-04-05 15:26:10,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-05 15:26:10,141 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:26:10,141 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:26:10,141 INFO L408 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:26:10,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1296239548, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:26:10,172 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:26:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:26:10,236 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:26:10,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:26:10,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-05 15:26:10,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-05 15:26:10,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:26:10,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:26:10,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 15:26:10,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-05 15:26:10,687 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-05 15:26:10,715 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-05 15:26:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:10,734 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:26:10,978 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_16| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_16|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_16| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_16| 0) |c_old(#valid)|))) is different from false [2018-04-05 15:26:10,998 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_15| Int) (|v_main_#t~malloc11.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_15| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_16|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_16| 1) |v_main_#t~malloc10.base_15| 0) |v_main_#t~malloc11.base_16| 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_15|) 0))))) is different from false [2018-04-05 15:26:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:11,205 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:26:11,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-05 15:26:11,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-05 15:26:11,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-05 15:26:11,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-05 15:26:11,206 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 12 states. [2018-04-05 15:26:11,320 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_15| Int) (|v_main_#t~malloc11.base_16| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_15| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_16|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_16| 1) |v_main_#t~malloc10.base_15| 0) |v_main_#t~malloc11.base_16| 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_15|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-05 15:26:12,531 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 21 DAG size of output 20 [2018-04-05 15:26:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:26:12,859 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions. [2018-04-05 15:26:12,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-05 15:26:12,860 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-04-05 15:26:12,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:26:12,861 INFO L225 Difference]: With dead ends: 249 [2018-04-05 15:26:12,862 INFO L226 Difference]: Without dead ends: 235 [2018-04-05 15:26:12,862 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-05 15:26:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-04-05 15:26:12,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-04-05 15:26:12,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-05 15:26:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 252 transitions. [2018-04-05 15:26:12,942 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 252 transitions. Word has length 54 [2018-04-05 15:26:12,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:26:12,942 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 252 transitions. [2018-04-05 15:26:12,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-05 15:26:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 252 transitions. [2018-04-05 15:26:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-05 15:26:12,943 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:26:12,944 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:26:12,944 INFO L408 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:26:12,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1324238768, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:26:12,970 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:26:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:26:13,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:26:13,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:26:13,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-05 15:26:13,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:26:13,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-05 15:26:13,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:26:13,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:26:13,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 15:26:13,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-05 15:26:13,560 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-05 15:26:13,587 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-05 15:26:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:13,609 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:26:13,730 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_18| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_18| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_18| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_18|))))) is different from false [2018-04-05 15:26:13,741 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_17| Int) (|v_main_#t~malloc11.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_17| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_18| 1) |v_main_#t~malloc10.base_17| 0) |v_main_#t~malloc11.base_18| 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_18|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_17|) 0))))) is different from false [2018-04-05 15:26:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:13,953 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:26:13,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-05 15:26:13,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-05 15:26:13,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-05 15:26:13,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-05 15:26:13,955 INFO L87 Difference]: Start difference. First operand 232 states and 252 transitions. Second operand 12 states. [2018-04-05 15:26:14,076 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_17| Int) (|v_main_#t~malloc11.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_17| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_18| 1) |v_main_#t~malloc10.base_17| 0) |v_main_#t~malloc11.base_18| 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_18|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_17|) 0)))))) is different from false [2018-04-05 15:26:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:26:15,844 INFO L93 Difference]: Finished difference Result 346 states and 374 transitions. [2018-04-05 15:26:15,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-05 15:26:15,845 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-05 15:26:15,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:26:15,847 INFO L225 Difference]: With dead ends: 346 [2018-04-05 15:26:15,847 INFO L226 Difference]: Without dead ends: 332 [2018-04-05 15:26:15,848 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-05 15:26:15,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-04-05 15:26:15,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 231. [2018-04-05 15:26:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-04-05 15:26:15,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 250 transitions. [2018-04-05 15:26:15,918 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 250 transitions. Word has length 55 [2018-04-05 15:26:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:26:15,918 INFO L459 AbstractCegarLoop]: Abstraction has 231 states and 250 transitions. [2018-04-05 15:26:15,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-05 15:26:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 250 transitions. [2018-04-05 15:26:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-05 15:26:15,921 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:26:15,921 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:26:15,921 INFO L408 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:26:15,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1202236565, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:26:15,957 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:26:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:26:15,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:26:16,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:26:16,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-05 15:26:16,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-05 15:26:16,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:26:16,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:26:16,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 15:26:16,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-05 15:26:16,484 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-05 15:26:16,498 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-05 15:26:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:16,518 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:26:16,630 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_20| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_20| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_20|))))) is different from false [2018-04-05 15:26:16,650 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_20| Int) (|v_main_#t~malloc10.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_19| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_20|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_20| 1) |v_main_#t~malloc10.base_19| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_19|)))))) is different from false [2018-04-05 15:26:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:16,777 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:26:16,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-05 15:26:16,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-05 15:26:16,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-05 15:26:16,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-05 15:26:16,783 INFO L87 Difference]: Start difference. First operand 231 states and 250 transitions. Second operand 12 states. [2018-04-05 15:26:16,898 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc11.base_20| Int) (|v_main_#t~malloc10.base_19| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_19| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_20|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_20| 1) |v_main_#t~malloc10.base_19| 0) |v_main_#t~malloc11.base_20| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_19|))))))) is different from false [2018-04-05 15:26:18,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:26:18,575 INFO L93 Difference]: Finished difference Result 347 states and 375 transitions. [2018-04-05 15:26:18,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-05 15:26:18,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-05 15:26:18,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:26:18,578 INFO L225 Difference]: With dead ends: 347 [2018-04-05 15:26:18,578 INFO L226 Difference]: Without dead ends: 333 [2018-04-05 15:26:18,579 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-05 15:26:18,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-04-05 15:26:18,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 233. [2018-04-05 15:26:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-05 15:26:18,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 253 transitions. [2018-04-05 15:26:18,614 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 253 transitions. Word has length 55 [2018-04-05 15:26:18,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:26:18,614 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 253 transitions. [2018-04-05 15:26:18,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-05 15:26:18,615 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 253 transitions. [2018-04-05 15:26:18,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-05 15:26:18,616 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:26:18,616 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:26:18,616 INFO L408 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:26:18,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1018456304, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:26:18,640 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:26:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:26:18,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:26:18,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:26:18,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-05 15:26:18,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:26:18,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-05 15:26:18,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:26:18,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:26:19,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 15:26:19,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-05 15:26:19,205 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-05 15:26:19,227 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-05 15:26:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:19,238 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:26:19,431 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_22| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_22|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_22| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|))) is different from false [2018-04-05 15:26:19,450 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_21| Int) (|v_main_#t~malloc11.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_22| 1) |v_main_#t~malloc10.base_21| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_22|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_21|) 0))))) is different from false [2018-04-05 15:26:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:19,585 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:26:19,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-05 15:26:19,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-05 15:26:19,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-05 15:26:19,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-05 15:26:19,586 INFO L87 Difference]: Start difference. First operand 233 states and 253 transitions. Second operand 12 states. [2018-04-05 15:26:19,769 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_21| Int) (|v_main_#t~malloc11.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_22| 1) |v_main_#t~malloc10.base_21| 0) |v_main_#t~malloc11.base_22| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_22|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc10.base_21|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-05 15:26:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:26:21,654 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-04-05 15:26:21,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-05 15:26:21,655 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-05 15:26:21,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:26:21,657 INFO L225 Difference]: With dead ends: 348 [2018-04-05 15:26:21,657 INFO L226 Difference]: Without dead ends: 334 [2018-04-05 15:26:21,658 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-05 15:26:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-05 15:26:21,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 235. [2018-04-05 15:26:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-05 15:26:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 256 transitions. [2018-04-05 15:26:21,755 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 256 transitions. Word has length 55 [2018-04-05 15:26:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:26:21,755 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 256 transitions. [2018-04-05 15:26:21,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-05 15:26:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 256 transitions. [2018-04-05 15:26:21,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-05 15:26:21,757 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:26:21,757 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:26:21,757 INFO L408 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:26:21,757 INFO L82 PathProgramCache]: Analyzing trace with hash 832685737, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:26:21,797 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:26:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:26:21,860 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:26:22,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:26:22,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-05 15:26:22,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-05 15:26:22,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:26:22,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:26:22,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 15:26:22,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-05 15:26:22,262 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-05 15:26:22,273 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-05 15:26:22,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:22,288 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:26:22,423 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_24| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_24| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_24|))))) is different from false [2018-04-05 15:26:22,437 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_24| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc11.base_24|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_24| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|)))) is different from false [2018-04-05 15:26:22,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:22,567 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:26:22,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-05 15:26:22,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-05 15:26:22,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-05 15:26:22,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-05 15:26:22,569 INFO L87 Difference]: Start difference. First operand 235 states and 256 transitions. Second operand 12 states. [2018-04-05 15:26:22,649 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_24| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc11.base_24|))) (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_24| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_24| 0) |c_old(#valid)|)))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-05 15:26:24,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:26:24,372 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-04-05 15:26:24,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-05 15:26:24,407 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-04-05 15:26:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:26:24,409 INFO L225 Difference]: With dead ends: 348 [2018-04-05 15:26:24,409 INFO L226 Difference]: Without dead ends: 334 [2018-04-05 15:26:24,409 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-05 15:26:24,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-05 15:26:24,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 233. [2018-04-05 15:26:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-05 15:26:24,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 253 transitions. [2018-04-05 15:26:24,447 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 253 transitions. Word has length 56 [2018-04-05 15:26:24,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:26:24,447 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 253 transitions. [2018-04-05 15:26:24,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-05 15:26:24,448 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 253 transitions. [2018-04-05 15:26:24,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-05 15:26:24,453 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:26:24,453 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:26:24,453 INFO L408 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:26:24,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1388007132, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:26:24,477 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:26:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:26:24,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:26:24,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:26:24,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-05 15:26:24,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-05 15:26:24,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:26:24,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:26:24,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 15:26:24,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-05 15:26:24,932 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-05 15:26:24,941 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-05 15:26:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:24,956 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:26:25,075 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_26| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_26|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_26| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_26| 0) |c_old(#valid)|))) is different from false [2018-04-05 15:26:25,085 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_25| Int) (|v_main_#t~malloc11.base_26| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_25|) 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_26|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_26| 1) |v_main_#t~malloc10.base_25| 0) |v_main_#t~malloc11.base_26| 0))))) is different from false [2018-04-05 15:26:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:25,193 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:26:25,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-05 15:26:25,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-05 15:26:25,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-05 15:26:25,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-05 15:26:25,195 INFO L87 Difference]: Start difference. First operand 233 states and 253 transitions. Second operand 12 states. [2018-04-05 15:26:25,248 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc10.base_25| Int) (|v_main_#t~malloc11.base_26| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_25|) 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_26|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_26| 1) |v_main_#t~malloc10.base_25| 0) |v_main_#t~malloc11.base_26| 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-05 15:26:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:26:27,761 INFO L93 Difference]: Finished difference Result 348 states and 376 transitions. [2018-04-05 15:26:27,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-05 15:26:27,762 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-04-05 15:26:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:26:27,763 INFO L225 Difference]: With dead ends: 348 [2018-04-05 15:26:27,764 INFO L226 Difference]: Without dead ends: 334 [2018-04-05 15:26:27,764 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-05 15:26:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-05 15:26:27,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 232. [2018-04-05 15:26:27,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-05 15:26:27,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-04-05 15:26:27,828 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 56 [2018-04-05 15:26:27,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:26:27,828 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-04-05 15:26:27,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-05 15:26:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-04-05 15:26:27,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-05 15:26:27,829 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:26:27,829 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:26:27,830 INFO L408 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:26:27,830 INFO L82 PathProgramCache]: Analyzing trace with hash -875108129, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:26:27,863 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:26:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:26:27,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:26:28,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:26:28,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-05 15:26:28,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-05 15:26:28,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:26:28,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:26:28,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 15:26:28,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-05 15:26:28,726 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-05 15:26:28,754 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-05 15:26:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:28,764 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:26:28,978 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_28| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_28|))) (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_28| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_28| 0) |c_old(#valid)|))) is different from false [2018-04-05 15:26:28,990 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_27| Int) (|v_main_#t~malloc11.base_28| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_27| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_28|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_28| 1) |v_main_#t~malloc10.base_27| 0) |v_main_#t~malloc11.base_28| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc10.base_27|) 0))))) is different from false [2018-04-05 15:26:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:29,138 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:26:29,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-05 15:26:29,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-05 15:26:29,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-05 15:26:29,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-05 15:26:29,139 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 12 states. [2018-04-05 15:26:29,233 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_27| Int) (|v_main_#t~malloc11.base_28| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_27| 1))) (or (not (= (select .cse0 |v_main_#t~malloc11.base_28|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc11.base_28| 1) |v_main_#t~malloc10.base_27| 0) |v_main_#t~malloc11.base_28| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc10.base_27|) 0)))))) is different from false [2018-04-05 15:26:31,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:26:31,364 INFO L93 Difference]: Finished difference Result 349 states and 377 transitions. [2018-04-05 15:26:31,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-05 15:26:31,367 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-04-05 15:26:31,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:26:31,369 INFO L225 Difference]: With dead ends: 349 [2018-04-05 15:26:31,369 INFO L226 Difference]: Without dead ends: 335 [2018-04-05 15:26:31,370 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-05 15:26:31,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-04-05 15:26:31,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 234. [2018-04-05 15:26:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-05 15:26:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 254 transitions. [2018-04-05 15:26:31,461 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 254 transitions. Word has length 56 [2018-04-05 15:26:31,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:26:31,461 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 254 transitions. [2018-04-05 15:26:31,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-05 15:26:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 254 transitions. [2018-04-05 15:26:31,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-05 15:26:31,462 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:26:31,462 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:26:31,462 INFO L408 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:26:31,463 INFO L82 PathProgramCache]: Analyzing trace with hash 553718091, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:26:31,508 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:26:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:26:31,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:26:31,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:26:31,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-05 15:26:31,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-05 15:26:31,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:26:31,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:26:32,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 15:26:32,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-05 15:26:32,176 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-05 15:26:32,192 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-05 15:26:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:32,203 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:26:32,389 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_30| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_30|))) (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc11.base_30| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_30| 0)))) is different from false [2018-04-05 15:26:32,412 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_30| Int) (|v_main_#t~malloc10.base_29| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_29| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_29|) 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_30|))) (= (store (store (store .cse0 |v_main_#t~malloc11.base_30| 1) |v_main_#t~malloc10.base_29| 0) |v_main_#t~malloc11.base_30| 0) |c_old(#valid)|)))) is different from false [2018-04-05 15:26:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:32,567 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 15:26:32,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-05 15:26:32,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-05 15:26:32,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-05 15:26:32,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-05 15:26:32,568 INFO L87 Difference]: Start difference. First operand 234 states and 254 transitions. Second operand 12 states. [2018-04-05 15:26:32,653 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc11.base_30| Int) (|v_main_#t~malloc10.base_29| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_29| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_29|) 0)) (not (= 0 (select .cse0 |v_main_#t~malloc11.base_30|))) (= (store (store (store .cse0 |v_main_#t~malloc11.base_30| 1) |v_main_#t~malloc10.base_29| 0) |v_main_#t~malloc11.base_30| 0) |c_old(#valid)|))))) is different from false [2018-04-05 15:26:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:26:34,461 INFO L93 Difference]: Finished difference Result 237 states and 254 transitions. [2018-04-05 15:26:34,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-05 15:26:34,462 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-04-05 15:26:34,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:26:34,463 INFO L225 Difference]: With dead ends: 237 [2018-04-05 15:26:34,464 INFO L226 Difference]: Without dead ends: 223 [2018-04-05 15:26:34,464 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-05 15:26:34,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-05 15:26:34,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 120. [2018-04-05 15:26:34,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-05 15:26:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-04-05 15:26:34,502 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 57 [2018-04-05 15:26:34,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:26:34,503 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-04-05 15:26:34,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-05 15:26:34,503 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-04-05 15:26:34,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-05 15:26:34,511 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:26:34,511 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:26:34,511 INFO L408 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:26:34,511 INFO L82 PathProgramCache]: Analyzing trace with hash -21117222, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:26:34,529 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:26:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:26:34,567 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:26:34,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:26:34,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:26:34,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:26:34,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:26:34,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:26:34,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-05 15:26:34,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:26:34,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:26:34,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-05 15:26:34,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:26:34,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:26:34,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:26:34,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-05 15:26:34,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:26:34,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:26:34,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-05 15:26:36,567 WARN L148 SmtUtils]: Spent 134ms on a formula simplification that was a NOOP. DAG size: 15 [2018-04-05 15:26:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:37,475 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:26:40,930 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 19 DAG size of output 15 [2018-04-05 15:26:42,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-04-05 15:26:42,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:26:42,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-05 15:26:42,696 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-05 15:26:42,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 15:26:42,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-05 15:26:42,705 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 15:26:42,722 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:26:42,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:26:42,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-05 15:26:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:26:43,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 15:26:43,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2018-04-05 15:26:43,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-05 15:26:43,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-05 15:26:43,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1687, Unknown=0, NotChecked=0, Total=1806 [2018-04-05 15:26:43,248 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 43 states. [2018-04-05 15:26:45,295 WARN L148 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-05 15:26:46,092 WARN L148 SmtUtils]: Spent 128ms on a formula simplification that was a NOOP. DAG size: 17 [2018-04-05 15:26:47,161 WARN L151 SmtUtils]: Spent 298ms on a formula simplification. DAG size of input: 40 DAG size of output 38 [2018-04-05 15:26:47,666 WARN L151 SmtUtils]: Spent 336ms on a formula simplification. DAG size of input: 46 DAG size of output 44 [2018-04-05 15:26:48,774 WARN L151 SmtUtils]: Spent 562ms on a formula simplification. DAG size of input: 54 DAG size of output 52 [2018-04-05 15:26:49,409 WARN L148 SmtUtils]: Spent 212ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-05 15:26:50,167 WARN L148 SmtUtils]: Spent 454ms on a formula simplification that was a NOOP. DAG size: 56 [2018-04-05 15:26:51,100 WARN L151 SmtUtils]: Spent 523ms on a formula simplification. DAG size of input: 41 DAG size of output 38 [2018-04-05 15:26:51,801 WARN L148 SmtUtils]: Spent 289ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-05 15:26:52,210 WARN L148 SmtUtils]: Spent 208ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-05 15:26:52,983 WARN L151 SmtUtils]: Spent 384ms on a formula simplification. DAG size of input: 52 DAG size of output 47 [2018-04-05 15:26:53,287 WARN L148 SmtUtils]: Spent 154ms on a formula simplification that was a NOOP. DAG size: 40 [2018-04-05 15:26:53,761 WARN L151 SmtUtils]: Spent 253ms on a formula simplification. DAG size of input: 42 DAG size of output 40 [2018-04-05 15:26:54,068 WARN L148 SmtUtils]: Spent 144ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-05 15:26:54,479 WARN L148 SmtUtils]: Spent 194ms on a formula simplification that was a NOOP. DAG size: 50 [2018-04-05 15:26:55,009 WARN L148 SmtUtils]: Spent 350ms on a formula simplification that was a NOOP. DAG size: 41 [2018-04-05 15:26:55,448 WARN L148 SmtUtils]: Spent 132ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-05 15:26:55,783 WARN L148 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-05 15:26:56,384 WARN L148 SmtUtils]: Spent 365ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-05 15:26:57,807 WARN L148 SmtUtils]: Spent 479ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-05 15:26:58,360 WARN L148 SmtUtils]: Spent 219ms on a formula simplification that was a NOOP. DAG size: 35 [2018-04-05 15:26:59,437 WARN L148 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-05 15:27:00,822 WARN L148 SmtUtils]: Spent 160ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-05 15:27:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:27:01,512 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2018-04-05 15:27:01,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-05 15:27:01,513 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 58 [2018-04-05 15:27:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:27:01,514 INFO L225 Difference]: With dead ends: 148 [2018-04-05 15:27:01,514 INFO L226 Difference]: Without dead ends: 147 [2018-04-05 15:27:01,516 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=769, Invalid=6203, Unknown=0, NotChecked=0, Total=6972 [2018-04-05 15:27:01,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-05 15:27:01,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 120. [2018-04-05 15:27:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-05 15:27:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-04-05 15:27:01,537 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 58 [2018-04-05 15:27:01,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:27:01,537 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-04-05 15:27:01,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-05 15:27:01,538 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-04-05 15:27:01,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-05 15:27:01,538 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:27:01,539 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:27:01,539 INFO L408 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:27:01,539 INFO L82 PathProgramCache]: Analyzing trace with hash -705173693, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:27:01,554 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:27:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:27:01,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:27:01,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:27:01,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:01,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:27:01,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:01,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:27:01,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-05 15:27:01,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:27:01,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-05 15:27:01,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:01,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:27:01,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:27:01,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-05 15:27:01,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:01,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:27:01,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-05 15:27:01,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-05 15:27:01,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-05 15:27:01,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:01,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:27:02,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:27:02,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-05 15:27:02,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-04-05 15:27:02,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 15:27:02,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:02,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:27:02,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 15:27:02,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-05 15:27:03,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-05 15:27:03,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-04-05 15:27:03,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-05 15:27:03,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:27:03,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-05 15:27:03,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:45 [2018-04-05 15:27:03,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-05 15:27:03,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-05 15:27:03,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-05 15:27:04,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:27:04,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:27:04,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-05 15:27:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:27:04,622 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:27:08,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-04-05 15:27:08,478 WARN L148 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 26 [2018-04-05 15:27:08,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-05 15:27:08,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:08,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-05 15:27:08,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-04-05 15:27:08,620 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:08,633 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:27:08,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-04-05 15:27:08,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-05 15:27:08,643 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:08,666 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:27:08,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-05 15:27:08,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-05 15:27:08,890 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-04-05 15:27:09,381 WARN L151 SmtUtils]: Spent 285ms on a formula simplification. DAG size of input: 24 DAG size of output 20 [2018-04-05 15:27:13,696 WARN L151 SmtUtils]: Spent 3838ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-04-05 15:27:16,014 WARN L148 SmtUtils]: Spent 2031ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-05 15:27:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:27:16,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 15:27:16,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-04-05 15:27:16,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-05 15:27:16,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-05 15:27:16,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1522, Unknown=0, NotChecked=0, Total=1640 [2018-04-05 15:27:16,146 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 41 states. [2018-04-05 15:27:20,224 WARN L151 SmtUtils]: Spent 416ms on a formula simplification. DAG size of input: 86 DAG size of output 74 [2018-04-05 15:27:20,704 WARN L148 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-05 15:27:21,305 WARN L151 SmtUtils]: Spent 432ms on a formula simplification. DAG size of input: 66 DAG size of output 56 [2018-04-05 15:27:21,900 WARN L151 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 64 DAG size of output 51 [2018-04-05 15:27:23,420 WARN L151 SmtUtils]: Spent 320ms on a formula simplification. DAG size of input: 31 DAG size of output 29 [2018-04-05 15:27:24,408 WARN L151 SmtUtils]: Spent 292ms on a formula simplification. DAG size of input: 32 DAG size of output 29 [2018-04-05 15:27:25,024 WARN L151 SmtUtils]: Spent 392ms on a formula simplification. DAG size of input: 38 DAG size of output 33 [2018-04-05 15:27:25,415 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 28 DAG size of output 25 [2018-04-05 15:27:26,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:27:26,518 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-04-05 15:27:26,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-05 15:27:26,520 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 61 [2018-04-05 15:27:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:27:26,521 INFO L225 Difference]: With dead ends: 154 [2018-04-05 15:27:26,521 INFO L226 Difference]: Without dead ends: 153 [2018-04-05 15:27:26,522 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=348, Invalid=3312, Unknown=0, NotChecked=0, Total=3660 [2018-04-05 15:27:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-05 15:27:26,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2018-04-05 15:27:26,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-05 15:27:26,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-04-05 15:27:26,579 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 61 [2018-04-05 15:27:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:27:26,580 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-04-05 15:27:26,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-05 15:27:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-04-05 15:27:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-05 15:27:26,581 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:27:26,581 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:27:26,581 INFO L408 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:27:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash -385547963, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:27:26,619 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:27:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:27:26,683 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:27:26,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:27:26,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:27,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:27:27,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:27,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:27:27,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-05 15:27:27,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:27:27,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:27:27,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-05 15:27:27,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:27,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:27:27,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-05 15:27:27,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:27,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:27:27,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-05 15:27:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:27:31,021 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:27:32,329 WARN L148 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 16 [2018-04-05 15:27:35,263 WARN L148 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 20 [2018-04-05 15:27:36,798 WARN L151 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 18 DAG size of output 13 [2018-04-05 15:27:39,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-05 15:27:39,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:39,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-05 15:27:39,295 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-05 15:27:39,295 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:39,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-05 15:27:39,303 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:39,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:27:39,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:27:39,370 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-05 15:27:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:27:40,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 15:27:40,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-04-05 15:27:40,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-05 15:27:40,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-05 15:27:40,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2102, Unknown=0, NotChecked=0, Total=2256 [2018-04-05 15:27:40,002 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 48 states. [2018-04-05 15:27:42,393 WARN L148 SmtUtils]: Spent 197ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-05 15:27:43,302 WARN L148 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 21 [2018-04-05 15:27:43,924 WARN L148 SmtUtils]: Spent 115ms on a formula simplification that was a NOOP. DAG size: 26 [2018-04-05 15:27:45,131 WARN L151 SmtUtils]: Spent 652ms on a formula simplification. DAG size of input: 50 DAG size of output 47 [2018-04-05 15:27:46,382 WARN L151 SmtUtils]: Spent 624ms on a formula simplification. DAG size of input: 59 DAG size of output 56 [2018-04-05 15:27:46,840 WARN L148 SmtUtils]: Spent 146ms on a formula simplification that was a NOOP. DAG size: 39 [2018-04-05 15:27:47,593 WARN L151 SmtUtils]: Spent 446ms on a formula simplification. DAG size of input: 58 DAG size of output 54 [2018-04-05 15:27:47,872 WARN L148 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 39 [2018-04-05 15:27:48,211 WARN L148 SmtUtils]: Spent 137ms on a formula simplification that was a NOOP. DAG size: 46 [2018-04-05 15:27:48,727 WARN L151 SmtUtils]: Spent 330ms on a formula simplification. DAG size of input: 51 DAG size of output 47 [2018-04-05 15:27:49,139 WARN L148 SmtUtils]: Spent 135ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-05 15:27:49,437 WARN L151 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 36 DAG size of output 35 [2018-04-05 15:27:50,167 WARN L148 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-05 15:27:50,509 WARN L148 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-05 15:27:51,786 WARN L151 SmtUtils]: Spent 236ms on a formula simplification. DAG size of input: 48 DAG size of output 46 [2018-04-05 15:27:52,348 WARN L148 SmtUtils]: Spent 125ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-05 15:27:52,989 WARN L148 SmtUtils]: Spent 466ms on a formula simplification that was a NOOP. DAG size: 41 [2018-04-05 15:27:54,225 WARN L148 SmtUtils]: Spent 256ms on a formula simplification that was a NOOP. DAG size: 35 [2018-04-05 15:27:54,734 WARN L151 SmtUtils]: Spent 233ms on a formula simplification. DAG size of input: 46 DAG size of output 44 [2018-04-05 15:27:55,346 WARN L151 SmtUtils]: Spent 445ms on a formula simplification. DAG size of input: 55 DAG size of output 53 [2018-04-05 15:27:55,680 WARN L148 SmtUtils]: Spent 145ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-05 15:27:56,045 WARN L148 SmtUtils]: Spent 156ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-05 15:27:56,378 WARN L148 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-05 15:27:57,415 WARN L148 SmtUtils]: Spent 145ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-05 15:27:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:27:57,838 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-04-05 15:27:57,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-05 15:27:57,839 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 62 [2018-04-05 15:27:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:27:57,840 INFO L225 Difference]: With dead ends: 168 [2018-04-05 15:27:57,840 INFO L226 Difference]: Without dead ends: 167 [2018-04-05 15:27:57,842 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=836, Invalid=6646, Unknown=0, NotChecked=0, Total=7482 [2018-04-05 15:27:57,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-05 15:27:57,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2018-04-05 15:27:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-05 15:27:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-04-05 15:27:57,896 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 62 [2018-04-05 15:27:57,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:27:57,896 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2018-04-05 15:27:57,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-05 15:27:57,896 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-04-05 15:27:57,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-05 15:27:57,905 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:27:57,906 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:27:57,906 INFO L408 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:27:57,906 INFO L82 PathProgramCache]: Analyzing trace with hash -832531843, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:27:57,927 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:27:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:27:57,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:27:58,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:27:58,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:58,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:27:58,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-05 15:27:58,340 WARN L148 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 12 [2018-04-05 15:27:58,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-05 15:27:58,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 15:27:58,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:27:58,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:27:58,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 15:27:58,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-05 15:27:59,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 28 treesize of output 22 [2018-04-05 15:27:59,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:27:59,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-04-05 15:27:59,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-05 15:27:59,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:27:59,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:27:59,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2018-04-05 15:27:59,994 WARN L151 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 20 DAG size of output 19 [2018-04-05 15:28:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:28:00,816 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:28:03,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-05 15:28:04,077 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 21 DAG size of output 17 [2018-04-05 15:28:04,085 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 15:28:04,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-05 15:28:04,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:28:04,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:28:04,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:28:04,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:54 [2018-04-05 15:28:04,521 WARN L151 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 23 DAG size of output 17 [2018-04-05 15:28:04,901 WARN L148 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 17 [2018-04-05 15:28:05,229 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 11 DAG size of output 10 [2018-04-05 15:28:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:28:05,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 15:28:05,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-04-05 15:28:05,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-05 15:28:05,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-05 15:28:05,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1510, Unknown=0, NotChecked=0, Total=1640 [2018-04-05 15:28:05,590 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 41 states. [2018-04-05 15:28:05,952 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 14 DAG size of output 11 [2018-04-05 15:28:07,501 WARN L148 SmtUtils]: Spent 134ms on a formula simplification that was a NOOP. DAG size: 21 [2018-04-05 15:28:10,208 WARN L148 SmtUtils]: Spent 290ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-05 15:28:11,032 WARN L148 SmtUtils]: Spent 177ms on a formula simplification that was a NOOP. DAG size: 60 [2018-04-05 15:28:11,837 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 66 DAG size of output 50 [2018-04-05 15:28:13,576 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 55 DAG size of output 52 [2018-04-05 15:28:14,742 WARN L151 SmtUtils]: Spent 702ms on a formula simplification. DAG size of input: 69 DAG size of output 61 [2018-04-05 15:28:15,070 WARN L151 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 61 DAG size of output 58 [2018-04-05 15:28:16,162 WARN L151 SmtUtils]: Spent 282ms on a formula simplification. DAG size of input: 77 DAG size of output 72 [2018-04-05 15:28:16,945 WARN L151 SmtUtils]: Spent 270ms on a formula simplification. DAG size of input: 66 DAG size of output 62 [2018-04-05 15:28:18,262 WARN L151 SmtUtils]: Spent 1073ms on a formula simplification. DAG size of input: 58 DAG size of output 55 [2018-04-05 15:28:18,580 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 49 DAG size of output 47 [2018-04-05 15:28:19,241 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 48 DAG size of output 45 [2018-04-05 15:28:20,408 WARN L148 SmtUtils]: Spent 368ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-05 15:28:20,761 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 44 DAG size of output 41 [2018-04-05 15:28:21,294 WARN L151 SmtUtils]: Spent 312ms on a formula simplification. DAG size of input: 61 DAG size of output 59 [2018-04-05 15:28:22,290 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 51 DAG size of output 48 [2018-04-05 15:28:23,194 WARN L151 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 56 DAG size of output 54 [2018-04-05 15:28:26,667 WARN L151 SmtUtils]: Spent 371ms on a formula simplification. DAG size of input: 59 DAG size of output 53 [2018-04-05 15:28:27,693 WARN L151 SmtUtils]: Spent 264ms on a formula simplification. DAG size of input: 51 DAG size of output 45 [2018-04-05 15:28:28,247 WARN L148 SmtUtils]: Spent 238ms on a formula simplification that was a NOOP. DAG size: 30 [2018-04-05 15:28:29,004 WARN L151 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 57 DAG size of output 51 [2018-04-05 15:28:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:28:31,152 INFO L93 Difference]: Finished difference Result 204 states and 214 transitions. [2018-04-05 15:28:31,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-05 15:28:31,153 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 65 [2018-04-05 15:28:31,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:28:31,154 INFO L225 Difference]: With dead ends: 204 [2018-04-05 15:28:31,154 INFO L226 Difference]: Without dead ends: 203 [2018-04-05 15:28:31,160 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=798, Invalid=6342, Unknown=0, NotChecked=0, Total=7140 [2018-04-05 15:28:31,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-05 15:28:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 160. [2018-04-05 15:28:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-05 15:28:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-04-05 15:28:31,203 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 65 [2018-04-05 15:28:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:28:31,207 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2018-04-05 15:28:31,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-05 15:28:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-04-05 15:28:31,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-05 15:28:31,208 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:28:31,208 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:28:31,208 INFO L408 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:28:31,209 INFO L82 PathProgramCache]: Analyzing trace with hash 434218203, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:28:31,230 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:28:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:28:31,265 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:28:31,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:28:31,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:28:31,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:28:31,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-05 15:28:31,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-05 15:28:31,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 15:28:31,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:28:31,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:28:31,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 15:28:31,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-05 15:28:33,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2018-04-05 15:28:33,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:28:33,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:28:33,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:28:33,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:28:33,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:28:33,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:28:33,840 INFO L303 Elim1Store]: Index analysis took 131 ms [2018-04-05 15:28:33,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 93 [2018-04-05 15:28:33,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-05 15:28:34,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:28:34,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:28:34,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-04-05 15:28:34,810 WARN L151 SmtUtils]: Spent 265ms on a formula simplification. DAG size of input: 23 DAG size of output 18 [2018-04-05 15:28:35,227 WARN L148 SmtUtils]: Spent 172ms on a formula simplification that was a NOOP. DAG size: 10 [2018-04-05 15:28:36,108 WARN L148 SmtUtils]: Spent 145ms on a formula simplification that was a NOOP. DAG size: 11 [2018-04-05 15:28:36,813 WARN L148 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 11 [2018-04-05 15:28:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:28:37,590 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:28:43,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2018-04-05 15:28:43,661 WARN L151 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 35 DAG size of output 27 [2018-04-05 15:28:43,669 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 15:28:43,671 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 15:28:43,675 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 15:28:43,676 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 15:28:43,680 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 15:28:43,681 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 15:28:43,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 49 [2018-04-05 15:28:43,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:28:43,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:28:43,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:28:43,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:86 [2018-04-05 15:28:44,478 WARN L151 SmtUtils]: Spent 309ms on a formula simplification. DAG size of input: 33 DAG size of output 17 [2018-04-05 15:28:45,389 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 11 DAG size of output 10 [2018-04-05 15:28:45,752 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:28:45,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 15:28:45,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-04-05 15:28:45,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-05 15:28:45,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-05 15:28:45,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2720, Unknown=0, NotChecked=0, Total=2970 [2018-04-05 15:28:45,805 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 55 states. [2018-04-05 15:28:46,197 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 14 DAG size of output 11 [2018-04-05 15:28:47,361 WARN L148 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 16 [2018-04-05 15:28:48,063 WARN L148 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 21 [2018-04-05 15:28:48,906 WARN L148 SmtUtils]: Spent 106ms on a formula simplification that was a NOOP. DAG size: 29 [2018-04-05 15:28:51,622 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 73 DAG size of output 43 [2018-04-05 15:28:52,507 WARN L148 SmtUtils]: Spent 456ms on a formula simplification that was a NOOP. DAG size: 60 [2018-04-05 15:28:55,769 WARN L148 SmtUtils]: Spent 142ms on a formula simplification that was a NOOP. DAG size: 69 [2018-04-05 15:28:56,619 WARN L148 SmtUtils]: Spent 172ms on a formula simplification that was a NOOP. DAG size: 73 [2018-04-05 15:28:57,139 WARN L148 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-05 15:28:59,347 WARN L148 SmtUtils]: Spent 130ms on a formula simplification that was a NOOP. DAG size: 83 [2018-04-05 15:28:59,854 WARN L148 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-05 15:29:02,392 WARN L151 SmtUtils]: Spent 2206ms on a formula simplification. DAG size of input: 95 DAG size of output 87 [2018-04-05 15:29:03,195 WARN L151 SmtUtils]: Spent 368ms on a formula simplification. DAG size of input: 89 DAG size of output 82 [2018-04-05 15:29:04,740 WARN L151 SmtUtils]: Spent 1225ms on a formula simplification. DAG size of input: 120 DAG size of output 107 [2018-04-05 15:29:06,545 WARN L151 SmtUtils]: Spent 1298ms on a formula simplification. DAG size of input: 98 DAG size of output 86 [2018-04-05 15:29:07,619 WARN L151 SmtUtils]: Spent 533ms on a formula simplification. DAG size of input: 66 DAG size of output 60 [2018-04-05 15:29:08,873 WARN L151 SmtUtils]: Spent 550ms on a formula simplification. DAG size of input: 71 DAG size of output 65 [2018-04-05 15:29:09,301 WARN L151 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 62 DAG size of output 56 [2018-04-05 15:29:10,260 WARN L151 SmtUtils]: Spent 703ms on a formula simplification. DAG size of input: 79 DAG size of output 71 [2018-04-05 15:29:11,324 WARN L151 SmtUtils]: Spent 763ms on a formula simplification. DAG size of input: 88 DAG size of output 76 [2018-04-05 15:29:12,588 WARN L151 SmtUtils]: Spent 806ms on a formula simplification. DAG size of input: 87 DAG size of output 75 [2018-04-05 15:29:13,478 WARN L151 SmtUtils]: Spent 411ms on a formula simplification. DAG size of input: 61 DAG size of output 55 [2018-04-05 15:29:14,588 WARN L151 SmtUtils]: Spent 598ms on a formula simplification. DAG size of input: 65 DAG size of output 63 [2018-04-05 15:29:15,003 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 57 DAG size of output 49 [2018-04-05 15:29:15,902 WARN L151 SmtUtils]: Spent 606ms on a formula simplification. DAG size of input: 80 DAG size of output 74 [2018-04-05 15:29:16,600 WARN L151 SmtUtils]: Spent 261ms on a formula simplification. DAG size of input: 75 DAG size of output 62 [2018-04-05 15:29:17,291 WARN L151 SmtUtils]: Spent 220ms on a formula simplification. DAG size of input: 70 DAG size of output 60 [2018-04-05 15:29:17,987 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 51 DAG size of output 46 [2018-04-05 15:29:18,557 WARN L151 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 54 DAG size of output 49 [2018-04-05 15:29:19,757 WARN L151 SmtUtils]: Spent 606ms on a formula simplification. DAG size of input: 78 DAG size of output 68 [2018-04-05 15:29:20,140 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 56 DAG size of output 46 [2018-04-05 15:29:20,599 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 53 DAG size of output 47 [2018-04-05 15:29:21,721 WARN L151 SmtUtils]: Spent 421ms on a formula simplification. DAG size of input: 75 DAG size of output 65 [2018-04-05 15:29:22,156 WARN L151 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 49 DAG size of output 46 [2018-04-05 15:29:23,722 WARN L151 SmtUtils]: Spent 469ms on a formula simplification. DAG size of input: 73 DAG size of output 65 [2018-04-05 15:29:23,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:29:23,871 INFO L93 Difference]: Finished difference Result 214 states and 230 transitions. [2018-04-05 15:29:23,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-05 15:29:23,872 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 66 [2018-04-05 15:29:23,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:29:23,873 INFO L225 Difference]: With dead ends: 214 [2018-04-05 15:29:23,874 INFO L226 Difference]: Without dead ends: 213 [2018-04-05 15:29:23,878 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2468 ImplicationChecksByTransitivity, 41.8s TimeCoverageRelationStatistics Valid=1479, Invalid=10293, Unknown=0, NotChecked=0, Total=11772 [2018-04-05 15:29:23,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-05 15:29:23,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 188. [2018-04-05 15:29:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-05 15:29:23,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2018-04-05 15:29:23,946 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 66 [2018-04-05 15:29:23,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:29:23,946 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2018-04-05 15:29:23,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-05 15:29:23,946 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2018-04-05 15:29:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-05 15:29:23,947 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:29:23,947 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:29:23,947 INFO L408 AbstractCegarLoop]: === Iteration 29 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:29:23,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1482206016, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:29:23,972 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:29:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:29:24,053 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:29:24,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:29:24,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:29:24,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:29:24,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:29:24,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:29:24,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-05 15:29:24,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:29:24,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:29:24,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-05 15:29:24,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:29:24,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-05 15:29:24,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:29:24,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:29:24,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-05 15:29:24,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-05 15:29:24,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-05 15:29:24,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:29:24,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:29:24,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:29:24,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-05 15:29:24,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-04-05 15:29:24,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 15:29:24,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:29:24,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:29:24,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 15:29:24,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-05 15:29:25,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-05 15:29:26,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-04-05 15:29:26,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-05 15:29:26,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:29:26,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-05 15:29:26,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:45 [2018-04-05 15:29:26,598 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 27 DAG size of output 14 [2018-04-05 15:29:27,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-05 15:29:27,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-05 15:29:27,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-05 15:29:27,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:29:27,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:29:27,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-05 15:29:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-05 15:29:27,809 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:29:29,378 WARN L148 SmtUtils]: Spent 141ms on a formula simplification that was a NOOP. DAG size: 26 [2018-04-05 15:29:29,933 WARN L148 SmtUtils]: Spent 203ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-05 15:29:33,351 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 37 treesize of output 28 [2018-04-05 15:29:33,512 WARN L148 SmtUtils]: Spent 159ms on a formula simplification that was a NOOP. DAG size: 26 [2018-04-05 15:29:33,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-05 15:29:33,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:29:33,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-04-05 15:29:33,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-05 15:29:33,621 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 15:29:33,642 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:29:33,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-05 15:29:33,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-04-05 15:29:33,653 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 15:29:33,657 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:29:33,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-05 15:29:33,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-05 15:29:33,895 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-04-05 15:29:34,291 WARN L151 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 24 DAG size of output 20 [2018-04-05 15:29:36,978 WARN L151 SmtUtils]: Spent 2182ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-04-05 15:29:39,244 WARN L148 SmtUtils]: Spent 2033ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-05 15:29:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-05 15:29:39,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 15:29:39,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2018-04-05 15:29:39,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-05 15:29:39,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-05 15:29:39,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-04-05 15:29:39,411 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand 43 states. [2018-04-05 15:29:41,111 WARN L148 SmtUtils]: Spent 203ms on a formula simplification that was a NOOP. DAG size: 32 [2018-04-05 15:29:43,051 WARN L148 SmtUtils]: Spent 126ms on a formula simplification that was a NOOP. DAG size: 50 [2018-04-05 15:29:43,911 WARN L148 SmtUtils]: Spent 243ms on a formula simplification that was a NOOP. DAG size: 50 [2018-04-05 15:29:44,566 WARN L151 SmtUtils]: Spent 306ms on a formula simplification. DAG size of input: 86 DAG size of output 74 [2018-04-05 15:29:44,939 WARN L148 SmtUtils]: Spent 148ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-05 15:29:45,499 WARN L151 SmtUtils]: Spent 324ms on a formula simplification. DAG size of input: 66 DAG size of output 56 [2018-04-05 15:29:46,416 WARN L151 SmtUtils]: Spent 425ms on a formula simplification. DAG size of input: 64 DAG size of output 51 [2018-04-05 15:29:46,928 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 42 DAG size of output 32 [2018-04-05 15:29:47,396 WARN L151 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 31 DAG size of output 29 [2018-04-05 15:29:47,935 WARN L151 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 32 DAG size of output 29 [2018-04-05 15:29:48,535 WARN L151 SmtUtils]: Spent 361ms on a formula simplification. DAG size of input: 38 DAG size of output 33 [2018-04-05 15:29:48,900 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 28 DAG size of output 25 [2018-04-05 15:29:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:29:50,013 INFO L93 Difference]: Finished difference Result 206 states and 219 transitions. [2018-04-05 15:29:50,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-05 15:29:50,014 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 68 [2018-04-05 15:29:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:29:50,015 INFO L225 Difference]: With dead ends: 206 [2018-04-05 15:29:50,015 INFO L226 Difference]: Without dead ends: 205 [2018-04-05 15:29:50,016 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=359, Invalid=3547, Unknown=0, NotChecked=0, Total=3906 [2018-04-05 15:29:50,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-05 15:29:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2018-04-05 15:29:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-05 15:29:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 214 transitions. [2018-04-05 15:29:50,058 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 214 transitions. Word has length 68 [2018-04-05 15:29:50,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:29:50,058 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 214 transitions. [2018-04-05 15:29:50,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-05 15:29:50,058 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 214 transitions. [2018-04-05 15:29:50,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-05 15:29:50,059 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:29:50,059 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:29:50,059 INFO L408 AbstractCegarLoop]: === Iteration 30 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:29:50,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1296253800, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:29:50,080 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:29:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:29:50,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:29:50,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:29:50,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:29:50,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:29:50,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:29:50,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:29:50,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-05 15:29:50,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:29:50,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:29:50,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-05 15:29:50,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:29:50,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:29:50,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:29:50,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-05 15:29:50,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:29:50,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:29:50,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-05 15:29:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:29:54,152 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:30:00,330 WARN L148 SmtUtils]: Spent 173ms on a formula simplification that was a NOOP. DAG size: 20 [2018-04-05 15:30:00,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-04-05 15:30:00,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:30:00,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-05 15:30:00,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-05 15:30:00,463 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 15:30:00,466 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-05 15:30:00,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 15:30:00,545 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:30:00,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:30:00,701 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-05 15:30:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:30:01,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 15:30:01,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-04-05 15:30:01,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-05 15:30:01,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-05 15:30:01,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2402, Unknown=0, NotChecked=0, Total=2550 [2018-04-05 15:30:01,633 INFO L87 Difference]: Start difference. First operand 200 states and 214 transitions. Second operand 51 states. [2018-04-05 15:30:04,335 WARN L148 SmtUtils]: Spent 144ms on a formula simplification that was a NOOP. DAG size: 28 [2018-04-05 15:30:07,227 WARN L151 SmtUtils]: Spent 294ms on a formula simplification. DAG size of input: 41 DAG size of output 40 [2018-04-05 15:30:07,820 WARN L148 SmtUtils]: Spent 174ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-05 15:30:08,651 WARN L148 SmtUtils]: Spent 249ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-05 15:30:09,439 WARN L148 SmtUtils]: Spent 240ms on a formula simplification that was a NOOP. DAG size: 50 [2018-04-05 15:30:09,990 WARN L148 SmtUtils]: Spent 269ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-05 15:30:10,356 WARN L148 SmtUtils]: Spent 125ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-05 15:30:11,040 WARN L148 SmtUtils]: Spent 397ms on a formula simplification that was a NOOP. DAG size: 56 [2018-04-05 15:30:11,568 WARN L148 SmtUtils]: Spent 178ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-05 15:30:12,399 WARN L151 SmtUtils]: Spent 318ms on a formula simplification. DAG size of input: 53 DAG size of output 51 [2018-04-05 15:30:12,666 WARN L148 SmtUtils]: Spent 133ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-05 15:30:13,150 WARN L151 SmtUtils]: Spent 232ms on a formula simplification. DAG size of input: 42 DAG size of output 40 [2018-04-05 15:30:13,415 WARN L148 SmtUtils]: Spent 124ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-05 15:30:13,789 WARN L148 SmtUtils]: Spent 136ms on a formula simplification that was a NOOP. DAG size: 50 [2018-04-05 15:30:14,202 WARN L148 SmtUtils]: Spent 188ms on a formula simplification that was a NOOP. DAG size: 39 [2018-04-05 15:30:14,733 WARN L148 SmtUtils]: Spent 184ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-05 15:30:15,458 WARN L151 SmtUtils]: Spent 414ms on a formula simplification. DAG size of input: 49 DAG size of output 47 [2018-04-05 15:30:16,109 WARN L148 SmtUtils]: Spent 290ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-05 15:30:16,903 WARN L148 SmtUtils]: Spent 192ms on a formula simplification that was a NOOP. DAG size: 40 [2018-04-05 15:30:17,699 WARN L148 SmtUtils]: Spent 250ms on a formula simplification that was a NOOP. DAG size: 46 [2018-04-05 15:30:18,063 WARN L148 SmtUtils]: Spent 147ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-05 15:30:19,811 WARN L148 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 43 [2018-04-05 15:30:20,360 WARN L148 SmtUtils]: Spent 229ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-05 15:30:20,972 WARN L148 SmtUtils]: Spent 251ms on a formula simplification that was a NOOP. DAG size: 23 [2018-04-05 15:30:22,644 WARN L148 SmtUtils]: Spent 257ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-05 15:30:24,027 WARN L151 SmtUtils]: Spent 277ms on a formula simplification. DAG size of input: 49 DAG size of output 47 [2018-04-05 15:30:24,397 WARN L148 SmtUtils]: Spent 149ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-05 15:30:26,894 WARN L148 SmtUtils]: Spent 142ms on a formula simplification that was a NOOP. DAG size: 40 [2018-04-05 15:30:27,540 WARN L148 SmtUtils]: Spent 227ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-05 15:30:28,176 WARN L148 SmtUtils]: Spent 229ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-05 15:30:28,694 WARN L148 SmtUtils]: Spent 156ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-05 15:30:29,211 WARN L148 SmtUtils]: Spent 131ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-05 15:30:29,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 15:30:29,896 INFO L93 Difference]: Finished difference Result 248 states and 265 transitions. [2018-04-05 15:30:29,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-05 15:30:29,897 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 69 [2018-04-05 15:30:29,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 15:30:29,898 INFO L225 Difference]: With dead ends: 248 [2018-04-05 15:30:29,899 INFO L226 Difference]: Without dead ends: 247 [2018-04-05 15:30:29,900 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=1104, Invalid=10238, Unknown=0, NotChecked=0, Total=11342 [2018-04-05 15:30:29,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-05 15:30:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 200. [2018-04-05 15:30:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-05 15:30:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 214 transitions. [2018-04-05 15:30:30,012 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 214 transitions. Word has length 69 [2018-04-05 15:30:30,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 15:30:30,012 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 214 transitions. [2018-04-05 15:30:30,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-05 15:30:30,012 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 214 transitions. [2018-04-05 15:30:30,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-05 15:30:30,013 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 15:30:30,013 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 15:30:30,013 INFO L408 AbstractCegarLoop]: === Iteration 31 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-05 15:30:30,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1320893077, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 15:30:30,050 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 15:30:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 15:30:30,103 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 15:30:30,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:30:30,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:30:30,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 15:30:30,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:30:30,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:30:30,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-05 15:30:30,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:30:30,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-05 15:30:30,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 15:30:30,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:30:30,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 15:30:30,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-05 15:30:30,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:30:30,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:30:30,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-05 15:30:30,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-05 15:30:30,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-05 15:30:30,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:30:30,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:30:30,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:30:30,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-05 15:30:30,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-04-05 15:30:30,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-05 15:30:30,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:30:30,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:30:30,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-05 15:30:30,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-05 15:30:32,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-05 15:30:32,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-04-05 15:30:32,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-05 15:30:32,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:30:32,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-05 15:30:32,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:49 [2018-04-05 15:30:33,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-05 15:30:33,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-05 15:30:33,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:30:33,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:30:33,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:30:33,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-05 15:30:33,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-05 15:30:34,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-05 15:30:34,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-05 15:30:34,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:30:34,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-05 15:30:34,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-05 15:30:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 15:30:34,785 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 15:30:37,996 WARN L148 SmtUtils]: Spent 144ms on a formula simplification that was a NOOP. DAG size: 56 [2018-04-05 15:30:41,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-04-05 15:30:41,426 WARN L148 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 30 [2018-04-05 15:30:41,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-05 15:30:41,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 15:30:41,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-05 15:30:41,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-04-05 15:30:41,694 WARN L148 SmtUtils]: Spent 127ms on a formula simplification that was a NOOP. DAG size: 39 [2018-04-05 15:30:41,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-04-05 15:30:41,729 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-05 15:30:41,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-05 15:30:41,741 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-05 15:30:41,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-04-05 15:30:41,778 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-05 15:30:42,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-05 15:30:42,133 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-04-05 15:30:42,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2018-04-05 15:30:42,186 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-05 15:30:42,374 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-05 15:30:42,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-05 15:30:42,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2018-04-05 15:30:42,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 52 [2018-04-05 15:30:43,052 WARN L151 SmtUtils]: Spent 379ms on a formula simplification. DAG size of input: 64 DAG size of output 52 [2018-04-05 15:30:43,068 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 30 treesize of output 25 [2018-04-05 15:30:43,069 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-05 15:30:43,100 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 0 case distinctions, treesize of input 30 treesize of output 25 [2018-04-05 15:30:43,100 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-05 15:30:43,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 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-05 15:30:43,916 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-04-05 15:30:43,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-05 15:30:43,989 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-04-05 15:30:44,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2018-04-05 15:30:44,290 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-05 15:30:44,420 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 15:30:44,669 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-05 15:30:44,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-05 15:30:44,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-04-05 15:30:44,683 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-05 15:30:44,701 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 15:30:44,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-05 15:30:45,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-05 15:30:45,066 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 6 variables, input treesize:58, output treesize:84 [2018-04-05 15:30:45,470 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 24 DAG size of output 20