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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/length_test03_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 15:57:30,550 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 15:57:30,551 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 15:57:30,565 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 15:57:30,565 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 15:57:30,565 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 15:57:30,566 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 15:57:30,568 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 15:57:30,569 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 15:57:30,570 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 15:57:30,571 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 15:57:30,571 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 15:57:30,572 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 15:57:30,573 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 15:57:30,574 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 15:57:30,575 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 15:57:30,577 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 15:57:30,578 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 15:57:30,579 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 15:57:30,580 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 15:57:30,582 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 15:57:30,582 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 15:57:30,582 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 15:57:30,583 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 15:57:30,584 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 15:57:30,585 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 15:57:30,585 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 15:57:30,585 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 15:57:30,586 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 15:57:30,586 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 15:57:30,586 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 15:57:30,587 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-10 15:57:30,604 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 15:57:30,604 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 15:57:30,605 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 15:57:30,605 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 15:57:30,605 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 15:57:30,605 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 15:57:30,605 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 15:57:30,606 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 15:57:30,606 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 15:57:30,606 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 15:57:30,606 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 15:57:30,606 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 15:57:30,606 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 15:57:30,606 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 15:57:30,606 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 15:57:30,606 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 15:57:30,606 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 15:57:30,607 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 15:57:30,607 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 15:57:30,607 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 15:57:30,607 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 15:57:30,607 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 15:57:30,607 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 15:57:30,607 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 15:57:30,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 15:57:30,640 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 15:57:30,643 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 15:57:30,644 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 15:57:30,644 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 15:57:30,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-04-10 15:57:30,938 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc73854eba [2018-04-10 15:57:31,089 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 15:57:31,089 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 15:57:31,090 INFO L168 CDTParser]: Scanning length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,099 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 15:57:31,099 INFO L215 ultiparseSymbolTable]: [2018-04-10 15:57:31,099 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 15:57:31,099 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___false_valid_memtrack_i____bswap_32 ('__bswap_32') in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,100 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___false_valid_memtrack_i____bswap_64 ('__bswap_64') in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,100 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___false_valid_memtrack_i__append ('append') in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,100 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,100 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 15:57:31,100 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__gid_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,100 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__off_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,100 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____blkcnt64_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,100 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ldiv_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,100 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____nlink_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,100 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_short in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,100 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____int8_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,100 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int64_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,100 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____mode_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____timer_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uid_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ssize_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____sig_atomic_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__key_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____ssize_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__nlink_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fsfilcnt_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__timer_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__mode_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsword_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_short in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__int32_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uint64_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pid_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____clockid_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int8_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____suseconds_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,101 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__clockid_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,102 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____pthread_slist_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,102 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__quad_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,102 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__caddr_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,102 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fd_mask in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,102 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____id_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,102 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,102 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int16_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,102 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____syscall_ulong_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,102 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_cond_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,102 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____int32_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,102 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,103 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uint32_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,103 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__div_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,103 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__blksize_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,103 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_spinlock_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,103 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fsblkcnt_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,103 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__size_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,103 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____pid_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,103 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_once_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,103 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_quad_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,103 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____intptr_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,103 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_mutexattr_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,103 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_char in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,104 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____off64_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,104 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____quad_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,104 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsblkcnt64_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,104 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____socklen_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,104 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__lldiv_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,104 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__uid_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,104 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__int16_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,104 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_barrier_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,104 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_attr_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,104 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__wchar_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,104 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____rlim_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,105 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____int16_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,105 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_rwlockattr_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,105 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_char in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,105 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__daddr_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,105 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__blkcnt_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,105 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__sigset_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,105 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uint16_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,105 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_long in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,105 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____gid_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,105 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____ino_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,106 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____loff_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,106 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____ino64_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,106 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____sigset_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,106 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int32_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,106 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsid_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,106 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____dev_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,106 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ulong in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,106 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_long in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,106 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__suseconds_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,106 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fd_mask in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,106 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__clock_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,107 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____caddr_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,107 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____off_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,107 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fd_set in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,107 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__dev_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,107 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____rlim64_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,107 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____key_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,107 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__loff_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,107 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__uint in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,107 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uint8_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,107 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__time_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,107 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_rwlock_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,107 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_int in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,107 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fsid_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____qaddr_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____blkcnt_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____clock_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____daddr_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__id_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__int64_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____blksize_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_condattr_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ushort in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____syscall_slong_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_quad_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsfilcnt_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____time_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__int8_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_key_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsblkcnt_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__register_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____int64_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_barrierattr_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsfilcnt64_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_mutex_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ino_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____useconds_t in length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,122 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc73854eba [2018-04-10 15:57:31,126 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 15:57:31,127 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 15:57:31,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 15:57:31,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 15:57:31,131 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 15:57:31,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:57:31" (1/1) ... [2018-04-10 15:57:31,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b1b39bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:57:31, skipping insertion in model container [2018-04-10 15:57:31,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:57:31" (1/1) ... [2018-04-10 15:57:31,144 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:57:31,167 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:57:31,302 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:57:31,340 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:57:31,346 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 119 non ball SCCs. Number of states in SCCs 119. [2018-04-10 15:57:31,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:57:31 WrapperNode [2018-04-10 15:57:31,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 15:57:31,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 15:57:31,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 15:57:31,389 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 15:57:31,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:57:31" (1/1) ... [2018-04-10 15:57:31,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:57:31" (1/1) ... [2018-04-10 15:57:31,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:57:31" (1/1) ... [2018-04-10 15:57:31,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:57:31" (1/1) ... [2018-04-10 15:57:31,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:57:31" (1/1) ... [2018-04-10 15:57:31,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:57:31" (1/1) ... [2018-04-10 15:57:31,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:57:31" (1/1) ... [2018-04-10 15:57:31,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 15:57:31,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 15:57:31,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 15:57:31,436 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 15:57:31,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:57:31" (1/1) ... No working directory specified, using /home/ultimate/work/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-10 15:57:31,535 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 15:57:31,535 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 15:57:31,535 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_32 [2018-04-10 15:57:31,535 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_64 [2018-04-10 15:57:31,535 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i__append [2018-04-10 15:57:31,535 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 15:57:31,535 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 15:57:31,535 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 15:57:31,535 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 15:57:31,535 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 15:57:31,535 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 15:57:31,535 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 15:57:31,535 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 15:57:31,535 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_32 [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_64 [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 15:57:31,536 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 15:57:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 15:57:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 15:57:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 15:57:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 15:57:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 15:57:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 15:57:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 15:57:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 15:57:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 15:57:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 15:57:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 15:57:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 15:57:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 15:57:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 15:57:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 15:57:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 15:57:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 15:57:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 15:57:31,540 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 15:57:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 15:57:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 15:57:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 15:57:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 15:57:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 15:57:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 15:57:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 15:57:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 15:57:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 15:57:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-04-10 15:57:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 15:57:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i__append [2018-04-10 15:57:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 15:57:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 15:57:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 15:57:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 15:57:31,541 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 15:57:31,542 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 15:57:31,542 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 15:57:31,542 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 15:57:31,542 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 15:57:31,542 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 15:57:31,942 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 15:57:31,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:57:31 BoogieIcfgContainer [2018-04-10 15:57:31,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 15:57:31,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 15:57:31,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 15:57:31,945 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 15:57:31,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 03:57:31" (1/3) ... [2018-04-10 15:57:31,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28706dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:57:31, skipping insertion in model container [2018-04-10 15:57:31,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:57:31" (2/3) ... [2018-04-10 15:57:31,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28706dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:57:31, skipping insertion in model container [2018-04-10 15:57:31,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:57:31" (3/3) ... [2018-04-10 15:57:31,947 INFO L107 eAbstractionObserver]: Analyzing ICFG length_test03_false-valid-memtrack.i [2018-04-10 15:57:31,953 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 15:57:31,963 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-10 15:57:31,998 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 15:57:31,999 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 15:57:31,999 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 15:57:31,999 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 15:57:31,999 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 15:57:31,999 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 15:57:31,999 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 15:57:31,999 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 15:57:32,000 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 15:57:32,000 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 15:57:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2018-04-10 15:57:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 15:57:32,018 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:32,018 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:32,018 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-10 15:57:32,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1465942715, now seen corresponding path program 1 times [2018-04-10 15:57:32,022 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:32,023 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:32,050 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:32,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:32,051 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:32,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:32,124 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-10 15:57:32,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:32,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:57:32,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:57:32,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:57:32,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:57:32,142 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 4 states. [2018-04-10 15:57:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:32,350 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-04-10 15:57:32,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:57:32,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 15:57:32,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:32,363 INFO L225 Difference]: With dead ends: 175 [2018-04-10 15:57:32,363 INFO L226 Difference]: Without dead ends: 172 [2018-04-10 15:57:32,364 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:57:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-10 15:57:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 134. [2018-04-10 15:57:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-10 15:57:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-04-10 15:57:32,398 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 8 [2018-04-10 15:57:32,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:32,399 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-04-10 15:57:32,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:57:32,399 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-04-10 15:57:32,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 15:57:32,399 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:32,399 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:32,400 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-10 15:57:32,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1465942716, now seen corresponding path program 1 times [2018-04-10 15:57:32,400 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:32,400 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:32,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:32,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:32,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:32,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:32,451 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-10 15:57:32,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:32,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:57:32,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:57:32,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:57:32,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:57:32,453 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 4 states. [2018-04-10 15:57:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:32,573 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-04-10 15:57:32,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:57:32,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 15:57:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:32,574 INFO L225 Difference]: With dead ends: 134 [2018-04-10 15:57:32,574 INFO L226 Difference]: Without dead ends: 134 [2018-04-10 15:57:32,575 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:57:32,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-10 15:57:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-04-10 15:57:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-10 15:57:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-04-10 15:57:32,582 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 8 [2018-04-10 15:57:32,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:32,582 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-04-10 15:57:32,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:57:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-04-10 15:57:32,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-10 15:57:32,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:32,583 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:32,583 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-10 15:57:32,583 INFO L82 PathProgramCache]: Analyzing trace with hash -643063297, now seen corresponding path program 1 times [2018-04-10 15:57:32,583 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:32,583 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:32,584 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:32,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:32,585 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:32,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:32,619 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-10 15:57:32,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:32,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:57:32,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:57:32,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:57:32,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:57:32,620 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 4 states. [2018-04-10 15:57:32,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:32,720 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-04-10 15:57:32,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:57:32,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-10 15:57:32,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:32,721 INFO L225 Difference]: With dead ends: 148 [2018-04-10 15:57:32,721 INFO L226 Difference]: Without dead ends: 148 [2018-04-10 15:57:32,721 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:57:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-10 15:57:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2018-04-10 15:57:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-10 15:57:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-04-10 15:57:32,726 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 12 [2018-04-10 15:57:32,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:32,726 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-04-10 15:57:32,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:57:32,726 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-04-10 15:57:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-10 15:57:32,727 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:32,727 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:32,727 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-10 15:57:32,727 INFO L82 PathProgramCache]: Analyzing trace with hash -643063296, now seen corresponding path program 1 times [2018-04-10 15:57:32,727 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:32,727 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:32,728 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:32,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:32,728 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:32,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:32,769 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-10 15:57:32,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:32,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:57:32,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:57:32,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:57:32,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:57:32,770 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 4 states. [2018-04-10 15:57:32,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:32,867 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-04-10 15:57:32,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:57:32,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-04-10 15:57:32,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:32,868 INFO L225 Difference]: With dead ends: 135 [2018-04-10 15:57:32,868 INFO L226 Difference]: Without dead ends: 135 [2018-04-10 15:57:32,869 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:57:32,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-10 15:57:32,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-04-10 15:57:32,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-10 15:57:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-04-10 15:57:32,873 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 12 [2018-04-10 15:57:32,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:32,873 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-04-10 15:57:32,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:57:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-04-10 15:57:32,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-10 15:57:32,874 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:32,874 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:32,874 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-10 15:57:32,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1451976942, now seen corresponding path program 1 times [2018-04-10 15:57:32,874 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:32,874 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:32,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:32,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:32,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:32,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:32,930 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-10 15:57:32,930 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:32,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:57:32,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:57:32,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:57:32,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:57:32,930 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 4 states. [2018-04-10 15:57:33,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:33,007 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-04-10 15:57:33,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:57:33,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-10 15:57:33,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:33,008 INFO L225 Difference]: With dead ends: 128 [2018-04-10 15:57:33,008 INFO L226 Difference]: Without dead ends: 128 [2018-04-10 15:57:33,008 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:57:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-10 15:57:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-04-10 15:57:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-10 15:57:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-04-10 15:57:33,015 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 20 [2018-04-10 15:57:33,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:33,015 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-04-10 15:57:33,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:57:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-04-10 15:57:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-10 15:57:33,016 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:33,016 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:33,016 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-10 15:57:33,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1451976941, now seen corresponding path program 1 times [2018-04-10 15:57:33,017 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:33,017 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:33,018 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:33,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:33,018 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:33,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:33,070 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-10 15:57:33,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:33,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:57:33,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:57:33,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:57:33,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:57:33,071 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 4 states. [2018-04-10 15:57:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:33,118 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-04-10 15:57:33,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:57:33,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-10 15:57:33,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:33,119 INFO L225 Difference]: With dead ends: 123 [2018-04-10 15:57:33,119 INFO L226 Difference]: Without dead ends: 123 [2018-04-10 15:57:33,120 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:57:33,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-10 15:57:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-04-10 15:57:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-10 15:57:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-04-10 15:57:33,124 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 20 [2018-04-10 15:57:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:33,124 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-04-10 15:57:33,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:57:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-04-10 15:57:33,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-10 15:57:33,125 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:33,125 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-10 15:57:33,125 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-10 15:57:33,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2061612264, now seen corresponding path program 1 times [2018-04-10 15:57:33,126 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:33,126 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:33,127 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:33,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:33,127 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:33,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:33,149 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:33,149 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:33,149 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:33,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:33,195 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:33,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 15:57:33,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 15:57:33,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:33,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:33,233 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-10 15:57:33,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:33,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-10 15:57:33,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-10 15:57:33,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,281 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-10 15:57:33,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-04-10 15:57:33,294 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-10 15:57:33,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:33,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 15:57:33,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:57:33,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:57:33,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:57:33,295 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 7 states. [2018-04-10 15:57:33,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:33,546 INFO L93 Difference]: Finished difference Result 238 states and 254 transitions. [2018-04-10 15:57:33,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 15:57:33,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-04-10 15:57:33,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:33,547 INFO L225 Difference]: With dead ends: 238 [2018-04-10 15:57:33,547 INFO L226 Difference]: Without dead ends: 238 [2018-04-10 15:57:33,548 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-10 15:57:33,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-10 15:57:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 150. [2018-04-10 15:57:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-10 15:57:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2018-04-10 15:57:33,553 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 21 [2018-04-10 15:57:33,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:33,553 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2018-04-10 15:57:33,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:57:33,554 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2018-04-10 15:57:33,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-10 15:57:33,554 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:33,554 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-10 15:57:33,555 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-10 15:57:33,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2061612263, now seen corresponding path program 1 times [2018-04-10 15:57:33,555 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:33,555 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:33,556 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:33,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:33,556 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:33,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:33,572 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:33,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:33,573 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:33,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:33,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:33,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:33,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,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-10 15:57:33,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:57:33,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:33,641 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-10 15:57:33,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:33,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:33,651 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-10 15:57:33,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:33,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:33,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-10 15:57:33,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:33,718 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 4 case distinctions, treesize of input 17 treesize of output 28 [2018-04-10 15:57:33,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-10 15:57:33,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-10 15:57:33,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:69 [2018-04-10 15:57:33,848 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-10 15:57:33,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:33,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 15:57:33,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 15:57:33,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 15:57:33,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-10 15:57:33,849 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand 9 states. [2018-04-10 15:57:34,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:34,126 INFO L93 Difference]: Finished difference Result 178 states and 200 transitions. [2018-04-10 15:57:34,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 15:57:34,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-10 15:57:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:34,127 INFO L225 Difference]: With dead ends: 178 [2018-04-10 15:57:34,127 INFO L226 Difference]: Without dead ends: 178 [2018-04-10 15:57:34,127 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:57:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-10 15:57:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-04-10 15:57:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-10 15:57:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2018-04-10 15:57:34,130 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 21 [2018-04-10 15:57:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:34,130 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2018-04-10 15:57:34,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 15:57:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2018-04-10 15:57:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 15:57:34,131 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:34,131 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] [2018-04-10 15:57:34,131 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-10 15:57:34,131 INFO L82 PathProgramCache]: Analyzing trace with hash 945598509, now seen corresponding path program 1 times [2018-04-10 15:57:34,131 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:34,131 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:34,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:34,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:34,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:34,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:34,145 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:34,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:34,145 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:34,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:34,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:34,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 15:57:34,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:57:34,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 15:57:34,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 15:57:34,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,222 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 11 treesize of output 8 [2018-04-10 15:57:34,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:34,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,231 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:26 [2018-04-10 15:57:34,241 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 21 treesize of output 16 [2018-04-10 15:57:34,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:34,244 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 16 treesize of output 23 [2018-04-10 15:57:34,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,257 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 21 treesize of output 16 [2018-04-10 15:57:34,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:34,261 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 16 treesize of output 23 [2018-04-10 15:57:34,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,271 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-10 15:57:34,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:34,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:34,284 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-10 15:57:34,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:53 [2018-04-10 15:57:34,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-10 15:57:34,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:57:34,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-10 15:57:34,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 15:57:34,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,359 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-04-10 15:57:34,383 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 37 treesize of output 36 [2018-04-10 15:57:34,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:34,386 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 16 treesize of output 23 [2018-04-10 15:57:34,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,411 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 37 treesize of output 36 [2018-04-10 15:57:34,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:34,415 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 16 treesize of output 23 [2018-04-10 15:57:34,415 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:34,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:85 [2018-04-10 15:57:34,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:34,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:34,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:34,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-10 15:57:34,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,573 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-10 15:57:34,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:90, output treesize:83 [2018-04-10 15:57:34,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-04-10 15:57:34,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:34,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 15:57:34,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:34,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-10 15:57:34,675 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:34,695 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-10 15:57:34,695 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:97, output treesize:61 [2018-04-10 15:57:34,751 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-10 15:57:34,752 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:34,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-10 15:57:34,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 15:57:34,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 15:57:34,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-04-10 15:57:34,753 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand 16 states. [2018-04-10 15:57:35,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:35,885 INFO L93 Difference]: Finished difference Result 178 states and 199 transitions. [2018-04-10 15:57:35,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 15:57:35,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-04-10 15:57:35,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:35,887 INFO L225 Difference]: With dead ends: 178 [2018-04-10 15:57:35,887 INFO L226 Difference]: Without dead ends: 178 [2018-04-10 15:57:35,887 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2018-04-10 15:57:35,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-04-10 15:57:35,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-04-10 15:57:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-10 15:57:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 199 transitions. [2018-04-10 15:57:35,894 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 199 transitions. Word has length 30 [2018-04-10 15:57:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:35,894 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 199 transitions. [2018-04-10 15:57:35,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 15:57:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 199 transitions. [2018-04-10 15:57:35,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-10 15:57:35,895 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:35,895 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] [2018-04-10 15:57:35,895 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-10 15:57:35,895 INFO L82 PathProgramCache]: Analyzing trace with hash 548364848, now seen corresponding path program 1 times [2018-04-10 15:57:35,895 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:35,896 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:35,896 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:35,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:35,896 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:35,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:35,920 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:35,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:35,920 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:35,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:35,964 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:35,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 15:57:35,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:35,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:35,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:57:35,980 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 13 treesize of output 10 [2018-04-10 15:57:35,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10 treesize of output 9 [2018-04-10 15:57:35,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:35,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:35,996 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 13 treesize of output 10 [2018-04-10 15:57:35,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10 treesize of output 9 [2018-04-10 15:57:35,998 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,005 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-10 15:57:36,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:36,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:36,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 15:57:36,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:36 [2018-04-10 15:57:36,066 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 21 treesize of output 22 [2018-04-10 15:57:36,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 15:57:36,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,109 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 21 treesize of output 22 [2018-04-10 15:57:36,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 15:57:36,112 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,116 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,126 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-04-10 15:57:36,152 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 30 treesize of output 29 [2018-04-10 15:57:36,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:36,156 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 16 treesize of output 23 [2018-04-10 15:57:36,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,184 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 30 treesize of output 29 [2018-04-10 15:57:36,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:36,189 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 16 treesize of output 23 [2018-04-10 15:57:36,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,196 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:36,208 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:68 [2018-04-10 15:57:36,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:36,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:36,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:36,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-10 15:57:36,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-10 15:57:36,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:36,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:36,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:75, output treesize:67 [2018-04-10 15:57:36,572 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-10 15:57:36,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:36,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-10 15:57:36,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 15:57:36,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 15:57:36,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=194, Unknown=2, NotChecked=0, Total=240 [2018-04-10 15:57:36,573 INFO L87 Difference]: Start difference. First operand 176 states and 199 transitions. Second operand 16 states. [2018-04-10 15:57:36,876 WARN L148 SmtUtils]: Spent 131ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-10 15:57:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:37,608 INFO L93 Difference]: Finished difference Result 168 states and 188 transitions. [2018-04-10 15:57:37,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 15:57:37,608 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-04-10 15:57:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:37,609 INFO L225 Difference]: With dead ends: 168 [2018-04-10 15:57:37,609 INFO L226 Difference]: Without dead ends: 168 [2018-04-10 15:57:37,610 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=649, Unknown=2, NotChecked=0, Total=812 [2018-04-10 15:57:37,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-10 15:57:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-04-10 15:57:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-10 15:57:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2018-04-10 15:57:37,613 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 32 [2018-04-10 15:57:37,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:37,613 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2018-04-10 15:57:37,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 15:57:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2018-04-10 15:57:37,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-10 15:57:37,614 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:37,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] [2018-04-10 15:57:37,614 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-10 15:57:37,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1767154905, now seen corresponding path program 1 times [2018-04-10 15:57:37,614 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:37,615 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:37,615 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:37,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:37,615 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:37,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:37,654 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-10 15:57:37,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:57:37,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:57:37,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 15:57:37,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 15:57:37,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 15:57:37,655 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 3 states. [2018-04-10 15:57:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:37,668 INFO L93 Difference]: Finished difference Result 177 states and 194 transitions. [2018-04-10 15:57:37,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 15:57:37,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-04-10 15:57:37,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:37,670 INFO L225 Difference]: With dead ends: 177 [2018-04-10 15:57:37,670 INFO L226 Difference]: Without dead ends: 177 [2018-04-10 15:57:37,670 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 15:57:37,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-10 15:57:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2018-04-10 15:57:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-10 15:57:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2018-04-10 15:57:37,674 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 38 [2018-04-10 15:57:37,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:37,674 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2018-04-10 15:57:37,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 15:57:37,674 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2018-04-10 15:57:37,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-10 15:57:37,675 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:37,675 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:57:37,675 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-10 15:57:37,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1625593294, now seen corresponding path program 1 times [2018-04-10 15:57:37,675 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:37,675 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:37,676 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:37,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:37,676 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:37,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:37,696 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:37,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:37,697 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:37,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:37,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:37,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:37,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:37,804 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 11 treesize of output 12 [2018-04-10 15:57:37,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:37,812 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 14 treesize of output 17 [2018-04-10 15:57:37,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:37,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:37,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-10 15:57:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:57:37,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:37,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-10 15:57:37,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 15:57:37,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 15:57:37,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-10 15:57:37,838 INFO L87 Difference]: Start difference. First operand 164 states and 180 transitions. Second operand 10 states. [2018-04-10 15:57:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:38,166 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-04-10 15:57:38,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 15:57:38,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-04-10 15:57:38,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:38,186 INFO L225 Difference]: With dead ends: 177 [2018-04-10 15:57:38,186 INFO L226 Difference]: Without dead ends: 177 [2018-04-10 15:57:38,186 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:57:38,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-10 15:57:38,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 164. [2018-04-10 15:57:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-10 15:57:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-04-10 15:57:38,190 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 41 [2018-04-10 15:57:38,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:38,191 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-04-10 15:57:38,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 15:57:38,191 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-04-10 15:57:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 15:57:38,192 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:38,192 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 15:57:38,192 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-10 15:57:38,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1911230466, now seen corresponding path program 1 times [2018-04-10 15:57:38,192 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:38,192 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:38,193 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:38,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:38,193 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:38,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:38,209 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:38,209 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:38,210 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:38,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:38,240 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:38,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 15:57:38,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:38,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:38,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 15:57:38,266 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___false_valid_memtrack_i__append_#t~malloc2.base| Int)) (and (= (select |c_old(#valid)| |__U_MULTI_flength_test___false_valid_memtrack_i__append_#t~malloc2.base|) 0) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_flength_test___false_valid_memtrack_i__append_#t~malloc2.base| 1)))) is different from true [2018-04-10 15:57:38,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 15:57:38,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:38,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:38,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-10 15:57:38,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-10 15:57:38,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:38,328 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-10 15:57:38,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-04-10 15:57:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-04-10 15:57:38,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:38,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-10 15:57:38,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 15:57:38,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 15:57:38,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2018-04-10 15:57:38,343 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 9 states. [2018-04-10 15:57:38,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:38,623 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2018-04-10 15:57:38,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 15:57:38,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-04-10 15:57:38,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:38,624 INFO L225 Difference]: With dead ends: 275 [2018-04-10 15:57:38,624 INFO L226 Difference]: Without dead ends: 275 [2018-04-10 15:57:38,625 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2018-04-10 15:57:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-10 15:57:38,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 213. [2018-04-10 15:57:38,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-10 15:57:38,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 244 transitions. [2018-04-10 15:57:38,628 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 244 transitions. Word has length 43 [2018-04-10 15:57:38,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:38,628 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 244 transitions. [2018-04-10 15:57:38,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 15:57:38,628 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 244 transitions. [2018-04-10 15:57:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 15:57:38,628 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:38,629 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 15:57:38,629 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-10 15:57:38,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1911230465, now seen corresponding path program 1 times [2018-04-10 15:57:38,629 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:38,629 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:38,630 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:38,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:38,630 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:38,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:38,644 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:38,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:38,644 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:38,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:38,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:38,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 15:57:38,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:38,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 15:57:38,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:38,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:38,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 15:57:38,721 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_flength_test___false_valid_memtrack_i__append_#t~malloc2.base| Int)) (and (= (select |c_old(#valid)| |__U_MULTI_flength_test___false_valid_memtrack_i__append_#t~malloc2.base|) 0) (= (store |c_old(#length)| |__U_MULTI_flength_test___false_valid_memtrack_i__append_#t~malloc2.base| 9) |c_#length|))) is different from true [2018-04-10 15:57:38,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,733 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 12 treesize of output 21 [2018-04-10 15:57:38,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:38,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,743 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-10 15:57:38,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:38,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:38,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-10 15:57:38,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:38,807 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 2 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 15:57:38,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-10 15:57:38,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:38,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:44 [2018-04-10 15:57:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-04-10 15:57:38,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:38,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 15:57:38,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:57:38,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:57:38,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2018-04-10 15:57:38,897 INFO L87 Difference]: Start difference. First operand 213 states and 244 transitions. Second operand 11 states. [2018-04-10 15:57:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:39,255 INFO L93 Difference]: Finished difference Result 268 states and 313 transitions. [2018-04-10 15:57:39,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 15:57:39,255 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-04-10 15:57:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:39,257 INFO L225 Difference]: With dead ends: 268 [2018-04-10 15:57:39,257 INFO L226 Difference]: Without dead ends: 268 [2018-04-10 15:57:39,258 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2018-04-10 15:57:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-10 15:57:39,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 243. [2018-04-10 15:57:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-10 15:57:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 279 transitions. [2018-04-10 15:57:39,264 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 279 transitions. Word has length 43 [2018-04-10 15:57:39,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:39,264 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 279 transitions. [2018-04-10 15:57:39,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:57:39,265 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 279 transitions. [2018-04-10 15:57:39,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 15:57:39,265 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:39,265 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] [2018-04-10 15:57:39,265 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-10 15:57:39,266 INFO L82 PathProgramCache]: Analyzing trace with hash 771137816, now seen corresponding path program 1 times [2018-04-10 15:57:39,266 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:39,266 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:39,266 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:39,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:39,267 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:39,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:39,288 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:39,289 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:39,289 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:39,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:39,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:39,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 15:57:39,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:57:39,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:39,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:39,367 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-10 15:57:39,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:39,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-04-10 15:57:39,482 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 13 treesize of output 10 [2018-04-10 15:57:39,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:57:39,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,497 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-10 15:57:39,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-04-10 15:57:39,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-10 15:57:39,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 15:57:39,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,567 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-10 15:57:39,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-04-10 15:57:39,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 61 [2018-04-10 15:57:39,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:39,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-04-10 15:57:39,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:39,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:39,637 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 2 case distinctions, treesize of input 44 treesize of output 63 [2018-04-10 15:57:39,637 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 15:57:39,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:57:39,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:39,678 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:76, output treesize:107 [2018-04-10 15:57:39,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:39,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:39,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:39,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 97 [2018-04-10 15:57:39,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:39,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:141, output treesize:91 [2018-04-10 15:57:39,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:39,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:39,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:39,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:39,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 81 [2018-04-10 15:57:39,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:39,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:39,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:102, output treesize:114 [2018-04-10 15:57:39,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2018-04-10 15:57:39,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10 treesize of output 9 [2018-04-10 15:57:39,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:40,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:40,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:40,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:127, output treesize:114 [2018-04-10 15:57:40,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2018-04-10 15:57:40,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 15:57:40,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:40,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:40,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:40,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:127, output treesize:123 [2018-04-10 15:57:40,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 73 [2018-04-10 15:57:40,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:40,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-10 15:57:40,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:40,220 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:40,221 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2018-04-10 15:57:40,221 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:40,229 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 7 treesize of output 1 [2018-04-10 15:57:40,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:40,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:40,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:40,250 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:132, output treesize:45 [2018-04-10 15:57:40,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:57:40,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:40,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 15:57:40,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 15:57:40,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 15:57:40,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-04-10 15:57:40,304 INFO L87 Difference]: Start difference. First operand 243 states and 279 transitions. Second operand 21 states. [2018-04-10 15:57:41,388 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 123 DAG size of output 85 [2018-04-10 15:57:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:57:41,895 INFO L93 Difference]: Finished difference Result 312 states and 360 transitions. [2018-04-10 15:57:41,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 15:57:41,895 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-04-10 15:57:41,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:57:41,896 INFO L225 Difference]: With dead ends: 312 [2018-04-10 15:57:41,896 INFO L226 Difference]: Without dead ends: 312 [2018-04-10 15:57:41,897 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=207, Invalid=1199, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 15:57:41,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-04-10 15:57:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 265. [2018-04-10 15:57:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-10 15:57:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 309 transitions. [2018-04-10 15:57:41,902 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 309 transitions. Word has length 50 [2018-04-10 15:57:41,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:57:41,902 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 309 transitions. [2018-04-10 15:57:41,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 15:57:41,902 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 309 transitions. [2018-04-10 15:57:41,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 15:57:41,902 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:57:41,902 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] [2018-04-10 15:57:41,902 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-10 15:57:41,903 INFO L82 PathProgramCache]: Analyzing trace with hash 771137817, now seen corresponding path program 1 times [2018-04-10 15:57:41,903 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:57:41,903 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:57:41,903 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:41,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:41,903 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:57:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:41,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:57:41,927 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:57:41,928 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:57:41,928 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:57:41,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:57:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:57:41,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:57:41,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 15:57:41,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 15:57:42,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 15:57:42,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:42,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-10 15:57:42,268 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:42,269 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 28 treesize of output 26 [2018-04-10 15:57:42,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:42,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2018-04-10 15:57:42,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:42 [2018-04-10 15:57:42,319 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:42,320 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 30 treesize of output 30 [2018-04-10 15:57:42,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:42,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-04-10 15:57:42,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,340 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 13 treesize of output 10 [2018-04-10 15:57:42,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10 treesize of output 9 [2018-04-10 15:57:42,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:42,353 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:48 [2018-04-10 15:57:42,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 58 [2018-04-10 15:57:42,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 43 treesize of output 42 [2018-04-10 15:57:42,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 48 [2018-04-10 15:57:42,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 39 treesize of output 38 [2018-04-10 15:57:42,436 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,452 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:42,467 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:72 [2018-04-10 15:57:42,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 135 [2018-04-10 15:57:42,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:42,511 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 139 treesize of output 166 [2018-04-10 15:57:42,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:42,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:42,560 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 2 case distinctions, treesize of input 118 treesize of output 145 [2018-04-10 15:57:42,560 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 15:57:42,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:57:42,638 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:42,639 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 111 treesize of output 103 [2018-04-10 15:57:42,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:42,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:42,642 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:42,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 57 [2018-04-10 15:57:42,643 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,655 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 157 [2018-04-10 15:57:42,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:42,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 181 [2018-04-10 15:57:42,674 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,787 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:42,832 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:177, output treesize:220 [2018-04-10 15:57:42,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:42,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:42,899 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 165 treesize of output 159 [2018-04-10 15:57:42,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:42,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:42,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:236, output treesize:159 [2018-04-10 15:57:43,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:43,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:43,087 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-04-10 15:57:43,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:43,118 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 26 treesize of output 35 [2018-04-10 15:57:43,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:43,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:57:43,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:173, output treesize:166 [2018-04-10 15:57:43,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 143 treesize of output 153 [2018-04-10 15:57:43,377 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:43,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:43,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 167 [2018-04-10 15:57:43,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:43,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 140 treesize of output 139 [2018-04-10 15:57:43,507 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:43,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:43,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:43,567 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:43,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 168 [2018-04-10 15:57:43,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:43,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:57:43,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 146 [2018-04-10 15:57:43,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:43,727 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:43,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 76 [2018-04-10 15:57:43,729 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:43,743 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:43,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 177 treesize of output 194 [2018-04-10 15:57:43,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:43,773 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:43,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 198 [2018-04-10 15:57:43,775 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:43,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 174 treesize of output 173 [2018-04-10 15:57:43,912 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:44,036 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:57:44,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:44,082 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:198, output treesize:324 [2018-04-10 15:57:44,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 198 treesize of output 202 [2018-04-10 15:57:44,205 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 207 treesize of output 208 [2018-04-10 15:57:44,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:44,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:44,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 201 [2018-04-10 15:57:44,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:44,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:44,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:44,515 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:44,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 232 [2018-04-10 15:57:44,515 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:44,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 191 treesize of output 190 [2018-04-10 15:57:44,622 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:44,667 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:44,733 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:44,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 194 treesize of output 182 [2018-04-10 15:57:44,736 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:44,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-04-10 15:57:44,737 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:44,756 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:44,807 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:44,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 164 treesize of output 147 [2018-04-10 15:57:44,810 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:44,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:44,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 80 [2018-04-10 15:57:44,813 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:44,828 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:44,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 15:57:44,869 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:393, output treesize:332 [2018-04-10 15:57:44,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 208 treesize of output 197 [2018-04-10 15:57:44,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:44,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:44,969 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:44,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:44,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:44,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:44,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:44,972 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:44,972 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:44,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 211 [2018-04-10 15:57:44,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:45,075 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:45,076 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 158 [2018-04-10 15:57:45,076 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:45,155 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:45,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 156 [2018-04-10 15:57:45,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:45,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 135 [2018-04-10 15:57:45,242 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:45,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 15:57:45,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 136 [2018-04-10 15:57:45,531 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:45,532 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 77 treesize of output 97 [2018-04-10 15:57:45,532 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:45,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,550 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 57 [2018-04-10 15:57:45,551 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:45,570 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:45,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2018-04-10 15:57:45,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-10 15:57:45,632 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:45,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,643 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:45,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-04-10 15:57:45,643 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:45,651 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:45,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 103 [2018-04-10 15:57:45,712 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:45,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,714 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:45,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 77 [2018-04-10 15:57:45,715 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:45,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-04-10 15:57:45,751 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:45,781 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:45,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 110 [2018-04-10 15:57:45,795 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:45,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,799 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:45,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:57:45,800 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 15:57:45,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 108 [2018-04-10 15:57:45,801 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 15:57:45,874 INFO L267 ElimStorePlain]: Start of recursive call 16: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:57:45,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-10 15:57:45,904 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 13 variables, input treesize:366, output treesize:69 [2018-04-10 15:57:45,965 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-10 15:57:45,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:57:45,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-10 15:57:45,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 15:57:45,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 15:57:45,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=626, Unknown=1, NotChecked=0, Total=702 [2018-04-10 15:57:45,966 INFO L87 Difference]: Start difference. First operand 265 states and 309 transitions. Second operand 27 states. [2018-04-10 15:57:59,493 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 112 DAG size of output 102 [2018-04-10 15:58:23,788 WARN L151 SmtUtils]: Spent 268ms on a formula simplification. DAG size of input: 138 DAG size of output 129 [2018-04-10 15:58:24,163 WARN L151 SmtUtils]: Spent 294ms on a formula simplification. DAG size of input: 152 DAG size of output 143 [2018-04-10 15:58:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:58:30,257 INFO L93 Difference]: Finished difference Result 323 states and 378 transitions. [2018-04-10 15:58:30,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 15:58:30,258 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2018-04-10 15:58:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:58:30,259 INFO L225 Difference]: With dead ends: 323 [2018-04-10 15:58:30,259 INFO L226 Difference]: Without dead ends: 323 [2018-04-10 15:58:30,260 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=419, Invalid=2333, Unknown=4, NotChecked=0, Total=2756 [2018-04-10 15:58:30,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-04-10 15:58:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 288. [2018-04-10 15:58:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-04-10 15:58:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 337 transitions. [2018-04-10 15:58:30,267 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 337 transitions. Word has length 50 [2018-04-10 15:58:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:58:30,267 INFO L459 AbstractCegarLoop]: Abstraction has 288 states and 337 transitions. [2018-04-10 15:58:30,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 15:58:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 337 transitions. [2018-04-10 15:58:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-10 15:58:30,268 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:58:30,268 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:58:30,268 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-10 15:58:30,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1788489223, now seen corresponding path program 1 times [2018-04-10 15:58:30,268 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 15:58:30,268 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 15:58:30,269 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:58:30,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:58:30,269 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 15:58:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:58:30,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:58:30,288 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 15:58:30,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 15:58:30,288 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 15:58:30,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 15:58:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:58:30,332 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 15:58:30,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 15:58:30,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 15:58:30,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:30,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:30,347 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-10 15:58:30,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-10 15:58:30,378 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 11 treesize of output 8 [2018-04-10 15:58:30,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:58:30,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,394 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 11 treesize of output 8 [2018-04-10 15:58:30,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 15:58:30,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,404 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-10 15:58:30,418 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 21 treesize of output 16 [2018-04-10 15:58:30,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:30,420 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 16 treesize of output 23 [2018-04-10 15:58:30,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,438 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 21 treesize of output 16 [2018-04-10 15:58:30,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:30,441 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 16 treesize of output 23 [2018-04-10 15:58:30,441 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,444 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,461 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-04-10 15:58:30,605 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base Int) (__U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset Int) (__U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset Int)) (let ((.cse1 (+ __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset 1)) (.cse2 (+ __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset 5)) (.cse3 (+ __U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset 4))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base|) __U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) .cse3 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base)))) (store .cse0 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base (store (store (select .cse0 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) .cse1 0) .cse2 0)))) (= (select |c_old(#valid)| __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base 1)) (= (let ((.cse4 (store |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base|) __U_MULTI_flength_test___false_valid_memtrack_i__append_~head.offset __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset) .cse3 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.offset)))) (store .cse4 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base (store (store (select .cse4 __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) .cse1 0) .cse2 0))) |c_#memory_$Pointer$.offset|)))) is different from true [2018-04-10 15:58:30,720 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 77 DAG size of output 61 [2018-04-10 15:58:30,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:30,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:30,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:30,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-04-10 15:58:30,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 60 [2018-04-10 15:58:30,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 13 treesize of output 16 [2018-04-10 15:58:30,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:30,797 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 16 treesize of output 23 [2018-04-10 15:58:30,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-04-10 15:58:30,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15 treesize of output 18 [2018-04-10 15:58:30,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:30,836 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 18 treesize of output 27 [2018-04-10 15:58:30,836 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,841 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,853 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,863 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 60 [2018-04-10 15:58:30,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2018-04-10 15:58:30,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:30,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 15:58:30,904 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,909 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-04-10 15:58:30,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-04-10 15:58:30,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:30,929 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 18 treesize of output 27 [2018-04-10 15:58:30,930 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,933 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,941 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,948 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 15:58:30,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:30,972 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:152, output treesize:194 [2018-04-10 15:58:31,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:31,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:31,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:31,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 15:58:31,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 43 [2018-04-10 15:58:31,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 15:58:31,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 15:58:31,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:202, output treesize:194 [2018-04-10 15:58:54,028 WARN L148 SmtUtils]: Spent 2736ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-10 15:59:15,390 WARN L148 SmtUtils]: Spent 2728ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-10 15:59:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:59:25,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:59:25,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-10 15:59:25,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 15:59:25,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 15:59:25,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=388, Unknown=27, NotChecked=40, Total=506 [2018-04-10 15:59:25,271 INFO L87 Difference]: Start difference. First operand 288 states and 337 transitions. Second operand 23 states. [2018-04-10 16:00:10,499 WARN L151 SmtUtils]: Spent 8444ms on a formula simplification. DAG size of input: 131 DAG size of output 123 [2018-04-10 16:00:18,432 WARN L151 SmtUtils]: Spent 7761ms on a formula simplification. DAG size of input: 144 DAG size of output 126 [2018-04-10 16:00:28,004 WARN L151 SmtUtils]: Spent 9466ms on a formula simplification. DAG size of input: 153 DAG size of output 135 [2018-04-10 16:00:40,305 WARN L151 SmtUtils]: Spent 9510ms on a formula simplification. DAG size of input: 213 DAG size of output 136 Received shutdown request... [2018-04-10 16:01:06,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:01:06,019 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 16:01:06,022 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 16:01:06,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:01:06 BoogieIcfgContainer [2018-04-10 16:01:06,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:01:06,023 INFO L168 Benchmark]: Toolchain (without parser) took 214897.00 ms. Allocated memory was 402.7 MB in the beginning and 904.9 MB in the end (delta: 502.3 MB). Free memory was 336.6 MB in the beginning and 695.2 MB in the end (delta: -358.6 MB). Peak memory consumption was 143.7 MB. Max. memory is 5.3 GB. [2018-04-10 16:01:06,024 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 402.7 MB. Free memory is still 363.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:01:06,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.21 ms. Allocated memory is still 402.7 MB. Free memory was 335.3 MB in the beginning and 310.2 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-10 16:01:06,024 INFO L168 Benchmark]: Boogie Preprocessor took 46.95 ms. Allocated memory is still 402.7 MB. Free memory was 310.2 MB in the beginning and 307.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-10 16:01:06,024 INFO L168 Benchmark]: RCFGBuilder took 506.20 ms. Allocated memory was 402.7 MB in the beginning and 610.8 MB in the end (delta: 208.1 MB). Free memory was 307.5 MB in the beginning and 527.0 MB in the end (delta: -219.5 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-04-10 16:01:06,024 INFO L168 Benchmark]: TraceAbstraction took 214079.84 ms. Allocated memory was 610.8 MB in the beginning and 904.9 MB in the end (delta: 294.1 MB). Free memory was 527.0 MB in the beginning and 695.2 MB in the end (delta: -168.2 MB). Peak memory consumption was 125.9 MB. Max. memory is 5.3 GB. [2018-04-10 16:01:06,026 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 402.7 MB. Free memory is still 363.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 261.21 ms. Allocated memory is still 402.7 MB. Free memory was 335.3 MB in the beginning and 310.2 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.95 ms. Allocated memory is still 402.7 MB. Free memory was 310.2 MB in the beginning and 307.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 506.20 ms. Allocated memory was 402.7 MB in the beginning and 610.8 MB in the end (delta: 208.1 MB). Free memory was 307.5 MB in the beginning and 527.0 MB in the end (delta: -219.5 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 214079.84 ms. Allocated memory was 610.8 MB in the beginning and 904.9 MB in the end (delta: 294.1 MB). Free memory was 527.0 MB in the beginning and 695.2 MB in the end (delta: -168.2 MB). Peak memory consumption was 125.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 588]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 588). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 575]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 588]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 588). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 582]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 582). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 582]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 582). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 575]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (288states) and interpolant automaton (currently 23 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 73. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 145 locations, 55 error locations. TIMEOUT Result, 214.0s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 151.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1735 SDtfs, 1810 SDslu, 5606 SDs, 0 SdLazy, 6389 SolverSat, 327 SolverUnsat, 91 SolverUnknown, 0 SolverNotchecked, 77.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 501 GetRequests, 246 SyntacticMatches, 6 SemanticMatches, 248 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 111.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 342 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 62.1s InterpolantComputationTime, 884 NumberOfCodeBlocks, 884 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 484 ConstructedInterpolants, 165 QuantifiedInterpolants, 654402 SizeOfPredicates, 130 NumberOfNonLiveVariables, 1980 ConjunctsInSsa, 391 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 6/45 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_16-01-06-032.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_16-01-06-032.csv Completed graceful shutdown